./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-84.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-84.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5b5c579625c7e7f8372c6e72b92791251deae7da0317f60eb86bbc80368b12cf --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 07:48:55,518 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 07:48:55,605 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 07:48:55,611 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 07:48:55,612 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 07:48:55,653 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 07:48:55,655 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 07:48:55,655 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 07:48:55,656 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 07:48:55,657 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 07:48:55,657 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 07:48:55,657 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 07:48:55,658 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 07:48:55,660 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 07:48:55,660 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 07:48:55,661 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 07:48:55,661 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 07:48:55,661 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 07:48:55,661 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 07:48:55,662 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 07:48:55,662 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 07:48:55,662 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 07:48:55,663 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 07:48:55,663 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 07:48:55,663 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 07:48:55,663 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 07:48:55,664 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 07:48:55,664 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 07:48:55,664 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 07:48:55,665 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 07:48:55,665 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 07:48:55,665 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 07:48:55,665 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:48:55,666 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 07:48:55,666 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 07:48:55,667 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 07:48:55,667 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 07:48:55,667 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 07:48:55,668 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 07:48:55,668 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 07:48:55,668 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 07:48:55,668 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 07:48:55,669 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5b5c579625c7e7f8372c6e72b92791251deae7da0317f60eb86bbc80368b12cf [2024-10-11 07:48:55,938 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 07:48:55,960 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 07:48:55,964 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 07:48:55,965 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 07:48:55,965 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 07:48:55,967 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-84.i [2024-10-11 07:48:57,452 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 07:48:57,642 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 07:48:57,643 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-84.i [2024-10-11 07:48:57,657 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3e3e2fda2/1688d4187f854c608c57273988dcc99e/FLAG56110ef01 [2024-10-11 07:48:58,029 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3e3e2fda2/1688d4187f854c608c57273988dcc99e [2024-10-11 07:48:58,032 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 07:48:58,033 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 07:48:58,034 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 07:48:58,035 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 07:48:58,040 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 07:48:58,041 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:48:58" (1/1) ... [2024-10-11 07:48:58,042 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4644e29c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:48:58, skipping insertion in model container [2024-10-11 07:48:58,042 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:48:58" (1/1) ... [2024-10-11 07:48:58,072 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 07:48:58,238 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-84.i[913,926] [2024-10-11 07:48:58,306 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:48:58,319 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 07:48:58,330 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-84.i[913,926] [2024-10-11 07:48:58,359 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:48:58,384 INFO L204 MainTranslator]: Completed translation [2024-10-11 07:48:58,384 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:48:58 WrapperNode [2024-10-11 07:48:58,384 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 07:48:58,385 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 07:48:58,386 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 07:48:58,386 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 07:48:58,391 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:48:58" (1/1) ... [2024-10-11 07:48:58,402 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:48:58" (1/1) ... [2024-10-11 07:48:58,446 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 182 [2024-10-11 07:48:58,446 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 07:48:58,447 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 07:48:58,447 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 07:48:58,447 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 07:48:58,460 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:48:58" (1/1) ... [2024-10-11 07:48:58,461 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:48:58" (1/1) ... [2024-10-11 07:48:58,464 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:48:58" (1/1) ... [2024-10-11 07:48:58,490 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 07:48:58,490 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:48:58" (1/1) ... [2024-10-11 07:48:58,490 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:48:58" (1/1) ... [2024-10-11 07:48:58,506 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:48:58" (1/1) ... [2024-10-11 07:48:58,515 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:48:58" (1/1) ... [2024-10-11 07:48:58,518 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:48:58" (1/1) ... [2024-10-11 07:48:58,524 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:48:58" (1/1) ... [2024-10-11 07:48:58,533 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 07:48:58,534 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 07:48:58,534 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 07:48:58,534 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 07:48:58,535 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:48:58" (1/1) ... [2024-10-11 07:48:58,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:48:58,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:48:58,573 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 07:48:58,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 07:48:58,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 07:48:58,630 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 07:48:58,631 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 07:48:58,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 07:48:58,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 07:48:58,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 07:48:58,729 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 07:48:58,731 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 07:48:59,152 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-10-11 07:48:59,152 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 07:48:59,189 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 07:48:59,189 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 07:48:59,190 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:48:59 BoogieIcfgContainer [2024-10-11 07:48:59,190 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 07:48:59,192 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 07:48:59,192 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 07:48:59,196 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 07:48:59,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:48:58" (1/3) ... [2024-10-11 07:48:59,197 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e48ba04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:48:59, skipping insertion in model container [2024-10-11 07:48:59,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:48:58" (2/3) ... [2024-10-11 07:48:59,197 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e48ba04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:48:59, skipping insertion in model container [2024-10-11 07:48:59,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:48:59" (3/3) ... [2024-10-11 07:48:59,198 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-84.i [2024-10-11 07:48:59,214 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 07:48:59,215 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 07:48:59,287 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 07:48:59,297 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5193a5e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 07:48:59,298 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 07:48:59,303 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 50 states have (on average 1.46) internal successors, (73), 51 states have internal predecessors, (73), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 07:48:59,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-11 07:48:59,317 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:48:59,318 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:48:59,318 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:48:59,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:48:59,324 INFO L85 PathProgramCache]: Analyzing trace with hash 313342948, now seen corresponding path program 1 times [2024-10-11 07:48:59,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:48:59,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342962488] [2024-10-11 07:48:59,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:48:59,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:48:59,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:59,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:48:59,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:59,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:48:59,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:59,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:48:59,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:59,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:48:59,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:59,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:48:59,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:59,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:48:59,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:59,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:48:59,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:59,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:48:59,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:59,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 07:48:59,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:59,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:48:59,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:59,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 07:48:59,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:59,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 07:48:59,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:59,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 07:48:59,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:59,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 07:48:59,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:59,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 07:48:59,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:59,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 07:48:59,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:59,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 07:48:59,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:59,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 07:48:59,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:59,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 07:48:59,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:59,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 07:48:59,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:59,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 07:48:59,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:59,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 07:48:59,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:59,784 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-11 07:48:59,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:48:59,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342962488] [2024-10-11 07:48:59,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342962488] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:48:59,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:48:59,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 07:48:59,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319837704] [2024-10-11 07:48:59,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:48:59,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 07:48:59,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:48:59,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 07:48:59,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 07:48:59,819 INFO L87 Difference]: Start difference. First operand has 75 states, 50 states have (on average 1.46) internal successors, (73), 51 states have internal predecessors, (73), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-11 07:48:59,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:48:59,869 INFO L93 Difference]: Finished difference Result 147 states and 254 transitions. [2024-10-11 07:48:59,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 07:48:59,873 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 141 [2024-10-11 07:48:59,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:48:59,883 INFO L225 Difference]: With dead ends: 147 [2024-10-11 07:48:59,884 INFO L226 Difference]: Without dead ends: 73 [2024-10-11 07:48:59,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 07:48:59,892 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 07:48:59,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 109 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:48:59,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-11 07:48:59,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-10-11 07:48:59,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 49 states have internal predecessors, (68), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 07:48:59,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 112 transitions. [2024-10-11 07:48:59,946 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 112 transitions. Word has length 141 [2024-10-11 07:48:59,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:48:59,946 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 112 transitions. [2024-10-11 07:48:59,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-11 07:48:59,947 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 112 transitions. [2024-10-11 07:48:59,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-11 07:48:59,951 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:48:59,951 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:48:59,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 07:48:59,952 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:48:59,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:48:59,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1808792156, now seen corresponding path program 1 times [2024-10-11 07:48:59,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:48:59,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589732978] [2024-10-11 07:48:59,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:48:59,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:49:00,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:00,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:49:00,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:00,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:49:00,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:00,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:49:00,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:00,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:49:00,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:00,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:49:00,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:00,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:49:00,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:00,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:49:00,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:00,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:49:00,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:00,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 07:49:00,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:00,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:49:00,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:00,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 07:49:00,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:00,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 07:49:00,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:00,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 07:49:00,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:00,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 07:49:00,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:00,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 07:49:00,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:00,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 07:49:00,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:00,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 07:49:00,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:00,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 07:49:00,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:00,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 07:49:00,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:00,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 07:49:00,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:00,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 07:49:00,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:00,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 07:49:00,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:00,485 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-11 07:49:00,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:49:00,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589732978] [2024-10-11 07:49:00,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589732978] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:49:00,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:49:00,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 07:49:00,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257504638] [2024-10-11 07:49:00,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:49:00,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 07:49:00,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:49:00,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 07:49:00,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 07:49:00,490 INFO L87 Difference]: Start difference. First operand 73 states and 112 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 07:49:00,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:49:00,534 INFO L93 Difference]: Finished difference Result 145 states and 223 transitions. [2024-10-11 07:49:00,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 07:49:00,535 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 141 [2024-10-11 07:49:00,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:49:00,537 INFO L225 Difference]: With dead ends: 145 [2024-10-11 07:49:00,537 INFO L226 Difference]: Without dead ends: 73 [2024-10-11 07:49:00,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 07:49:00,540 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 109 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 07:49:00,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 106 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:49:00,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-11 07:49:00,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-10-11 07:49:00,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 49 states have internal predecessors, (67), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 07:49:00,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 111 transitions. [2024-10-11 07:49:00,555 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 111 transitions. Word has length 141 [2024-10-11 07:49:00,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:49:00,557 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 111 transitions. [2024-10-11 07:49:00,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 07:49:00,558 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 111 transitions. [2024-10-11 07:49:00,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-11 07:49:00,560 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:49:00,560 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:49:00,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 07:49:00,561 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:49:00,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:49:00,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1107727578, now seen corresponding path program 1 times [2024-10-11 07:49:00,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:49:00,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076299388] [2024-10-11 07:49:00,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:49:00,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:49:00,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:03,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:49:03,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:03,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:49:03,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:03,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:49:03,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:03,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:49:03,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:03,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:49:03,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:03,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:49:03,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:03,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:49:03,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:03,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:49:03,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:03,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 07:49:03,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:03,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:49:03,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:03,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 07:49:03,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:03,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 07:49:03,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:03,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 07:49:03,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:03,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 07:49:03,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:03,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 07:49:03,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:03,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 07:49:03,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:03,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 07:49:03,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:03,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 07:49:03,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:03,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 07:49:03,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:03,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 07:49:03,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:03,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 07:49:03,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:03,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 07:49:03,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:03,287 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-11 07:49:03,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:49:03,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076299388] [2024-10-11 07:49:03,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076299388] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:49:03,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:49:03,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 07:49:03,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909080658] [2024-10-11 07:49:03,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:49:03,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 07:49:03,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:49:03,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 07:49:03,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 07:49:03,292 INFO L87 Difference]: Start difference. First operand 73 states and 111 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 07:49:04,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:49:04,320 INFO L93 Difference]: Finished difference Result 178 states and 265 transitions. [2024-10-11 07:49:04,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 07:49:04,321 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 141 [2024-10-11 07:49:04,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:49:04,323 INFO L225 Difference]: With dead ends: 178 [2024-10-11 07:49:04,323 INFO L226 Difference]: Without dead ends: 106 [2024-10-11 07:49:04,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 07:49:04,325 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 37 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 07:49:04,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 417 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 07:49:04,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-11 07:49:04,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 103. [2024-10-11 07:49:04,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 74 states have (on average 1.3513513513513513) internal successors, (100), 75 states have internal predecessors, (100), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 07:49:04,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 152 transitions. [2024-10-11 07:49:04,344 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 152 transitions. Word has length 141 [2024-10-11 07:49:04,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:49:04,348 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 152 transitions. [2024-10-11 07:49:04,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 07:49:04,349 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 152 transitions. [2024-10-11 07:49:04,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 07:49:04,351 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:49:04,351 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:49:04,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 07:49:04,351 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:49:04,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:49:04,352 INFO L85 PathProgramCache]: Analyzing trace with hash 141776580, now seen corresponding path program 1 times [2024-10-11 07:49:04,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:49:04,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504243933] [2024-10-11 07:49:04,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:49:04,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:49:04,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:08,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:49:08,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:08,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:49:08,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:08,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:49:08,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:08,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:49:08,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:08,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:49:08,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:08,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:49:08,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:08,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:49:08,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:08,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:49:08,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:08,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 07:49:08,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:08,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:49:08,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:08,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 07:49:08,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:08,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 07:49:08,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:08,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 07:49:08,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:08,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 07:49:08,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:08,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 07:49:08,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:08,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 07:49:08,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:08,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 07:49:08,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:08,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 07:49:08,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:08,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 07:49:08,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:08,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 07:49:08,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:08,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 07:49:08,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:08,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 07:49:08,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:08,082 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-11 07:49:08,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:49:08,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504243933] [2024-10-11 07:49:08,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504243933] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:49:08,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:49:08,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 07:49:08,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098500851] [2024-10-11 07:49:08,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:49:08,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 07:49:08,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:49:08,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 07:49:08,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 07:49:08,086 INFO L87 Difference]: Start difference. First operand 103 states and 152 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 07:49:08,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:49:08,645 INFO L93 Difference]: Finished difference Result 243 states and 351 transitions. [2024-10-11 07:49:08,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 07:49:08,646 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 142 [2024-10-11 07:49:08,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:49:08,650 INFO L225 Difference]: With dead ends: 243 [2024-10-11 07:49:08,650 INFO L226 Difference]: Without dead ends: 141 [2024-10-11 07:49:08,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 07:49:08,657 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 97 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 07:49:08,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 382 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 07:49:08,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-10-11 07:49:08,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 137. [2024-10-11 07:49:08,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 102 states have (on average 1.3333333333333333) internal successors, (136), 105 states have internal predecessors, (136), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 07:49:08,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 196 transitions. [2024-10-11 07:49:08,695 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 196 transitions. Word has length 142 [2024-10-11 07:49:08,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:49:08,696 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 196 transitions. [2024-10-11 07:49:08,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 07:49:08,696 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 196 transitions. [2024-10-11 07:49:08,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 07:49:08,698 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:49:08,699 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:49:08,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 07:49:08,699 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:49:08,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:49:08,702 INFO L85 PathProgramCache]: Analyzing trace with hash -445029434, now seen corresponding path program 1 times [2024-10-11 07:49:08,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:49:08,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94998091] [2024-10-11 07:49:08,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:49:08,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:49:08,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:09,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:49:09,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:09,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:49:09,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:09,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:49:09,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:09,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:49:09,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:09,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:49:09,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:09,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:49:09,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:09,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:49:09,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:09,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:49:09,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:09,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 07:49:09,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:09,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:49:09,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:09,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 07:49:09,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:09,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 07:49:09,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:09,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 07:49:09,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:09,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 07:49:09,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:09,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 07:49:09,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:09,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 07:49:09,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:09,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 07:49:09,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:09,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 07:49:09,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:09,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 07:49:09,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:09,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 07:49:09,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:09,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 07:49:09,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:09,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 07:49:09,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:09,368 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-11 07:49:09,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:49:09,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94998091] [2024-10-11 07:49:09,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94998091] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:49:09,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:49:09,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 07:49:09,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932198357] [2024-10-11 07:49:09,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:49:09,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 07:49:09,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:49:09,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 07:49:09,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 07:49:09,370 INFO L87 Difference]: Start difference. First operand 137 states and 196 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 07:49:09,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:49:09,687 INFO L93 Difference]: Finished difference Result 274 states and 389 transitions. [2024-10-11 07:49:09,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 07:49:09,688 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 142 [2024-10-11 07:49:09,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:49:09,690 INFO L225 Difference]: With dead ends: 274 [2024-10-11 07:49:09,690 INFO L226 Difference]: Without dead ends: 145 [2024-10-11 07:49:09,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 07:49:09,694 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 40 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 07:49:09,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 462 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 07:49:09,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-10-11 07:49:09,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 114. [2024-10-11 07:49:09,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 81 states have (on average 1.308641975308642) internal successors, (106), 83 states have internal predecessors, (106), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-11 07:49:09,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 162 transitions. [2024-10-11 07:49:09,729 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 162 transitions. Word has length 142 [2024-10-11 07:49:09,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:49:09,730 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 162 transitions. [2024-10-11 07:49:09,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 07:49:09,731 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 162 transitions. [2024-10-11 07:49:09,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-11 07:49:09,734 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:49:09,734 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:49:09,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 07:49:09,735 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:49:09,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:49:09,735 INFO L85 PathProgramCache]: Analyzing trace with hash -6372629, now seen corresponding path program 1 times [2024-10-11 07:49:09,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:49:09,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041225038] [2024-10-11 07:49:09,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:49:09,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:49:09,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:12,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:49:12,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:12,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:49:12,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:12,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:49:12,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:12,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:49:12,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:12,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:49:12,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:12,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:49:12,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:12,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:49:12,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:12,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:49:12,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:12,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 07:49:12,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:12,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:49:12,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:12,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 07:49:12,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:12,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 07:49:12,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:12,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 07:49:12,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:12,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 07:49:12,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:12,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 07:49:12,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:12,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 07:49:12,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:12,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 07:49:12,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:12,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 07:49:12,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:12,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 07:49:12,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:12,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 07:49:12,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:12,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 07:49:12,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:12,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 07:49:12,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:12,827 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-11 07:49:12,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:49:12,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041225038] [2024-10-11 07:49:12,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041225038] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:49:12,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:49:12,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 07:49:12,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723971184] [2024-10-11 07:49:12,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:49:12,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 07:49:12,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:49:12,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 07:49:12,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-11 07:49:12,831 INFO L87 Difference]: Start difference. First operand 114 states and 162 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 07:49:13,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:49:13,861 INFO L93 Difference]: Finished difference Result 351 states and 493 transitions. [2024-10-11 07:49:13,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 07:49:13,865 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 143 [2024-10-11 07:49:13,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:49:13,867 INFO L225 Difference]: With dead ends: 351 [2024-10-11 07:49:13,867 INFO L226 Difference]: Without dead ends: 245 [2024-10-11 07:49:13,872 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2024-10-11 07:49:13,873 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 186 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 07:49:13,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 587 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 07:49:13,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-10-11 07:49:13,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 145. [2024-10-11 07:49:13,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 112 states have (on average 1.3303571428571428) internal successors, (149), 114 states have internal predecessors, (149), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-11 07:49:13,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 205 transitions. [2024-10-11 07:49:13,902 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 205 transitions. Word has length 143 [2024-10-11 07:49:13,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:49:13,902 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 205 transitions. [2024-10-11 07:49:13,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 07:49:13,903 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 205 transitions. [2024-10-11 07:49:13,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-11 07:49:13,904 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:49:13,904 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:49:13,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 07:49:13,905 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:49:13,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:49:13,905 INFO L85 PathProgramCache]: Analyzing trace with hash -399399639, now seen corresponding path program 1 times [2024-10-11 07:49:13,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:49:13,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225433245] [2024-10-11 07:49:13,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:49:13,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:49:13,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:16,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:49:16,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:16,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:49:16,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:16,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:49:16,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:16,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:49:16,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:16,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:49:16,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:16,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:49:16,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:16,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:49:16,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:16,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:49:16,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:16,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 07:49:16,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:16,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:49:16,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:16,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 07:49:16,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:16,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 07:49:16,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:16,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 07:49:16,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:16,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 07:49:16,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:16,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 07:49:16,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:16,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 07:49:16,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:16,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 07:49:16,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:16,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 07:49:16,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:16,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 07:49:16,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:16,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 07:49:16,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:16,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 07:49:16,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:16,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 07:49:16,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:16,250 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-11 07:49:16,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:49:16,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225433245] [2024-10-11 07:49:16,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225433245] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:49:16,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:49:16,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-11 07:49:16,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129924550] [2024-10-11 07:49:16,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:49:16,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 07:49:16,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:49:16,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 07:49:16,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-10-11 07:49:16,253 INFO L87 Difference]: Start difference. First operand 145 states and 205 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 07:49:17,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:49:17,470 INFO L93 Difference]: Finished difference Result 360 states and 505 transitions. [2024-10-11 07:49:17,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 07:49:17,472 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 143 [2024-10-11 07:49:17,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:49:17,474 INFO L225 Difference]: With dead ends: 360 [2024-10-11 07:49:17,474 INFO L226 Difference]: Without dead ends: 223 [2024-10-11 07:49:17,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=125, Invalid=337, Unknown=0, NotChecked=0, Total=462 [2024-10-11 07:49:17,476 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 286 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 07:49:17,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 302 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 07:49:17,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-10-11 07:49:17,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 145. [2024-10-11 07:49:17,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 112 states have (on average 1.3303571428571428) internal successors, (149), 114 states have internal predecessors, (149), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-11 07:49:17,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 205 transitions. [2024-10-11 07:49:17,501 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 205 transitions. Word has length 143 [2024-10-11 07:49:17,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:49:17,502 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 205 transitions. [2024-10-11 07:49:17,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 07:49:17,502 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 205 transitions. [2024-10-11 07:49:17,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-11 07:49:17,504 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:49:17,504 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:49:17,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 07:49:17,504 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:49:17,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:49:17,505 INFO L85 PathProgramCache]: Analyzing trace with hash 251792809, now seen corresponding path program 1 times [2024-10-11 07:49:17,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:49:17,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891906274] [2024-10-11 07:49:17,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:49:17,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:49:17,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:19,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:49:19,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:19,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:49:19,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:19,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:49:19,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:19,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:49:19,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:19,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:49:19,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:19,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:49:19,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:19,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:49:19,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:19,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:49:19,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:19,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 07:49:19,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:19,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:49:19,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:19,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 07:49:19,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:19,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 07:49:19,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:19,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 07:49:19,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:19,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 07:49:19,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:19,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 07:49:19,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:19,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 07:49:19,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:19,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 07:49:19,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:19,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 07:49:19,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:19,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 07:49:19,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:19,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 07:49:19,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:19,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 07:49:19,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:19,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 07:49:19,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:19,256 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-11 07:49:19,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:49:19,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891906274] [2024-10-11 07:49:19,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891906274] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:49:19,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:49:19,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 07:49:19,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211991405] [2024-10-11 07:49:19,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:49:19,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 07:49:19,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:49:19,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 07:49:19,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-11 07:49:19,259 INFO L87 Difference]: Start difference. First operand 145 states and 205 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 07:49:20,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:49:20,384 INFO L93 Difference]: Finished difference Result 388 states and 542 transitions. [2024-10-11 07:49:20,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 07:49:20,385 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 143 [2024-10-11 07:49:20,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:49:20,391 INFO L225 Difference]: With dead ends: 388 [2024-10-11 07:49:20,391 INFO L226 Difference]: Without dead ends: 251 [2024-10-11 07:49:20,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-10-11 07:49:20,392 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 94 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 07:49:20,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 525 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 07:49:20,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-10-11 07:49:20,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 149. [2024-10-11 07:49:20,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 116 states have (on average 1.3362068965517242) internal successors, (155), 118 states have internal predecessors, (155), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-11 07:49:20,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 211 transitions. [2024-10-11 07:49:20,417 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 211 transitions. Word has length 143 [2024-10-11 07:49:20,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:49:20,418 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 211 transitions. [2024-10-11 07:49:20,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 07:49:20,419 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 211 transitions. [2024-10-11 07:49:20,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-11 07:49:20,420 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:49:20,420 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:49:20,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 07:49:20,421 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:49:20,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:49:20,421 INFO L85 PathProgramCache]: Analyzing trace with hash -141234201, now seen corresponding path program 1 times [2024-10-11 07:49:20,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:49:20,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745976086] [2024-10-11 07:49:20,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:49:20,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:49:20,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:22,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:49:22,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:22,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:49:22,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:22,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:49:22,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:22,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:49:22,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:22,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:49:22,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:22,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:49:22,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:22,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:49:22,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:22,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:49:22,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:22,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 07:49:22,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:22,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:49:22,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:22,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 07:49:22,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:22,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 07:49:22,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:22,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 07:49:22,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:22,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 07:49:22,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:22,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 07:49:22,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:22,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 07:49:22,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:22,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 07:49:22,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:22,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 07:49:22,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:22,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 07:49:22,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:22,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 07:49:22,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:22,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 07:49:22,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:22,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 07:49:22,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:22,163 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-11 07:49:22,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:49:22,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745976086] [2024-10-11 07:49:22,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745976086] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:49:22,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:49:22,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 07:49:22,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093859261] [2024-10-11 07:49:22,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:49:22,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 07:49:22,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:49:22,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 07:49:22,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-11 07:49:22,165 INFO L87 Difference]: Start difference. First operand 149 states and 211 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 07:49:23,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:49:23,323 INFO L93 Difference]: Finished difference Result 358 states and 503 transitions. [2024-10-11 07:49:23,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 07:49:23,324 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 143 [2024-10-11 07:49:23,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:49:23,330 INFO L225 Difference]: With dead ends: 358 [2024-10-11 07:49:23,330 INFO L226 Difference]: Without dead ends: 217 [2024-10-11 07:49:23,330 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2024-10-11 07:49:23,333 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 94 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 07:49:23,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 575 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 07:49:23,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-10-11 07:49:23,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 145. [2024-10-11 07:49:23,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 112 states have (on average 1.3303571428571428) internal successors, (149), 114 states have internal predecessors, (149), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-11 07:49:23,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 205 transitions. [2024-10-11 07:49:23,357 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 205 transitions. Word has length 143 [2024-10-11 07:49:23,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:49:23,358 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 205 transitions. [2024-10-11 07:49:23,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 07:49:23,358 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 205 transitions. [2024-10-11 07:49:23,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-11 07:49:23,360 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:49:23,360 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:49:23,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 07:49:23,360 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:49:23,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:49:23,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1282873403, now seen corresponding path program 1 times [2024-10-11 07:49:23,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:49:23,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982034493] [2024-10-11 07:49:23,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:49:23,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:49:23,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:23,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:49:23,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:23,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:49:23,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:23,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:49:23,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:23,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:49:23,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:23,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:49:23,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:23,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:49:23,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:23,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:49:23,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:23,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:49:23,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:23,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 07:49:23,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:23,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:49:23,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:23,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 07:49:23,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:23,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 07:49:23,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:23,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 07:49:23,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:23,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 07:49:23,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:23,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 07:49:23,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:23,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 07:49:23,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:23,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 07:49:23,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:23,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 07:49:23,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:23,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 07:49:23,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:23,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 07:49:23,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:23,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 07:49:23,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:23,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 07:49:23,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:23,461 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-11 07:49:23,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:49:23,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982034493] [2024-10-11 07:49:23,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982034493] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:49:23,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:49:23,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 07:49:23,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233775074] [2024-10-11 07:49:23,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:49:23,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 07:49:23,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:49:23,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 07:49:23,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 07:49:23,464 INFO L87 Difference]: Start difference. First operand 145 states and 205 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 07:49:23,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:49:23,600 INFO L93 Difference]: Finished difference Result 345 states and 485 transitions. [2024-10-11 07:49:23,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 07:49:23,600 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 144 [2024-10-11 07:49:23,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:49:23,603 INFO L225 Difference]: With dead ends: 345 [2024-10-11 07:49:23,604 INFO L226 Difference]: Without dead ends: 208 [2024-10-11 07:49:23,605 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 07:49:23,606 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 37 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 07:49:23,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 158 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 07:49:23,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-10-11 07:49:23,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 180. [2024-10-11 07:49:23,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 147 states have (on average 1.3333333333333333) internal successors, (196), 149 states have internal predecessors, (196), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-11 07:49:23,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 252 transitions. [2024-10-11 07:49:23,637 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 252 transitions. Word has length 144 [2024-10-11 07:49:23,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:49:23,637 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 252 transitions. [2024-10-11 07:49:23,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 07:49:23,637 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 252 transitions. [2024-10-11 07:49:23,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-11 07:49:23,640 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:49:23,641 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:49:23,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 07:49:23,641 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:49:23,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:49:23,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1922919577, now seen corresponding path program 1 times [2024-10-11 07:49:23,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:49:23,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866418436] [2024-10-11 07:49:23,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:49:23,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:49:23,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:23,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:49:23,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:23,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:49:23,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:23,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:49:23,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:23,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:49:23,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:23,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:49:23,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:23,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:49:23,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:23,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:49:23,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:23,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:49:23,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:23,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 07:49:23,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:23,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:49:23,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:23,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 07:49:23,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:23,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 07:49:23,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:23,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 07:49:23,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:23,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 07:49:23,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:23,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 07:49:23,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:23,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 07:49:23,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:23,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 07:49:23,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:23,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 07:49:23,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:23,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 07:49:23,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:23,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 07:49:23,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:23,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 07:49:23,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:23,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 07:49:23,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:23,864 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-11 07:49:23,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:49:23,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866418436] [2024-10-11 07:49:23,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866418436] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:49:23,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:49:23,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 07:49:23,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056589354] [2024-10-11 07:49:23,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:49:23,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 07:49:23,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:49:23,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 07:49:23,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 07:49:23,866 INFO L87 Difference]: Start difference. First operand 180 states and 252 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 07:49:24,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:49:24,063 INFO L93 Difference]: Finished difference Result 503 states and 704 transitions. [2024-10-11 07:49:24,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 07:49:24,064 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 144 [2024-10-11 07:49:24,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:49:24,066 INFO L225 Difference]: With dead ends: 503 [2024-10-11 07:49:24,066 INFO L226 Difference]: Without dead ends: 324 [2024-10-11 07:49:24,069 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 07:49:24,070 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 84 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 07:49:24,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 366 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 07:49:24,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2024-10-11 07:49:24,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 227. [2024-10-11 07:49:24,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 169 states have (on average 1.2958579881656804) internal successors, (219), 171 states have internal predecessors, (219), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-11 07:49:24,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 319 transitions. [2024-10-11 07:49:24,115 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 319 transitions. Word has length 144 [2024-10-11 07:49:24,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:49:24,116 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 319 transitions. [2024-10-11 07:49:24,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 07:49:24,116 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 319 transitions. [2024-10-11 07:49:24,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-11 07:49:24,118 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:49:24,119 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:49:24,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 07:49:24,119 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:49:24,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:49:24,119 INFO L85 PathProgramCache]: Analyzing trace with hash -932675079, now seen corresponding path program 1 times [2024-10-11 07:49:24,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:49:24,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554517955] [2024-10-11 07:49:24,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:49:24,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:49:24,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:24,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:49:24,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:24,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:49:24,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:24,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:49:24,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:24,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:49:24,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:24,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:49:24,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:24,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:49:24,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:24,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:49:24,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:24,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:49:24,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:24,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 07:49:24,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:24,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:49:24,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:24,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 07:49:24,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:24,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 07:49:24,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:24,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 07:49:24,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:24,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 07:49:24,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:24,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 07:49:24,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:24,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 07:49:24,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:24,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 07:49:24,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:24,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 07:49:24,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:24,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 07:49:24,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:24,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 07:49:24,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:24,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 07:49:24,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:24,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 07:49:24,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:24,218 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-11 07:49:24,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:49:24,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554517955] [2024-10-11 07:49:24,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554517955] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:49:24,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:49:24,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 07:49:24,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077069087] [2024-10-11 07:49:24,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:49:24,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 07:49:24,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:49:24,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 07:49:24,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 07:49:24,219 INFO L87 Difference]: Start difference. First operand 227 states and 319 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 07:49:24,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:49:24,348 INFO L93 Difference]: Finished difference Result 431 states and 598 transitions. [2024-10-11 07:49:24,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 07:49:24,349 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 144 [2024-10-11 07:49:24,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:49:24,351 INFO L225 Difference]: With dead ends: 431 [2024-10-11 07:49:24,352 INFO L226 Difference]: Without dead ends: 252 [2024-10-11 07:49:24,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 07:49:24,353 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 42 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 07:49:24,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 180 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 07:49:24,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-10-11 07:49:24,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 214. [2024-10-11 07:49:24,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 158 states have (on average 1.2784810126582278) internal successors, (202), 159 states have internal predecessors, (202), 48 states have call successors, (48), 7 states have call predecessors, (48), 7 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-11 07:49:24,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 298 transitions. [2024-10-11 07:49:24,402 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 298 transitions. Word has length 144 [2024-10-11 07:49:24,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:49:24,402 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 298 transitions. [2024-10-11 07:49:24,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 07:49:24,402 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 298 transitions. [2024-10-11 07:49:24,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-11 07:49:24,404 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:49:24,404 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:49:24,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 07:49:24,404 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:49:24,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:49:24,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1952165040, now seen corresponding path program 1 times [2024-10-11 07:49:24,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:49:24,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886724173] [2024-10-11 07:49:24,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:49:24,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:49:24,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 07:49:24,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1947950208] [2024-10-11 07:49:24,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:49:24,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 07:49:24,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:49:24,499 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 07:49:24,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 07:49:24,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 07:49:24,899 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 07:49:24,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 07:49:25,048 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 07:49:25,051 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 07:49:25,053 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 07:49:25,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 07:49:25,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-11 07:49:25,259 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:49:25,362 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 07:49:25,364 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 07:49:25 BoogieIcfgContainer [2024-10-11 07:49:25,365 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 07:49:25,365 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 07:49:25,365 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 07:49:25,366 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 07:49:25,366 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:48:59" (3/4) ... [2024-10-11 07:49:25,368 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 07:49:25,369 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 07:49:25,370 INFO L158 Benchmark]: Toolchain (without parser) took 27336.91ms. Allocated memory was 172.0MB in the beginning and 469.8MB in the end (delta: 297.8MB). Free memory was 117.4MB in the beginning and 366.1MB in the end (delta: -248.7MB). Peak memory consumption was 50.6MB. Max. memory is 16.1GB. [2024-10-11 07:49:25,370 INFO L158 Benchmark]: CDTParser took 0.45ms. Allocated memory is still 172.0MB. Free memory is still 137.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 07:49:25,370 INFO L158 Benchmark]: CACSL2BoogieTranslator took 350.57ms. Allocated memory is still 172.0MB. Free memory was 116.7MB in the beginning and 100.6MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 07:49:25,370 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.12ms. Allocated memory is still 172.0MB. Free memory was 100.6MB in the beginning and 97.1MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 07:49:25,371 INFO L158 Benchmark]: Boogie Preprocessor took 85.82ms. Allocated memory is still 172.0MB. Free memory was 97.1MB in the beginning and 92.3MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 07:49:25,371 INFO L158 Benchmark]: RCFGBuilder took 656.16ms. Allocated memory is still 172.0MB. Free memory was 92.3MB in the beginning and 63.6MB in the end (delta: 28.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-11 07:49:25,371 INFO L158 Benchmark]: TraceAbstraction took 26172.96ms. Allocated memory was 172.0MB in the beginning and 469.8MB in the end (delta: 297.8MB). Free memory was 62.9MB in the beginning and 367.1MB in the end (delta: -304.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 07:49:25,371 INFO L158 Benchmark]: Witness Printer took 3.90ms. Allocated memory is still 469.8MB. Free memory was 367.1MB in the beginning and 366.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 07:49:25,373 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.45ms. Allocated memory is still 172.0MB. Free memory is still 137.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 350.57ms. Allocated memory is still 172.0MB. Free memory was 116.7MB in the beginning and 100.6MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.12ms. Allocated memory is still 172.0MB. Free memory was 100.6MB in the beginning and 97.1MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 85.82ms. Allocated memory is still 172.0MB. Free memory was 97.1MB in the beginning and 92.3MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 656.16ms. Allocated memory is still 172.0MB. Free memory was 92.3MB in the beginning and 63.6MB in the end (delta: 28.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 26172.96ms. Allocated memory was 172.0MB in the beginning and 469.8MB in the end (delta: 297.8MB). Free memory was 62.9MB in the beginning and 367.1MB in the end (delta: -304.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.90ms. Allocated memory is still 469.8MB. Free memory was 367.1MB in the beginning and 366.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 119. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -10; [L23] signed char var_1_3 = -16; [L24] signed char var_1_4 = 50; [L25] signed char var_1_5 = 4; [L26] unsigned long int var_1_6 = 50; [L27] signed long int var_1_7 = -8; [L28] signed long int var_1_8 = -4; [L29] signed char var_1_9 = 50; [L30] unsigned char var_1_10 = 128; [L31] unsigned char var_1_11 = 5; [L32] unsigned long int var_1_12 = 10; [L33] signed char var_1_13 = 16; [L34] unsigned short int var_1_15 = 128; [L35] signed long int var_1_16 = 2; [L36] unsigned short int var_1_17 = 61498; [L37] unsigned long int var_1_18 = 1; [L38] unsigned char var_1_19 = 0; [L39] double var_1_20 = 4.9; [L40] double var_1_21 = 1.5; [L41] unsigned short int last_1_var_1_15 = 128; [L123] isInitial = 1 [L124] FCALL initially() [L125] COND TRUE 1 [L126] CALL updateLastVariables() [L116] last_1_var_1_15 = var_1_15 [L126] RET updateLastVariables() [L127] CALL updateVariables() [L82] var_1_3 = __VERIFIER_nondet_char() [L83] CALL assume_abort_if_not(var_1_3 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L83] RET assume_abort_if_not(var_1_3 >= -63) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L84] CALL assume_abort_if_not(var_1_3 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L84] RET assume_abort_if_not(var_1_3 <= 63) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L85] var_1_4 = __VERIFIER_nondet_char() [L86] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L86] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L87] CALL assume_abort_if_not(var_1_4 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L87] RET assume_abort_if_not(var_1_4 <= 63) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L88] var_1_5 = __VERIFIER_nondet_char() [L89] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L89] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L90] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L90] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L91] var_1_7 = __VERIFIER_nondet_long() [L92] CALL assume_abort_if_not(var_1_7 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L92] RET assume_abort_if_not(var_1_7 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L93] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L93] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L94] CALL assume_abort_if_not(var_1_7 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L94] RET assume_abort_if_not(var_1_7 != 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L95] var_1_8 = __VERIFIER_nondet_long() [L96] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L96] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L97] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L97] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L98] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L98] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L99] var_1_10 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_10 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L100] RET assume_abort_if_not(var_1_10 >= 127) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L101] CALL assume_abort_if_not(var_1_10 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L101] RET assume_abort_if_not(var_1_10 <= 255) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L102] var_1_11 = __VERIFIER_nondet_uchar() [L103] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=120, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=120, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L103] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=120, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L104] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=120, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=120, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L104] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=120, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L105] CALL assume_abort_if_not(var_1_11 != 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=120, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=120, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L105] RET assume_abort_if_not(var_1_11 != 127) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=120, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L106] var_1_16 = __VERIFIER_nondet_long() [L107] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=120, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=120, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L107] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=120, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L108] CALL assume_abort_if_not(var_1_16 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=120, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=120, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L108] RET assume_abort_if_not(var_1_16 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=120, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L109] var_1_17 = __VERIFIER_nondet_ushort() [L110] CALL assume_abort_if_not(var_1_17 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=120, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=120, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L110] RET assume_abort_if_not(var_1_17 >= 32767) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=120, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L111] CALL assume_abort_if_not(var_1_17 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=120, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=120, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L111] RET assume_abort_if_not(var_1_17 <= 65534) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=120, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L112] var_1_21 = __VERIFIER_nondet_double() [L113] CALL assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=120, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=120, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L113] RET assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=120, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L127] RET updateVariables() [L128] CALL step() [L45] EXPR var_1_8 & var_1_4 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=120, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L45] COND FALSE !(last_1_var_1_15 <= (var_1_8 & var_1_4)) [L50] var_1_9 = var_1_4 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=120, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L52] EXPR (var_1_4 + var_1_9) & var_1_7 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=120, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L52] signed long int stepLocal_3 = (var_1_4 + var_1_9) & var_1_7; [L53] COND TRUE stepLocal_3 <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16)))) [L54] var_1_15 = (var_1_11 + 64) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=120, var_1_12=10, var_1_13=16, var_1_15=184, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L58] signed long int stepLocal_1 = -4; [L59] signed long int stepLocal_0 = -16; VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, stepLocal_1=-4, var_1_10=127, var_1_11=120, var_1_12=10, var_1_13=16, var_1_15=184, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L60] COND FALSE !(stepLocal_1 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=127, var_1_11=120, var_1_12=10, var_1_13=16, var_1_15=184, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L65] var_1_18 = var_1_17 [L66] var_1_19 = 0 [L67] var_1_20 = var_1_21 VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=127, var_1_11=120, var_1_12=10, var_1_13=16, var_1_15=184, var_1_16=1, var_1_17=32767, var_1_18=32767, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L68] COND FALSE !(\read(var_1_19)) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=127, var_1_11=120, var_1_12=10, var_1_13=16, var_1_15=184, var_1_16=1, var_1_17=32767, var_1_18=32767, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L71] COND TRUE var_1_3 <= var_1_1 [L72] var_1_12 = var_1_4 VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=127, var_1_11=120, var_1_12=0, var_1_13=16, var_1_15=184, var_1_16=1, var_1_17=32767, var_1_18=32767, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L76] unsigned long int stepLocal_2 = var_1_18; VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, stepLocal_2=32767, var_1_10=127, var_1_11=120, var_1_12=0, var_1_13=16, var_1_15=184, var_1_16=1, var_1_17=32767, var_1_18=32767, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L77] COND TRUE (~ var_1_3) < stepLocal_2 [L78] var_1_13 = (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=127, var_1_11=120, var_1_12=0, var_1_13=-5, var_1_15=184, var_1_16=1, var_1_17=32767, var_1_18=32767, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L128] RET step() [L129] CALL, EXPR property() [L119] EXPR ((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=120, var_1_12=0, var_1_13=-5, var_1_15=184, var_1_16=1, var_1_17=32767, var_1_18=32767, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L119] EXPR var_1_8 & var_1_4 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=120, var_1_12=0, var_1_13=-5, var_1_15=184, var_1_16=1, var_1_17=32767, var_1_18=32767, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L119] EXPR ((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=120, var_1_12=0, var_1_13=-5, var_1_15=184, var_1_16=1, var_1_17=32767, var_1_18=32767, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L119] EXPR (((((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_18) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_9) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11)))))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=120, var_1_12=0, var_1_13=-5, var_1_15=184, var_1_16=1, var_1_17=32767, var_1_18=32767, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L119] EXPR (var_1_4 + var_1_9) & var_1_7 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=120, var_1_12=0, var_1_13=-5, var_1_15=184, var_1_16=1, var_1_17=32767, var_1_18=32767, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L119] EXPR (((((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_18) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_9) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11)))))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=120, var_1_12=0, var_1_13=-5, var_1_15=184, var_1_16=1, var_1_17=32767, var_1_18=32767, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L119-L120] return ((((((((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_18) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_9) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11))))))) && (var_1_18 == ((unsigned long int) var_1_17))) && (var_1_19 == ((unsigned char) 0))) && (var_1_20 == ((double) var_1_21)) ; [L129] RET, EXPR property() [L129] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=120, var_1_12=0, var_1_13=-5, var_1_15=184, var_1_16=1, var_1_17=32767, var_1_18=32767, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=120, var_1_12=0, var_1_13=-5, var_1_15=184, var_1_16=1, var_1_17=32767, var_1_18=32767, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 75 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 26.0s, OverallIterations: 13, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1106 SdHoareTripleChecker+Valid, 4.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1106 mSDsluCounter, 4169 SdHoareTripleChecker+Invalid, 4.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2984 mSDsCounter, 160 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2608 IncrementalHoareTripleChecker+Invalid, 2768 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 160 mSolverCounterUnsat, 1185 mSDtfsCounter, 2608 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 659 GetRequests, 578 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=227occurred in iteration=11, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 12 MinimizatonAttempts, 553 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 16.8s InterpolantComputationTime, 2001 NumberOfCodeBlocks, 2001 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1699 ConstructedInterpolants, 0 QuantifiedInterpolants, 11047 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 11088/11088 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 07:49:25,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-84.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5b5c579625c7e7f8372c6e72b92791251deae7da0317f60eb86bbc80368b12cf --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 07:49:27,665 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 07:49:27,753 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 07:49:27,759 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 07:49:27,760 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 07:49:27,791 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 07:49:27,795 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 07:49:27,796 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 07:49:27,796 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 07:49:27,797 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 07:49:27,797 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 07:49:27,799 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 07:49:27,800 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 07:49:27,800 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 07:49:27,800 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 07:49:27,801 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 07:49:27,801 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 07:49:27,801 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 07:49:27,801 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 07:49:27,802 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 07:49:27,805 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 07:49:27,806 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 07:49:27,806 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 07:49:27,809 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 07:49:27,810 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 07:49:27,810 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 07:49:27,810 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 07:49:27,810 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 07:49:27,811 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 07:49:27,811 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 07:49:27,811 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 07:49:27,811 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 07:49:27,812 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 07:49:27,812 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 07:49:27,813 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:49:27,813 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 07:49:27,813 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 07:49:27,813 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 07:49:27,814 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 07:49:27,814 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 07:49:27,814 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 07:49:27,816 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 07:49:27,816 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 07:49:27,817 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 07:49:27,817 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 07:49:27,817 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5b5c579625c7e7f8372c6e72b92791251deae7da0317f60eb86bbc80368b12cf [2024-10-11 07:49:28,179 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 07:49:28,209 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 07:49:28,213 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 07:49:28,215 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 07:49:28,215 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 07:49:28,218 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-84.i [2024-10-11 07:49:29,800 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 07:49:30,023 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 07:49:30,024 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-84.i [2024-10-11 07:49:30,036 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/53d4be226/99fe58afe89044f394177cf06a2cd42f/FLAG1e61f8870 [2024-10-11 07:49:30,054 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/53d4be226/99fe58afe89044f394177cf06a2cd42f [2024-10-11 07:49:30,057 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 07:49:30,058 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 07:49:30,061 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 07:49:30,061 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 07:49:30,066 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 07:49:30,067 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:49:30" (1/1) ... [2024-10-11 07:49:30,070 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ebae2ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:49:30, skipping insertion in model container [2024-10-11 07:49:30,071 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:49:30" (1/1) ... [2024-10-11 07:49:30,111 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 07:49:30,306 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-84.i[913,926] [2024-10-11 07:49:30,378 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:49:30,404 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 07:49:30,417 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-84.i[913,926] [2024-10-11 07:49:30,461 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:49:30,486 INFO L204 MainTranslator]: Completed translation [2024-10-11 07:49:30,486 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:49:30 WrapperNode [2024-10-11 07:49:30,486 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 07:49:30,487 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 07:49:30,488 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 07:49:30,488 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 07:49:30,495 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:49:30" (1/1) ... [2024-10-11 07:49:30,509 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:49:30" (1/1) ... [2024-10-11 07:49:30,547 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 131 [2024-10-11 07:49:30,547 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 07:49:30,548 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 07:49:30,548 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 07:49:30,548 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 07:49:30,562 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:49:30" (1/1) ... [2024-10-11 07:49:30,563 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:49:30" (1/1) ... [2024-10-11 07:49:30,567 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:49:30" (1/1) ... [2024-10-11 07:49:30,587 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 07:49:30,588 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:49:30" (1/1) ... [2024-10-11 07:49:30,588 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:49:30" (1/1) ... [2024-10-11 07:49:30,600 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:49:30" (1/1) ... [2024-10-11 07:49:30,606 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:49:30" (1/1) ... [2024-10-11 07:49:30,608 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:49:30" (1/1) ... [2024-10-11 07:49:30,610 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:49:30" (1/1) ... [2024-10-11 07:49:30,613 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 07:49:30,614 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 07:49:30,614 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 07:49:30,614 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 07:49:30,615 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:49:30" (1/1) ... [2024-10-11 07:49:30,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:49:30,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:49:30,655 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 07:49:30,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 07:49:30,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 07:49:30,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 07:49:30,698 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 07:49:30,698 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 07:49:30,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 07:49:30,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 07:49:30,782 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 07:49:30,788 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 07:49:31,268 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-11 07:49:31,268 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 07:49:31,362 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 07:49:31,362 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 07:49:31,364 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:49:31 BoogieIcfgContainer [2024-10-11 07:49:31,364 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 07:49:31,366 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 07:49:31,366 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 07:49:31,370 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 07:49:31,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:49:30" (1/3) ... [2024-10-11 07:49:31,371 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b4fc21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:49:31, skipping insertion in model container [2024-10-11 07:49:31,372 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:49:30" (2/3) ... [2024-10-11 07:49:31,372 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b4fc21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:49:31, skipping insertion in model container [2024-10-11 07:49:31,372 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:49:31" (3/3) ... [2024-10-11 07:49:31,374 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-84.i [2024-10-11 07:49:31,391 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 07:49:31,391 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 07:49:31,462 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 07:49:31,471 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5f93d007, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 07:49:31,472 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 07:49:31,476 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 32 states have (on average 1.40625) internal successors, (45), 33 states have internal predecessors, (45), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 07:49:31,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-11 07:49:31,491 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:49:31,492 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:49:31,493 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:49:31,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:49:31,499 INFO L85 PathProgramCache]: Analyzing trace with hash -153112892, now seen corresponding path program 1 times [2024-10-11 07:49:31,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:49:31,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [621817133] [2024-10-11 07:49:31,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:49:31,514 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 07:49:31,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:49:31,517 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 07:49:31,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 07:49:31,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:31,768 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 07:49:31,777 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:49:31,839 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 802 trivial. 0 not checked. [2024-10-11 07:49:31,843 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 07:49:31,844 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 07:49:31,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [621817133] [2024-10-11 07:49:31,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [621817133] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:49:31,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:49:31,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 07:49:31,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400734196] [2024-10-11 07:49:31,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:49:31,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 07:49:31,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 07:49:31,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 07:49:31,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 07:49:31,881 INFO L87 Difference]: Start difference. First operand has 57 states, 32 states have (on average 1.40625) internal successors, (45), 33 states have internal predecessors, (45), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-11 07:49:31,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:49:31,962 INFO L93 Difference]: Finished difference Result 111 states and 198 transitions. [2024-10-11 07:49:31,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 07:49:31,973 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 135 [2024-10-11 07:49:31,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:49:31,980 INFO L225 Difference]: With dead ends: 111 [2024-10-11 07:49:31,980 INFO L226 Difference]: Without dead ends: 55 [2024-10-11 07:49:31,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 07:49:31,986 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 07:49:31,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 07:49:32,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-11 07:49:32,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-10-11 07:49:32,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 07:49:32,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 84 transitions. [2024-10-11 07:49:32,037 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 84 transitions. Word has length 135 [2024-10-11 07:49:32,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:49:32,038 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 84 transitions. [2024-10-11 07:49:32,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-11 07:49:32,038 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 84 transitions. [2024-10-11 07:49:32,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-11 07:49:32,041 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:49:32,041 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:49:32,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 07:49:32,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 07:49:32,244 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:49:32,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:49:32,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1571604612, now seen corresponding path program 1 times [2024-10-11 07:49:32,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:49:32,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2047310173] [2024-10-11 07:49:32,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:49:32,246 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 07:49:32,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:49:32,249 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 07:49:32,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 07:49:32,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:32,483 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 07:49:32,497 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:49:32,549 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-11 07:49:32,549 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 07:49:32,550 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 07:49:32,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2047310173] [2024-10-11 07:49:32,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2047310173] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:49:32,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:49:32,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 07:49:32,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256745027] [2024-10-11 07:49:32,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:49:32,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 07:49:32,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 07:49:32,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 07:49:32,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 07:49:32,556 INFO L87 Difference]: Start difference. First operand 55 states and 84 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 07:49:32,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:49:32,669 INFO L93 Difference]: Finished difference Result 109 states and 167 transitions. [2024-10-11 07:49:32,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 07:49:32,682 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 135 [2024-10-11 07:49:32,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:49:32,684 INFO L225 Difference]: With dead ends: 109 [2024-10-11 07:49:32,684 INFO L226 Difference]: Without dead ends: 55 [2024-10-11 07:49:32,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 07:49:32,687 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 81 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 07:49:32,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 79 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 07:49:32,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-11 07:49:32,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-10-11 07:49:32,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 07:49:32,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 83 transitions. [2024-10-11 07:49:32,700 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 83 transitions. Word has length 135 [2024-10-11 07:49:32,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:49:32,702 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 83 transitions. [2024-10-11 07:49:32,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 07:49:32,702 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 83 transitions. [2024-10-11 07:49:32,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-11 07:49:32,706 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:49:32,706 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:49:32,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-11 07:49:32,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 07:49:32,908 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:49:32,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:49:32,909 INFO L85 PathProgramCache]: Analyzing trace with hash -948355322, now seen corresponding path program 1 times [2024-10-11 07:49:32,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:49:32,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1149402605] [2024-10-11 07:49:32,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:49:32,910 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 07:49:32,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:49:32,913 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 07:49:32,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 07:49:33,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:33,114 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-11 07:49:33,135 INFO L278 TraceCheckSpWp]: Computing forward predicates...