./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_codestructure_dependencies_file-72.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-72.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 b545584bd88f47093962ebc7c26b6e47720a32713ab794e33d897c38ad3103bb --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 23:53:22,418 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 23:53:22,478 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 23:53:22,482 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 23:53:22,482 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 23:53:22,498 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 23:53:22,499 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 23:53:22,500 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 23:53:22,500 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 23:53:22,501 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 23:53:22,501 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 23:53:22,502 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 23:53:22,502 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 23:53:22,502 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 23:53:22,503 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 23:53:22,503 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 23:53:22,503 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 23:53:22,503 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 23:53:22,504 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 23:53:22,504 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 23:53:22,504 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 23:53:22,508 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 23:53:22,508 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 23:53:22,508 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 23:53:22,508 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 23:53:22,509 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 23:53:22,509 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 23:53:22,509 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 23:53:22,509 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 23:53:22,509 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 23:53:22,510 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 23:53:22,510 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 23:53:22,510 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 23:53:22,510 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 23:53:22,510 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 23:53:22,510 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 23:53:22,510 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 23:53:22,511 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 23:53:22,511 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 23:53:22,511 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 23:53:22,513 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 23:53:22,513 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 23:53:22,513 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/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/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 -> b545584bd88f47093962ebc7c26b6e47720a32713ab794e33d897c38ad3103bb [2024-10-12 23:53:22,710 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 23:53:22,732 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 23:53:22,734 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 23:53:22,735 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 23:53:22,735 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 23:53:22,736 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-72.i [2024-10-12 23:53:24,089 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 23:53:24,310 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 23:53:24,312 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-72.i [2024-10-12 23:53:24,326 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d311bf47/0581eed7c63f4b6498f17ba4f5eb3f20/FLAG36a56cc90 [2024-10-12 23:53:24,341 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d311bf47/0581eed7c63f4b6498f17ba4f5eb3f20 [2024-10-12 23:53:24,344 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 23:53:24,345 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 23:53:24,346 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 23:53:24,346 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 23:53:24,351 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 23:53:24,351 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:53:24" (1/1) ... [2024-10-12 23:53:24,354 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32197b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:53:24, skipping insertion in model container [2024-10-12 23:53:24,354 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:53:24" (1/1) ... [2024-10-12 23:53:24,382 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 23:53:24,518 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_codestructure_dependencies_file-72.i[919,932] [2024-10-12 23:53:24,550 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 23:53:24,558 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 23:53:24,567 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_codestructure_dependencies_file-72.i[919,932] [2024-10-12 23:53:24,584 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 23:53:24,598 INFO L204 MainTranslator]: Completed translation [2024-10-12 23:53:24,598 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:53:24 WrapperNode [2024-10-12 23:53:24,598 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 23:53:24,599 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 23:53:24,599 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 23:53:24,599 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 23:53:24,604 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:53:24" (1/1) ... [2024-10-12 23:53:24,611 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:53:24" (1/1) ... [2024-10-12 23:53:24,638 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 135 [2024-10-12 23:53:24,639 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 23:53:24,639 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 23:53:24,640 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 23:53:24,640 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 23:53:24,649 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:53:24" (1/1) ... [2024-10-12 23:53:24,649 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:53:24" (1/1) ... [2024-10-12 23:53:24,651 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:53:24" (1/1) ... [2024-10-12 23:53:24,662 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-12 23:53:24,662 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:53:24" (1/1) ... [2024-10-12 23:53:24,662 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:53:24" (1/1) ... [2024-10-12 23:53:24,667 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:53:24" (1/1) ... [2024-10-12 23:53:24,669 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:53:24" (1/1) ... [2024-10-12 23:53:24,670 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:53:24" (1/1) ... [2024-10-12 23:53:24,671 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:53:24" (1/1) ... [2024-10-12 23:53:24,673 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 23:53:24,674 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 23:53:24,674 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 23:53:24,674 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 23:53:24,675 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:53:24" (1/1) ... [2024-10-12 23:53:24,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 23:53:24,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 23:53:24,714 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 23:53:24,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 23:53:24,757 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 23:53:24,757 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-12 23:53:24,758 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-12 23:53:24,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 23:53:24,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 23:53:24,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 23:53:24,842 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 23:53:24,846 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 23:53:25,170 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-12 23:53:25,171 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 23:53:25,231 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 23:53:25,231 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 23:53:25,232 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:53:25 BoogieIcfgContainer [2024-10-12 23:53:25,232 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 23:53:25,233 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 23:53:25,234 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 23:53:25,236 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 23:53:25,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 11:53:24" (1/3) ... [2024-10-12 23:53:25,237 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29055b05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:53:25, skipping insertion in model container [2024-10-12 23:53:25,237 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:53:24" (2/3) ... [2024-10-12 23:53:25,237 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29055b05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:53:25, skipping insertion in model container [2024-10-12 23:53:25,237 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:53:25" (3/3) ... [2024-10-12 23:53:25,238 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-72.i [2024-10-12 23:53:25,251 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 23:53:25,252 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 23:53:25,309 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 23:53:25,314 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;@62b86dc5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 23:53:25,314 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 23:53:25,317 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 32 states have internal predecessors, (45), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-12 23:53:25,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-12 23:53:25,327 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:53:25,328 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 23:53:25,329 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:53:25,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:53:25,333 INFO L85 PathProgramCache]: Analyzing trace with hash 191248627, now seen corresponding path program 1 times [2024-10-12 23:53:25,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:53:25,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215085986] [2024-10-12 23:53:25,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:53:25,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:53:25,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:25,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 23:53:25,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:25,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 23:53:25,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:25,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 23:53:25,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:25,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 23:53:25,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:25,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 23:53:25,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:25,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-12 23:53:25,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:25,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 23:53:25,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:25,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-12 23:53:25,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:25,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 23:53:25,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:25,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 23:53:25,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:25,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 23:53:25,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:25,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-12 23:53:25,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:25,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 23:53:25,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:25,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-12 23:53:25,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:25,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-12 23:53:25,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:25,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-12 23:53:25,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:25,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-12 23:53:25,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:25,639 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-12 23:53:25,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:53:25,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215085986] [2024-10-12 23:53:25,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215085986] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:53:25,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:53:25,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 23:53:25,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315332293] [2024-10-12 23:53:25,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:53:25,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 23:53:25,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:53:25,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 23:53:25,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 23:53:25,672 INFO L87 Difference]: Start difference. First operand has 51 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 32 states have internal predecessors, (45), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-12 23:53:25,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:53:25,709 INFO L93 Difference]: Finished difference Result 99 states and 173 transitions. [2024-10-12 23:53:25,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 23:53:25,713 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 107 [2024-10-12 23:53:25,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:53:25,720 INFO L225 Difference]: With dead ends: 99 [2024-10-12 23:53:25,721 INFO L226 Difference]: Without dead ends: 49 [2024-10-12 23:53:25,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 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-12 23:53:25,728 INFO L432 NwaCegarLoop]: 70 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, 70 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-12 23:53:25,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 23:53:25,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-10-12 23:53:25,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-10-12 23:53:25,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-12 23:53:25,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 73 transitions. [2024-10-12 23:53:25,764 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 73 transitions. Word has length 107 [2024-10-12 23:53:25,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:53:25,766 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 73 transitions. [2024-10-12 23:53:25,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-12 23:53:25,766 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 73 transitions. [2024-10-12 23:53:25,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-12 23:53:25,769 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:53:25,769 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 23:53:25,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 23:53:25,769 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:53:25,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:53:25,770 INFO L85 PathProgramCache]: Analyzing trace with hash -766413323, now seen corresponding path program 1 times [2024-10-12 23:53:25,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:53:25,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511335137] [2024-10-12 23:53:25,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:53:25,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:53:25,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:26,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 23:53:26,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:26,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 23:53:26,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:26,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 23:53:26,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:26,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 23:53:26,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:26,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 23:53:26,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:26,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-12 23:53:26,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:26,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 23:53:26,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:26,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-12 23:53:26,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:26,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 23:53:26,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:26,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 23:53:26,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:26,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 23:53:26,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:26,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-12 23:53:26,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:26,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 23:53:26,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:26,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-12 23:53:26,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:26,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-12 23:53:26,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:26,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-12 23:53:26,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:26,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-12 23:53:26,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:26,127 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-12 23:53:26,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:53:26,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511335137] [2024-10-12 23:53:26,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511335137] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:53:26,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:53:26,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 23:53:26,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344992226] [2024-10-12 23:53:26,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:53:26,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 23:53:26,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:53:26,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 23:53:26,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 23:53:26,136 INFO L87 Difference]: Start difference. First operand 49 states and 73 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-12 23:53:26,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:53:26,185 INFO L93 Difference]: Finished difference Result 110 states and 162 transitions. [2024-10-12 23:53:26,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 23:53:26,185 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 107 [2024-10-12 23:53:26,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:53:26,188 INFO L225 Difference]: With dead ends: 110 [2024-10-12 23:53:26,189 INFO L226 Difference]: Without dead ends: 62 [2024-10-12 23:53:26,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 37 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-12 23:53:26,190 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 13 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 23:53:26,191 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 129 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 23:53:26,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-12 23:53:26,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 52. [2024-10-12 23:53:26,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 33 states have (on average 1.303030303030303) internal successors, (43), 33 states have internal predecessors, (43), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-12 23:53:26,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 77 transitions. [2024-10-12 23:53:26,206 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 77 transitions. Word has length 107 [2024-10-12 23:53:26,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:53:26,208 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 77 transitions. [2024-10-12 23:53:26,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-12 23:53:26,209 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 77 transitions. [2024-10-12 23:53:26,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-12 23:53:26,212 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:53:26,212 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 23:53:26,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 23:53:26,212 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:53:26,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:53:26,213 INFO L85 PathProgramCache]: Analyzing trace with hash -949489068, now seen corresponding path program 1 times [2024-10-12 23:53:26,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:53:26,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915005173] [2024-10-12 23:53:26,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:53:26,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:53:26,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:26,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 23:53:26,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:26,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 23:53:26,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:26,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 23:53:26,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:26,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 23:53:26,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:26,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 23:53:26,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:26,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-12 23:53:26,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:26,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 23:53:26,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:26,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-12 23:53:26,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:26,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 23:53:26,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:26,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 23:53:26,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:26,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 23:53:26,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:26,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-12 23:53:26,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:26,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 23:53:26,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:26,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-12 23:53:26,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:26,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-12 23:53:26,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:26,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-12 23:53:26,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:26,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-12 23:53:26,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:26,576 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-12 23:53:26,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:53:26,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915005173] [2024-10-12 23:53:26,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915005173] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:53:26,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:53:26,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 23:53:26,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241073128] [2024-10-12 23:53:26,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:53:26,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 23:53:26,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:53:26,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 23:53:26,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 23:53:26,582 INFO L87 Difference]: Start difference. First operand 52 states and 77 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-12 23:53:26,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:53:26,744 INFO L93 Difference]: Finished difference Result 155 states and 230 transitions. [2024-10-12 23:53:26,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 23:53:26,744 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 108 [2024-10-12 23:53:26,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:53:26,746 INFO L225 Difference]: With dead ends: 155 [2024-10-12 23:53:26,746 INFO L226 Difference]: Without dead ends: 104 [2024-10-12 23:53:26,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 23:53:26,747 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 51 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:53:26,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 198 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 23:53:26,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-12 23:53:26,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 85. [2024-10-12 23:53:26,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 48 states have internal predecessors, (58), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-12 23:53:26,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 126 transitions. [2024-10-12 23:53:26,766 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 126 transitions. Word has length 108 [2024-10-12 23:53:26,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:53:26,767 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 126 transitions. [2024-10-12 23:53:26,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-12 23:53:26,767 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 126 transitions. [2024-10-12 23:53:26,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-12 23:53:26,769 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:53:26,770 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 23:53:26,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 23:53:26,771 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:53:26,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:53:26,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1650553646, now seen corresponding path program 1 times [2024-10-12 23:53:26,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:53:26,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857788192] [2024-10-12 23:53:26,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:53:26,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:53:26,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:26,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 23:53:26,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:26,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 23:53:26,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:26,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 23:53:26,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:26,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 23:53:26,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:26,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 23:53:26,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:26,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-12 23:53:26,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:27,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 23:53:27,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:27,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-12 23:53:27,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:27,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 23:53:27,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:27,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 23:53:27,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:27,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 23:53:27,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:27,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-12 23:53:27,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:27,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 23:53:27,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:27,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-12 23:53:27,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:27,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-12 23:53:27,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:27,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-12 23:53:27,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:27,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-12 23:53:27,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:27,071 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 15 proven. 33 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-10-12 23:53:27,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:53:27,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857788192] [2024-10-12 23:53:27,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857788192] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 23:53:27,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912716905] [2024-10-12 23:53:27,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:53:27,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 23:53:27,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 23:53:27,074 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 23:53:27,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 23:53:27,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:27,163 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 23:53:27,168 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 23:53:27,342 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 246 proven. 33 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-10-12 23:53:27,342 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 23:53:27,490 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 15 proven. 33 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-10-12 23:53:27,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912716905] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 23:53:27,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 23:53:27,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-10-12 23:53:27,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949332284] [2024-10-12 23:53:27,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 23:53:27,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 23:53:27,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:53:27,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 23:53:27,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 23:53:27,495 INFO L87 Difference]: Start difference. First operand 85 states and 126 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-12 23:53:27,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:53:27,682 INFO L93 Difference]: Finished difference Result 148 states and 212 transitions. [2024-10-12 23:53:27,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 23:53:27,683 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), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 108 [2024-10-12 23:53:27,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:53:27,685 INFO L225 Difference]: With dead ends: 148 [2024-10-12 23:53:27,685 INFO L226 Difference]: Without dead ends: 97 [2024-10-12 23:53:27,686 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 246 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-10-12 23:53:27,688 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 52 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:53:27,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 128 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 23:53:27,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-12 23:53:27,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2024-10-12 23:53:27,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 54 states have internal predecessors, (62), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-12 23:53:27,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 130 transitions. [2024-10-12 23:53:27,710 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 130 transitions. Word has length 108 [2024-10-12 23:53:27,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:53:27,711 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 130 transitions. [2024-10-12 23:53:27,711 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), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-12 23:53:27,711 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 130 transitions. [2024-10-12 23:53:27,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-12 23:53:27,712 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:53:27,712 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 23:53:27,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-12 23:53:27,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 23:53:27,917 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:53:27,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:53:27,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1835067024, now seen corresponding path program 1 times [2024-10-12 23:53:27,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:53:27,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531093487] [2024-10-12 23:53:27,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:53:27,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:53:27,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-12 23:53:27,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [141702004] [2024-10-12 23:53:27,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:53:27,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 23:53:27,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 23:53:27,947 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 23:53:27,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 23:53:28,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:28,095 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-12 23:53:28,098 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 23:53:28,364 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-12 23:53:28,365 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 23:53:28,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:53:28,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531093487] [2024-10-12 23:53:28,366 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-12 23:53:28,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141702004] [2024-10-12 23:53:28,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [141702004] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:53:28,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:53:28,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 23:53:28,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566133603] [2024-10-12 23:53:28,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:53:28,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 23:53:28,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:53:28,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 23:53:28,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 23:53:28,370 INFO L87 Difference]: Start difference. First operand 93 states and 130 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-12 23:53:28,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:53:28,453 INFO L93 Difference]: Finished difference Result 164 states and 229 transitions. [2024-10-12 23:53:28,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 23:53:28,453 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 108 [2024-10-12 23:53:28,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:53:28,454 INFO L225 Difference]: With dead ends: 164 [2024-10-12 23:53:28,454 INFO L226 Difference]: Without dead ends: 109 [2024-10-12 23:53:28,455 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 23:53:28,458 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 34 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:53:28,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 198 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 23:53:28,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-12 23:53:28,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 94. [2024-10-12 23:53:28,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 55 states have (on average 1.1454545454545455) internal successors, (63), 55 states have internal predecessors, (63), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-12 23:53:28,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 131 transitions. [2024-10-12 23:53:28,477 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 131 transitions. Word has length 108 [2024-10-12 23:53:28,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:53:28,479 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 131 transitions. [2024-10-12 23:53:28,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-12 23:53:28,479 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 131 transitions. [2024-10-12 23:53:28,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-12 23:53:28,480 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:53:28,480 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 23:53:28,499 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 23:53:28,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 23:53:28,685 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:53:28,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:53:28,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1468704586, now seen corresponding path program 1 times [2024-10-12 23:53:28,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:53:28,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519603302] [2024-10-12 23:53:28,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:53:28,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:53:28,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:28,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 23:53:28,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:28,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 23:53:28,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:28,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 23:53:28,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:28,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 23:53:28,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:28,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 23:53:28,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:28,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-12 23:53:28,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:28,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 23:53:28,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:28,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-12 23:53:28,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:28,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 23:53:28,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:28,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 23:53:28,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:28,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 23:53:28,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:28,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-12 23:53:28,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:28,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 23:53:28,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:28,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-12 23:53:28,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:28,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-12 23:53:28,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:28,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-12 23:53:28,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:28,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-12 23:53:28,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:28,802 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-12 23:53:28,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:53:28,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519603302] [2024-10-12 23:53:28,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519603302] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:53:28,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:53:28,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 23:53:28,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385559160] [2024-10-12 23:53:28,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:53:28,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 23:53:28,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:53:28,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 23:53:28,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 23:53:28,803 INFO L87 Difference]: Start difference. First operand 94 states and 131 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-12 23:53:28,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:53:28,895 INFO L93 Difference]: Finished difference Result 201 states and 282 transitions. [2024-10-12 23:53:28,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 23:53:28,895 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 108 [2024-10-12 23:53:28,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:53:28,897 INFO L225 Difference]: With dead ends: 201 [2024-10-12 23:53:28,897 INFO L226 Difference]: Without dead ends: 146 [2024-10-12 23:53:28,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 23:53:28,898 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 101 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:53:28,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 121 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 23:53:28,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-10-12 23:53:28,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 94. [2024-10-12 23:53:28,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 55 states have (on average 1.1454545454545455) internal successors, (63), 55 states have internal predecessors, (63), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-12 23:53:28,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 131 transitions. [2024-10-12 23:53:28,913 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 131 transitions. Word has length 108 [2024-10-12 23:53:28,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:53:28,914 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 131 transitions. [2024-10-12 23:53:28,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-12 23:53:28,914 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 131 transitions. [2024-10-12 23:53:28,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-12 23:53:28,915 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:53:28,915 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 23:53:28,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 23:53:28,915 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:53:28,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:53:28,915 INFO L85 PathProgramCache]: Analyzing trace with hash -380310625, now seen corresponding path program 1 times [2024-10-12 23:53:28,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:53:28,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389846775] [2024-10-12 23:53:28,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:53:28,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:53:28,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:29,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 23:53:29,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:29,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 23:53:29,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:29,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 23:53:29,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:29,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 23:53:29,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:29,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 23:53:29,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:29,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-12 23:53:29,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:29,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 23:53:29,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:29,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-12 23:53:29,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:29,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 23:53:29,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:29,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 23:53:29,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:29,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 23:53:29,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:29,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-12 23:53:29,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:29,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 23:53:29,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:29,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-12 23:53:29,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:29,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-12 23:53:29,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:29,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-12 23:53:29,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:29,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-12 23:53:29,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:29,034 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-12 23:53:29,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:53:29,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389846775] [2024-10-12 23:53:29,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389846775] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:53:29,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:53:29,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 23:53:29,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530783052] [2024-10-12 23:53:29,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:53:29,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 23:53:29,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:53:29,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 23:53:29,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 23:53:29,035 INFO L87 Difference]: Start difference. First operand 94 states and 131 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-12 23:53:29,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:53:29,130 INFO L93 Difference]: Finished difference Result 167 states and 231 transitions. [2024-10-12 23:53:29,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 23:53:29,131 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 109 [2024-10-12 23:53:29,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:53:29,132 INFO L225 Difference]: With dead ends: 167 [2024-10-12 23:53:29,132 INFO L226 Difference]: Without dead ends: 112 [2024-10-12 23:53:29,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 23:53:29,133 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 40 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:53:29,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 201 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 23:53:29,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-12 23:53:29,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 95. [2024-10-12 23:53:29,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 56 states have internal predecessors, (64), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-12 23:53:29,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 132 transitions. [2024-10-12 23:53:29,150 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 132 transitions. Word has length 109 [2024-10-12 23:53:29,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:53:29,151 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 132 transitions. [2024-10-12 23:53:29,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-12 23:53:29,151 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 132 transitions. [2024-10-12 23:53:29,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-12 23:53:29,152 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:53:29,152 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 23:53:29,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 23:53:29,152 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:53:29,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:53:29,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1949109216, now seen corresponding path program 1 times [2024-10-12 23:53:29,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:53:29,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735327791] [2024-10-12 23:53:29,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:53:29,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:53:29,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:29,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 23:53:29,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:29,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 23:53:29,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:29,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 23:53:29,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:29,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 23:53:29,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:29,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 23:53:29,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:29,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-12 23:53:29,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:29,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 23:53:29,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:29,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-12 23:53:29,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:29,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 23:53:29,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:29,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 23:53:29,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:29,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 23:53:29,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:29,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-12 23:53:29,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:29,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 23:53:29,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:29,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-12 23:53:29,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:29,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-12 23:53:29,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:29,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-12 23:53:29,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:29,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-12 23:53:29,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:29,243 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-12 23:53:29,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:53:29,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735327791] [2024-10-12 23:53:29,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735327791] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:53:29,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:53:29,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 23:53:29,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255062819] [2024-10-12 23:53:29,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:53:29,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 23:53:29,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:53:29,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 23:53:29,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 23:53:29,244 INFO L87 Difference]: Start difference. First operand 95 states and 132 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-12 23:53:29,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:53:29,328 INFO L93 Difference]: Finished difference Result 202 states and 282 transitions. [2024-10-12 23:53:29,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 23:53:29,328 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 109 [2024-10-12 23:53:29,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:53:29,330 INFO L225 Difference]: With dead ends: 202 [2024-10-12 23:53:29,330 INFO L226 Difference]: Without dead ends: 147 [2024-10-12 23:53:29,330 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 23:53:29,330 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 91 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:53:29,331 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 119 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 23:53:29,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-10-12 23:53:29,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 92. [2024-10-12 23:53:29,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 53 states have (on average 1.1320754716981132) internal successors, (60), 53 states have internal predecessors, (60), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-12 23:53:29,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 128 transitions. [2024-10-12 23:53:29,347 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 128 transitions. Word has length 109 [2024-10-12 23:53:29,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:53:29,347 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 128 transitions. [2024-10-12 23:53:29,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-12 23:53:29,347 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 128 transitions. [2024-10-12 23:53:29,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-12 23:53:29,348 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:53:29,348 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 23:53:29,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 23:53:29,348 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:53:29,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:53:29,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1434670923, now seen corresponding path program 1 times [2024-10-12 23:53:29,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:53:29,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734202387] [2024-10-12 23:53:29,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:53:29,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:53:29,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-12 23:53:29,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [336239801] [2024-10-12 23:53:29,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:53:29,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 23:53:29,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 23:53:29,377 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 23:53:29,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-12 23:53:29,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 23:53:29,531 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 23:53:29,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 23:53:29,611 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 23:53:29,611 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-12 23:53:29,612 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 23:53:29,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-12 23:53:29,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 23:53:29,817 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:53:29,894 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 23:53:29,898 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 11:53:29 BoogieIcfgContainer [2024-10-12 23:53:29,898 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 23:53:29,899 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 23:53:29,899 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 23:53:29,899 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 23:53:29,899 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:53:25" (3/4) ... [2024-10-12 23:53:29,901 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-12 23:53:29,902 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 23:53:29,902 INFO L158 Benchmark]: Toolchain (without parser) took 5557.28ms. Allocated memory was 146.8MB in the beginning and 253.8MB in the end (delta: 107.0MB). Free memory was 90.7MB in the beginning and 100.6MB in the end (delta: -9.9MB). Peak memory consumption was 98.9MB. Max. memory is 16.1GB. [2024-10-12 23:53:29,903 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 146.8MB. Free memory is still 107.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 23:53:29,903 INFO L158 Benchmark]: CACSL2BoogieTranslator took 252.30ms. Allocated memory is still 146.8MB. Free memory was 90.4MB in the beginning and 75.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-12 23:53:29,903 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.90ms. Allocated memory is still 146.8MB. Free memory was 75.7MB in the beginning and 72.8MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 23:53:29,903 INFO L158 Benchmark]: Boogie Preprocessor took 34.16ms. Allocated memory is still 146.8MB. Free memory was 72.8MB in the beginning and 69.2MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-12 23:53:29,903 INFO L158 Benchmark]: RCFGBuilder took 557.92ms. Allocated memory is still 146.8MB. Free memory was 69.2MB in the beginning and 103.4MB in the end (delta: -34.2MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. [2024-10-12 23:53:29,903 INFO L158 Benchmark]: TraceAbstraction took 4664.77ms. Allocated memory was 146.8MB in the beginning and 253.8MB in the end (delta: 107.0MB). Free memory was 102.7MB in the beginning and 100.6MB in the end (delta: 2.1MB). Peak memory consumption was 110.8MB. Max. memory is 16.1GB. [2024-10-12 23:53:29,904 INFO L158 Benchmark]: Witness Printer took 3.44ms. Allocated memory is still 253.8MB. Free memory is still 100.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 23:53:29,904 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.14ms. Allocated memory is still 146.8MB. Free memory is still 107.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 252.30ms. Allocated memory is still 146.8MB. Free memory was 90.4MB in the beginning and 75.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.90ms. Allocated memory is still 146.8MB. Free memory was 75.7MB in the beginning and 72.8MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.16ms. Allocated memory is still 146.8MB. Free memory was 72.8MB in the beginning and 69.2MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 557.92ms. Allocated memory is still 146.8MB. Free memory was 69.2MB in the beginning and 103.4MB in the end (delta: -34.2MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. * TraceAbstraction took 4664.77ms. Allocated memory was 146.8MB in the beginning and 253.8MB in the end (delta: 107.0MB). Free memory was 102.7MB in the beginning and 100.6MB in the end (delta: 2.1MB). Peak memory consumption was 110.8MB. Max. memory is 16.1GB. * Witness Printer took 3.44ms. Allocated memory is still 253.8MB. Free memory is still 100.6MB. 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 someBinaryFLOATComparisonOperation at line 94, overapproximation of someBinaryDOUBLEComparisonOperation at line 126. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 16; [L23] signed char var_1_10 = 2; [L24] signed char var_1_11 = 1; [L25] float var_1_14 = 64.3; [L26] signed char var_1_16 = 32; [L27] unsigned char var_1_17 = 1; [L28] unsigned char var_1_18 = 0; [L29] unsigned char var_1_19 = 0; [L30] double var_1_20 = 9.25; [L31] double var_1_21 = 255.05; [L32] double var_1_22 = 25.5; [L33] unsigned char var_1_23 = 2; [L34] unsigned char var_1_25 = 1; [L35] unsigned short int var_1_26 = 5; [L36] unsigned char var_1_27 = 128; [L37] unsigned char var_1_28 = 1; [L38] signed long int var_1_29 = 128; [L39] unsigned long int var_1_31 = 1; [L40] unsigned char last_1_var_1_17 = 1; [L41] double last_1_var_1_20 = 9.25; [L42] unsigned char last_1_var_1_23 = 2; [L43] unsigned short int last_1_var_1_26 = 5; [L44] signed long int last_1_var_1_29 = 128; [L130] isInitial = 1 [L131] FCALL initially() [L132] COND TRUE 1 [L133] CALL updateLastVariables() [L119] last_1_var_1_17 = var_1_17 [L120] last_1_var_1_20 = var_1_20 [L121] last_1_var_1_23 = var_1_23 [L122] last_1_var_1_26 = var_1_26 [L123] last_1_var_1_29 = var_1_29 [L133] RET updateLastVariables() [L134] CALL updateVariables() [L90] var_1_11 = __VERIFIER_nondet_char() [L91] CALL assume_abort_if_not(var_1_11 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L91] RET assume_abort_if_not(var_1_11 >= -63) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L92] CALL assume_abort_if_not(var_1_11 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L92] RET assume_abort_if_not(var_1_11 <= 63) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L93] var_1_14 = __VERIFIER_nondet_float() [L94] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L94] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L95] var_1_16 = __VERIFIER_nondet_char() [L96] CALL assume_abort_if_not(var_1_16 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L96] RET assume_abort_if_not(var_1_16 >= -63) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L97] CALL assume_abort_if_not(var_1_16 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L97] RET assume_abort_if_not(var_1_16 <= 63) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L98] var_1_18 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_18 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L99] RET assume_abort_if_not(var_1_18 >= 1) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L100] CALL assume_abort_if_not(var_1_18 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L100] RET assume_abort_if_not(var_1_18 <= 1) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L101] var_1_19 = __VERIFIER_nondet_uchar() [L102] CALL assume_abort_if_not(var_1_19 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L102] RET assume_abort_if_not(var_1_19 >= 1) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L103] CALL assume_abort_if_not(var_1_19 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L103] RET assume_abort_if_not(var_1_19 <= 1) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L104] var_1_21 = __VERIFIER_nondet_double() [L105] 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_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L105] 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_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L106] var_1_22 = __VERIFIER_nondet_double() [L107] CALL assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L107] RET assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L108] var_1_25 = __VERIFIER_nondet_uchar() [L109] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L109] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L110] CALL assume_abort_if_not(var_1_25 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L110] RET assume_abort_if_not(var_1_25 <= 254) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L111] var_1_27 = __VERIFIER_nondet_uchar() [L112] CALL assume_abort_if_not(var_1_27 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=1, var_1_29=128, var_1_31=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=1, var_1_29=128, var_1_31=1] [L112] RET assume_abort_if_not(var_1_27 >= 127) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=1, var_1_29=128, var_1_31=1] [L113] CALL assume_abort_if_not(var_1_27 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=1, var_1_29=128, var_1_31=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=1, var_1_29=128, var_1_31=1] [L113] RET assume_abort_if_not(var_1_27 <= 255) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=1, var_1_29=128, var_1_31=1] [L114] var_1_28 = __VERIFIER_nondet_uchar() [L115] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_29=128, var_1_31=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_29=128, var_1_31=1] [L115] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_29=128, var_1_31=1] [L116] CALL assume_abort_if_not(var_1_28 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=-241, var_1_29=128, var_1_31=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=-241, var_1_29=128, var_1_31=1] [L116] RET assume_abort_if_not(var_1_28 <= 127) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=-241, var_1_29=128, var_1_31=1] [L134] RET updateVariables() [L135] CALL step() [L48] COND TRUE (last_1_var_1_29 + last_1_var_1_29) > last_1_var_1_26 [L49] var_1_23 = var_1_25 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=0, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=-241, var_1_29=128, var_1_31=1] [L51] COND FALSE !((last_1_var_1_29 * last_1_var_1_23) <= last_1_var_1_29) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=0, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=-241, var_1_29=128, var_1_31=1] [L54] COND TRUE last_1_var_1_17 || last_1_var_1_17 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=0, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=-241, var_1_29=128, var_1_31=1] [L55] COND TRUE (((((last_1_var_1_20) < 0 ) ? -(last_1_var_1_20) : (last_1_var_1_20))) - var_1_14) == (last_1_var_1_20 + last_1_var_1_20) [L56] var_1_10 = (var_1_11 + var_1_16) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=0, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=-241, var_1_29=128, var_1_31=1] [L64] var_1_17 = (var_1_18 && var_1_19) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=0, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=-241, var_1_29=128, var_1_31=1] [L65] COND FALSE !(! var_1_18) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=0, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=-241, var_1_29=128, var_1_31=1] [L68] COND TRUE 256 >= var_1_10 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=0, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=-241, var_1_29=128, var_1_31=1] [L69] COND FALSE !(var_1_17 && (var_1_25 >= (var_1_27 - var_1_28))) [L72] var_1_26 = var_1_28 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=0, var_1_25=0, var_1_26=15, var_1_27=127, var_1_28=-241, var_1_29=128, var_1_31=1] [L77] var_1_31 = var_1_26 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=0, var_1_25=0, var_1_26=15, var_1_27=127, var_1_28=-241, var_1_29=128, var_1_31=15] [L78] COND FALSE !(((((var_1_20) < (63.5)) ? (var_1_20) : (63.5))) > (2.4 * var_1_20)) [L85] var_1_1 = -50 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=-50, var_1_20=37/4, var_1_23=0, var_1_25=0, var_1_26=15, var_1_27=127, var_1_28=-241, var_1_29=128, var_1_31=15] [L87] var_1_29 = var_1_1 [L135] RET step() [L136] CALL, EXPR property() [L126-L127] return ((((((((((((var_1_20) < (63.5)) ? (var_1_20) : (63.5))) > (2.4 * var_1_20)) ? (((var_1_23 * var_1_26) <= (~ var_1_26)) ? (var_1_1 == ((signed short int) (((((var_1_10) < (var_1_10)) ? (var_1_10) : (var_1_10))) + var_1_23))) : (var_1_1 == ((signed short int) var_1_10))) : (var_1_1 == ((signed short int) -50))) && (((last_1_var_1_29 * last_1_var_1_23) <= last_1_var_1_29) ? (var_1_10 == ((signed char) (var_1_11 + 10))) : ((last_1_var_1_17 || last_1_var_1_17) ? (((((((last_1_var_1_20) < 0 ) ? -(last_1_var_1_20) : (last_1_var_1_20))) - var_1_14) == (last_1_var_1_20 + last_1_var_1_20)) ? (var_1_10 == ((signed char) (var_1_11 + var_1_16))) : (var_1_10 == ((signed char) var_1_11))) : (var_1_10 == ((signed char) var_1_16))))) && (var_1_17 == ((unsigned char) (var_1_18 && var_1_19)))) && ((! var_1_18) ? (var_1_20 == ((double) ((((var_1_21) > (var_1_22)) ? (var_1_21) : (var_1_22))))) : 1)) && (((last_1_var_1_29 + last_1_var_1_29) > last_1_var_1_26) ? (var_1_23 == ((unsigned char) var_1_25)) : 1)) && ((256 >= var_1_10) ? ((var_1_17 && (var_1_25 >= (var_1_27 - var_1_28))) ? (var_1_26 == ((unsigned short int) 16)) : (var_1_26 == ((unsigned short int) var_1_28))) : (var_1_26 == ((unsigned short int) var_1_25)))) && (var_1_29 == ((signed long int) var_1_1))) && (var_1_31 == ((unsigned long int) var_1_26)) ; [L136] RET, EXPR property() [L136] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=-50, var_1_20=37/4, var_1_23=0, var_1_25=0, var_1_26=15, var_1_27=127, var_1_28=-241, var_1_29=-50, var_1_31=15] [L19] reach_error() VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=-50, var_1_20=37/4, var_1_23=0, var_1_25=0, var_1_26=15, var_1_27=127, var_1_28=-241, var_1_29=-50, var_1_31=15] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.5s, OverallIterations: 9, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 387 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 382 mSDsluCounter, 1164 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 641 mSDsCounter, 269 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 259 IncrementalHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 269 mSolverCounterUnsat, 523 mSDtfsCounter, 259 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 614 GetRequests, 589 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=95occurred in iteration=7, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 172 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1300 NumberOfCodeBlocks, 1300 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1070 ConstructedInterpolants, 0 QuantifiedInterpolants, 2772 SizeOfPredicates, 2 NumberOfNonLiveVariables, 547 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 5341/5440 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-12 23:53:29,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-72.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 b545584bd88f47093962ebc7c26b6e47720a32713ab794e33d897c38ad3103bb --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 23:53:31,840 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 23:53:31,896 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-12 23:53:31,901 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 23:53:31,901 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 23:53:31,926 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 23:53:31,927 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 23:53:31,927 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 23:53:31,928 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 23:53:31,928 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 23:53:31,928 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 23:53:31,929 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 23:53:31,929 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 23:53:31,933 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 23:53:31,934 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 23:53:31,934 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 23:53:31,934 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 23:53:31,934 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 23:53:31,935 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 23:53:31,935 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 23:53:31,935 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 23:53:31,937 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 23:53:31,937 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 23:53:31,937 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-12 23:53:31,937 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-12 23:53:31,938 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 23:53:31,938 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-12 23:53:31,938 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 23:53:31,938 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 23:53:31,938 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 23:53:31,939 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 23:53:31,939 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 23:53:31,939 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 23:53:31,939 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 23:53:31,939 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 23:53:31,949 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 23:53:31,949 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 23:53:31,949 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 23:53:31,950 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-12 23:53:31,950 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-12 23:53:31,950 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 23:53:31,951 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 23:53:31,951 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 23:53:31,951 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 23:53:31,951 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-12 23:53:31,951 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/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/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 -> b545584bd88f47093962ebc7c26b6e47720a32713ab794e33d897c38ad3103bb [2024-10-12 23:53:32,198 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 23:53:32,221 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 23:53:32,224 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 23:53:32,225 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 23:53:32,225 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 23:53:32,227 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-72.i [2024-10-12 23:53:33,608 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 23:53:33,791 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 23:53:33,791 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-72.i [2024-10-12 23:53:33,801 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1090ff976/1cf9d28bd81a48dd8ea4429757a6cc30/FLAG500707b22 [2024-10-12 23:53:33,819 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1090ff976/1cf9d28bd81a48dd8ea4429757a6cc30 [2024-10-12 23:53:33,821 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 23:53:33,822 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 23:53:33,824 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 23:53:33,825 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 23:53:33,833 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 23:53:33,834 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:53:33" (1/1) ... [2024-10-12 23:53:33,834 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f63f3ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:53:33, skipping insertion in model container [2024-10-12 23:53:33,835 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:53:33" (1/1) ... [2024-10-12 23:53:33,862 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 23:53:34,018 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_codestructure_dependencies_file-72.i[919,932] [2024-10-12 23:53:34,078 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 23:53:34,093 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 23:53:34,106 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_codestructure_dependencies_file-72.i[919,932] [2024-10-12 23:53:34,135 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 23:53:34,166 INFO L204 MainTranslator]: Completed translation [2024-10-12 23:53:34,166 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:53:34 WrapperNode [2024-10-12 23:53:34,166 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 23:53:34,167 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 23:53:34,167 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 23:53:34,167 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 23:53:34,180 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:53:34" (1/1) ... [2024-10-12 23:53:34,194 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:53:34" (1/1) ... [2024-10-12 23:53:34,211 INFO L138 Inliner]: procedures = 27, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 133 [2024-10-12 23:53:34,212 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 23:53:34,212 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 23:53:34,212 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 23:53:34,212 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 23:53:34,229 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:53:34" (1/1) ... [2024-10-12 23:53:34,229 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:53:34" (1/1) ... [2024-10-12 23:53:34,232 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:53:34" (1/1) ... [2024-10-12 23:53:34,263 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-12 23:53:34,263 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:53:34" (1/1) ... [2024-10-12 23:53:34,263 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:53:34" (1/1) ... [2024-10-12 23:53:34,278 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:53:34" (1/1) ... [2024-10-12 23:53:34,285 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:53:34" (1/1) ... [2024-10-12 23:53:34,287 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:53:34" (1/1) ... [2024-10-12 23:53:34,288 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:53:34" (1/1) ... [2024-10-12 23:53:34,294 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 23:53:34,298 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 23:53:34,301 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 23:53:34,301 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 23:53:34,302 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:53:34" (1/1) ... [2024-10-12 23:53:34,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 23:53:34,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 23:53:34,348 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 23:53:34,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 23:53:34,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 23:53:34,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-12 23:53:34,388 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-12 23:53:34,388 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-12 23:53:34,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 23:53:34,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 23:53:34,457 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 23:53:34,459 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 23:53:41,364 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-12 23:53:41,364 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 23:53:41,404 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 23:53:41,404 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 23:53:41,405 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:53:41 BoogieIcfgContainer [2024-10-12 23:53:41,405 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 23:53:41,406 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 23:53:41,406 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 23:53:41,410 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 23:53:41,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 11:53:33" (1/3) ... [2024-10-12 23:53:41,412 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bcf25f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:53:41, skipping insertion in model container [2024-10-12 23:53:41,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:53:34" (2/3) ... [2024-10-12 23:53:41,412 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bcf25f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:53:41, skipping insertion in model container [2024-10-12 23:53:41,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:53:41" (3/3) ... [2024-10-12 23:53:41,413 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-72.i [2024-10-12 23:53:41,426 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 23:53:41,426 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 23:53:41,483 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 23:53:41,489 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;@5a3f7663, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 23:53:41,490 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 23:53:41,496 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 32 states have internal predecessors, (45), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-12 23:53:41,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-12 23:53:41,505 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:53:41,506 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 23:53:41,506 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:53:41,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:53:41,511 INFO L85 PathProgramCache]: Analyzing trace with hash 191248627, now seen corresponding path program 1 times [2024-10-12 23:53:41,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 23:53:41,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2118782819] [2024-10-12 23:53:41,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:53:41,523 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-12 23:53:41,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 23:53:41,527 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/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-12 23:53:41,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-12 23:53:41,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:41,988 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-12 23:53:42,000 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 23:53:42,044 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2024-10-12 23:53:42,045 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 23:53:42,046 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 23:53:42,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2118782819] [2024-10-12 23:53:42,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2118782819] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:53:42,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:53:42,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 23:53:42,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131203007] [2024-10-12 23:53:42,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:53:42,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 23:53:42,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 23:53:42,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 23:53:42,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 23:53:42,079 INFO L87 Difference]: Start difference. First operand has 51 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 32 states have internal predecessors, (45), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-12 23:53:46,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-12 23:53:46,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:53:46,220 INFO L93 Difference]: Finished difference Result 99 states and 173 transitions. [2024-10-12 23:53:46,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 23:53:46,260 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 107 [2024-10-12 23:53:46,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:53:46,265 INFO L225 Difference]: With dead ends: 99 [2024-10-12 23:53:46,266 INFO L226 Difference]: Without dead ends: 49 [2024-10-12 23:53:46,267 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 106 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-12 23:53:46,270 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:53:46,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2024-10-12 23:53:46,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-10-12 23:53:46,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-10-12 23:53:46,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 30 states have internal predecessors, (38), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-12 23:53:46,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 72 transitions. [2024-10-12 23:53:46,315 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 72 transitions. Word has length 107 [2024-10-12 23:53:46,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:53:46,316 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 72 transitions. [2024-10-12 23:53:46,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-12 23:53:46,317 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 72 transitions. [2024-10-12 23:53:46,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-12 23:53:46,321 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:53:46,321 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 23:53:46,334 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-12 23:53:46,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/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-12 23:53:46,522 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:53:46,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:53:46,525 INFO L85 PathProgramCache]: Analyzing trace with hash -949489068, now seen corresponding path program 1 times [2024-10-12 23:53:46,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 23:53:46,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1769138511] [2024-10-12 23:53:46,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:53:46,526 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-12 23:53:46,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 23:53:46,532 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/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-12 23:53:46,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-12 23:53:46,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:46,923 INFO L255 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-12 23:53:46,927 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 23:53:49,167 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-12 23:53:49,168 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 23:53:49,168 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 23:53:49,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1769138511] [2024-10-12 23:53:49,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1769138511] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:53:49,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:53:49,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 23:53:49,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277783836] [2024-10-12 23:53:49,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:53:49,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 23:53:49,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 23:53:49,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 23:53:49,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 23:53:49,171 INFO L87 Difference]: Start difference. First operand 49 states and 72 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-12 23:53:53,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-12 23:53:57,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-12 23:54:01,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-12 23:54:05,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-12 23:54:09,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-12 23:54:09,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:54:09,825 INFO L93 Difference]: Finished difference Result 146 states and 215 transitions. [2024-10-12 23:54:09,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 23:54:09,865 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 108 [2024-10-12 23:54:09,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:54:09,867 INFO L225 Difference]: With dead ends: 146 [2024-10-12 23:54:09,867 INFO L226 Difference]: Without dead ends: 98 [2024-10-12 23:54:09,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 23:54:09,869 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 47 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 35 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.6s IncrementalHoareTripleChecker+Time [2024-10-12 23:54:09,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 196 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 15 Invalid, 5 Unknown, 0 Unchecked, 20.6s Time] [2024-10-12 23:54:09,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-12 23:54:09,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 82. [2024-10-12 23:54:09,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 45 states have internal predecessors, (53), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-12 23:54:09,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 121 transitions. [2024-10-12 23:54:09,885 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 121 transitions. Word has length 108 [2024-10-12 23:54:09,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:54:09,886 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 121 transitions. [2024-10-12 23:54:09,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-12 23:54:09,886 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 121 transitions. [2024-10-12 23:54:09,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-12 23:54:09,887 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:54:09,887 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 23:54:09,901 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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)] Ended with exit code 0 [2024-10-12 23:54:10,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/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-12 23:54:10,092 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:54:10,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:54:10,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1650553646, now seen corresponding path program 1 times [2024-10-12 23:54:10,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 23:54:10,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1046990477] [2024-10-12 23:54:10,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:54:10,093 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-12 23:54:10,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 23:54:10,096 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/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-12 23:54:10,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-12 23:54:10,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:54:10,538 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-12 23:54:10,541 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 23:54:12,572 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-12 23:54:12,578 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 23:54:12,579 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 23:54:12,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1046990477] [2024-10-12 23:54:12,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1046990477] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:54:12,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:54:12,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 23:54:12,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209325734] [2024-10-12 23:54:12,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:54:12,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 23:54:12,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 23:54:12,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 23:54:12,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 23:54:12,581 INFO L87 Difference]: Start difference. First operand 82 states and 121 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-12 23:54:16,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-12 23:54:20,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-12 23:54:25,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-12 23:54:27,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-12 23:54:27,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:54:27,319 INFO L93 Difference]: Finished difference Result 146 states and 214 transitions. [2024-10-12 23:54:27,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 23:54:27,358 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 108 [2024-10-12 23:54:27,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:54:27,360 INFO L225 Difference]: With dead ends: 146 [2024-10-12 23:54:27,360 INFO L226 Difference]: Without dead ends: 98 [2024-10-12 23:54:27,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 23:54:27,362 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 34 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 35 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.7s IncrementalHoareTripleChecker+Time [2024-10-12 23:54:27,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 198 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 15 Invalid, 3 Unknown, 0 Unchecked, 14.7s Time] [2024-10-12 23:54:27,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-12 23:54:27,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 83. [2024-10-12 23:54:27,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 46 states have (on average 1.173913043478261) internal successors, (54), 46 states have internal predecessors, (54), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-12 23:54:27,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 122 transitions. [2024-10-12 23:54:27,374 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 122 transitions. Word has length 108 [2024-10-12 23:54:27,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:54:27,374 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 122 transitions. [2024-10-12 23:54:27,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-12 23:54:27,375 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 122 transitions. [2024-10-12 23:54:27,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-12 23:54:27,376 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:54:27,376 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 23:54:27,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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)] Forceful destruction successful, exit code 0 [2024-10-12 23:54:27,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/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-12 23:54:27,581 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:54:27,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:54:27,582 INFO L85 PathProgramCache]: Analyzing trace with hash 429036001, now seen corresponding path program 1 times [2024-10-12 23:54:27,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 23:54:27,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [940864126] [2024-10-12 23:54:27,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:54:27,582 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-12 23:54:27,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 23:54:27,585 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/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-12 23:54:27,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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 (5)] Waiting until timeout for monitored process [2024-10-12 23:54:27,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:54:27,914 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 23:54:27,917 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 23:54:28,888 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-12 23:54:28,888 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 23:54:28,888 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 23:54:28,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [940864126] [2024-10-12 23:54:28,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [940864126] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:54:28,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:54:28,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 23:54:28,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177286211] [2024-10-12 23:54:28,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:54:28,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 23:54:28,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 23:54:28,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 23:54:28,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 23:54:28,891 INFO L87 Difference]: Start difference. First operand 83 states and 122 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-12 23:54:33,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-12 23:54:35,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.39s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-12 23:54:39,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-12 23:54:39,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:54:39,692 INFO L93 Difference]: Finished difference Result 146 states and 213 transitions. [2024-10-12 23:54:39,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 23:54:39,730 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 109 [2024-10-12 23:54:39,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:54:39,731 INFO L225 Difference]: With dead ends: 146 [2024-10-12 23:54:39,731 INFO L226 Difference]: Without dead ends: 98 [2024-10-12 23:54:39,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 23:54:39,733 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 37 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 35 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2024-10-12 23:54:39,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 201 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 11 Invalid, 2 Unknown, 0 Unchecked, 10.8s Time] [2024-10-12 23:54:39,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-12 23:54:39,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 84. [2024-10-12 23:54:39,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 47 states have internal predecessors, (55), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-12 23:54:39,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 123 transitions. [2024-10-12 23:54:39,752 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 123 transitions. Word has length 109 [2024-10-12 23:54:39,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:54:39,752 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 123 transitions. [2024-10-12 23:54:39,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-12 23:54:39,753 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 123 transitions. [2024-10-12 23:54:39,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-12 23:54:39,758 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:54:39,758 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 23:54:39,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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 (5)] Forceful destruction successful, exit code 0 [2024-10-12 23:54:39,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/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-12 23:54:39,959 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:54:39,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:54:39,960 INFO L85 PathProgramCache]: Analyzing trace with hash -2050949747, now seen corresponding path program 1 times [2024-10-12 23:54:39,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 23:54:39,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1336059166] [2024-10-12 23:54:39,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:54:39,961 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-12 23:54:39,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 23:54:39,964 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/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-12 23:54:39,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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 (6)] Waiting until timeout for monitored process [2024-10-12 23:54:40,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:54:40,317 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 23:54:40,319 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 23:54:41,166 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 246 proven. 33 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-10-12 23:54:41,166 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 23:54:42,044 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 15 proven. 33 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-10-12 23:54:42,048 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 23:54:42,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1336059166] [2024-10-12 23:54:42,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1336059166] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 23:54:42,048 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 23:54:42,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-10-12 23:54:42,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939805247] [2024-10-12 23:54:42,049 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 23:54:42,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 23:54:42,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 23:54:42,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 23:54:42,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 23:54:42,054 INFO L87 Difference]: Start difference. First operand 84 states and 123 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-12 23:54:46,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-12 23:54:50,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-12 23:54:55,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-12 23:54:55,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:54:55,210 INFO L93 Difference]: Finished difference Result 144 states and 204 transitions. [2024-10-12 23:54:55,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 23:54:55,217 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 110 [2024-10-12 23:54:55,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:54:55,218 INFO L225 Difference]: With dead ends: 144 [2024-10-12 23:54:55,218 INFO L226 Difference]: Without dead ends: 96 [2024-10-12 23:54:55,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 212 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-10-12 23:54:55,219 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 46 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 13 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.0s IncrementalHoareTripleChecker+Time [2024-10-12 23:54:55,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 124 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 135 Invalid, 3 Unknown, 0 Unchecked, 13.0s Time] [2024-10-12 23:54:55,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-12 23:54:55,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2024-10-12 23:54:55,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 53 states have (on average 1.1320754716981132) internal successors, (60), 53 states have internal predecessors, (60), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-12 23:54:55,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 128 transitions. [2024-10-12 23:54:55,256 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 128 transitions. Word has length 110 [2024-10-12 23:54:55,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:54:55,256 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 128 transitions. [2024-10-12 23:54:55,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-12 23:54:55,257 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 128 transitions. [2024-10-12 23:54:55,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-12 23:54:55,257 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:54:55,257 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 23:54:55,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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 (6)] Forceful destruction successful, exit code 0 [2024-10-12 23:54:55,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/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-12 23:54:55,459 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:54:55,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:54:55,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1434670923, now seen corresponding path program 1 times [2024-10-12 23:54:55,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 23:54:55,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1662504511] [2024-10-12 23:54:55,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:54:55,460 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-12 23:54:55,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 23:54:55,461 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/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-12 23:54:55,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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 (7)] Waiting until timeout for monitored process [2024-10-12 23:54:55,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:54:55,948 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-12 23:54:55,957 INFO L278 TraceCheckSpWp]: Computing forward predicates...