./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-25.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-ps-co_file-25.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 ff8bee30ebc0a54ebfcfd9d99cb415407b7814d567c1f87cff440d6e8ced68ab --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 22:34:57,531 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 22:34:57,603 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 22:34:57,609 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 22:34:57,612 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 22:34:57,644 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 22:34:57,645 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 22:34:57,645 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 22:34:57,646 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 22:34:57,665 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 22:34:57,666 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 22:34:57,666 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 22:34:57,667 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 22:34:57,667 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 22:34:57,667 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 22:34:57,668 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 22:34:57,668 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 22:34:57,668 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 22:34:57,669 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 22:34:57,669 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 22:34:57,675 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 22:34:57,675 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 22:34:57,676 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 22:34:57,676 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 22:34:57,676 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 22:34:57,676 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 22:34:57,677 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 22:34:57,677 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 22:34:57,677 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 22:34:57,677 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 22:34:57,677 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 22:34:57,678 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 22:34:57,678 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:34:57,678 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 22:34:57,678 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 22:34:57,678 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 22:34:57,679 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 22:34:57,679 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 22:34:57,680 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 22:34:57,680 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 22:34:57,681 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 22:34:57,681 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 22:34:57,681 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 -> ff8bee30ebc0a54ebfcfd9d99cb415407b7814d567c1f87cff440d6e8ced68ab [2024-11-08 22:34:57,927 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 22:34:57,951 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 22:34:57,956 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 22:34:57,957 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 22:34:57,957 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 22:34:57,958 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-ps-co_file-25.i [2024-11-08 22:34:59,297 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 22:34:59,478 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 22:34:59,479 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-25.i [2024-11-08 22:34:59,495 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a58ea990/0d674d7d45e042e291c20243949730f8/FLAG09f32ca0d [2024-11-08 22:34:59,867 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a58ea990/0d674d7d45e042e291c20243949730f8 [2024-11-08 22:34:59,872 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 22:34:59,874 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 22:34:59,876 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 22:34:59,876 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 22:34:59,884 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 22:34:59,885 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:34:59" (1/1) ... [2024-11-08 22:34:59,886 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a928b27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:34:59, skipping insertion in model container [2024-11-08 22:34:59,886 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:34:59" (1/1) ... [2024-11-08 22:34:59,910 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 22:35:00,064 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-ps-co_file-25.i[919,932] [2024-11-08 22:35:00,173 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:35:00,184 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 22:35:00,199 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-ps-co_file-25.i[919,932] [2024-11-08 22:35:00,244 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:35:00,259 INFO L204 MainTranslator]: Completed translation [2024-11-08 22:35:00,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:35:00 WrapperNode [2024-11-08 22:35:00,259 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 22:35:00,260 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 22:35:00,260 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 22:35:00,260 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 22:35:00,265 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:35:00" (1/1) ... [2024-11-08 22:35:00,273 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:35:00" (1/1) ... [2024-11-08 22:35:00,300 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 219 [2024-11-08 22:35:00,303 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 22:35:00,304 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 22:35:00,304 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 22:35:00,304 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 22:35:00,323 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:35:00" (1/1) ... [2024-11-08 22:35:00,323 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:35:00" (1/1) ... [2024-11-08 22:35:00,330 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:35:00" (1/1) ... [2024-11-08 22:35:00,345 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 22:35:00,345 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:35:00" (1/1) ... [2024-11-08 22:35:00,345 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:35:00" (1/1) ... [2024-11-08 22:35:00,363 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:35:00" (1/1) ... [2024-11-08 22:35:00,366 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:35:00" (1/1) ... [2024-11-08 22:35:00,369 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:35:00" (1/1) ... [2024-11-08 22:35:00,375 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:35:00" (1/1) ... [2024-11-08 22:35:00,383 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 22:35:00,384 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 22:35:00,386 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 22:35:00,386 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 22:35:00,387 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:35:00" (1/1) ... [2024-11-08 22:35:00,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:35:00,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 22:35:00,417 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 22:35:00,419 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 22:35:00,454 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 22:35:00,455 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 22:35:00,455 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 22:35:00,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 22:35:00,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 22:35:00,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 22:35:00,529 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 22:35:00,530 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 22:35:00,974 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-08 22:35:00,974 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 22:35:00,985 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 22:35:00,986 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 22:35:00,986 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:35:00 BoogieIcfgContainer [2024-11-08 22:35:00,986 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 22:35:00,988 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 22:35:00,988 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 22:35:00,991 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 22:35:00,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:34:59" (1/3) ... [2024-11-08 22:35:00,992 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dbb260 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:35:00, skipping insertion in model container [2024-11-08 22:35:00,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:35:00" (2/3) ... [2024-11-08 22:35:00,993 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dbb260 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:35:00, skipping insertion in model container [2024-11-08 22:35:00,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:35:00" (3/3) ... [2024-11-08 22:35:00,994 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-25.i [2024-11-08 22:35:01,008 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 22:35:01,009 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 22:35:01,065 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 22:35:01,071 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;@20cd6f45, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 22:35:01,071 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 22:35:01,077 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 67 states have (on average 1.5223880597014925) internal successors, (102), 68 states have internal predecessors, (102), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 22:35:01,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-08 22:35:01,095 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:35:01,096 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:35:01,097 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:35:01,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:35:01,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1388994005, now seen corresponding path program 1 times [2024-11-08 22:35:01,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:35:01,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740336175] [2024-11-08 22:35:01,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:35:01,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:01,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:01,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:35:01,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:01,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 22:35:01,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:01,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 22:35:01,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:01,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 22:35:01,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:01,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 22:35:01,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:01,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 22:35:01,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:01,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 22:35:01,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:01,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 22:35:01,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:01,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 22:35:01,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:01,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 22:35:01,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:01,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 22:35:01,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:01,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 22:35:01,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:01,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 22:35:01,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:01,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 22:35:01,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:01,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 22:35:01,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:01,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 22:35:01,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:01,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 22:35:01,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:01,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 22:35:01,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:01,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 22:35:01,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:01,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 22:35:01,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:01,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 22:35:01,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:01,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 22:35:01,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:01,640 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 22:35:01,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:35:01,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740336175] [2024-11-08 22:35:01,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740336175] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:35:01,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:35:01,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 22:35:01,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46210858] [2024-11-08 22:35:01,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:35:01,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 22:35:01,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:35:01,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 22:35:01,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:35:01,762 INFO L87 Difference]: Start difference. First operand has 92 states, 67 states have (on average 1.5223880597014925) internal successors, (102), 68 states have internal predecessors, (102), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 22:35:01,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:35:01,886 INFO L93 Difference]: Finished difference Result 260 states and 466 transitions. [2024-11-08 22:35:01,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 22:35:01,890 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 152 [2024-11-08 22:35:01,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:35:01,900 INFO L225 Difference]: With dead ends: 260 [2024-11-08 22:35:01,900 INFO L226 Difference]: Without dead ends: 171 [2024-11-08 22:35:01,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:35:01,909 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 122 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 22:35:01,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 325 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 22:35:01,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-08 22:35:01,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 152. [2024-11-08 22:35:01,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 105 states have (on average 1.4) internal successors, (147), 105 states have internal predecessors, (147), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-08 22:35:01,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 235 transitions. [2024-11-08 22:35:01,980 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 235 transitions. Word has length 152 [2024-11-08 22:35:01,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:35:01,981 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 235 transitions. [2024-11-08 22:35:01,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 22:35:01,981 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 235 transitions. [2024-11-08 22:35:01,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-08 22:35:01,984 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:35:01,984 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:35:01,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 22:35:01,985 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:35:01,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:35:01,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1254980499, now seen corresponding path program 1 times [2024-11-08 22:35:01,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:35:01,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441995065] [2024-11-08 22:35:01,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:35:01,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:02,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:02,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:35:02,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:02,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 22:35:02,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:02,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 22:35:02,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:02,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 22:35:02,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:02,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 22:35:02,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:02,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 22:35:02,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:02,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 22:35:02,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:02,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 22:35:02,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:02,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 22:35:02,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:02,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 22:35:02,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:02,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 22:35:02,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:02,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 22:35:02,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:02,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 22:35:02,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:02,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 22:35:02,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:02,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 22:35:02,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:02,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 22:35:02,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:02,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 22:35:02,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:02,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 22:35:02,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:02,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 22:35:02,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:02,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 22:35:02,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:02,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 22:35:02,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:02,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 22:35:02,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:02,178 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 22:35:02,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:35:02,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441995065] [2024-11-08 22:35:02,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441995065] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:35:02,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:35:02,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 22:35:02,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928242566] [2024-11-08 22:35:02,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:35:02,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 22:35:02,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:35:02,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 22:35:02,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:35:02,185 INFO L87 Difference]: Start difference. First operand 152 states and 235 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 22:35:02,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:35:02,276 INFO L93 Difference]: Finished difference Result 375 states and 582 transitions. [2024-11-08 22:35:02,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 22:35:02,277 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 152 [2024-11-08 22:35:02,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:35:02,280 INFO L225 Difference]: With dead ends: 375 [2024-11-08 22:35:02,283 INFO L226 Difference]: Without dead ends: 226 [2024-11-08 22:35:02,284 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:35:02,285 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 125 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 22:35:02,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 264 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 22:35:02,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-11-08 22:35:02,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 207. [2024-11-08 22:35:02,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 137 states have (on average 1.3357664233576643) internal successors, (183), 137 states have internal predecessors, (183), 66 states have call successors, (66), 3 states have call predecessors, (66), 3 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-08 22:35:02,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 315 transitions. [2024-11-08 22:35:02,316 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 315 transitions. Word has length 152 [2024-11-08 22:35:02,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:35:02,318 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 315 transitions. [2024-11-08 22:35:02,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 22:35:02,318 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 315 transitions. [2024-11-08 22:35:02,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-08 22:35:02,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:35:02,321 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:35:02,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 22:35:02,321 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:35:02,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:35:02,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1677682325, now seen corresponding path program 1 times [2024-11-08 22:35:02,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:35:02,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27519317] [2024-11-08 22:35:02,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:35:02,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:02,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:02,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:35:02,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:02,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 22:35:02,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:02,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 22:35:02,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:02,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 22:35:02,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:02,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 22:35:02,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:02,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 22:35:02,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:02,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 22:35:02,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:02,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 22:35:02,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:02,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 22:35:02,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:02,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 22:35:02,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:02,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 22:35:02,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:02,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 22:35:02,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:02,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 22:35:02,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:02,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 22:35:02,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:02,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 22:35:02,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:02,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 22:35:02,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:02,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 22:35:02,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:02,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 22:35:02,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:02,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 22:35:02,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:02,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 22:35:02,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:02,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 22:35:02,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:02,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 22:35:02,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:02,616 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 22:35:02,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:35:02,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27519317] [2024-11-08 22:35:02,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27519317] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:35:02,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:35:02,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 22:35:02,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269108275] [2024-11-08 22:35:02,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:35:02,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 22:35:02,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:35:02,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 22:35:02,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:35:02,619 INFO L87 Difference]: Start difference. First operand 207 states and 315 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 22:35:02,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:35:02,680 INFO L93 Difference]: Finished difference Result 611 states and 934 transitions. [2024-11-08 22:35:02,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 22:35:02,681 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 152 [2024-11-08 22:35:02,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:35:02,685 INFO L225 Difference]: With dead ends: 611 [2024-11-08 22:35:02,685 INFO L226 Difference]: Without dead ends: 407 [2024-11-08 22:35:02,686 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 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 22:35:02,690 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 88 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 22:35:02,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 279 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 22:35:02,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2024-11-08 22:35:02,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 404. [2024-11-08 22:35:02,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 265 states have (on average 1.3169811320754716) internal successors, (349), 265 states have internal predecessors, (349), 132 states have call successors, (132), 6 states have call predecessors, (132), 6 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2024-11-08 22:35:02,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 613 transitions. [2024-11-08 22:35:02,762 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 613 transitions. Word has length 152 [2024-11-08 22:35:02,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:35:02,763 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 613 transitions. [2024-11-08 22:35:02,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 22:35:02,764 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 613 transitions. [2024-11-08 22:35:02,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-08 22:35:02,765 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:35:02,766 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:35:02,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 22:35:02,766 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:35:02,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:35:02,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1862977455, now seen corresponding path program 1 times [2024-11-08 22:35:02,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:35:02,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119007982] [2024-11-08 22:35:02,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:35:02,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:02,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:02,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:35:02,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:02,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 22:35:02,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:02,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 22:35:02,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:02,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 22:35:02,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:02,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 22:35:02,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:02,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 22:35:02,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:02,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 22:35:02,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:02,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 22:35:02,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:02,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 22:35:02,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:02,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 22:35:02,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:02,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 22:35:02,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:02,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 22:35:02,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:02,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 22:35:02,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:02,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 22:35:02,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:03,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 22:35:03,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:03,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 22:35:03,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:03,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 22:35:03,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:03,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 22:35:03,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:03,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 22:35:03,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:03,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 22:35:03,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:03,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 22:35:03,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:03,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 22:35:03,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:03,031 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 22:35:03,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:35:03,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119007982] [2024-11-08 22:35:03,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119007982] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:35:03,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:35:03,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 22:35:03,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121441717] [2024-11-08 22:35:03,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:35:03,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 22:35:03,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:35:03,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 22:35:03,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 22:35:03,036 INFO L87 Difference]: Start difference. First operand 404 states and 613 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 22:35:03,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:35:03,161 INFO L93 Difference]: Finished difference Result 810 states and 1230 transitions. [2024-11-08 22:35:03,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 22:35:03,162 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 154 [2024-11-08 22:35:03,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:35:03,167 INFO L225 Difference]: With dead ends: 810 [2024-11-08 22:35:03,168 INFO L226 Difference]: Without dead ends: 409 [2024-11-08 22:35:03,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 22:35:03,170 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 89 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 22:35:03,173 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 510 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 22:35:03,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2024-11-08 22:35:03,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 406. [2024-11-08 22:35:03,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 267 states have (on average 1.3146067415730338) internal successors, (351), 267 states have internal predecessors, (351), 132 states have call successors, (132), 6 states have call predecessors, (132), 6 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2024-11-08 22:35:03,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 615 transitions. [2024-11-08 22:35:03,230 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 615 transitions. Word has length 154 [2024-11-08 22:35:03,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:35:03,231 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 615 transitions. [2024-11-08 22:35:03,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 22:35:03,231 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 615 transitions. [2024-11-08 22:35:03,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-08 22:35:03,234 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:35:03,235 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:35:03,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 22:35:03,235 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:35:03,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:35:03,236 INFO L85 PathProgramCache]: Analyzing trace with hash 2081832173, now seen corresponding path program 1 times [2024-11-08 22:35:03,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:35:03,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007409210] [2024-11-08 22:35:03,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:35:03,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:03,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:03,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:35:03,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:03,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 22:35:03,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:03,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 22:35:03,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:03,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 22:35:03,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:03,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 22:35:03,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:03,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 22:35:03,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:03,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 22:35:03,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:03,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 22:35:03,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:03,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 22:35:03,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:03,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 22:35:03,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:03,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 22:35:03,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:03,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 22:35:03,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:03,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 22:35:03,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:03,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 22:35:03,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:03,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 22:35:03,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:03,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 22:35:03,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:03,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 22:35:03,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:03,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 22:35:03,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:03,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 22:35:03,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:03,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 22:35:03,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:03,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 22:35:03,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:03,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 22:35:03,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:03,504 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 22:35:03,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:35:03,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007409210] [2024-11-08 22:35:03,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007409210] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:35:03,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:35:03,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 22:35:03,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836238766] [2024-11-08 22:35:03,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:35:03,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 22:35:03,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:35:03,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 22:35:03,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:35:03,508 INFO L87 Difference]: Start difference. First operand 406 states and 615 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 22:35:03,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:35:03,617 INFO L93 Difference]: Finished difference Result 1192 states and 1809 transitions. [2024-11-08 22:35:03,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 22:35:03,618 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 154 [2024-11-08 22:35:03,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:35:03,623 INFO L225 Difference]: With dead ends: 1192 [2024-11-08 22:35:03,623 INFO L226 Difference]: Without dead ends: 789 [2024-11-08 22:35:03,625 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:35:03,626 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 93 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 22:35:03,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 234 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 22:35:03,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2024-11-08 22:35:03,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 787. [2024-11-08 22:35:03,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 510 states have (on average 1.2980392156862746) internal successors, (662), 510 states have internal predecessors, (662), 264 states have call successors, (264), 12 states have call predecessors, (264), 12 states have return successors, (264), 264 states have call predecessors, (264), 264 states have call successors, (264) [2024-11-08 22:35:03,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1190 transitions. [2024-11-08 22:35:03,688 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1190 transitions. Word has length 154 [2024-11-08 22:35:03,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:35:03,690 INFO L471 AbstractCegarLoop]: Abstraction has 787 states and 1190 transitions. [2024-11-08 22:35:03,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 22:35:03,690 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1190 transitions. [2024-11-08 22:35:03,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-08 22:35:03,692 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:35:03,692 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:35:03,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 22:35:03,692 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:35:03,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:35:03,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1081100782, now seen corresponding path program 1 times [2024-11-08 22:35:03,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:35:03,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893595787] [2024-11-08 22:35:03,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:35:03,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:03,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:03,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:35:03,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:03,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 22:35:03,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:03,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 22:35:03,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:03,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 22:35:03,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:03,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 22:35:03,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:03,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 22:35:03,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:03,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 22:35:03,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:03,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 22:35:03,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:03,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 22:35:03,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:03,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 22:35:03,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:03,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 22:35:03,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:03,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 22:35:03,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:03,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 22:35:03,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:03,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 22:35:03,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:03,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 22:35:03,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:03,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 22:35:03,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:03,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 22:35:03,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:03,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 22:35:03,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:03,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 22:35:03,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:03,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 22:35:03,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:03,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 22:35:03,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:03,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 22:35:03,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:03,833 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 22:35:03,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:35:03,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893595787] [2024-11-08 22:35:03,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893595787] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:35:03,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:35:03,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 22:35:03,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872871357] [2024-11-08 22:35:03,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:35:03,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 22:35:03,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:35:03,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 22:35:03,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 22:35:03,837 INFO L87 Difference]: Start difference. First operand 787 states and 1190 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 22:35:03,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:35:03,974 INFO L93 Difference]: Finished difference Result 1575 states and 2382 transitions. [2024-11-08 22:35:03,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 22:35:03,975 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 156 [2024-11-08 22:35:03,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:35:03,984 INFO L225 Difference]: With dead ends: 1575 [2024-11-08 22:35:03,984 INFO L226 Difference]: Without dead ends: 791 [2024-11-08 22:35:03,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 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 22:35:03,987 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 83 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 22:35:03,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 408 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 22:35:03,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2024-11-08 22:35:04,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 785. [2024-11-08 22:35:04,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 785 states, 508 states have (on average 1.2913385826771653) internal successors, (656), 508 states have internal predecessors, (656), 264 states have call successors, (264), 12 states have call predecessors, (264), 12 states have return successors, (264), 264 states have call predecessors, (264), 264 states have call successors, (264) [2024-11-08 22:35:04,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 1184 transitions. [2024-11-08 22:35:04,030 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 1184 transitions. Word has length 156 [2024-11-08 22:35:04,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:35:04,030 INFO L471 AbstractCegarLoop]: Abstraction has 785 states and 1184 transitions. [2024-11-08 22:35:04,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 22:35:04,030 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 1184 transitions. [2024-11-08 22:35:04,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-08 22:35:04,031 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:35:04,032 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:35:04,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 22:35:04,032 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:35:04,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:35:04,032 INFO L85 PathProgramCache]: Analyzing trace with hash -862246064, now seen corresponding path program 1 times [2024-11-08 22:35:04,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:35:04,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673947479] [2024-11-08 22:35:04,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:35:04,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:04,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:04,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:35:04,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:04,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 22:35:04,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:04,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 22:35:04,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:04,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 22:35:04,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:04,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 22:35:04,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:04,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 22:35:04,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:04,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 22:35:04,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:04,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 22:35:04,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:04,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 22:35:04,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:04,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 22:35:04,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:04,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 22:35:04,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:04,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 22:35:04,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:04,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 22:35:04,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:04,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 22:35:04,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:04,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 22:35:04,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:04,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 22:35:04,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:04,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 22:35:04,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:04,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 22:35:04,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:04,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 22:35:04,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:04,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 22:35:04,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:04,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 22:35:04,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:04,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 22:35:04,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:04,258 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 22:35:04,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:35:04,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673947479] [2024-11-08 22:35:04,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673947479] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:35:04,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:35:04,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 22:35:04,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773167009] [2024-11-08 22:35:04,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:35:04,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 22:35:04,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:35:04,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 22:35:04,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 22:35:04,261 INFO L87 Difference]: Start difference. First operand 785 states and 1184 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 22:35:04,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:35:04,396 INFO L93 Difference]: Finished difference Result 987 states and 1490 transitions. [2024-11-08 22:35:04,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 22:35:04,396 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 156 [2024-11-08 22:35:04,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:35:04,399 INFO L225 Difference]: With dead ends: 987 [2024-11-08 22:35:04,399 INFO L226 Difference]: Without dead ends: 205 [2024-11-08 22:35:04,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 22:35:04,401 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 137 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 22:35:04,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 225 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 22:35:04,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-08 22:35:04,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 135. [2024-11-08 22:35:04,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 88 states have (on average 1.25) internal successors, (110), 88 states have internal predecessors, (110), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-08 22:35:04,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 198 transitions. [2024-11-08 22:35:04,416 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 198 transitions. Word has length 156 [2024-11-08 22:35:04,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:35:04,417 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 198 transitions. [2024-11-08 22:35:04,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 22:35:04,417 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 198 transitions. [2024-11-08 22:35:04,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-08 22:35:04,418 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:35:04,418 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:35:04,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 22:35:04,419 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:35:04,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:35:04,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1480311400, now seen corresponding path program 1 times [2024-11-08 22:35:04,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:35:04,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167235792] [2024-11-08 22:35:04,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:35:04,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:04,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 22:35:04,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [163372005] [2024-11-08 22:35:04,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:35:04,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 22:35:04,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 22:35:04,494 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 22:35:04,497 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 22:35:04,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 22:35:04,635 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 22:35:04,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 22:35:04,860 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 22:35:04,861 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 22:35:04,866 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 22:35:04,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 22:35:05,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 22:35:05,071 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:35:05,185 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 22:35:05,187 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 10:35:05 BoogieIcfgContainer [2024-11-08 22:35:05,187 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 22:35:05,188 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 22:35:05,188 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 22:35:05,188 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 22:35:05,188 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:35:00" (3/4) ... [2024-11-08 22:35:05,190 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 22:35:05,191 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 22:35:05,191 INFO L158 Benchmark]: Toolchain (without parser) took 5317.93ms. Allocated memory was 153.1MB in the beginning and 358.6MB in the end (delta: 205.5MB). Free memory was 81.3MB in the beginning and 293.8MB in the end (delta: -212.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 22:35:05,191 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 153.1MB. Free memory is still 119.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 22:35:05,191 INFO L158 Benchmark]: CACSL2BoogieTranslator took 383.91ms. Allocated memory was 153.1MB in the beginning and 247.5MB in the end (delta: 94.4MB). Free memory was 81.2MB in the beginning and 214.3MB in the end (delta: -133.1MB). Peak memory consumption was 23.7MB. Max. memory is 16.1GB. [2024-11-08 22:35:05,191 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.43ms. Allocated memory is still 247.5MB. Free memory was 214.3MB in the beginning and 210.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 22:35:05,192 INFO L158 Benchmark]: Boogie Preprocessor took 79.36ms. Allocated memory is still 247.5MB. Free memory was 210.1MB in the beginning and 204.8MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 22:35:05,192 INFO L158 Benchmark]: RCFGBuilder took 602.43ms. Allocated memory is still 247.5MB. Free memory was 204.8MB in the beginning and 175.5MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-08 22:35:05,192 INFO L158 Benchmark]: TraceAbstraction took 4199.10ms. Allocated memory was 247.5MB in the beginning and 358.6MB in the end (delta: 111.1MB). Free memory was 174.4MB in the beginning and 294.8MB in the end (delta: -120.4MB). Peak memory consumption was 174.8MB. Max. memory is 16.1GB. [2024-11-08 22:35:05,192 INFO L158 Benchmark]: Witness Printer took 3.09ms. Allocated memory is still 358.6MB. Free memory was 294.8MB in the beginning and 293.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 22:35:05,193 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.15ms. Allocated memory is still 153.1MB. Free memory is still 119.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 383.91ms. Allocated memory was 153.1MB in the beginning and 247.5MB in the end (delta: 94.4MB). Free memory was 81.2MB in the beginning and 214.3MB in the end (delta: -133.1MB). Peak memory consumption was 23.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.43ms. Allocated memory is still 247.5MB. Free memory was 214.3MB in the beginning and 210.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 79.36ms. Allocated memory is still 247.5MB. Free memory was 210.1MB in the beginning and 204.8MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 602.43ms. Allocated memory is still 247.5MB. Free memory was 204.8MB in the beginning and 175.5MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 4199.10ms. Allocated memory was 247.5MB in the beginning and 358.6MB in the end (delta: 111.1MB). Free memory was 174.4MB in the beginning and 294.8MB in the end (delta: -120.4MB). Peak memory consumption was 174.8MB. Max. memory is 16.1GB. * Witness Printer took 3.09ms. Allocated memory is still 358.6MB. Free memory was 294.8MB in the beginning and 293.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 203, overapproximation of someBinaryFLOATComparisonOperation at line 203, overapproximation of bitwiseOr at line 63. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -256; [L23] signed short int var_1_5 = -256; [L24] double var_1_7 = 256.25; [L25] double var_1_8 = 127.8; [L26] unsigned char var_1_10 = 0; [L27] unsigned char var_1_11 = 0; [L28] float var_1_12 = 999.75; [L29] float var_1_13 = 64.5; [L30] float var_1_14 = 127.25; [L31] signed char var_1_15 = -32; [L32] float var_1_16 = 32.7; [L33] unsigned char var_1_17 = 16; [L34] unsigned char var_1_18 = 32; [L35] unsigned short int var_1_19 = 5; [L36] signed long int var_1_21 = 100; [L37] signed short int var_1_22 = 50; [L38] double var_1_23 = 1000000.75; [L39] unsigned long int var_1_24 = 16; [L40] double var_1_28 = 15.5; [L41] double var_1_29 = 256.7; [L42] unsigned long int var_1_30 = 5; [L43] signed long int var_1_32 = 32; [L44] float var_1_34 = 7.5; [L45] unsigned short int var_1_35 = 100; [L46] signed short int var_1_36 = -4; [L47] unsigned short int var_1_37 = 47055; [L48] signed char var_1_39 = -64; [L49] double var_1_40 = 16.75; [L50] signed char var_1_41 = 16; [L51] signed long int last_1_var_1_1 = -256; [L52] signed short int last_1_var_1_5 = -256; [L53] unsigned char last_1_var_1_10 = 0; [L54] unsigned short int last_1_var_1_19 = 5; [L55] signed short int last_1_var_1_22 = 50; VAL [isInitial=0, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256, var_1_7=1025/4, var_1_8=639/5] [L207] isInitial = 1 [L208] FCALL initially() [L209] COND TRUE 1 [L210] CALL updateLastVariables() [L196] last_1_var_1_1 = var_1_1 [L197] last_1_var_1_5 = var_1_5 [L198] last_1_var_1_10 = var_1_10 [L199] last_1_var_1_19 = var_1_19 [L200] last_1_var_1_22 = var_1_22 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256, var_1_7=1025/4, var_1_8=639/5] [L210] RET updateLastVariables() [L211] CALL updateVariables() [L159] var_1_7 = __VERIFIER_nondet_double() [L160] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256, var_1_8=639/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256, var_1_8=639/5] [L160] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256, var_1_8=639/5] [L161] var_1_8 = __VERIFIER_nondet_double() [L162] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L162] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L163] var_1_11 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L164] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L165] CALL assume_abort_if_not(var_1_11 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L165] RET assume_abort_if_not(var_1_11 <= 0) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L166] var_1_13 = __VERIFIER_nondet_float() [L167] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L167] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L168] var_1_14 = __VERIFIER_nondet_float() [L169] CALL assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L169] RET assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L170] var_1_15 = __VERIFIER_nondet_char() [L171] CALL assume_abort_if_not(var_1_15 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L171] RET assume_abort_if_not(var_1_15 >= -128) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L172] CALL assume_abort_if_not(var_1_15 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L172] RET assume_abort_if_not(var_1_15 <= 127) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L173] CALL assume_abort_if_not(var_1_15 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L173] RET assume_abort_if_not(var_1_15 != 0) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L174] var_1_16 = __VERIFIER_nondet_float() [L175] CALL assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L175] RET assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L176] var_1_18 = __VERIFIER_nondet_uchar() [L177] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L177] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L178] CALL assume_abort_if_not(var_1_18 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L178] RET assume_abort_if_not(var_1_18 <= 254) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L179] var_1_29 = __VERIFIER_nondet_double() [L180] CALL assume_abort_if_not((var_1_29 >= -922337.2036854765600e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854765600e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L180] RET assume_abort_if_not((var_1_29 >= -922337.2036854765600e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854765600e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L181] var_1_36 = __VERIFIER_nondet_short() [L182] CALL assume_abort_if_not(var_1_36 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=50, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=50, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L182] RET assume_abort_if_not(var_1_36 >= -32768) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=50, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L183] CALL assume_abort_if_not(var_1_36 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=50, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=50, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L183] RET assume_abort_if_not(var_1_36 <= 32767) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=50, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L184] CALL assume_abort_if_not(var_1_36 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=50, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=50, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L184] RET assume_abort_if_not(var_1_36 != 0) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=50, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L185] var_1_37 = __VERIFIER_nondet_ushort() [L186] CALL assume_abort_if_not(var_1_37 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=50, var_1_37=32767, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=50, var_1_37=32767, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L186] RET assume_abort_if_not(var_1_37 >= 32767) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=50, var_1_37=32767, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L187] CALL assume_abort_if_not(var_1_37 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=50, var_1_37=32767, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=50, var_1_37=32767, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L187] RET assume_abort_if_not(var_1_37 <= 65534) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=50, var_1_37=32767, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L188] var_1_40 = __VERIFIER_nondet_double() [L189] CALL assume_abort_if_not((var_1_40 >= -922337.2036854776000e+13F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854776000e+12F && var_1_40 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=50, var_1_37=32767, var_1_39=-64, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=50, var_1_37=32767, var_1_39=-64, var_1_41=16, var_1_5=-256] [L189] RET assume_abort_if_not((var_1_40 >= -922337.2036854776000e+13F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854776000e+12F && var_1_40 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=50, var_1_37=32767, var_1_39=-64, var_1_41=16, var_1_5=-256] [L190] CALL assume_abort_if_not(var_1_40 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=50, var_1_37=32767, var_1_39=-64, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=50, var_1_37=32767, var_1_39=-64, var_1_41=16, var_1_5=-256] [L190] RET assume_abort_if_not(var_1_40 != 0.0F) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=50, var_1_37=32767, var_1_39=-64, var_1_41=16, var_1_5=-256] [L191] var_1_41 = __VERIFIER_nondet_char() [L192] CALL assume_abort_if_not(var_1_41 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=50, var_1_37=32767, var_1_39=-64, var_1_41=-127, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=50, var_1_37=32767, var_1_39=-64, var_1_41=-127, var_1_5=-256] [L192] RET assume_abort_if_not(var_1_41 >= -127) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=50, var_1_37=32767, var_1_39=-64, var_1_41=-127, var_1_5=-256] [L193] CALL assume_abort_if_not(var_1_41 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=50, var_1_37=32767, var_1_39=-64, var_1_41=-127, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=50, var_1_37=32767, var_1_39=-64, var_1_41=-127, var_1_5=-256] [L193] RET assume_abort_if_not(var_1_41 <= 126) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=50, var_1_37=32767, var_1_39=-64, var_1_41=-127, var_1_5=-256] [L211] RET updateVariables() [L212] CALL step() [L59] COND FALSE !(\read(var_1_10)) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=50, var_1_37=32767, var_1_39=-64, var_1_41=-127, var_1_5=-256] [L62] COND TRUE var_1_1 < var_1_19 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=50, var_1_37=32767, var_1_39=-64, var_1_41=-127, var_1_5=-256] [L63] EXPR var_1_1 ^ var_1_17 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=50, var_1_37=32767, var_1_39=-64, var_1_41=-127, var_1_5=-256] [L63] COND FALSE !(var_1_19 < (var_1_1 ^ var_1_17)) [L73] COND FALSE !(var_1_10 || var_1_10) [L76] var_1_30 = var_1_19 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=50, var_1_37=32767, var_1_39=-64, var_1_41=-127, var_1_5=-256] [L78] COND FALSE !(var_1_29 > var_1_12) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=50, var_1_37=32767, var_1_39=-64, var_1_41=-127, var_1_5=-256] [L89] var_1_34 = var_1_29 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2, var_1_30=5, var_1_32=32, var_1_34=2, var_1_35=100, var_1_36=50, var_1_37=32767, var_1_39=-64, var_1_41=-127, var_1_5=-256] [L90] EXPR (var_1_22 % var_1_36) ^ var_1_17 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2, var_1_30=5, var_1_32=32, var_1_34=2, var_1_35=100, var_1_36=50, var_1_37=32767, var_1_39=-64, var_1_41=-127, var_1_5=-256] [L90] COND TRUE ((var_1_22 % var_1_36) ^ var_1_17) != var_1_21 [L91] var_1_35 = (((((var_1_37) < 0 ) ? -(var_1_37) : (var_1_37))) - var_1_17) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2, var_1_30=5, var_1_32=32, var_1_34=2, var_1_35=32751, var_1_36=50, var_1_37=32767, var_1_39=-64, var_1_41=-127, var_1_5=-256] [L93] COND FALSE !(((var_1_12 / var_1_40) * var_1_12) > var_1_29) [L102] var_1_39 = var_1_41 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2, var_1_30=5, var_1_32=32, var_1_34=2, var_1_35=32751, var_1_36=50, var_1_37=32767, var_1_39=-127, var_1_41=-127, var_1_5=-256] [L104] signed long int stepLocal_2 = last_1_var_1_5; [L105] unsigned char stepLocal_1 = last_1_var_1_10; [L106] signed long int stepLocal_0 = 256; VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_1=0, stepLocal_2=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2, var_1_30=5, var_1_32=32, var_1_34=2, var_1_35=32751, var_1_36=50, var_1_37=32767, var_1_39=-127, var_1_41=-127, var_1_5=-256] [L107] COND FALSE !(stepLocal_1 && (last_1_var_1_5 >= last_1_var_1_1)) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_2=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2, var_1_30=5, var_1_32=32, var_1_34=2, var_1_35=32751, var_1_36=50, var_1_37=32767, var_1_39=-127, var_1_41=-127, var_1_5=-256] [L112] COND TRUE last_1_var_1_1 >= stepLocal_2 [L113] var_1_1 = last_1_var_1_5 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2, var_1_30=5, var_1_32=32, var_1_34=2, var_1_35=32751, var_1_36=50, var_1_37=32767, var_1_39=-127, var_1_41=-127, var_1_5=-256] [L118] var_1_10 = (last_1_var_1_10 && var_1_11) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2, var_1_30=5, var_1_32=32, var_1_34=2, var_1_35=32751, var_1_36=50, var_1_37=32767, var_1_39=-127, var_1_41=-127, var_1_5=-256] [L119] COND FALSE !(var_1_8 != ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14)))) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2, var_1_30=5, var_1_32=32, var_1_34=2, var_1_35=32751, var_1_36=50, var_1_37=32767, var_1_39=-127, var_1_41=-127, var_1_5=-256] [L124] var_1_22 = last_1_var_1_22 [L125] var_1_23 = var_1_14 [L126] unsigned char stepLocal_5 = var_1_10; [L127] unsigned char stepLocal_4 = var_1_18; VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_4=51, stepLocal_5=0, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_14=3, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=3, var_1_24=16, var_1_28=31/2, var_1_29=2, var_1_30=5, var_1_32=32, var_1_34=2, var_1_35=32751, var_1_36=50, var_1_37=32767, var_1_39=-127, var_1_41=-127, var_1_5=-256] [L128] COND TRUE var_1_22 < stepLocal_4 [L129] var_1_19 = last_1_var_1_19 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_5=0, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_14=3, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=3, var_1_24=16, var_1_28=31/2, var_1_29=2, var_1_30=5, var_1_32=32, var_1_34=2, var_1_35=32751, var_1_36=50, var_1_37=32767, var_1_39=-127, var_1_41=-127, var_1_5=-256] [L137] var_1_21 = var_1_22 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_5=0, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_14=3, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=3, var_1_24=16, var_1_28=31/2, var_1_29=2, var_1_30=5, var_1_32=32, var_1_34=2, var_1_35=32751, var_1_36=50, var_1_37=32767, var_1_39=-127, var_1_41=-127, var_1_5=-256] [L138] COND TRUE ! (var_1_23 <= var_1_7) [L139] var_1_12 = ((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14))) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_5=0, var_1_10=0, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=3, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=3, var_1_24=16, var_1_28=31/2, var_1_29=2, var_1_30=5, var_1_32=32, var_1_34=2, var_1_35=32751, var_1_36=50, var_1_37=32767, var_1_39=-127, var_1_41=-127, var_1_5=-256] [L147] unsigned char stepLocal_3 = var_1_10; VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_3=0, stepLocal_5=0, var_1_10=0, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=3, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=3, var_1_24=16, var_1_28=31/2, var_1_29=2, var_1_30=5, var_1_32=32, var_1_34=2, var_1_35=32751, var_1_36=50, var_1_37=32767, var_1_39=-127, var_1_41=-127, var_1_5=-256] [L148] COND FALSE !(var_1_10 && stepLocal_3) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_5=0, var_1_10=0, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=3, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=3, var_1_24=16, var_1_28=31/2, var_1_29=2, var_1_30=5, var_1_32=32, var_1_34=2, var_1_35=32751, var_1_36=50, var_1_37=32767, var_1_39=-127, var_1_41=-127, var_1_5=-256] [L151] COND TRUE (var_1_7 - var_1_8) > var_1_12 [L152] var_1_5 = var_1_19 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_5=0, var_1_10=0, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=3, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=3, var_1_24=16, var_1_28=31/2, var_1_29=2, var_1_30=5, var_1_32=32, var_1_34=2, var_1_35=32751, var_1_36=50, var_1_37=32767, var_1_39=-127, var_1_41=-127, var_1_5=5] [L212] RET step() [L213] CALL, EXPR property() [L203-L204] return (((((((((last_1_var_1_10 && (last_1_var_1_5 >= last_1_var_1_1)) ? ((256 != last_1_var_1_5) ? (var_1_1 == ((signed long int) (last_1_var_1_1 + last_1_var_1_5))) : 1) : ((last_1_var_1_1 >= last_1_var_1_5) ? (var_1_1 == ((signed long int) last_1_var_1_5)) : (var_1_1 == ((signed long int) last_1_var_1_1)))) && ((var_1_10 && var_1_10) ? (var_1_5 == ((signed short int) ((((var_1_19) < (-100)) ? (var_1_19) : (-100))))) : (((var_1_7 - var_1_8) > var_1_12) ? (var_1_5 == ((signed short int) var_1_19)) : (var_1_5 == ((signed short int) var_1_19))))) && (var_1_10 == ((unsigned char) (last_1_var_1_10 && var_1_11)))) && ((! (var_1_23 <= var_1_7)) ? (var_1_12 == ((float) ((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14))))) : (((((((var_1_1) > (var_1_17)) ? (var_1_1) : (var_1_17))) / var_1_15) < var_1_19) ? (var_1_12 == ((float) var_1_13)) : (var_1_12 == ((float) (var_1_16 + 49.6f)))))) && ((var_1_8 != ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14)))) ? (var_1_10 ? (var_1_17 == ((unsigned char) var_1_18)) : 1) : 1)) && ((var_1_22 < var_1_18) ? (var_1_19 == ((unsigned short int) last_1_var_1_19)) : (((var_1_10 || var_1_10) || var_1_10) ? (var_1_19 == ((unsigned short int) last_1_var_1_19)) : (var_1_19 == ((unsigned short int) var_1_22))))) && (var_1_21 == ((signed long int) var_1_22))) && (var_1_22 == ((signed short int) last_1_var_1_22))) && (var_1_23 == ((double) var_1_14)) ; VAL [\result=0, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=3, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=3, var_1_24=16, var_1_28=31/2, var_1_29=2, var_1_30=5, var_1_32=32, var_1_34=2, var_1_35=32751, var_1_36=50, var_1_37=32767, var_1_39=-127, var_1_41=-127, var_1_5=5] [L213] RET, EXPR property() [L213] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=3, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=3, var_1_24=16, var_1_28=31/2, var_1_29=2, var_1_30=5, var_1_32=32, var_1_34=2, var_1_35=32751, var_1_36=50, var_1_37=32767, var_1_39=-127, var_1_41=-127, var_1_5=5] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=3, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=3, var_1_24=16, var_1_28=31/2, var_1_29=2, var_1_30=5, var_1_32=32, var_1_34=2, var_1_35=32751, var_1_36=50, var_1_37=32767, var_1_39=-127, var_1_41=-127, var_1_5=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 92 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.0s, OverallIterations: 8, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 737 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 737 mSDsluCounter, 2245 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1185 mSDsCounter, 89 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 309 IncrementalHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 89 mSolverCounterUnsat, 1060 mSDtfsCounter, 309 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 336 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=787occurred in iteration=5, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 122 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1390 NumberOfCodeBlocks, 1390 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1069 ConstructedInterpolants, 0 QuantifiedInterpolants, 2081 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 6468/6468 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 22:35:05,223 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-ps-co_file-25.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 ff8bee30ebc0a54ebfcfd9d99cb415407b7814d567c1f87cff440d6e8ced68ab --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 22:35:07,409 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 22:35:07,479 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 22:35:07,486 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 22:35:07,487 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 22:35:07,513 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 22:35:07,517 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 22:35:07,518 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 22:35:07,518 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 22:35:07,518 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 22:35:07,518 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 22:35:07,519 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 22:35:07,519 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 22:35:07,519 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 22:35:07,519 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 22:35:07,520 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 22:35:07,520 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 22:35:07,520 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 22:35:07,520 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 22:35:07,520 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 22:35:07,521 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 22:35:07,521 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 22:35:07,521 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 22:35:07,521 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 22:35:07,522 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 22:35:07,522 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 22:35:07,522 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 22:35:07,522 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 22:35:07,522 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 22:35:07,523 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 22:35:07,523 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 22:35:07,523 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 22:35:07,523 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 22:35:07,523 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 22:35:07,524 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:35:07,524 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 22:35:07,527 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 22:35:07,527 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 22:35:07,527 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 22:35:07,528 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 22:35:07,528 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 22:35:07,528 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 22:35:07,529 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 22:35:07,529 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 22:35:07,529 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 -> ff8bee30ebc0a54ebfcfd9d99cb415407b7814d567c1f87cff440d6e8ced68ab [2024-11-08 22:35:07,820 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 22:35:07,842 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 22:35:07,844 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 22:35:07,845 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 22:35:07,846 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 22:35:07,847 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-ps-co_file-25.i [2024-11-08 22:35:09,537 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 22:35:09,767 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 22:35:09,768 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-25.i [2024-11-08 22:35:09,781 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a53224854/4658be4413514055915b3cb9edd87b34/FLAGfdf6b4a3e [2024-11-08 22:35:09,797 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a53224854/4658be4413514055915b3cb9edd87b34 [2024-11-08 22:35:09,800 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 22:35:09,802 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 22:35:09,803 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 22:35:09,803 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 22:35:09,808 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 22:35:09,809 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:35:09" (1/1) ... [2024-11-08 22:35:09,812 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18d8b98e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:35:09, skipping insertion in model container [2024-11-08 22:35:09,812 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:35:09" (1/1) ... [2024-11-08 22:35:09,843 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 22:35:10,011 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-ps-co_file-25.i[919,932] [2024-11-08 22:35:10,080 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:35:10,096 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 22:35:10,106 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-ps-co_file-25.i[919,932] [2024-11-08 22:35:10,162 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:35:10,181 INFO L204 MainTranslator]: Completed translation [2024-11-08 22:35:10,181 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:35:10 WrapperNode [2024-11-08 22:35:10,182 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 22:35:10,183 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 22:35:10,183 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 22:35:10,183 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 22:35:10,188 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:35:10" (1/1) ... [2024-11-08 22:35:10,205 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:35:10" (1/1) ... [2024-11-08 22:35:10,235 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 194 [2024-11-08 22:35:10,235 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 22:35:10,236 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 22:35:10,236 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 22:35:10,236 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 22:35:10,245 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:35:10" (1/1) ... [2024-11-08 22:35:10,245 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:35:10" (1/1) ... [2024-11-08 22:35:10,250 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:35:10" (1/1) ... [2024-11-08 22:35:10,266 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 22:35:10,267 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:35:10" (1/1) ... [2024-11-08 22:35:10,268 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:35:10" (1/1) ... [2024-11-08 22:35:10,282 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:35:10" (1/1) ... [2024-11-08 22:35:10,289 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:35:10" (1/1) ... [2024-11-08 22:35:10,295 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:35:10" (1/1) ... [2024-11-08 22:35:10,297 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:35:10" (1/1) ... [2024-11-08 22:35:10,303 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 22:35:10,308 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 22:35:10,308 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 22:35:10,308 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 22:35:10,309 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:35:10" (1/1) ... [2024-11-08 22:35:10,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:35:10,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 22:35:10,340 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 22:35:10,343 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 22:35:10,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 22:35:10,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 22:35:10,408 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 22:35:10,408 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 22:35:10,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 22:35:10,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 22:35:10,482 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 22:35:10,486 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 22:35:21,657 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-08 22:35:21,657 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 22:35:21,668 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 22:35:21,668 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 22:35:21,668 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:35:21 BoogieIcfgContainer [2024-11-08 22:35:21,669 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 22:35:21,670 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 22:35:21,670 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 22:35:21,673 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 22:35:21,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:35:09" (1/3) ... [2024-11-08 22:35:21,673 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a610f52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:35:21, skipping insertion in model container [2024-11-08 22:35:21,674 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:35:10" (2/3) ... [2024-11-08 22:35:21,674 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a610f52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:35:21, skipping insertion in model container [2024-11-08 22:35:21,674 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:35:21" (3/3) ... [2024-11-08 22:35:21,675 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-25.i [2024-11-08 22:35:21,687 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 22:35:21,687 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 22:35:21,731 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 22:35:21,737 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;@5e71c389, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 22:35:21,737 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 22:35:21,741 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 59 states have (on average 1.4915254237288136) internal successors, (88), 60 states have internal predecessors, (88), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 22:35:21,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-08 22:35:21,754 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:35:21,754 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:35:21,755 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:35:21,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:35:21,760 INFO L85 PathProgramCache]: Analyzing trace with hash -941019790, now seen corresponding path program 1 times [2024-11-08 22:35:21,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:35:21,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [802702075] [2024-11-08 22:35:21,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:35:21,773 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 22:35:21,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:35:21,778 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 22:35:21,779 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 22:35:22,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:22,820 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 22:35:22,828 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:35:22,861 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2024-11-08 22:35:22,861 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 22:35:22,862 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 22:35:22,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [802702075] [2024-11-08 22:35:22,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [802702075] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:35:22,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:35:22,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 22:35:22,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753263246] [2024-11-08 22:35:22,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:35:22,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 22:35:22,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 22:35:22,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 22:35:22,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 22:35:22,887 INFO L87 Difference]: Start difference. First operand has 84 states, 59 states have (on average 1.4915254237288136) internal successors, (88), 60 states have internal predecessors, (88), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-08 22:35:22,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:35:22,911 INFO L93 Difference]: Finished difference Result 161 states and 280 transitions. [2024-11-08 22:35:22,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 22:35:22,913 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, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 151 [2024-11-08 22:35:22,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:35:22,921 INFO L225 Difference]: With dead ends: 161 [2024-11-08 22:35:22,921 INFO L226 Difference]: Without dead ends: 80 [2024-11-08 22:35:22,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 150 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 22:35:22,928 INFO L432 NwaCegarLoop]: 125 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, 125 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 22:35:22,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 22:35:22,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-08 22:35:22,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-08 22:35:22,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 56 states have (on average 1.4464285714285714) internal successors, (81), 56 states have internal predecessors, (81), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 22:35:22,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 125 transitions. [2024-11-08 22:35:22,966 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 125 transitions. Word has length 151 [2024-11-08 22:35:22,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:35:22,967 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 125 transitions. [2024-11-08 22:35:22,967 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, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-08 22:35:22,967 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 125 transitions. [2024-11-08 22:35:22,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-08 22:35:22,970 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:35:22,970 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:35:23,005 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 22:35:23,174 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 22:35:23,175 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:35:23,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:35:23,176 INFO L85 PathProgramCache]: Analyzing trace with hash 489901106, now seen corresponding path program 1 times [2024-11-08 22:35:23,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:35:23,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2023368252] [2024-11-08 22:35:23,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:35:23,177 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 22:35:23,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:35:23,180 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 22:35:23,247 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 22:35:24,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:24,420 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 22:35:24,424 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:35:29,593 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 22:35:29,593 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 22:35:29,594 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 22:35:29,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2023368252] [2024-11-08 22:35:29,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2023368252] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:35:29,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:35:29,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 22:35:29,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086362545] [2024-11-08 22:35:29,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:35:29,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 22:35:29,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 22:35:29,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 22:35:29,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:35:29,598 INFO L87 Difference]: Start difference. First operand 80 states and 125 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 22:35:30,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:35:30,582 INFO L93 Difference]: Finished difference Result 232 states and 365 transitions. [2024-11-08 22:35:30,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 22:35:30,583 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 151 [2024-11-08 22:35:30,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:35:30,589 INFO L225 Difference]: With dead ends: 232 [2024-11-08 22:35:30,589 INFO L226 Difference]: Without dead ends: 155 [2024-11-08 22:35:30,590 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:35:30,598 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 50 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 22:35:30,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 236 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 22:35:30,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-08 22:35:30,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 140. [2024-11-08 22:35:30,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 93 states have (on average 1.3655913978494623) internal successors, (127), 93 states have internal predecessors, (127), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-08 22:35:30,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 215 transitions. [2024-11-08 22:35:30,639 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 215 transitions. Word has length 151 [2024-11-08 22:35:30,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:35:30,646 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 215 transitions. [2024-11-08 22:35:30,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 22:35:30,647 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 215 transitions. [2024-11-08 22:35:30,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-08 22:35:30,651 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:35:30,654 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:35:30,696 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 22:35:30,854 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 22:35:30,855 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:35:30,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:35:30,856 INFO L85 PathProgramCache]: Analyzing trace with hash -2133185678, now seen corresponding path program 1 times [2024-11-08 22:35:30,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:35:30,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [265892270] [2024-11-08 22:35:30,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:35:30,857 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 22:35:30,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:35:30,860 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 22:35:30,861 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 22:35:31,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:31,783 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 22:35:31,787 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:35:37,086 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 22:35:37,087 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 22:35:37,087 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 22:35:37,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [265892270] [2024-11-08 22:35:37,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [265892270] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:35:37,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:35:37,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 22:35:37,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246517344] [2024-11-08 22:35:37,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:35:37,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 22:35:37,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 22:35:37,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 22:35:37,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:35:37,094 INFO L87 Difference]: Start difference. First operand 140 states and 215 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 22:35:38,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:35:38,319 INFO L93 Difference]: Finished difference Result 410 states and 632 transitions. [2024-11-08 22:35:38,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 22:35:38,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 151 [2024-11-08 22:35:38,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:35:38,324 INFO L225 Difference]: With dead ends: 410 [2024-11-08 22:35:38,324 INFO L226 Difference]: Without dead ends: 273 [2024-11-08 22:35:38,325 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:35:38,326 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 50 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-08 22:35:38,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 258 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-08 22:35:38,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-11-08 22:35:38,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 270. [2024-11-08 22:35:38,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 177 states have (on average 1.3389830508474576) internal successors, (237), 177 states have internal predecessors, (237), 88 states have call successors, (88), 4 states have call predecessors, (88), 4 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-08 22:35:38,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 413 transitions. [2024-11-08 22:35:38,350 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 413 transitions. Word has length 151 [2024-11-08 22:35:38,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:35:38,351 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 413 transitions. [2024-11-08 22:35:38,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 22:35:38,351 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 413 transitions. [2024-11-08 22:35:38,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-08 22:35:38,352 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:35:38,353 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:35:38,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-08 22:35:38,554 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 22:35:38,555 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:35:38,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:35:38,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1672550036, now seen corresponding path program 1 times [2024-11-08 22:35:38,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:35:38,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1563293002] [2024-11-08 22:35:38,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:35:38,557 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 22:35:38,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:35:38,559 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 22:35:38,560 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 22:35:39,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:39,722 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 22:35:39,726 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:35:45,467 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 22:35:45,467 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 22:35:45,468 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 22:35:45,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1563293002] [2024-11-08 22:35:45,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1563293002] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:35:45,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:35:45,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 22:35:45,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038613657] [2024-11-08 22:35:45,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:35:45,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 22:35:45,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 22:35:45,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 22:35:45,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 22:35:45,470 INFO L87 Difference]: Start difference. First operand 270 states and 413 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 22:35:47,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:35:47,113 INFO L93 Difference]: Finished difference Result 456 states and 697 transitions. [2024-11-08 22:35:47,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 22:35:47,117 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 151 [2024-11-08 22:35:47,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:35:47,119 INFO L225 Difference]: With dead ends: 456 [2024-11-08 22:35:47,119 INFO L226 Difference]: Without dead ends: 189 [2024-11-08 22:35:47,126 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 22:35:47,126 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 116 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-08 22:35:47,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 201 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-08 22:35:47,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-11-08 22:35:47,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 123. [2024-11-08 22:35:47,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 76 states have (on average 1.236842105263158) internal successors, (94), 76 states have internal predecessors, (94), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-08 22:35:47,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 182 transitions. [2024-11-08 22:35:47,165 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 182 transitions. Word has length 151 [2024-11-08 22:35:47,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:35:47,165 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 182 transitions. [2024-11-08 22:35:47,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 22:35:47,165 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 182 transitions. [2024-11-08 22:35:47,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-08 22:35:47,166 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:35:47,167 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:35:47,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-08 22:35:47,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 22:35:47,367 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:35:47,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:35:47,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1841048040, now seen corresponding path program 1 times [2024-11-08 22:35:47,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:35:47,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1794600411] [2024-11-08 22:35:47,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:35:47,370 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 22:35:47,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:35:47,373 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 22:35:47,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-08 22:35:48,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:48,408 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 22:35:48,411 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:35:59,473 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 22:35:59,474 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 22:35:59,474 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 22:35:59,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1794600411] [2024-11-08 22:35:59,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1794600411] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:35:59,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:35:59,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 22:35:59,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012246905] [2024-11-08 22:35:59,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:35:59,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 22:35:59,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 22:35:59,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 22:35:59,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 22:35:59,476 INFO L87 Difference]: Start difference. First operand 123 states and 182 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 22:36:03,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:36:03,115 INFO L93 Difference]: Finished difference Result 230 states and 341 transitions. [2024-11-08 22:36:03,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 22:36:03,128 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 152 [2024-11-08 22:36:03,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:36:03,130 INFO L225 Difference]: With dead ends: 230 [2024-11-08 22:36:03,130 INFO L226 Difference]: Without dead ends: 154 [2024-11-08 22:36:03,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 22:36:03,131 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 95 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-08 22:36:03,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 379 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-08 22:36:03,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-08 22:36:03,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 135. [2024-11-08 22:36:03,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 88 states have (on average 1.2840909090909092) internal successors, (113), 88 states have internal predecessors, (113), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-08 22:36:03,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 201 transitions. [2024-11-08 22:36:03,144 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 201 transitions. Word has length 152 [2024-11-08 22:36:03,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:36:03,145 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 201 transitions. [2024-11-08 22:36:03,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 22:36:03,145 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 201 transitions. [2024-11-08 22:36:03,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-08 22:36:03,146 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:36:03,146 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:36:03,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-08 22:36:03,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 22:36:03,347 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:36:03,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:36:03,348 INFO L85 PathProgramCache]: Analyzing trace with hash -829930790, now seen corresponding path program 1 times [2024-11-08 22:36:03,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:36:03,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1926877639] [2024-11-08 22:36:03,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:36:03,349 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 22:36:03,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:36:03,351 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 22:36:03,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-08 22:36:04,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:36:04,420 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-08 22:36:04,440 INFO L278 TraceCheckSpWp]: Computing forward predicates...