./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-61.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-61.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 f8c7f093a0092c99d535dacf9ec847d585a162cf9e23f66317fd8ccac5a76f81 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 21:11:58,350 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 21:11:58,451 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 21:11:58,458 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 21:11:58,459 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 21:11:58,480 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 21:11:58,481 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 21:11:58,481 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 21:11:58,482 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 21:11:58,482 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 21:11:58,483 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 21:11:58,483 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 21:11:58,483 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 21:11:58,484 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 21:11:58,484 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 21:11:58,485 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 21:11:58,485 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 21:11:58,485 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 21:11:58,486 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 21:11:58,486 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 21:11:58,486 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 21:11:58,487 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 21:11:58,487 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 21:11:58,487 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 21:11:58,492 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 21:11:58,493 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 21:11:58,493 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 21:11:58,493 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 21:11:58,494 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 21:11:58,494 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 21:11:58,494 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 21:11:58,494 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 21:11:58,494 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:11:58,495 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 21:11:58,495 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 21:11:58,495 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 21:11:58,495 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 21:11:58,496 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 21:11:58,496 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 21:11:58,496 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 21:11:58,498 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 21:11:58,498 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 21:11:58,498 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 -> f8c7f093a0092c99d535dacf9ec847d585a162cf9e23f66317fd8ccac5a76f81 [2024-11-08 21:11:58,779 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 21:11:58,803 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 21:11:58,806 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 21:11:58,807 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 21:11:58,807 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 21:11:58,809 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-61.i [2024-11-08 21:12:00,260 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 21:12:00,467 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 21:12:00,468 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-61.i [2024-11-08 21:12:00,476 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee176b8c5/77f790cfb18b4d79a69a224ffd3f8990/FLAGa23bd0029 [2024-11-08 21:12:00,488 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee176b8c5/77f790cfb18b4d79a69a224ffd3f8990 [2024-11-08 21:12:00,491 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 21:12:00,492 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 21:12:00,495 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 21:12:00,495 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 21:12:00,501 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 21:12:00,502 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:12:00" (1/1) ... [2024-11-08 21:12:00,503 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@325fa952 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:12:00, skipping insertion in model container [2024-11-08 21:12:00,505 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:12:00" (1/1) ... [2024-11-08 21:12:00,538 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 21:12:00,700 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-61.i[919,932] [2024-11-08 21:12:00,806 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:12:00,815 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 21:12:00,824 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-61.i[919,932] [2024-11-08 21:12:00,853 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:12:00,872 INFO L204 MainTranslator]: Completed translation [2024-11-08 21:12:00,873 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:12:00 WrapperNode [2024-11-08 21:12:00,873 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 21:12:00,874 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 21:12:00,874 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 21:12:00,875 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 21:12:00,882 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:12:00" (1/1) ... [2024-11-08 21:12:00,897 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:12:00" (1/1) ... [2024-11-08 21:12:00,936 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 226 [2024-11-08 21:12:00,936 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 21:12:00,937 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 21:12:00,937 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 21:12:00,937 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 21:12:00,953 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:12:00" (1/1) ... [2024-11-08 21:12:00,953 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:12:00" (1/1) ... [2024-11-08 21:12:00,960 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:12:00" (1/1) ... [2024-11-08 21:12:00,979 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-11-08 21:12:00,979 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:12:00" (1/1) ... [2024-11-08 21:12:00,979 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:12:00" (1/1) ... [2024-11-08 21:12:00,988 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:12:00" (1/1) ... [2024-11-08 21:12:00,993 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:12:00" (1/1) ... [2024-11-08 21:12:00,995 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:12:00" (1/1) ... [2024-11-08 21:12:00,997 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:12:00" (1/1) ... [2024-11-08 21:12:01,002 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 21:12:01,003 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 21:12:01,003 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 21:12:01,003 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 21:12:01,004 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:12:00" (1/1) ... [2024-11-08 21:12:01,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:12:01,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:12:01,053 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-11-08 21:12:01,057 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-11-08 21:12:01,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 21:12:01,108 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 21:12:01,109 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 21:12:01,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 21:12:01,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 21:12:01,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 21:12:01,213 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 21:12:01,215 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 21:12:01,706 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-08 21:12:01,706 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 21:12:01,726 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 21:12:01,726 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 21:12:01,727 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:12:01 BoogieIcfgContainer [2024-11-08 21:12:01,727 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 21:12:01,730 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 21:12:01,732 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 21:12:01,735 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 21:12:01,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 09:12:00" (1/3) ... [2024-11-08 21:12:01,736 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6beaea6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:12:01, skipping insertion in model container [2024-11-08 21:12:01,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:12:00" (2/3) ... [2024-11-08 21:12:01,737 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6beaea6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:12:01, skipping insertion in model container [2024-11-08 21:12:01,737 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:12:01" (3/3) ... [2024-11-08 21:12:01,740 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-61.i [2024-11-08 21:12:01,757 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 21:12:01,757 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 21:12:01,823 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 21:12:01,832 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;@5a80f39c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 21:12:01,833 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 21:12:01,838 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 75 states have (on average 1.5066666666666666) internal successors, (113), 76 states have internal predecessors, (113), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 21:12:01,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-08 21:12:01,856 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:12:01,857 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 21:12:01,858 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:12:01,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:12:01,866 INFO L85 PathProgramCache]: Analyzing trace with hash 223257851, now seen corresponding path program 1 times [2024-11-08 21:12:01,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:12:01,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388111830] [2024-11-08 21:12:01,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:12:01,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:12:02,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:02,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:12:02,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:02,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:12:02,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:02,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:12:02,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:02,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:12:02,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:02,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:12:02,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:02,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 21:12:02,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:02,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:12:02,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:02,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 21:12:02,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:02,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:12:02,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:02,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 21:12:02,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:02,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:12:02,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:02,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 21:12:02,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:02,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 21:12:02,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:02,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:12:02,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:02,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 21:12:02,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:02,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:12:02,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:02,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 21:12:02,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:02,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 21:12:02,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:02,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 21:12:02,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:02,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 21:12:02,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:02,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 21:12:02,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:02,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 21:12:02,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:02,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 21:12:02,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:02,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 21:12:02,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:02,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-08 21:12:02,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:12:02,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388111830] [2024-11-08 21:12:02,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388111830] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:12:02,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:12:02,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 21:12:02,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139213059] [2024-11-08 21:12:02,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:12:02,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 21:12:02,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:12:02,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 21:12:02,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 21:12:02,505 INFO L87 Difference]: Start difference. First operand has 102 states, 75 states have (on average 1.5066666666666666) internal successors, (113), 76 states have internal predecessors, (113), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-08 21:12:02,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:12:02,542 INFO L93 Difference]: Finished difference Result 197 states and 340 transitions. [2024-11-08 21:12:02,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 21:12:02,544 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 165 [2024-11-08 21:12:02,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:12:02,558 INFO L225 Difference]: With dead ends: 197 [2024-11-08 21:12:02,558 INFO L226 Difference]: Without dead ends: 98 [2024-11-08 21:12:02,563 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 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-11-08 21:12:02,567 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 21:12:02,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:12:02,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-08 21:12:02,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-08 21:12:02,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 72 states have (on average 1.4444444444444444) internal successors, (104), 72 states have internal predecessors, (104), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 21:12:02,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 152 transitions. [2024-11-08 21:12:02,619 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 152 transitions. Word has length 165 [2024-11-08 21:12:02,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:12:02,620 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 152 transitions. [2024-11-08 21:12:02,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-08 21:12:02,621 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 152 transitions. [2024-11-08 21:12:02,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-08 21:12:02,625 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:12:02,625 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 21:12:02,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 21:12:02,628 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:12:02,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:12:02,629 INFO L85 PathProgramCache]: Analyzing trace with hash -443059017, now seen corresponding path program 1 times [2024-11-08 21:12:02,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:12:02,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705384889] [2024-11-08 21:12:02,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:12:02,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:12:02,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:02,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:12:02,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:02,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:12:02,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:02,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:12:02,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:02,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:12:02,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:02,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:12:02,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:02,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 21:12:02,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:02,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:12:02,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:02,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 21:12:02,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:02,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:12:02,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:02,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 21:12:02,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:02,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:12:02,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:02,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 21:12:02,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:02,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 21:12:02,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:02,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:12:02,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:02,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 21:12:03,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:03,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:12:03,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:03,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 21:12:03,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:03,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 21:12:03,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:03,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 21:12:03,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:03,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 21:12:03,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:03,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 21:12:03,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:03,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 21:12:03,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:03,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 21:12:03,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:03,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 21:12:03,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:03,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-08 21:12:03,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:12:03,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705384889] [2024-11-08 21:12:03,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705384889] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:12:03,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:12:03,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 21:12:03,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797644013] [2024-11-08 21:12:03,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:12:03,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 21:12:03,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:12:03,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 21:12:03,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:12:03,056 INFO L87 Difference]: Start difference. First operand 98 states and 152 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 21:12:03,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:12:03,094 INFO L93 Difference]: Finished difference Result 193 states and 301 transitions. [2024-11-08 21:12:03,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 21:12:03,095 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 165 [2024-11-08 21:12:03,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:12:03,112 INFO L225 Difference]: With dead ends: 193 [2024-11-08 21:12:03,113 INFO L226 Difference]: Without dead ends: 98 [2024-11-08 21:12:03,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 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-11-08 21:12:03,116 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 21:12:03,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 296 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:12:03,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-08 21:12:03,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-08 21:12:03,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 72 states have (on average 1.4305555555555556) internal successors, (103), 72 states have internal predecessors, (103), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 21:12:03,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 151 transitions. [2024-11-08 21:12:03,134 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 151 transitions. Word has length 165 [2024-11-08 21:12:03,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:12:03,136 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 151 transitions. [2024-11-08 21:12:03,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 21:12:03,136 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 151 transitions. [2024-11-08 21:12:03,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-08 21:12:03,139 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:12:03,139 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 21:12:03,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 21:12:03,140 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:12:03,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:12:03,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1480169017, now seen corresponding path program 1 times [2024-11-08 21:12:03,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:12:03,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82677308] [2024-11-08 21:12:03,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:12:03,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:12:03,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:03,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:12:03,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:03,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:12:03,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:03,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:12:03,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:03,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:12:03,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:03,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:12:03,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:03,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 21:12:03,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:03,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:12:03,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:03,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 21:12:03,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:03,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:12:03,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:03,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 21:12:03,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:03,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:12:03,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:03,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 21:12:03,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:03,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 21:12:03,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:03,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:12:03,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:03,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 21:12:03,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:03,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:12:03,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:03,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 21:12:03,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:03,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 21:12:03,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:03,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 21:12:03,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:03,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 21:12:03,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:03,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 21:12:03,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:03,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 21:12:03,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:03,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 21:12:03,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:03,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 21:12:03,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:03,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-08 21:12:03,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:12:03,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82677308] [2024-11-08 21:12:03,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82677308] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:12:03,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:12:03,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 21:12:03,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229814108] [2024-11-08 21:12:03,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:12:03,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 21:12:03,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:12:03,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 21:12:03,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 21:12:03,616 INFO L87 Difference]: Start difference. First operand 98 states and 151 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 21:12:03,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:12:03,854 INFO L93 Difference]: Finished difference Result 287 states and 445 transitions. [2024-11-08 21:12:03,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 21:12:03,857 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 165 [2024-11-08 21:12:03,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:12:03,860 INFO L225 Difference]: With dead ends: 287 [2024-11-08 21:12:03,860 INFO L226 Difference]: Without dead ends: 192 [2024-11-08 21:12:03,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 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-11-08 21:12:03,861 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 128 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 21:12:03,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 383 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 21:12:03,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-11-08 21:12:03,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 132. [2024-11-08 21:12:03,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 106 states have (on average 1.5188679245283019) internal successors, (161), 106 states have internal predecessors, (161), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 21:12:03,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 209 transitions. [2024-11-08 21:12:03,889 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 209 transitions. Word has length 165 [2024-11-08 21:12:03,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:12:03,894 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 209 transitions. [2024-11-08 21:12:03,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 21:12:03,894 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 209 transitions. [2024-11-08 21:12:03,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-08 21:12:03,897 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:12:03,897 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 21:12:03,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 21:12:03,897 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:12:03,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:12:03,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1339620407, now seen corresponding path program 1 times [2024-11-08 21:12:03,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:12:03,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754543226] [2024-11-08 21:12:03,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:12:03,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:12:03,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:04,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:12:04,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:04,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:12:04,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:04,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:12:04,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:04,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:12:04,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:04,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:12:04,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:04,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 21:12:04,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:04,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:12:04,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:04,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 21:12:04,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:04,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:12:04,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:04,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 21:12:04,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:04,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:12:04,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:04,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 21:12:04,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:04,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 21:12:04,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:04,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:12:04,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:04,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 21:12:04,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:04,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:12:04,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:04,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 21:12:04,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:04,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 21:12:04,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:04,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 21:12:04,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:04,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 21:12:04,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:04,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 21:12:04,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:04,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 21:12:04,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:04,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 21:12:04,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:04,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 21:12:04,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:04,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-08 21:12:04,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:12:04,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754543226] [2024-11-08 21:12:04,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754543226] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:12:04,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:12:04,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 21:12:04,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304633202] [2024-11-08 21:12:04,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:12:04,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 21:12:04,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:12:04,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 21:12:04,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 21:12:04,407 INFO L87 Difference]: Start difference. First operand 132 states and 209 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 21:12:04,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:12:04,553 INFO L93 Difference]: Finished difference Result 261 states and 415 transitions. [2024-11-08 21:12:04,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 21:12:04,556 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 165 [2024-11-08 21:12:04,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:12:04,558 INFO L225 Difference]: With dead ends: 261 [2024-11-08 21:12:04,558 INFO L226 Difference]: Without dead ends: 132 [2024-11-08 21:12:04,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 21:12:04,563 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 104 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 21:12:04,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 235 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 21:12:04,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-08 21:12:04,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2024-11-08 21:12:04,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 106 states have (on average 1.5) internal successors, (159), 106 states have internal predecessors, (159), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 21:12:04,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 207 transitions. [2024-11-08 21:12:04,583 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 207 transitions. Word has length 165 [2024-11-08 21:12:04,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:12:04,584 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 207 transitions. [2024-11-08 21:12:04,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 21:12:04,588 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 207 transitions. [2024-11-08 21:12:04,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-08 21:12:04,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:12:04,591 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 21:12:04,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 21:12:04,591 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:12:04,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:12:04,592 INFO L85 PathProgramCache]: Analyzing trace with hash -465817927, now seen corresponding path program 1 times [2024-11-08 21:12:04,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:12:04,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134352288] [2024-11-08 21:12:04,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:12:04,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:12:04,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:04,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:12:04,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:04,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:12:04,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:04,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:12:04,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:04,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:12:04,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:04,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:12:04,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:04,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 21:12:04,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:04,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:12:04,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:04,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 21:12:04,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:04,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:12:04,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:04,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 21:12:04,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:04,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:12:04,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:04,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 21:12:04,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:04,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 21:12:04,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:04,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:12:04,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:04,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 21:12:04,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:04,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:12:04,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:04,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 21:12:04,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:04,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 21:12:04,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:04,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 21:12:04,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:04,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 21:12:04,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:04,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 21:12:04,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:04,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 21:12:04,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:04,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 21:12:04,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:04,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 21:12:04,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:04,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-08 21:12:04,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:12:04,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134352288] [2024-11-08 21:12:04,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134352288] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:12:04,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:12:04,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 21:12:04,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260015296] [2024-11-08 21:12:04,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:12:04,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 21:12:04,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:12:04,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 21:12:04,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 21:12:04,902 INFO L87 Difference]: Start difference. First operand 132 states and 207 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-08 21:12:04,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:12:04,951 INFO L93 Difference]: Finished difference Result 261 states and 411 transitions. [2024-11-08 21:12:04,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 21:12:04,953 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 165 [2024-11-08 21:12:04,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:12:04,955 INFO L225 Difference]: With dead ends: 261 [2024-11-08 21:12:04,955 INFO L226 Difference]: Without dead ends: 132 [2024-11-08 21:12:04,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 21:12:04,959 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 119 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 21:12:04,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 130 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:12:04,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-08 21:12:04,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2024-11-08 21:12:04,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 106 states have (on average 1.4811320754716981) internal successors, (157), 106 states have internal predecessors, (157), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 21:12:04,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 205 transitions. [2024-11-08 21:12:04,982 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 205 transitions. Word has length 165 [2024-11-08 21:12:04,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:12:04,982 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 205 transitions. [2024-11-08 21:12:04,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-08 21:12:04,983 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 205 transitions. [2024-11-08 21:12:04,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-08 21:12:04,986 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:12:04,986 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 21:12:04,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 21:12:04,986 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:12:04,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:12:04,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1275164553, now seen corresponding path program 1 times [2024-11-08 21:12:04,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:12:04,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111975992] [2024-11-08 21:12:04,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:12:04,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:12:05,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:05,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:12:05,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:05,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:12:05,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:05,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:12:05,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:05,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:12:05,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:05,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:12:05,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:05,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 21:12:05,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:05,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:12:05,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:05,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 21:12:05,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:05,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:12:05,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:05,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 21:12:05,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:05,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:12:05,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:05,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 21:12:05,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:05,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 21:12:05,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:05,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:12:05,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:05,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 21:12:05,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:05,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:12:05,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:05,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 21:12:05,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:05,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 21:12:05,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:05,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 21:12:05,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:05,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 21:12:05,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:05,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 21:12:05,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:05,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 21:12:05,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:05,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 21:12:05,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:05,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 21:12:05,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:05,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-08 21:12:05,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:12:05,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111975992] [2024-11-08 21:12:05,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111975992] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:12:05,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:12:05,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 21:12:05,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627488210] [2024-11-08 21:12:05,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:12:05,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 21:12:05,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:12:05,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 21:12:05,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 21:12:05,445 INFO L87 Difference]: Start difference. First operand 132 states and 205 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 21:12:05,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:12:05,686 INFO L93 Difference]: Finished difference Result 321 states and 494 transitions. [2024-11-08 21:12:05,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 21:12:05,687 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 165 [2024-11-08 21:12:05,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:12:05,689 INFO L225 Difference]: With dead ends: 321 [2024-11-08 21:12:05,689 INFO L226 Difference]: Without dead ends: 192 [2024-11-08 21:12:05,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 21:12:05,692 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 239 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 21:12:05,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 337 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 21:12:05,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-11-08 21:12:05,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 137. [2024-11-08 21:12:05,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 111 states have (on average 1.4594594594594594) internal successors, (162), 111 states have internal predecessors, (162), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 21:12:05,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 210 transitions. [2024-11-08 21:12:05,732 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 210 transitions. Word has length 165 [2024-11-08 21:12:05,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:12:05,733 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 210 transitions. [2024-11-08 21:12:05,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 21:12:05,734 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 210 transitions. [2024-11-08 21:12:05,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-08 21:12:05,736 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:12:05,736 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 21:12:05,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 21:12:05,736 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:12:05,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:12:05,737 INFO L85 PathProgramCache]: Analyzing trace with hash 267956569, now seen corresponding path program 1 times [2024-11-08 21:12:05,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:12:05,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829376309] [2024-11-08 21:12:05,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:12:05,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:12:05,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 21:12:05,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [637936778] [2024-11-08 21:12:05,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:12:05,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:12:05,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:12:05,844 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-11-08 21:12:05,846 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-11-08 21:12:06,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:06,067 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-08 21:12:06,078 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:12:06,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 563 proven. 39 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2024-11-08 21:12:06,868 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 21:12:08,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 30 proven. 39 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-08 21:12:08,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:12:08,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829376309] [2024-11-08 21:12:08,378 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 21:12:08,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637936778] [2024-11-08 21:12:08,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637936778] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 21:12:08,379 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 21:12:08,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2024-11-08 21:12:08,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151113239] [2024-11-08 21:12:08,381 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 21:12:08,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 21:12:08,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:12:08,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 21:12:08,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2024-11-08 21:12:08,383 INFO L87 Difference]: Start difference. First operand 137 states and 210 transitions. Second operand has 14 states, 14 states have (on average 7.0) internal successors, (98), 14 states have internal predecessors, (98), 4 states have call successors, (48), 3 states have call predecessors, (48), 5 states have return successors, (48), 4 states have call predecessors, (48), 4 states have call successors, (48) [2024-11-08 21:12:10,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:12:10,090 INFO L93 Difference]: Finished difference Result 406 states and 602 transitions. [2024-11-08 21:12:10,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-08 21:12:10,092 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.0) internal successors, (98), 14 states have internal predecessors, (98), 4 states have call successors, (48), 3 states have call predecessors, (48), 5 states have return successors, (48), 4 states have call predecessors, (48), 4 states have call successors, (48) Word has length 167 [2024-11-08 21:12:10,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:12:10,095 INFO L225 Difference]: With dead ends: 406 [2024-11-08 21:12:10,096 INFO L226 Difference]: Without dead ends: 272 [2024-11-08 21:12:10,097 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=353, Invalid=703, Unknown=0, NotChecked=0, Total=1056 [2024-11-08 21:12:10,098 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 983 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 992 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 21:12:10,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [992 Valid, 321 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 21:12:10,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2024-11-08 21:12:10,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 194. [2024-11-08 21:12:10,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 166 states have (on average 1.4879518072289157) internal successors, (247), 166 states have internal predecessors, (247), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 21:12:10,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 295 transitions. [2024-11-08 21:12:10,121 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 295 transitions. Word has length 167 [2024-11-08 21:12:10,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:12:10,121 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 295 transitions. [2024-11-08 21:12:10,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.0) internal successors, (98), 14 states have internal predecessors, (98), 4 states have call successors, (48), 3 states have call predecessors, (48), 5 states have return successors, (48), 4 states have call predecessors, (48), 4 states have call successors, (48) [2024-11-08 21:12:10,122 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 295 transitions. [2024-11-08 21:12:10,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-08 21:12:10,123 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:12:10,124 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 21:12:10,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 21:12:10,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:12:10,325 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:12:10,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:12:10,325 INFO L85 PathProgramCache]: Analyzing trace with hash -546905887, now seen corresponding path program 1 times [2024-11-08 21:12:10,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:12:10,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692562091] [2024-11-08 21:12:10,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:12:10,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:12:10,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 21:12:10,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [261900829] [2024-11-08 21:12:10,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:12:10,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:12:10,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:12:10,417 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-11-08 21:12:10,418 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-11-08 21:12:10,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:10,557 INFO L255 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-08 21:12:10,566 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:12:11,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 473 proven. 30 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2024-11-08 21:12:11,903 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 21:12:15,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 102 proven. 33 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2024-11-08 21:12:15,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:12:15,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692562091] [2024-11-08 21:12:15,002 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 21:12:15,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261900829] [2024-11-08 21:12:15,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261900829] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 21:12:15,003 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 21:12:15,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2024-11-08 21:12:15,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686638224] [2024-11-08 21:12:15,003 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 21:12:15,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-08 21:12:15,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:12:15,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-08 21:12:15,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=273, Unknown=8, NotChecked=0, Total=380 [2024-11-08 21:12:15,006 INFO L87 Difference]: Start difference. First operand 194 states and 295 transitions. Second operand has 20 states, 19 states have (on average 4.368421052631579) internal successors, (83), 18 states have internal predecessors, (83), 5 states have call successors, (30), 3 states have call predecessors, (30), 6 states have return successors, (31), 5 states have call predecessors, (31), 5 states have call successors, (31) [2024-11-08 21:12:16,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:12:16,542 INFO L93 Difference]: Finished difference Result 403 states and 598 transitions. [2024-11-08 21:12:16,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-08 21:12:16,543 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 4.368421052631579) internal successors, (83), 18 states have internal predecessors, (83), 5 states have call successors, (30), 3 states have call predecessors, (30), 6 states have return successors, (31), 5 states have call predecessors, (31), 5 states have call successors, (31) Word has length 168 [2024-11-08 21:12:16,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:12:16,545 INFO L225 Difference]: With dead ends: 403 [2024-11-08 21:12:16,545 INFO L226 Difference]: Without dead ends: 212 [2024-11-08 21:12:16,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=267, Invalid=595, Unknown=8, NotChecked=0, Total=870 [2024-11-08 21:12:16,547 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 499 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 502 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 21:12:16,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [502 Valid, 409 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 21:12:16,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-11-08 21:12:16,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 202. [2024-11-08 21:12:16,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 171 states have (on average 1.4269005847953216) internal successors, (244), 171 states have internal predecessors, (244), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 21:12:16,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 292 transitions. [2024-11-08 21:12:16,570 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 292 transitions. Word has length 168 [2024-11-08 21:12:16,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:12:16,571 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 292 transitions. [2024-11-08 21:12:16,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 4.368421052631579) internal successors, (83), 18 states have internal predecessors, (83), 5 states have call successors, (30), 3 states have call predecessors, (30), 6 states have return successors, (31), 5 states have call predecessors, (31), 5 states have call successors, (31) [2024-11-08 21:12:16,571 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 292 transitions. [2024-11-08 21:12:16,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-08 21:12:16,573 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:12:16,573 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 21:12:16,591 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 21:12:16,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-08 21:12:16,774 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:12:16,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:12:16,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1300546017, now seen corresponding path program 1 times [2024-11-08 21:12:16,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:12:16,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654749812] [2024-11-08 21:12:16,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:12:16,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:12:16,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 21:12:16,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1612155227] [2024-11-08 21:12:16,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:12:16,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:12:16,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:12:16,867 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-11-08 21:12:16,869 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-11-08 21:12:16,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 21:12:16,993 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 21:12:17,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 21:12:17,185 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 21:12:17,186 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 21:12:17,187 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 21:12:17,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 21:12:17,389 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-11-08 21:12:17,392 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:12:17,523 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 21:12:17,526 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 09:12:17 BoogieIcfgContainer [2024-11-08 21:12:17,526 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 21:12:17,527 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 21:12:17,527 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 21:12:17,527 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 21:12:17,528 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:12:01" (3/4) ... [2024-11-08 21:12:17,530 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 21:12:17,531 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 21:12:17,532 INFO L158 Benchmark]: Toolchain (without parser) took 17039.47ms. Allocated memory was 157.3MB in the beginning and 272.6MB in the end (delta: 115.3MB). Free memory was 128.4MB in the beginning and 92.5MB in the end (delta: 35.8MB). Peak memory consumption was 149.8MB. Max. memory is 16.1GB. [2024-11-08 21:12:17,532 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 92.3MB. Free memory is still 47.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 21:12:17,532 INFO L158 Benchmark]: CACSL2BoogieTranslator took 378.57ms. Allocated memory is still 157.3MB. Free memory was 128.4MB in the beginning and 123.8MB in the end (delta: 4.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 21:12:17,533 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.11ms. Allocated memory is still 157.3MB. Free memory was 123.8MB in the beginning and 120.5MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 21:12:17,533 INFO L158 Benchmark]: Boogie Preprocessor took 65.68ms. Allocated memory is still 157.3MB. Free memory was 120.5MB in the beginning and 116.3MB in the end (delta: 4.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 21:12:17,533 INFO L158 Benchmark]: RCFGBuilder took 724.26ms. Allocated memory is still 157.3MB. Free memory was 116.3MB in the beginning and 90.3MB in the end (delta: 26.0MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-08 21:12:17,533 INFO L158 Benchmark]: TraceAbstraction took 15796.22ms. Allocated memory was 157.3MB in the beginning and 272.6MB in the end (delta: 115.3MB). Free memory was 89.6MB in the beginning and 92.5MB in the end (delta: -2.9MB). Peak memory consumption was 113.7MB. Max. memory is 16.1GB. [2024-11-08 21:12:17,534 INFO L158 Benchmark]: Witness Printer took 4.69ms. Allocated memory is still 272.6MB. Free memory is still 92.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 21:12:17,536 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.20ms. Allocated memory is still 92.3MB. Free memory is still 47.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 378.57ms. Allocated memory is still 157.3MB. Free memory was 128.4MB in the beginning and 123.8MB in the end (delta: 4.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.11ms. Allocated memory is still 157.3MB. Free memory was 123.8MB in the beginning and 120.5MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.68ms. Allocated memory is still 157.3MB. Free memory was 120.5MB in the beginning and 116.3MB in the end (delta: 4.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 724.26ms. Allocated memory is still 157.3MB. Free memory was 116.3MB in the beginning and 90.3MB in the end (delta: 26.0MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 15796.22ms. Allocated memory was 157.3MB in the beginning and 272.6MB in the end (delta: 115.3MB). Free memory was 89.6MB in the beginning and 92.5MB in the end (delta: -2.9MB). Peak memory consumption was 113.7MB. Max. memory is 16.1GB. * Witness Printer took 4.69ms. Allocated memory is still 272.6MB. Free memory is still 92.5MB. 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 185, overapproximation of someBinaryArithmeticDOUBLEoperation at line 114, overapproximation of someBinaryDOUBLEComparisonOperation at line 185, overapproximation of someUnaryFLOAToperation at line 131. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 8.5; [L23] unsigned long int var_1_4 = 1; [L24] unsigned long int var_1_5 = 50; [L25] unsigned long int var_1_6 = 4; [L26] float var_1_7 = 15.8; [L27] float var_1_8 = 64.25; [L28] signed long int var_1_9 = -50; [L29] unsigned char var_1_13 = 1; [L30] unsigned long int var_1_14 = 3207304078; [L31] unsigned long int var_1_15 = 50; [L32] unsigned long int var_1_16 = 25; [L33] unsigned char var_1_17 = 1; [L34] unsigned char var_1_18 = 0; [L35] unsigned char var_1_19 = 0; [L36] unsigned short int var_1_20 = 1; [L37] unsigned long int var_1_21 = 50; [L38] signed char var_1_22 = -4; [L39] signed char var_1_23 = -10; [L40] unsigned long int var_1_24 = 2; [L41] unsigned long int var_1_26 = 1; [L42] double var_1_33 = 1.5; [L43] double var_1_35 = 50.5; [L44] double var_1_36 = 1.9; [L45] unsigned long int var_1_37 = 10000; [L46] unsigned char var_1_38 = 1; [L47] unsigned char var_1_39 = 0; [L48] double var_1_40 = 15.5; [L49] unsigned long int var_1_42 = 128; [L50] signed char var_1_43 = -1; [L51] signed long int last_1_var_1_9 = -50; VAL [isInitial=0, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L189] isInitial = 1 [L190] FCALL initially() [L191] COND TRUE 1 [L192] CALL updateLastVariables() [L182] last_1_var_1_9 = var_1_9 VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L192] RET updateLastVariables() [L193] CALL updateVariables() [L143] var_1_5 = __VERIFIER_nondet_ulong() [L144] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L144] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L145] CALL assume_abort_if_not(var_1_5 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L145] RET assume_abort_if_not(var_1_5 <= 4294967294) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L146] var_1_6 = __VERIFIER_nondet_ulong() [L147] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L147] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L148] CALL assume_abort_if_not(var_1_6 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L148] RET assume_abort_if_not(var_1_6 <= 4294967294) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L149] var_1_8 = __VERIFIER_nondet_float() [L150] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L150] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L151] var_1_14 = __VERIFIER_nondet_ulong() [L152] CALL assume_abort_if_not(var_1_14 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L152] RET assume_abort_if_not(var_1_14 >= 2147483647) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L153] CALL assume_abort_if_not(var_1_14 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L153] RET assume_abort_if_not(var_1_14 <= 4294967295) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L154] var_1_15 = __VERIFIER_nondet_ulong() [L155] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L155] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L156] CALL assume_abort_if_not(var_1_15 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=2147483646, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=2147483646, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L156] RET assume_abort_if_not(var_1_15 <= 2147483647) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=2147483646, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L157] var_1_16 = __VERIFIER_nondet_ulong() [L158] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=2147483646, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=2147483646, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L158] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=2147483646, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L159] CALL assume_abort_if_not(var_1_16 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=2147483646, var_1_16=2147483646, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=2147483646, var_1_16=2147483646, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L159] RET assume_abort_if_not(var_1_16 <= 2147483647) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=2147483646, var_1_16=2147483646, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L160] var_1_17 = __VERIFIER_nondet_uchar() [L161] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=2147483646, var_1_16=2147483646, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=2147483646, var_1_16=2147483646, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L161] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=2147483646, var_1_16=2147483646, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L162] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=2147483646, var_1_16=2147483646, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=2147483646, var_1_16=2147483646, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L162] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=2147483646, var_1_16=2147483646, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L163] var_1_18 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_18 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=2147483646, var_1_16=2147483646, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=2147483646, var_1_16=2147483646, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L164] RET assume_abort_if_not(var_1_18 >= 1) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=2147483646, var_1_16=2147483646, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L165] CALL assume_abort_if_not(var_1_18 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=2147483646, var_1_16=2147483646, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=2147483646, var_1_16=2147483646, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L165] RET assume_abort_if_not(var_1_18 <= 1) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=2147483646, var_1_16=2147483646, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L166] var_1_20 = __VERIFIER_nondet_ushort() [L167] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=2147483646, var_1_16=2147483646, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=2147483646, var_1_16=2147483646, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L167] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=2147483646, var_1_16=2147483646, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L168] CALL assume_abort_if_not(var_1_20 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=2147483646, var_1_16=2147483646, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=2147483646, var_1_16=2147483646, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L168] RET assume_abort_if_not(var_1_20 <= 65535) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=2147483646, var_1_16=2147483646, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L169] CALL assume_abort_if_not(var_1_20 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=2147483646, var_1_16=2147483646, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=9, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=2147483646, var_1_16=2147483646, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=9, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L169] RET assume_abort_if_not(var_1_20 != 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=2147483646, var_1_16=2147483646, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=9, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L170] var_1_23 = __VERIFIER_nondet_char() [L171] CALL assume_abort_if_not(var_1_23 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=2147483646, var_1_16=2147483646, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=9, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=2147483646, var_1_16=2147483646, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=9, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L171] RET assume_abort_if_not(var_1_23 >= -127) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=2147483646, var_1_16=2147483646, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=9, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L172] CALL assume_abort_if_not(var_1_23 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=2147483646, var_1_16=2147483646, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=9, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=2147483646, var_1_16=2147483646, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=9, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L172] RET assume_abort_if_not(var_1_23 <= 126) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=2147483646, var_1_16=2147483646, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=9, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L173] var_1_35 = __VERIFIER_nondet_double() [L174] CALL assume_abort_if_not((var_1_35 >= 0.0F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854765600e+12F && var_1_35 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=2147483646, var_1_16=2147483646, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=9, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=2147483646, var_1_16=2147483646, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=9, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L174] RET assume_abort_if_not((var_1_35 >= 0.0F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854765600e+12F && var_1_35 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=2147483646, var_1_16=2147483646, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=9, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L175] var_1_36 = __VERIFIER_nondet_double() [L176] CALL assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854765600e+12F && var_1_36 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=2147483646, var_1_16=2147483646, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=9, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=2147483646, var_1_16=2147483646, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=9, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L176] RET assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854765600e+12F && var_1_36 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=2147483646, var_1_16=2147483646, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=9, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L177] var_1_39 = __VERIFIER_nondet_uchar() [L178] CALL assume_abort_if_not(var_1_39 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=2147483646, var_1_16=2147483646, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=9, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=2147483646, var_1_16=2147483646, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=9, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L178] RET assume_abort_if_not(var_1_39 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=2147483646, var_1_16=2147483646, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=9, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L179] CALL assume_abort_if_not(var_1_39 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=2147483646, var_1_16=2147483646, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=9, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=2147483646, var_1_16=2147483646, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=9, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L179] RET assume_abort_if_not(var_1_39 <= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=2147483646, var_1_16=2147483646, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=9, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L193] RET updateVariables() [L194] CALL step() [L55] signed long int stepLocal_0 = last_1_var_1_9; VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_0=-50, var_1_13=1, var_1_14=2147483647, var_1_15=2147483646, var_1_16=2147483646, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=9, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L56] COND FALSE !(stepLocal_0 < last_1_var_1_9) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=2147483646, var_1_16=2147483646, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=9, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L59] var_1_21 = var_1_6 [L60] var_1_22 = var_1_23 VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=2147483646, var_1_16=2147483646, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=9, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L61] COND FALSE !((var_1_21 / ((((64u) < 0 ) ? -(64u) : (64u)))) == var_1_4) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=2147483646, var_1_16=2147483646, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=9, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L64] unsigned long int stepLocal_4 = 4256310412u - 128u; VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_4=4256310284, var_1_13=1, var_1_14=2147483647, var_1_15=2147483646, var_1_16=2147483646, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=9, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L65] COND FALSE !(var_1_4 >= stepLocal_4) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=2147483646, var_1_16=2147483646, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=9, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L68] signed long int stepLocal_3 = var_1_9; [L69] unsigned long int stepLocal_2 = (((var_1_21) > (var_1_5)) ? (var_1_21) : (var_1_5)); VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_2=0, stepLocal_3=-50, var_1_13=1, var_1_14=2147483647, var_1_15=2147483646, var_1_16=2147483646, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=9, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L70] EXPR var_1_21 ^ 4u VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_2=0, stepLocal_3=-50, var_1_13=1, var_1_14=2147483647, var_1_15=2147483646, var_1_16=2147483646, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=9, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L70] unsigned long int stepLocal_1 = var_1_21 ^ 4u; [L71] COND FALSE !(var_1_9 <= stepLocal_2) [L80] var_1_7 = var_1_8 VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=1, var_1_14=2147483647, var_1_15=2147483646, var_1_16=2147483646, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=9, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L82] COND FALSE !(var_1_21 >= (var_1_14 - ((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16))))) [L89] var_1_13 = var_1_18 VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=1, var_1_14=2147483647, var_1_15=2147483646, var_1_16=2147483646, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=9, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L91] signed long int stepLocal_5 = (var_1_22 / 2) / var_1_20; VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, stepLocal_5=0, var_1_13=1, var_1_14=2147483647, var_1_15=2147483646, var_1_16=2147483646, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=9, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L92] COND TRUE stepLocal_5 >= (~ 100) VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=1, var_1_14=2147483647, var_1_15=2147483646, var_1_16=2147483646, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=9, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L93] COND TRUE \read(var_1_13) [L94] var_1_19 = (var_1_17 && var_1_18) VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=1, var_1_14=2147483647, var_1_15=2147483646, var_1_16=2147483646, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=9, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L103] var_1_24 = var_1_6 VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=1, var_1_14=2147483647, var_1_15=2147483646, var_1_16=2147483646, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=9, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=0, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L104] COND FALSE !(var_1_5 != var_1_21) [L111] var_1_26 = 16u VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=1, var_1_14=2147483647, var_1_15=2147483646, var_1_16=2147483646, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=9, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=0, var_1_26=16, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L113] COND TRUE \read(var_1_17) [L114] var_1_33 = (var_1_35 - var_1_36) VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=1, var_1_14=2147483647, var_1_15=2147483646, var_1_16=2147483646, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=9, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=0, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L116] COND FALSE !(var_1_35 >= var_1_8) VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=1, var_1_14=2147483647, var_1_15=2147483646, var_1_16=2147483646, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=9, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=0, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L121] COND TRUE var_1_16 < ((var_1_6 + 16u) * var_1_9) VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=1, var_1_14=2147483647, var_1_15=2147483646, var_1_16=2147483646, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=9, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=0, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L122] COND FALSE !(var_1_17 && (var_1_35 < var_1_36)) VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=1, var_1_14=2147483647, var_1_15=2147483646, var_1_16=2147483646, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=9, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=0, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L130] COND TRUE (var_1_35 <= 64.5) && var_1_18 [L131] var_1_40 = ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))) VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=1, var_1_14=2147483647, var_1_15=2147483646, var_1_16=2147483646, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=9, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=0, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=3, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L135] COND FALSE !(var_1_20 < var_1_9) VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=1, var_1_14=2147483647, var_1_15=2147483646, var_1_16=2147483646, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=9, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=0, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=3, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L138] COND TRUE \read(var_1_17) [L139] var_1_43 = ((((((((-16) < 0 ) ? -(-16) : (-16)))) > (var_1_23)) ? (((((-16) < 0 ) ? -(-16) : (-16)))) : (var_1_23))) VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=1, var_1_14=2147483647, var_1_15=2147483646, var_1_16=2147483646, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=9, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=0, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=3, var_1_42=128, var_1_43=17, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L194] RET step() [L195] CALL, EXPR property() [L185] EXPR ((((var_1_21 / ((((64u) < 0 ) ? -(64u) : (64u)))) == var_1_4) ? (var_1_1 == ((double) (8.8 - 255.2))) : 1) && ((last_1_var_1_9 < last_1_var_1_9) ? (var_1_4 == ((unsigned long int) ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) : 1)) && ((var_1_9 <= ((((var_1_21) > (var_1_5)) ? (var_1_21) : (var_1_5)))) ? ((var_1_9 < var_1_5) ? ((var_1_9 >= (var_1_21 ^ 4u)) ? (var_1_7 == ((float) var_1_8)) : 1) : (var_1_7 == ((float) var_1_8))) : (var_1_7 == ((float) var_1_8))) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=2147483646, var_1_16=2147483646, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=9, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=0, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=3, var_1_42=128, var_1_43=17, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L185] EXPR (var_1_9 <= ((((var_1_21) > (var_1_5)) ? (var_1_21) : (var_1_5)))) ? ((var_1_9 < var_1_5) ? ((var_1_9 >= (var_1_21 ^ 4u)) ? (var_1_7 == ((float) var_1_8)) : 1) : (var_1_7 == ((float) var_1_8))) : (var_1_7 == ((float) var_1_8)) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=2147483646, var_1_16=2147483646, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=9, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=0, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=3, var_1_42=128, var_1_43=17, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L185] EXPR ((((var_1_21 / ((((64u) < 0 ) ? -(64u) : (64u)))) == var_1_4) ? (var_1_1 == ((double) (8.8 - 255.2))) : 1) && ((last_1_var_1_9 < last_1_var_1_9) ? (var_1_4 == ((unsigned long int) ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) : 1)) && ((var_1_9 <= ((((var_1_21) > (var_1_5)) ? (var_1_21) : (var_1_5)))) ? ((var_1_9 < var_1_5) ? ((var_1_9 >= (var_1_21 ^ 4u)) ? (var_1_7 == ((float) var_1_8)) : 1) : (var_1_7 == ((float) var_1_8))) : (var_1_7 == ((float) var_1_8))) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=2147483646, var_1_16=2147483646, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=9, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=0, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=3, var_1_42=128, var_1_43=17, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L185-L186] return (((((((((var_1_21 / ((((64u) < 0 ) ? -(64u) : (64u)))) == var_1_4) ? (var_1_1 == ((double) (8.8 - 255.2))) : 1) && ((last_1_var_1_9 < last_1_var_1_9) ? (var_1_4 == ((unsigned long int) ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) : 1)) && ((var_1_9 <= ((((var_1_21) > (var_1_5)) ? (var_1_21) : (var_1_5)))) ? ((var_1_9 < var_1_5) ? ((var_1_9 >= (var_1_21 ^ 4u)) ? (var_1_7 == ((float) var_1_8)) : 1) : (var_1_7 == ((float) var_1_8))) : (var_1_7 == ((float) var_1_8)))) && ((var_1_4 >= (4256310412u - 128u)) ? (var_1_9 == ((signed long int) (((((var_1_22 + var_1_22) < 0 ) ? -(var_1_22 + var_1_22) : (var_1_22 + var_1_22))) + var_1_22))) : 1)) && ((var_1_21 >= (var_1_14 - ((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16))))) ? ((var_1_16 < var_1_9) ? (var_1_13 == ((unsigned char) var_1_17)) : (var_1_13 == ((unsigned char) var_1_17))) : (var_1_13 == ((unsigned char) var_1_18)))) && ((((var_1_22 / 2) / var_1_20) >= (~ 100)) ? (var_1_13 ? (var_1_19 == ((unsigned char) (var_1_17 && var_1_18))) : 1) : (var_1_17 ? (var_1_19 == ((unsigned char) var_1_18)) : (var_1_19 == ((unsigned char) var_1_18))))) && (var_1_21 == ((unsigned long int) var_1_6))) && (var_1_22 == ((signed char) var_1_23)) ; [L195] RET, EXPR property() [L195] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=2147483646, var_1_16=2147483646, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=9, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=0, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=3, var_1_42=128, var_1_43=17, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L19] reach_error() VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=2147483646, var_1_16=2147483646, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=9, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=0, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=3, var_1_42=128, var_1_43=17, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 102 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.6s, OverallIterations: 9, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2084 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2072 mSDsluCounter, 2263 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1093 mSDsCounter, 282 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 972 IncrementalHoareTripleChecker+Invalid, 1254 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 282 mSolverCounterUnsat, 1170 mSDtfsCounter, 972 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1033 GetRequests, 964 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=202occurred in iteration=8, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 203 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 9.0s InterpolantComputationTime, 1996 NumberOfCodeBlocks, 1996 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1650 ConstructedInterpolants, 5 QuantifiedInterpolants, 8093 SizeOfPredicates, 11 NumberOfNonLiveVariables, 775 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 10 InterpolantComputations, 6 PerfectInterpolantSequences, 10899/11040 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-11-08 21:12:17,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-61.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 f8c7f093a0092c99d535dacf9ec847d585a162cf9e23f66317fd8ccac5a76f81 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 21:12:19,869 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 21:12:19,950 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 21:12:19,956 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 21:12:19,956 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 21:12:19,988 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 21:12:19,989 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 21:12:19,990 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 21:12:19,991 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 21:12:19,992 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 21:12:19,994 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 21:12:19,994 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 21:12:19,995 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 21:12:19,996 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 21:12:19,996 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 21:12:19,996 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 21:12:19,997 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 21:12:19,997 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 21:12:19,997 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 21:12:19,997 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 21:12:19,998 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 21:12:19,998 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 21:12:19,998 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 21:12:19,999 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 21:12:19,999 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 21:12:19,999 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 21:12:19,999 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 21:12:20,000 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 21:12:20,000 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 21:12:20,000 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 21:12:20,000 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 21:12:20,001 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 21:12:20,001 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 21:12:20,001 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 21:12:20,001 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:12:20,002 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 21:12:20,007 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 21:12:20,007 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 21:12:20,008 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 21:12:20,008 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 21:12:20,008 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 21:12:20,008 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 21:12:20,009 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 21:12:20,009 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 21:12:20,009 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 -> f8c7f093a0092c99d535dacf9ec847d585a162cf9e23f66317fd8ccac5a76f81 [2024-11-08 21:12:20,347 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 21:12:20,374 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 21:12:20,376 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 21:12:20,378 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 21:12:20,378 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 21:12:20,379 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-61.i [2024-11-08 21:12:21,930 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 21:12:22,179 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 21:12:22,180 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-61.i [2024-11-08 21:12:22,197 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a205fa4cc/c08f5a52962e472996949a54043ddc10/FLAG5b7bb3d76 [2024-11-08 21:12:22,215 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a205fa4cc/c08f5a52962e472996949a54043ddc10 [2024-11-08 21:12:22,219 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 21:12:22,221 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 21:12:22,223 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 21:12:22,224 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 21:12:22,229 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 21:12:22,230 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:12:22" (1/1) ... [2024-11-08 21:12:22,231 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d72ce0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:12:22, skipping insertion in model container [2024-11-08 21:12:22,231 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:12:22" (1/1) ... [2024-11-08 21:12:22,268 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 21:12:22,482 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-61.i[919,932] [2024-11-08 21:12:22,570 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:12:22,589 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 21:12:22,602 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-61.i[919,932] [2024-11-08 21:12:22,643 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:12:22,666 INFO L204 MainTranslator]: Completed translation [2024-11-08 21:12:22,667 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:12:22 WrapperNode [2024-11-08 21:12:22,667 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 21:12:22,668 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 21:12:22,668 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 21:12:22,668 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 21:12:22,675 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:12:22" (1/1) ... [2024-11-08 21:12:22,695 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:12:22" (1/1) ... [2024-11-08 21:12:22,734 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 182 [2024-11-08 21:12:22,734 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 21:12:22,735 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 21:12:22,735 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 21:12:22,735 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 21:12:22,750 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:12:22" (1/1) ... [2024-11-08 21:12:22,751 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:12:22" (1/1) ... [2024-11-08 21:12:22,755 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:12:22" (1/1) ... [2024-11-08 21:12:22,773 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-11-08 21:12:22,773 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:12:22" (1/1) ... [2024-11-08 21:12:22,773 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:12:22" (1/1) ... [2024-11-08 21:12:22,783 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:12:22" (1/1) ... [2024-11-08 21:12:22,787 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:12:22" (1/1) ... [2024-11-08 21:12:22,790 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:12:22" (1/1) ... [2024-11-08 21:12:22,792 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:12:22" (1/1) ... [2024-11-08 21:12:22,796 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 21:12:22,797 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 21:12:22,797 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 21:12:22,797 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 21:12:22,807 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:12:22" (1/1) ... [2024-11-08 21:12:22,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:12:22,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:12:22,847 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-11-08 21:12:22,849 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-11-08 21:12:22,890 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 21:12:22,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 21:12:22,891 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 21:12:22,891 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 21:12:22,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 21:12:22,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 21:12:22,987 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 21:12:22,990 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 21:12:23,900 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-08 21:12:23,900 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 21:12:23,931 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 21:12:23,932 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 21:12:23,932 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:12:23 BoogieIcfgContainer [2024-11-08 21:12:23,932 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 21:12:23,936 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 21:12:23,936 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 21:12:23,940 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 21:12:23,940 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 09:12:22" (1/3) ... [2024-11-08 21:12:23,941 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6803af6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:12:23, skipping insertion in model container [2024-11-08 21:12:23,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:12:22" (2/3) ... [2024-11-08 21:12:23,942 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6803af6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:12:23, skipping insertion in model container [2024-11-08 21:12:23,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:12:23" (3/3) ... [2024-11-08 21:12:23,943 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-61.i [2024-11-08 21:12:23,962 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 21:12:23,962 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 21:12:24,039 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 21:12:24,048 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;@4a17f5b4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 21:12:24,048 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 21:12:24,054 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 57 states have (on average 1.4912280701754386) internal successors, (85), 58 states have internal predecessors, (85), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 21:12:24,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-08 21:12:24,070 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:12:24,071 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 21:12:24,071 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:12:24,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:12:24,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1811567540, now seen corresponding path program 1 times [2024-11-08 21:12:24,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:12:24,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [916839766] [2024-11-08 21:12:24,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:12:24,095 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-11-08 21:12:24,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:12:24,099 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-11-08 21:12:24,100 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-11-08 21:12:24,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:24,515 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 21:12:24,530 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:12:24,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 454 proven. 0 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2024-11-08 21:12:24,575 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 21:12:24,579 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:12:24,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [916839766] [2024-11-08 21:12:24,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [916839766] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:12:24,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:12:24,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 21:12:24,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590976040] [2024-11-08 21:12:24,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:12:24,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 21:12:24,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:12:24,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 21:12:24,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 21:12:24,619 INFO L87 Difference]: Start difference. First operand has 84 states, 57 states have (on average 1.4912280701754386) internal successors, (85), 58 states have internal predecessors, (85), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-08 21:12:24,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:12:24,651 INFO L93 Difference]: Finished difference Result 161 states and 284 transitions. [2024-11-08 21:12:24,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 21:12:24,654 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 161 [2024-11-08 21:12:24,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:12:24,661 INFO L225 Difference]: With dead ends: 161 [2024-11-08 21:12:24,661 INFO L226 Difference]: Without dead ends: 80 [2024-11-08 21:12:24,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 160 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-11-08 21:12:24,670 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 21:12:24,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:12:24,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-08 21:12:24,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-08 21:12:24,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 54 states have internal predecessors, (78), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 21:12:24,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 126 transitions. [2024-11-08 21:12:24,714 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 126 transitions. Word has length 161 [2024-11-08 21:12:24,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:12:24,715 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 126 transitions. [2024-11-08 21:12:24,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-08 21:12:24,715 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 126 transitions. [2024-11-08 21:12:24,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-08 21:12:24,719 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:12:24,719 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 21:12:24,735 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 (2)] Forceful destruction successful, exit code 0 [2024-11-08 21:12:24,923 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-11-08 21:12:24,924 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:12:24,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:12:24,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1178355192, now seen corresponding path program 1 times [2024-11-08 21:12:24,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:12:24,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1091968753] [2024-11-08 21:12:24,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:12:24,927 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-11-08 21:12:24,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:12:24,929 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-11-08 21:12:24,932 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-11-08 21:12:25,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:25,323 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 21:12:25,336 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:12:25,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-08 21:12:25,947 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 21:12:25,947 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:12:25,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1091968753] [2024-11-08 21:12:25,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1091968753] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:12:25,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:12:25,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 21:12:25,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751795922] [2024-11-08 21:12:25,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:12:25,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 21:12:25,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:12:25,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 21:12:25,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 21:12:25,953 INFO L87 Difference]: Start difference. First operand 80 states and 126 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 21:12:26,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:12:26,699 INFO L93 Difference]: Finished difference Result 264 states and 422 transitions. [2024-11-08 21:12:26,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 21:12:26,712 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 161 [2024-11-08 21:12:26,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:12:26,715 INFO L225 Difference]: With dead ends: 264 [2024-11-08 21:12:26,716 INFO L226 Difference]: Without dead ends: 187 [2024-11-08 21:12:26,717 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-08 21:12:26,718 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 130 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 21:12:26,718 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 489 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 21:12:26,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-08 21:12:26,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 155. [2024-11-08 21:12:26,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 104 states have (on average 1.4423076923076923) internal successors, (150), 104 states have internal predecessors, (150), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-08 21:12:26,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 246 transitions. [2024-11-08 21:12:26,758 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 246 transitions. Word has length 161 [2024-11-08 21:12:26,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:12:26,759 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 246 transitions. [2024-11-08 21:12:26,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 21:12:26,760 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 246 transitions. [2024-11-08 21:12:26,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-08 21:12:26,769 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:12:26,770 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 21:12:26,784 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-11-08 21:12:26,970 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-11-08 21:12:26,971 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:12:26,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:12:26,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1311173770, now seen corresponding path program 1 times [2024-11-08 21:12:26,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:12:26,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [252660525] [2024-11-08 21:12:26,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:12:26,973 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-11-08 21:12:26,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:12:26,976 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-11-08 21:12:26,978 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-11-08 21:12:27,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:27,337 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 21:12:27,346 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:12:27,727 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-08 21:12:27,728 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 21:12:27,728 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:12:27,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [252660525] [2024-11-08 21:12:27,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [252660525] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:12:27,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:12:27,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 21:12:27,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740474924] [2024-11-08 21:12:27,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:12:27,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 21:12:27,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:12:27,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 21:12:27,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 21:12:27,734 INFO L87 Difference]: Start difference. First operand 155 states and 246 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 21:12:28,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:12:28,185 INFO L93 Difference]: Finished difference Result 157 states and 247 transitions. [2024-11-08 21:12:28,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 21:12:28,195 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 161 [2024-11-08 21:12:28,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:12:28,197 INFO L225 Difference]: With dead ends: 157 [2024-11-08 21:12:28,197 INFO L226 Difference]: Without dead ends: 80 [2024-11-08 21:12:28,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 21:12:28,199 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 50 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 21:12:28,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 183 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 21:12:28,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-08 21:12:28,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-08 21:12:28,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 54 states have internal predecessors, (75), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 21:12:28,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 123 transitions. [2024-11-08 21:12:28,221 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 123 transitions. Word has length 161 [2024-11-08 21:12:28,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:12:28,221 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 123 transitions. [2024-11-08 21:12:28,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 21:12:28,222 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 123 transitions. [2024-11-08 21:12:28,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-08 21:12:28,229 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:12:28,229 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 21:12:28,243 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 (4)] Ended with exit code 0 [2024-11-08 21:12:28,429 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-11-08 21:12:28,430 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:12:28,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:12:28,431 INFO L85 PathProgramCache]: Analyzing trace with hash -320511670, now seen corresponding path program 1 times [2024-11-08 21:12:28,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:12:28,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1584372564] [2024-11-08 21:12:28,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:12:28,432 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-11-08 21:12:28,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:12:28,434 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-11-08 21:12:28,435 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-11-08 21:12:28,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:28,730 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-08 21:12:28,743 INFO L278 TraceCheckSpWp]: Computing forward predicates...