./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-94.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-94.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 211883c60ce0bb06b72e4a9000b7135ce379464c60607038b1e2cd858553e4b3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 03:53:01,287 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 03:53:01,333 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 03:53:01,337 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 03:53:01,338 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 03:53:01,358 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 03:53:01,359 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 03:53:01,359 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 03:53:01,360 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 03:53:01,362 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 03:53:01,362 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 03:53:01,363 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 03:53:01,363 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 03:53:01,363 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 03:53:01,363 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 03:53:01,364 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 03:53:01,365 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 03:53:01,365 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 03:53:01,365 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 03:53:01,365 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 03:53:01,366 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 03:53:01,366 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 03:53:01,366 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 03:53:01,366 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 03:53:01,366 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 03:53:01,367 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 03:53:01,367 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 03:53:01,367 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 03:53:01,367 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 03:53:01,367 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 03:53:01,367 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 03:53:01,367 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 03:53:01,368 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:53:01,368 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 03:53:01,368 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 03:53:01,368 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 03:53:01,368 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 03:53:01,368 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 03:53:01,368 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 03:53:01,368 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 03:53:01,369 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 03:53:01,369 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 03:53:01,370 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 -> 211883c60ce0bb06b72e4a9000b7135ce379464c60607038b1e2cd858553e4b3 [2024-10-13 03:53:01,581 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 03:53:01,600 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 03:53:01,602 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 03:53:01,603 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 03:53:01,603 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 03:53:01,604 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-94.i [2024-10-13 03:53:02,846 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 03:53:03,035 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 03:53:03,036 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-94.i [2024-10-13 03:53:03,046 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92ab319cb/3d2209a40bbd4a7db86b82a8cc2bfe84/FLAG425831b35 [2024-10-13 03:53:03,075 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92ab319cb/3d2209a40bbd4a7db86b82a8cc2bfe84 [2024-10-13 03:53:03,077 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 03:53:03,078 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 03:53:03,079 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 03:53:03,079 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 03:53:03,085 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 03:53:03,088 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:53:03" (1/1) ... [2024-10-13 03:53:03,089 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57b8a016 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:53:03, skipping insertion in model container [2024-10-13 03:53:03,089 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:53:03" (1/1) ... [2024-10-13 03:53:03,123 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 03:53:03,254 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-94.i[916,929] [2024-10-13 03:53:03,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:53:03,336 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 03:53:03,347 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-94.i[916,929] [2024-10-13 03:53:03,392 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:53:03,410 INFO L204 MainTranslator]: Completed translation [2024-10-13 03:53:03,413 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:53:03 WrapperNode [2024-10-13 03:53:03,413 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 03:53:03,414 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 03:53:03,414 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 03:53:03,414 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 03:53:03,420 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:53:03" (1/1) ... [2024-10-13 03:53:03,431 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:53:03" (1/1) ... [2024-10-13 03:53:03,463 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 220 [2024-10-13 03:53:03,464 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 03:53:03,465 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 03:53:03,465 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 03:53:03,465 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 03:53:03,476 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:53:03" (1/1) ... [2024-10-13 03:53:03,476 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:53:03" (1/1) ... [2024-10-13 03:53:03,481 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:53:03" (1/1) ... [2024-10-13 03:53:03,502 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 03:53:03,503 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:53:03" (1/1) ... [2024-10-13 03:53:03,503 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:53:03" (1/1) ... [2024-10-13 03:53:03,520 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:53:03" (1/1) ... [2024-10-13 03:53:03,528 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:53:03" (1/1) ... [2024-10-13 03:53:03,536 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:53:03" (1/1) ... [2024-10-13 03:53:03,538 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:53:03" (1/1) ... [2024-10-13 03:53:03,543 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 03:53:03,544 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 03:53:03,544 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 03:53:03,544 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 03:53:03,545 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:53:03" (1/1) ... [2024-10-13 03:53:03,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:53:03,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:53:03,571 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 03:53:03,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 03:53:03,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 03:53:03,610 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 03:53:03,610 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 03:53:03,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 03:53:03,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 03:53:03,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 03:53:03,690 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 03:53:03,694 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 03:53:04,130 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2024-10-13 03:53:04,131 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 03:53:04,166 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 03:53:04,167 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 03:53:04,167 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:53:04 BoogieIcfgContainer [2024-10-13 03:53:04,167 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 03:53:04,169 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 03:53:04,170 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 03:53:04,172 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 03:53:04,173 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 03:53:03" (1/3) ... [2024-10-13 03:53:04,173 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@219d8968 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:53:04, skipping insertion in model container [2024-10-13 03:53:04,173 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:53:03" (2/3) ... [2024-10-13 03:53:04,173 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@219d8968 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:53:04, skipping insertion in model container [2024-10-13 03:53:04,173 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:53:04" (3/3) ... [2024-10-13 03:53:04,174 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-94.i [2024-10-13 03:53:04,187 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 03:53:04,187 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 03:53:04,239 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 03:53:04,244 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;@14341dc9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 03:53:04,244 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 03:53:04,250 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 57 states have internal predecessors, (83), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-13 03:53:04,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-10-13 03:53:04,261 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:53:04,261 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:53:04,262 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:53:04,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:53:04,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1261380877, now seen corresponding path program 1 times [2024-10-13 03:53:04,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:53:04,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351310208] [2024-10-13 03:53:04,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:53:04,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:53:04,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:04,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:53:04,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:04,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 03:53:04,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:04,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 03:53:04,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:04,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 03:53:04,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:04,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 03:53:04,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:04,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 03:53:04,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:04,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 03:53:04,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:04,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 03:53:04,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:04,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 03:53:04,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:04,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 03:53:04,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:04,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 03:53:04,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:04,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 03:53:04,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:04,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 03:53:04,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:04,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 03:53:04,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:04,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 03:53:04,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:04,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 03:53:04,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:04,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 03:53:04,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:04,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 03:53:04,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:04,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 03:53:04,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:04,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 03:53:04,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:04,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 03:53:04,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:04,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 03:53:04,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:04,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 03:53:04,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:04,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 03:53:04,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:04,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 03:53:04,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:04,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 03:53:04,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:04,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 03:53:04,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:04,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-13 03:53:04,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:53:04,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351310208] [2024-10-13 03:53:04,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351310208] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:53:04,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:53:04,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 03:53:04,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833592120] [2024-10-13 03:53:04,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:53:04,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 03:53:04,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:53:04,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 03:53:04,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:53:04,732 INFO L87 Difference]: Start difference. First operand has 86 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 57 states have internal predecessors, (83), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-13 03:53:04,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:53:04,781 INFO L93 Difference]: Finished difference Result 171 states and 300 transitions. [2024-10-13 03:53:04,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 03:53:04,785 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) Word has length 174 [2024-10-13 03:53:04,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:53:04,793 INFO L225 Difference]: With dead ends: 171 [2024-10-13 03:53:04,793 INFO L226 Difference]: Without dead ends: 84 [2024-10-13 03:53:04,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:53:04,801 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:53:04,802 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:53:04,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-13 03:53:04,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-13 03:53:04,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 55 states have internal predecessors, (78), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-13 03:53:04,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 132 transitions. [2024-10-13 03:53:04,851 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 132 transitions. Word has length 174 [2024-10-13 03:53:04,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:53:04,852 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 132 transitions. [2024-10-13 03:53:04,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-13 03:53:04,852 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 132 transitions. [2024-10-13 03:53:04,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-10-13 03:53:04,855 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:53:04,855 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:53:04,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 03:53:04,855 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:53:04,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:53:04,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1437934991, now seen corresponding path program 1 times [2024-10-13 03:53:04,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:53:04,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789014187] [2024-10-13 03:53:04,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:53:04,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:53:04,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:05,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:53:05,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:05,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 03:53:05,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:05,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 03:53:05,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:05,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 03:53:05,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:05,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 03:53:05,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:05,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 03:53:05,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:05,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 03:53:05,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:05,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 03:53:05,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:05,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 03:53:05,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:05,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 03:53:05,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:05,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 03:53:05,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:05,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 03:53:05,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:05,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 03:53:05,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:05,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 03:53:05,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:05,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 03:53:05,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:05,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 03:53:05,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:05,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 03:53:05,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:05,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 03:53:05,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:05,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 03:53:05,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:05,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 03:53:05,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:05,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 03:53:05,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:05,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 03:53:05,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:05,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 03:53:05,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:05,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 03:53:05,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:05,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 03:53:05,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:05,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 03:53:05,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:05,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 03:53:05,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:05,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-13 03:53:05,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:53:05,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789014187] [2024-10-13 03:53:05,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789014187] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:53:05,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:53:05,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 03:53:05,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451952229] [2024-10-13 03:53:05,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:53:05,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 03:53:05,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:53:05,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 03:53:05,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 03:53:05,338 INFO L87 Difference]: Start difference. First operand 84 states and 132 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-13 03:53:05,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:53:05,498 INFO L93 Difference]: Finished difference Result 197 states and 308 transitions. [2024-10-13 03:53:05,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 03:53:05,500 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 174 [2024-10-13 03:53:05,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:53:05,502 INFO L225 Difference]: With dead ends: 197 [2024-10-13 03:53:05,503 INFO L226 Difference]: Without dead ends: 114 [2024-10-13 03:53:05,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 03:53:05,504 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 67 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 03:53:05,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 372 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 03:53:05,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-13 03:53:05,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2024-10-13 03:53:05,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 67 states have (on average 1.328358208955224) internal successors, (89), 68 states have internal predecessors, (89), 43 states have call successors, (43), 2 states have call predecessors, (43), 2 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2024-10-13 03:53:05,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 175 transitions. [2024-10-13 03:53:05,520 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 175 transitions. Word has length 174 [2024-10-13 03:53:05,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:53:05,521 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 175 transitions. [2024-10-13 03:53:05,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-13 03:53:05,522 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 175 transitions. [2024-10-13 03:53:05,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-13 03:53:05,526 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:53:05,527 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:53:05,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 03:53:05,527 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:53:05,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:53:05,528 INFO L85 PathProgramCache]: Analyzing trace with hash -571973737, now seen corresponding path program 1 times [2024-10-13 03:53:05,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:53:05,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340651184] [2024-10-13 03:53:05,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:53:05,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:53:05,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:05,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:53:05,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:05,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 03:53:05,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:05,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 03:53:05,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:05,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 03:53:05,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:05,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 03:53:05,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:05,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 03:53:05,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:05,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 03:53:05,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:05,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 03:53:05,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:05,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 03:53:05,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:05,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 03:53:05,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:05,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 03:53:05,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:05,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 03:53:05,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:05,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 03:53:05,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:05,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 03:53:05,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:05,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 03:53:05,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:05,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 03:53:05,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:05,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 03:53:05,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:05,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 03:53:05,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:05,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 03:53:05,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:05,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 03:53:05,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:05,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 03:53:05,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:05,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 03:53:05,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:05,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 03:53:05,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:05,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 03:53:05,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:05,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 03:53:05,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:05,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 03:53:05,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:05,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 03:53:05,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:05,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-13 03:53:05,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:53:05,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340651184] [2024-10-13 03:53:05,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340651184] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:53:05,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:53:05,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 03:53:05,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638186087] [2024-10-13 03:53:05,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:53:05,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 03:53:05,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:53:05,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 03:53:05,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 03:53:05,880 INFO L87 Difference]: Start difference. First operand 113 states and 175 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-13 03:53:06,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:53:06,042 INFO L93 Difference]: Finished difference Result 317 states and 486 transitions. [2024-10-13 03:53:06,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 03:53:06,043 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 175 [2024-10-13 03:53:06,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:53:06,049 INFO L225 Difference]: With dead ends: 317 [2024-10-13 03:53:06,051 INFO L226 Difference]: Without dead ends: 230 [2024-10-13 03:53:06,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 03:53:06,055 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 167 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 03:53:06,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 363 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 03:53:06,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-10-13 03:53:06,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 196. [2024-10-13 03:53:06,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 121 states have (on average 1.3140495867768596) internal successors, (159), 122 states have internal predecessors, (159), 70 states have call successors, (70), 4 states have call predecessors, (70), 4 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-13 03:53:06,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 299 transitions. [2024-10-13 03:53:06,092 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 299 transitions. Word has length 175 [2024-10-13 03:53:06,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:53:06,092 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 299 transitions. [2024-10-13 03:53:06,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-13 03:53:06,094 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 299 transitions. [2024-10-13 03:53:06,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-13 03:53:06,096 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:53:06,096 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:53:06,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 03:53:06,097 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:53:06,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:53:06,099 INFO L85 PathProgramCache]: Analyzing trace with hash -353119019, now seen corresponding path program 1 times [2024-10-13 03:53:06,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:53:06,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390536985] [2024-10-13 03:53:06,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:53:06,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:53:06,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:06,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:53:06,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:06,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 03:53:06,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:06,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 03:53:06,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:06,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 03:53:06,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:06,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 03:53:06,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:06,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 03:53:06,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:06,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 03:53:06,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:06,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 03:53:06,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:06,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 03:53:06,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:06,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 03:53:06,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:06,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 03:53:06,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:06,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 03:53:06,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:06,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 03:53:06,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:06,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 03:53:06,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:06,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 03:53:06,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:06,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 03:53:06,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:06,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 03:53:06,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:06,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 03:53:06,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:06,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 03:53:06,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:06,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 03:53:06,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:06,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 03:53:06,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:06,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 03:53:06,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:06,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 03:53:06,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:06,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 03:53:06,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:06,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 03:53:06,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:06,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 03:53:06,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:06,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 03:53:06,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:06,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-13 03:53:06,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:53:06,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390536985] [2024-10-13 03:53:06,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390536985] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:53:06,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:53:06,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 03:53:06,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27844342] [2024-10-13 03:53:06,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:53:06,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 03:53:06,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:53:06,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 03:53:06,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 03:53:06,719 INFO L87 Difference]: Start difference. First operand 196 states and 299 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-13 03:53:07,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:53:07,092 INFO L93 Difference]: Finished difference Result 485 states and 731 transitions. [2024-10-13 03:53:07,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 03:53:07,109 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 175 [2024-10-13 03:53:07,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:53:07,111 INFO L225 Difference]: With dead ends: 485 [2024-10-13 03:53:07,111 INFO L226 Difference]: Without dead ends: 315 [2024-10-13 03:53:07,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2024-10-13 03:53:07,113 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 144 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 03:53:07,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 537 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 03:53:07,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2024-10-13 03:53:07,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 267. [2024-10-13 03:53:07,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 180 states have (on average 1.3666666666666667) internal successors, (246), 180 states have internal predecessors, (246), 81 states have call successors, (81), 5 states have call predecessors, (81), 5 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2024-10-13 03:53:07,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 408 transitions. [2024-10-13 03:53:07,144 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 408 transitions. Word has length 175 [2024-10-13 03:53:07,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:53:07,145 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 408 transitions. [2024-10-13 03:53:07,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-13 03:53:07,145 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 408 transitions. [2024-10-13 03:53:07,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-13 03:53:07,149 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:53:07,149 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:53:07,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 03:53:07,149 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:53:07,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:53:07,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1162465645, now seen corresponding path program 1 times [2024-10-13 03:53:07,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:53:07,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119534963] [2024-10-13 03:53:07,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:53:07,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:53:07,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 03:53:07,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [610015341] [2024-10-13 03:53:07,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:53:07,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 03:53:07,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:53:07,320 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 03:53:07,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 03:53:07,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:07,449 INFO L255 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-13 03:53:07,458 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:53:09,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 510 proven. 69 refuted. 0 times theorem prover too weak. 825 trivial. 0 not checked. [2024-10-13 03:53:09,483 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 03:53:10,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:53:10,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119534963] [2024-10-13 03:53:10,767 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 03:53:10,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610015341] [2024-10-13 03:53:10,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [610015341] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 03:53:10,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-13 03:53:10,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2024-10-13 03:53:10,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356415456] [2024-10-13 03:53:10,768 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-13 03:53:10,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 03:53:10,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:53:10,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 03:53:10,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2024-10-13 03:53:10,769 INFO L87 Difference]: Start difference. First operand 267 states and 408 transitions. Second operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 11 states have internal predecessors, (52), 2 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-13 03:53:11,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:53:11,799 INFO L93 Difference]: Finished difference Result 944 states and 1397 transitions. [2024-10-13 03:53:11,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-13 03:53:11,799 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 11 states have internal predecessors, (52), 2 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 175 [2024-10-13 03:53:11,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:53:11,805 INFO L225 Difference]: With dead ends: 944 [2024-10-13 03:53:11,805 INFO L226 Difference]: Without dead ends: 756 [2024-10-13 03:53:11,806 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=279, Invalid=843, Unknown=0, NotChecked=0, Total=1122 [2024-10-13 03:53:11,806 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 578 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 578 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 03:53:11,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [578 Valid, 713 Invalid, 895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 03:53:11,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2024-10-13 03:53:11,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 670. [2024-10-13 03:53:11,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 502 states have (on average 1.3844621513944224) internal successors, (695), 506 states have internal predecessors, (695), 151 states have call successors, (151), 16 states have call predecessors, (151), 16 states have return successors, (151), 147 states have call predecessors, (151), 151 states have call successors, (151) [2024-10-13 03:53:11,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 997 transitions. [2024-10-13 03:53:11,860 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 997 transitions. Word has length 175 [2024-10-13 03:53:11,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:53:11,860 INFO L471 AbstractCegarLoop]: Abstraction has 670 states and 997 transitions. [2024-10-13 03:53:11,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 11 states have internal predecessors, (52), 2 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-13 03:53:11,861 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 997 transitions. [2024-10-13 03:53:11,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-13 03:53:11,862 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:53:11,862 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:53:11,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-13 03:53:12,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 03:53:12,063 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:53:12,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:53:12,064 INFO L85 PathProgramCache]: Analyzing trace with hash -461401067, now seen corresponding path program 1 times [2024-10-13 03:53:12,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:53:12,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455600748] [2024-10-13 03:53:12,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:53:12,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:53:12,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 03:53:12,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1225385511] [2024-10-13 03:53:12,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:53:12,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 03:53:12,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:53:12,146 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 03:53:12,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 03:53:12,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:12,256 INFO L255 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-13 03:53:12,261 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:53:12,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 632 proven. 93 refuted. 0 times theorem prover too weak. 679 trivial. 0 not checked. [2024-10-13 03:53:12,791 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 03:53:12,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:53:12,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455600748] [2024-10-13 03:53:12,962 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 03:53:12,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225385511] [2024-10-13 03:53:12,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1225385511] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 03:53:12,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-13 03:53:12,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2024-10-13 03:53:12,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778767952] [2024-10-13 03:53:12,963 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-13 03:53:12,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 03:53:12,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:53:12,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 03:53:12,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=192, Unknown=1, NotChecked=0, Total=240 [2024-10-13 03:53:12,964 INFO L87 Difference]: Start difference. First operand 670 states and 997 transitions. Second operand has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 11 states have internal predecessors, (55), 3 states have call successors, (27), 3 states have call predecessors, (27), 5 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2024-10-13 03:53:14,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:53:14,263 INFO L93 Difference]: Finished difference Result 2131 states and 3103 transitions. [2024-10-13 03:53:14,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-13 03:53:14,264 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 11 states have internal predecessors, (55), 3 states have call successors, (27), 3 states have call predecessors, (27), 5 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) Word has length 175 [2024-10-13 03:53:14,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:53:14,271 INFO L225 Difference]: With dead ends: 2131 [2024-10-13 03:53:14,272 INFO L226 Difference]: Without dead ends: 1580 [2024-10-13 03:53:14,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 200 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=320, Invalid=939, Unknown=1, NotChecked=0, Total=1260 [2024-10-13 03:53:14,274 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 270 mSDsluCounter, 1007 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 1174 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 03:53:14,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 1174 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 03:53:14,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1580 states. [2024-10-13 03:53:14,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1580 to 896. [2024-10-13 03:53:14,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 896 states, 684 states have (on average 1.3903508771929824) internal successors, (951), 689 states have internal predecessors, (951), 182 states have call successors, (182), 29 states have call predecessors, (182), 29 states have return successors, (182), 177 states have call predecessors, (182), 182 states have call successors, (182) [2024-10-13 03:53:14,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1315 transitions. [2024-10-13 03:53:14,352 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1315 transitions. Word has length 175 [2024-10-13 03:53:14,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:53:14,352 INFO L471 AbstractCegarLoop]: Abstraction has 896 states and 1315 transitions. [2024-10-13 03:53:14,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 11 states have internal predecessors, (55), 3 states have call successors, (27), 3 states have call predecessors, (27), 5 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2024-10-13 03:53:14,352 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1315 transitions. [2024-10-13 03:53:14,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-13 03:53:14,354 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:53:14,354 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:53:14,369 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 03:53:14,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-13 03:53:14,559 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:53:14,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:53:14,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1839421523, now seen corresponding path program 1 times [2024-10-13 03:53:14,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:53:14,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360279982] [2024-10-13 03:53:14,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:53:14,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:53:14,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 03:53:14,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [802675848] [2024-10-13 03:53:14,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:53:14,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 03:53:14,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:53:14,686 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 03:53:14,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 03:53:14,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 03:53:14,843 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 03:53:14,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 03:53:15,079 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 03:53:15,079 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 03:53:15,080 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 03:53:15,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-13 03:53:15,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 03:53:15,286 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:53:15,380 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 03:53:15,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 03:53:15 BoogieIcfgContainer [2024-10-13 03:53:15,383 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 03:53:15,383 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 03:53:15,383 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 03:53:15,383 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 03:53:15,384 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:53:04" (3/4) ... [2024-10-13 03:53:15,385 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 03:53:15,386 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 03:53:15,387 INFO L158 Benchmark]: Toolchain (without parser) took 12307.99ms. Allocated memory was 153.1MB in the beginning and 360.7MB in the end (delta: 207.6MB). Free memory was 126.2MB in the beginning and 253.5MB in the end (delta: -127.3MB). Peak memory consumption was 80.4MB. Max. memory is 16.1GB. [2024-10-13 03:53:15,387 INFO L158 Benchmark]: CDTParser took 0.44ms. Allocated memory is still 153.1MB. Free memory is still 125.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 03:53:15,388 INFO L158 Benchmark]: CACSL2BoogieTranslator took 334.20ms. Allocated memory is still 153.1MB. Free memory was 126.2MB in the beginning and 107.2MB in the end (delta: 19.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-13 03:53:15,388 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.02ms. Allocated memory is still 153.1MB. Free memory was 107.2MB in the beginning and 100.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 03:53:15,389 INFO L158 Benchmark]: Boogie Preprocessor took 78.82ms. Allocated memory is still 153.1MB. Free memory was 100.9MB in the beginning and 90.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-13 03:53:15,389 INFO L158 Benchmark]: RCFGBuilder took 623.50ms. Allocated memory is still 153.1MB. Free memory was 90.4MB in the beginning and 93.5MB in the end (delta: -3.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-13 03:53:15,389 INFO L158 Benchmark]: TraceAbstraction took 11213.37ms. Allocated memory was 153.1MB in the beginning and 360.7MB in the end (delta: 207.6MB). Free memory was 92.6MB in the beginning and 253.5MB in the end (delta: -160.9MB). Peak memory consumption was 48.5MB. Max. memory is 16.1GB. [2024-10-13 03:53:15,389 INFO L158 Benchmark]: Witness Printer took 2.76ms. Allocated memory is still 360.7MB. Free memory is still 253.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 03:53:15,391 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.44ms. Allocated memory is still 153.1MB. Free memory is still 125.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 334.20ms. Allocated memory is still 153.1MB. Free memory was 126.2MB in the beginning and 107.2MB in the end (delta: 19.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.02ms. Allocated memory is still 153.1MB. Free memory was 107.2MB in the beginning and 100.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.82ms. Allocated memory is still 153.1MB. Free memory was 100.9MB in the beginning and 90.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 623.50ms. Allocated memory is still 153.1MB. Free memory was 90.4MB in the beginning and 93.5MB in the end (delta: -3.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 11213.37ms. Allocated memory was 153.1MB in the beginning and 360.7MB in the end (delta: 207.6MB). Free memory was 92.6MB in the beginning and 253.5MB in the end (delta: -160.9MB). Peak memory consumption was 48.5MB. Max. memory is 16.1GB. * Witness Printer took 2.76ms. Allocated memory is still 360.7MB. Free memory is still 253.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 188, overapproximation of someUnaryDOUBLEoperation at line 22, overapproximation of someBinaryArithmeticDOUBLEoperation at line 68, overapproximation of someBinaryDOUBLEComparisonOperation at line 188. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = -0.25; [L23] double var_1_2 = -0.125; [L24] double var_1_3 = 127.5; [L25] unsigned char var_1_4 = 4; [L26] unsigned char var_1_5 = 0; [L27] unsigned char var_1_6 = 10; [L28] float var_1_7 = -0.2; [L29] unsigned char var_1_9 = 0; [L30] unsigned char var_1_10 = 1; [L31] unsigned char var_1_11 = 1; [L32] unsigned char var_1_12 = 0; [L33] unsigned char var_1_13 = 0; [L34] unsigned char var_1_14 = 0; [L35] signed long int var_1_15 = -100000; [L36] signed char var_1_18 = 8; [L37] signed char var_1_19 = 64; [L38] signed short int var_1_20 = -16; [L39] signed long int var_1_22 = -1; [L40] double var_1_23 = 500.8; [L41] double var_1_24 = 9.8; [L42] unsigned short int var_1_25 = 16; [L43] unsigned short int var_1_26 = 41277; [L44] signed long int var_1_27 = 1000; [L45] double var_1_29 = 99.5; [L46] double var_1_30 = 99999999.6; [L47] unsigned long int var_1_31 = 4; [L48] unsigned short int var_1_32 = 10; [L49] unsigned short int var_1_33 = 52075; [L50] unsigned char last_1_var_1_4 = 4; [L51] unsigned char last_1_var_1_9 = 0; [L52] signed long int last_1_var_1_15 = -100000; [L53] signed short int last_1_var_1_20 = -16; [L54] signed long int last_1_var_1_22 = -1; [L55] unsigned short int last_1_var_1_32 = 10; [L192] isInitial = 1 [L193] FCALL initially() [L194] int k_loop; [L195] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_3=255/2, var_1_4=4, var_1_5=0, var_1_6=10, var_1_9=0] [L195] COND TRUE k_loop < 1 [L196] CALL updateLastVariables() [L180] last_1_var_1_4 = var_1_4 [L181] last_1_var_1_9 = var_1_9 [L182] last_1_var_1_15 = var_1_15 [L183] last_1_var_1_20 = var_1_20 [L184] last_1_var_1_22 = var_1_22 [L185] last_1_var_1_32 = var_1_32 [L196] RET updateLastVariables() [L197] CALL updateVariables() [L136] var_1_2 = __VERIFIER_nondet_double() [L137] CALL assume_abort_if_not((var_1_2 >= -461168.6018427382800e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 4611686.018427382800e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_3=255/2, var_1_4=4, var_1_5=0, var_1_6=10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_3=255/2, var_1_4=4, var_1_5=0, var_1_6=10, var_1_9=0] [L137] RET assume_abort_if_not((var_1_2 >= -461168.6018427382800e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 4611686.018427382800e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_3=255/2, var_1_4=4, var_1_5=0, var_1_6=10, var_1_9=0] [L138] var_1_3 = __VERIFIER_nondet_double() [L139] CALL assume_abort_if_not((var_1_3 >= -461168.6018427382800e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 4611686.018427382800e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=10, var_1_9=0] [L139] RET assume_abort_if_not((var_1_3 >= -461168.6018427382800e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 4611686.018427382800e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=10, var_1_9=0] [L140] var_1_5 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_6=10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_6=10, var_1_9=0] [L141] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_6=10, var_1_9=0] [L142] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=10, var_1_9=0] [L142] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=10, var_1_9=0] [L143] var_1_6 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_9=0] [L144] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_9=0] [L145] CALL assume_abort_if_not(var_1_6 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L145] RET assume_abort_if_not(var_1_6 <= 254) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L146] var_1_10 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L147] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L148] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L148] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L149] var_1_11 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L150] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L151] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L151] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L152] var_1_12 = __VERIFIER_nondet_uchar() [L153] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L153] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L154] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L154] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L155] var_1_13 = __VERIFIER_nondet_uchar() [L156] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L156] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L157] CALL assume_abort_if_not(var_1_13 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L157] RET assume_abort_if_not(var_1_13 <= 0) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L158] var_1_14 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_14 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L159] RET assume_abort_if_not(var_1_14 >= 1) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L160] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L160] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L161] var_1_19 = __VERIFIER_nondet_char() [L162] CALL assume_abort_if_not(var_1_19 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L162] RET assume_abort_if_not(var_1_19 >= -127) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L163] CALL assume_abort_if_not(var_1_19 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L163] RET assume_abort_if_not(var_1_19 <= 126) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L164] var_1_24 = __VERIFIER_nondet_double() [L165] CALL assume_abort_if_not((var_1_24 >= 0.0F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L165] RET assume_abort_if_not((var_1_24 >= 0.0F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L166] var_1_26 = __VERIFIER_nondet_ushort() [L167] CALL assume_abort_if_not(var_1_26 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32767, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32767, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L167] RET assume_abort_if_not(var_1_26 >= 32767) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32767, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L168] CALL assume_abort_if_not(var_1_26 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32767, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32767, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L168] RET assume_abort_if_not(var_1_26 <= 65535) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32767, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L169] var_1_27 = __VERIFIER_nondet_long() [L170] CALL assume_abort_if_not(var_1_27 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32767, var_1_27=1, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32767, var_1_27=1, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L170] RET assume_abort_if_not(var_1_27 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32767, var_1_27=1, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L171] CALL assume_abort_if_not(var_1_27 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32767, var_1_27=1, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32767, var_1_27=1, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L171] RET assume_abort_if_not(var_1_27 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32767, var_1_27=1, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L172] CALL assume_abort_if_not(var_1_27 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32767, var_1_27=1, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32767, var_1_27=1, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L172] RET assume_abort_if_not(var_1_27 != 0) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32767, var_1_27=1, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L173] var_1_30 = __VERIFIER_nondet_double() [L174] CALL assume_abort_if_not((var_1_30 >= -922337.2036854765600e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854765600e+12F && var_1_30 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32767, var_1_27=1, var_1_29=199/2, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32767, var_1_27=1, var_1_29=199/2, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L174] RET assume_abort_if_not((var_1_30 >= -922337.2036854765600e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854765600e+12F && var_1_30 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32767, var_1_27=1, var_1_29=199/2, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L175] var_1_33 = __VERIFIER_nondet_ushort() [L176] CALL assume_abort_if_not(var_1_33 >= 49150) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32767, var_1_27=1, var_1_29=199/2, var_1_31=4, var_1_32=10, var_1_33=49150, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32767, var_1_27=1, var_1_29=199/2, var_1_31=4, var_1_32=10, var_1_33=49150, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L176] RET assume_abort_if_not(var_1_33 >= 49150) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32767, var_1_27=1, var_1_29=199/2, var_1_31=4, var_1_32=10, var_1_33=49150, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L177] CALL assume_abort_if_not(var_1_33 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32767, var_1_27=1, var_1_29=199/2, var_1_31=4, var_1_32=10, var_1_33=49150, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32767, var_1_27=1, var_1_29=199/2, var_1_31=4, var_1_32=10, var_1_33=49150, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L177] RET assume_abort_if_not(var_1_33 <= 65534) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32767, var_1_27=1, var_1_29=199/2, var_1_31=4, var_1_32=10, var_1_33=49150, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L197] RET updateVariables() [L198] CALL step() [L59] signed long int stepLocal_7 = ((((((last_1_var_1_32) < (last_1_var_1_4)) ? (last_1_var_1_32) : (last_1_var_1_4))) < 0 ) ? -((((last_1_var_1_32) < (last_1_var_1_4)) ? (last_1_var_1_32) : (last_1_var_1_4))) : ((((last_1_var_1_32) < (last_1_var_1_4)) ? (last_1_var_1_32) : (last_1_var_1_4)))); VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, stepLocal_7=4, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32767, var_1_27=1, var_1_29=199/2, var_1_31=4, var_1_32=10, var_1_33=49150, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L60] COND TRUE stepLocal_7 >= ((last_1_var_1_22 * var_1_6) * last_1_var_1_15) [L61] var_1_31 = (last_1_var_1_32 + (1891941459u - last_1_var_1_15)) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32767, var_1_27=1, var_1_29=199/2, var_1_31=1892041469, var_1_32=10, var_1_33=49150, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L65] COND FALSE !(\read(last_1_var_1_9)) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32767, var_1_27=1, var_1_29=199/2, var_1_31=1892041469, var_1_32=10, var_1_33=49150, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L68] var_1_1 = ((((9.999999999999925E13) < ((var_1_2 + ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3)))))) ? (9.999999999999925E13) : ((var_1_2 + ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))))))) [L69] var_1_29 = ((((((((var_1_24) < (((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3))))) ? (var_1_24) : (((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3))))))) > (var_1_30)) ? (((((var_1_24) < (((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3))))) ? (var_1_24) : (((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3))))))) : (var_1_30))) [L70] unsigned char stepLocal_2 = var_1_10; VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, stepLocal_2=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=16, var_1_26=32767, var_1_27=1, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=49150, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L71] COND FALSE !(\read(var_1_5)) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, stepLocal_2=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=16, var_1_26=32767, var_1_27=1, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=49150, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L80] COND FALSE !(\read(var_1_9)) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, stepLocal_2=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=16, var_1_26=32767, var_1_27=1, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=49150, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L85] COND FALSE !((var_1_26 - var_1_32) <= (var_1_19 % var_1_27)) [L88] var_1_25 = ((((((((var_1_6) < (var_1_32)) ? (var_1_6) : (var_1_32)))) > (((((var_1_32) < (var_1_4)) ? (var_1_32) : (var_1_4))))) ? (((((var_1_6) < (var_1_32)) ? (var_1_6) : (var_1_32)))) : (((((var_1_32) < (var_1_4)) ? (var_1_32) : (var_1_4)))))) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, stepLocal_2=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=4, var_1_26=32767, var_1_27=1, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=49150, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L90] unsigned char stepLocal_1 = var_1_6 <= var_1_31; [L91] unsigned char stepLocal_0 = var_1_6; VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, stepLocal_0=0, stepLocal_1=1, stepLocal_2=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=4, var_1_26=32767, var_1_27=1, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=49150, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L92] COND FALSE !(stepLocal_0 > (var_1_25 * var_1_31)) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, stepLocal_1=1, stepLocal_2=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=4, var_1_26=32767, var_1_27=1, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=49150, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L97] COND FALSE !(var_1_3 <= (- var_1_7)) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, stepLocal_1=1, stepLocal_2=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=4, var_1_26=32767, var_1_27=1, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=49150, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L102] unsigned char stepLocal_3 = var_1_9; VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, stepLocal_1=1, stepLocal_2=0, stepLocal_3=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=4, var_1_26=32767, var_1_27=1, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=49150, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L103] COND FALSE !(var_1_3 != var_1_29) [L110] var_1_18 = var_1_19 VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, stepLocal_1=1, stepLocal_2=0, stepLocal_3=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=0, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=4, var_1_26=32767, var_1_27=1, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=49150, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L112] EXPR var_1_4 >> var_1_18 VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, stepLocal_1=1, stepLocal_2=0, stepLocal_3=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=0, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=4, var_1_26=32767, var_1_27=1, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=49150, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L112] COND FALSE !(var_1_6 >= (var_1_4 >> var_1_18)) [L115] signed char stepLocal_5 = var_1_18; [L116] signed char stepLocal_4 = var_1_18; VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, stepLocal_1=1, stepLocal_2=0, stepLocal_3=0, stepLocal_4=0, stepLocal_5=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=0, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=4, var_1_26=32767, var_1_27=1, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=49150, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L117] COND FALSE !(stepLocal_5 < var_1_19) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, stepLocal_1=1, stepLocal_2=0, stepLocal_3=0, stepLocal_4=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=0, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=4, var_1_26=32767, var_1_27=1, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=49150, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L120] COND FALSE !(((((last_1_var_1_20) < (var_1_6)) ? (last_1_var_1_20) : (var_1_6))) == stepLocal_4) [L123] var_1_20 = -10 VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, stepLocal_1=1, stepLocal_2=0, stepLocal_3=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=0, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-10, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=4, var_1_26=32767, var_1_27=1, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=49150, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L126] signed short int stepLocal_6 = var_1_20; VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, stepLocal_1=1, stepLocal_2=0, stepLocal_3=0, stepLocal_6=-10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=0, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-10, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=4, var_1_26=32767, var_1_27=1, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=49150, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L127] COND FALSE !(stepLocal_6 > ((((var_1_20) > (var_1_19)) ? (var_1_20) : (var_1_19)))) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, stepLocal_1=1, stepLocal_2=0, stepLocal_3=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=0, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-10, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=4, var_1_26=32767, var_1_27=1, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=49150, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L198] RET step() [L199] CALL, EXPR property() [L188] EXPR ((((var_1_1 == ((double) ((((9.999999999999925E13) < ((var_1_2 + ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3)))))) ? (9.999999999999925E13) : ((var_1_2 + ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))))))))) && (var_1_9 ? ((var_1_3 <= ((((499.25) < (999999.3)) ? (499.25) : (999999.3)))) ? (var_1_4 == ((unsigned char) var_1_6)) : 1) : 1)) && ((var_1_6 > (var_1_25 * var_1_31)) ? (((var_1_6 <= var_1_31) && var_1_9) ? (var_1_7 == ((float) var_1_3)) : 1) : 1)) && (var_1_5 ? ((var_1_11 || var_1_10) ? ((! (var_1_29 < var_1_2)) ? (var_1_9 == ((unsigned char) (var_1_12 || var_1_13))) : (var_1_9 == ((unsigned char) (var_1_11 && ((var_1_12 && var_1_13) || (! var_1_14)))))) : 1) : 1)) && ((var_1_6 >= (var_1_4 >> var_1_18)) ? (var_1_15 == ((signed long int) (((((var_1_4 + var_1_32)) < ((var_1_18 + (var_1_6 + var_1_18)))) ? ((var_1_4 + var_1_32)) : ((var_1_18 + (var_1_6 + var_1_18))))))) : 1) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=0, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-10, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=4, var_1_26=32767, var_1_27=1, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=49150, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L188-L189] return ((((((((((((var_1_1 == ((double) ((((9.999999999999925E13) < ((var_1_2 + ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3)))))) ? (9.999999999999925E13) : ((var_1_2 + ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))))))))) && (var_1_9 ? ((var_1_3 <= ((((499.25) < (999999.3)) ? (499.25) : (999999.3)))) ? (var_1_4 == ((unsigned char) var_1_6)) : 1) : 1)) && ((var_1_6 > (var_1_25 * var_1_31)) ? (((var_1_6 <= var_1_31) && var_1_9) ? (var_1_7 == ((float) var_1_3)) : 1) : 1)) && (var_1_5 ? ((var_1_11 || var_1_10) ? ((! (var_1_29 < var_1_2)) ? (var_1_9 == ((unsigned char) (var_1_12 || var_1_13))) : (var_1_9 == ((unsigned char) (var_1_11 && ((var_1_12 && var_1_13) || (! var_1_14)))))) : 1) : 1)) && ((var_1_6 >= (var_1_4 >> var_1_18)) ? (var_1_15 == ((signed long int) (((((var_1_4 + var_1_32)) < ((var_1_18 + (var_1_6 + var_1_18)))) ? ((var_1_4 + var_1_32)) : ((var_1_18 + (var_1_6 + var_1_18))))))) : 1)) && ((var_1_3 != var_1_29) ? (((var_1_32 <= var_1_31) && var_1_9) ? (var_1_18 == ((signed char) var_1_19)) : (var_1_18 == ((signed char) var_1_19))) : (var_1_18 == ((signed char) var_1_19)))) && ((var_1_18 < var_1_19) ? (var_1_20 == ((signed short int) (var_1_31 + var_1_19))) : ((((((last_1_var_1_20) < (var_1_6)) ? (last_1_var_1_20) : (var_1_6))) == var_1_18) ? (var_1_20 == ((signed short int) ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))) : (var_1_20 == ((signed short int) -10))))) && ((var_1_20 > ((((var_1_20) > (var_1_19)) ? (var_1_20) : (var_1_19)))) ? ((! var_1_12) ? (var_1_22 == ((signed long int) (var_1_31 - var_1_20))) : (var_1_22 == ((signed long int) 2))) : 1)) && ((var_1_3 <= (- var_1_7)) ? (var_1_9 ? (var_1_23 == ((double) (var_1_24 - 31.25))) : 1) : 1)) && (((var_1_26 - var_1_32) <= (var_1_19 % var_1_27)) ? (var_1_25 == ((unsigned short int) ((((var_1_6) > (((((var_1_32) > (var_1_32)) ? (var_1_32) : (var_1_32))))) ? (var_1_6) : (((((var_1_32) > (var_1_32)) ? (var_1_32) : (var_1_32)))))))) : (var_1_25 == ((unsigned short int) ((((((((var_1_6) < (var_1_32)) ? (var_1_6) : (var_1_32)))) > (((((var_1_32) < (var_1_4)) ? (var_1_32) : (var_1_4))))) ? (((((var_1_6) < (var_1_32)) ? (var_1_6) : (var_1_32)))) : (((((var_1_32) < (var_1_4)) ? (var_1_32) : (var_1_4)))))))))) && (var_1_29 == ((double) ((((((((var_1_24) < (((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3))))) ? (var_1_24) : (((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3))))))) > (var_1_30)) ? (((((var_1_24) < (((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3))))) ? (var_1_24) : (((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3))))))) : (var_1_30)))))) && (((((((((last_1_var_1_32) < (last_1_var_1_4)) ? (last_1_var_1_32) : (last_1_var_1_4))) < 0 ) ? -((((last_1_var_1_32) < (last_1_var_1_4)) ? (last_1_var_1_32) : (last_1_var_1_4))) : ((((last_1_var_1_32) < (last_1_var_1_4)) ? (last_1_var_1_32) : (last_1_var_1_4))))) >= ((last_1_var_1_22 * var_1_6) * last_1_var_1_15)) ? (var_1_31 == ((unsigned long int) (last_1_var_1_32 + (1891941459u - last_1_var_1_15)))) : (var_1_31 == ((unsigned long int) ((((((((last_1_var_1_15) < (last_1_var_1_4)) ? (last_1_var_1_15) : (last_1_var_1_4)))) > (var_1_26)) ? (((((last_1_var_1_15) < (last_1_var_1_4)) ? (last_1_var_1_15) : (last_1_var_1_4)))) : (var_1_26))))))) && (last_1_var_1_9 ? (var_1_32 == ((unsigned short int) ((var_1_33 - last_1_var_1_15) - var_1_6))) : 1) ; [L199] RET, EXPR property() [L199] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=0, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-10, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=4, var_1_26=32767, var_1_27=1, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=49150, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=0, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-10, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=4, var_1_26=32767, var_1_27=1, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=49150, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 86 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.1s, OverallIterations: 7, TraceHistogramMax: 27, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1245 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1226 mSDsluCounter, 3288 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2511 mSDsCounter, 353 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1849 IncrementalHoareTripleChecker+Invalid, 2202 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 353 mSolverCounterUnsat, 777 mSDtfsCounter, 1849 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 836 GetRequests, 754 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=896occurred in iteration=6, InterpolantAutomatonStates: 67, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 853 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 1748 NumberOfCodeBlocks, 1748 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1042 ConstructedInterpolants, 6 QuantifiedInterpolants, 6333 SizeOfPredicates, 19 NumberOfNonLiveVariables, 830 ConjunctsInSsa, 60 ConjunctsInUnsatCore, 6 InterpolantComputations, 4 PerfectInterpolantSequences, 8262/8424 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 03:53:15,427 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-94.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 211883c60ce0bb06b72e4a9000b7135ce379464c60607038b1e2cd858553e4b3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 03:53:17,318 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 03:53:17,373 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 03:53:17,379 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 03:53:17,380 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 03:53:17,400 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 03:53:17,401 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 03:53:17,401 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 03:53:17,402 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 03:53:17,402 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 03:53:17,402 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 03:53:17,403 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 03:53:17,403 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 03:53:17,403 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 03:53:17,404 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 03:53:17,404 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 03:53:17,404 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 03:53:17,405 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 03:53:17,405 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 03:53:17,405 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 03:53:17,405 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 03:53:17,406 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 03:53:17,406 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 03:53:17,407 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 03:53:17,407 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 03:53:17,407 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 03:53:17,407 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 03:53:17,407 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 03:53:17,408 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 03:53:17,408 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 03:53:17,408 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 03:53:17,408 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 03:53:17,408 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 03:53:17,409 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 03:53:17,409 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:53:17,409 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 03:53:17,409 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 03:53:17,410 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 03:53:17,410 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 03:53:17,410 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 03:53:17,410 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 03:53:17,412 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 03:53:17,412 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 03:53:17,412 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 03:53:17,412 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 03:53:17,412 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 -> 211883c60ce0bb06b72e4a9000b7135ce379464c60607038b1e2cd858553e4b3 [2024-10-13 03:53:17,686 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 03:53:17,705 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 03:53:17,707 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 03:53:17,708 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 03:53:17,709 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 03:53:17,710 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-94.i [2024-10-13 03:53:18,989 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 03:53:19,172 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 03:53:19,173 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-94.i [2024-10-13 03:53:19,182 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4826965b9/05f43fbf741c4f538c565328d90ce057/FLAG9289b3ab9 [2024-10-13 03:53:19,550 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4826965b9/05f43fbf741c4f538c565328d90ce057 [2024-10-13 03:53:19,552 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 03:53:19,553 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 03:53:19,554 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 03:53:19,554 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 03:53:19,558 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 03:53:19,558 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:53:19" (1/1) ... [2024-10-13 03:53:19,559 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14a5a765 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:53:19, skipping insertion in model container [2024-10-13 03:53:19,559 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:53:19" (1/1) ... [2024-10-13 03:53:19,587 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 03:53:19,734 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-94.i[916,929] [2024-10-13 03:53:19,819 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:53:19,836 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 03:53:19,849 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-94.i[916,929] [2024-10-13 03:53:19,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:53:19,898 INFO L204 MainTranslator]: Completed translation [2024-10-13 03:53:19,898 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:53:19 WrapperNode [2024-10-13 03:53:19,898 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 03:53:19,899 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 03:53:19,899 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 03:53:19,900 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 03:53:19,905 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:53:19" (1/1) ... [2024-10-13 03:53:19,923 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:53:19" (1/1) ... [2024-10-13 03:53:19,951 INFO L138 Inliner]: procedures = 27, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 199 [2024-10-13 03:53:19,952 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 03:53:19,952 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 03:53:19,954 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 03:53:19,954 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 03:53:19,965 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:53:19" (1/1) ... [2024-10-13 03:53:19,965 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:53:19" (1/1) ... [2024-10-13 03:53:19,975 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:53:19" (1/1) ... [2024-10-13 03:53:20,009 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 03:53:20,011 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:53:19" (1/1) ... [2024-10-13 03:53:20,012 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:53:19" (1/1) ... [2024-10-13 03:53:20,025 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:53:19" (1/1) ... [2024-10-13 03:53:20,029 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:53:19" (1/1) ... [2024-10-13 03:53:20,031 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:53:19" (1/1) ... [2024-10-13 03:53:20,034 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:53:19" (1/1) ... [2024-10-13 03:53:20,041 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 03:53:20,042 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 03:53:20,042 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 03:53:20,042 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 03:53:20,043 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:53:19" (1/1) ... [2024-10-13 03:53:20,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:53:20,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:53:20,075 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 03:53:20,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 03:53:20,114 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 03:53:20,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 03:53:20,115 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 03:53:20,115 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 03:53:20,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 03:53:20,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 03:53:20,216 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 03:53:20,218 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 03:53:23,376 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-10-13 03:53:23,376 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 03:53:23,426 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 03:53:23,426 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 03:53:23,427 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:53:23 BoogieIcfgContainer [2024-10-13 03:53:23,427 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 03:53:23,430 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 03:53:23,431 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 03:53:23,433 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 03:53:23,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 03:53:19" (1/3) ... [2024-10-13 03:53:23,434 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bbb841c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:53:23, skipping insertion in model container [2024-10-13 03:53:23,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:53:19" (2/3) ... [2024-10-13 03:53:23,435 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bbb841c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:53:23, skipping insertion in model container [2024-10-13 03:53:23,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:53:23" (3/3) ... [2024-10-13 03:53:23,436 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-94.i [2024-10-13 03:53:23,449 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 03:53:23,449 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 03:53:23,498 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 03:53:23,504 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;@4e6c35bb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 03:53:23,504 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 03:53:23,509 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 49 states have (on average 1.489795918367347) internal successors, (73), 50 states have internal predecessors, (73), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-13 03:53:23,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-13 03:53:23,533 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:53:23,534 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:53:23,534 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:53:23,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:53:23,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1114480480, now seen corresponding path program 1 times [2024-10-13 03:53:23,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:53:23,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1940873020] [2024-10-13 03:53:23,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:53:23,556 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 03:53:23,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:53:23,560 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 03:53:23,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 03:53:23,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:23,980 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 03:53:23,988 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:53:24,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 712 proven. 0 refuted. 0 times theorem prover too weak. 692 trivial. 0 not checked. [2024-10-13 03:53:24,023 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 03:53:24,024 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 03:53:24,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1940873020] [2024-10-13 03:53:24,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1940873020] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:53:24,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:53:24,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 03:53:24,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191529442] [2024-10-13 03:53:24,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:53:24,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 03:53:24,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 03:53:24,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 03:53:24,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:53:24,049 INFO L87 Difference]: Start difference. First operand has 79 states, 49 states have (on average 1.489795918367347) internal successors, (73), 50 states have internal predecessors, (73), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-13 03:53:25,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 03:53:26,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:53:26,022 INFO L93 Difference]: Finished difference Result 157 states and 280 transitions. [2024-10-13 03:53:26,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 03:53:26,024 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 171 [2024-10-13 03:53:26,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:53:26,030 INFO L225 Difference]: With dead ends: 157 [2024-10-13 03:53:26,030 INFO L226 Difference]: Without dead ends: 77 [2024-10-13 03:53:26,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:53:26,034 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-13 03:53:26,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-13 03:53:26,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-13 03:53:26,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-10-13 03:53:26,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 48 states have (on average 1.4166666666666667) internal successors, (68), 48 states have internal predecessors, (68), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-13 03:53:26,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 122 transitions. [2024-10-13 03:53:26,073 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 122 transitions. Word has length 171 [2024-10-13 03:53:26,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:53:26,074 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 122 transitions. [2024-10-13 03:53:26,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-13 03:53:26,074 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 122 transitions. [2024-10-13 03:53:26,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-13 03:53:26,080 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:53:26,080 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:53:26,094 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 03:53:26,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 03:53:26,281 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:53:26,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:53:26,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1616248670, now seen corresponding path program 1 times [2024-10-13 03:53:26,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:53:26,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1055826379] [2024-10-13 03:53:26,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:53:26,283 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 03:53:26,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:53:26,284 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 03:53:26,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 03:53:26,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:26,655 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 03:53:26,660 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:53:27,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-13 03:53:27,695 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 03:53:27,695 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 03:53:27,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1055826379] [2024-10-13 03:53:27,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1055826379] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:53:27,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:53:27,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 03:53:27,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350274803] [2024-10-13 03:53:27,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:53:27,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 03:53:27,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 03:53:27,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 03:53:27,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 03:53:27,699 INFO L87 Difference]: Start difference. First operand 77 states and 122 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-13 03:53:31,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.08s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 03:53:34,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.85s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 03:53:36,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.65s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 03:53:36,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:53:36,893 INFO L93 Difference]: Finished difference Result 278 states and 441 transitions. [2024-10-13 03:53:36,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 03:53:36,894 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 171 [2024-10-13 03:53:36,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:53:36,897 INFO L225 Difference]: With dead ends: 278 [2024-10-13 03:53:36,898 INFO L226 Difference]: Without dead ends: 202 [2024-10-13 03:53:36,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 03:53:36,900 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 176 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2024-10-13 03:53:36,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 340 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 9.1s Time] [2024-10-13 03:53:36,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-10-13 03:53:36,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 149. [2024-10-13 03:53:36,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 92 states have (on average 1.3695652173913044) internal successors, (126), 92 states have internal predecessors, (126), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-13 03:53:36,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 234 transitions. [2024-10-13 03:53:36,934 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 234 transitions. Word has length 171 [2024-10-13 03:53:36,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:53:36,935 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 234 transitions. [2024-10-13 03:53:36,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-13 03:53:36,935 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 234 transitions. [2024-10-13 03:53:36,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-13 03:53:36,937 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:53:36,937 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:53:36,952 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-13 03:53:37,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 03:53:37,138 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:53:37,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:53:37,139 INFO L85 PathProgramCache]: Analyzing trace with hash 684573920, now seen corresponding path program 1 times [2024-10-13 03:53:37,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:53:37,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2113321706] [2024-10-13 03:53:37,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:53:37,140 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 03:53:37,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:53:37,142 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 03:53:37,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 03:53:37,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:37,474 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 03:53:37,481 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:53:37,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-13 03:53:37,551 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 03:53:37,551 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 03:53:37,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2113321706] [2024-10-13 03:53:37,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2113321706] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:53:37,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:53:37,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 03:53:37,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909504231] [2024-10-13 03:53:37,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:53:37,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 03:53:37,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 03:53:37,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 03:53:37,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 03:53:37,555 INFO L87 Difference]: Start difference. First operand 149 states and 234 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-13 03:53:39,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 03:53:39,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:53:39,868 INFO L93 Difference]: Finished difference Result 331 states and 515 transitions. [2024-10-13 03:53:39,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 03:53:39,871 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 171 [2024-10-13 03:53:39,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:53:39,873 INFO L225 Difference]: With dead ends: 331 [2024-10-13 03:53:39,873 INFO L226 Difference]: Without dead ends: 183 [2024-10-13 03:53:39,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 03:53:39,879 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 59 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-13 03:53:39,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 361 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-13 03:53:39,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-10-13 03:53:39,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 182. [2024-10-13 03:53:39,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 107 states have (on average 1.2990654205607477) internal successors, (139), 108 states have internal predecessors, (139), 70 states have call successors, (70), 4 states have call predecessors, (70), 4 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-13 03:53:39,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 279 transitions. [2024-10-13 03:53:39,914 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 279 transitions. Word has length 171 [2024-10-13 03:53:39,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:53:39,915 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 279 transitions. [2024-10-13 03:53:39,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-13 03:53:39,915 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 279 transitions. [2024-10-13 03:53:39,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-13 03:53:39,917 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:53:39,917 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:53:39,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-13 03:53:40,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 03:53:40,125 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:53:40,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:53:40,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1451857573, now seen corresponding path program 1 times [2024-10-13 03:53:40,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:53:40,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1310543728] [2024-10-13 03:53:40,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:53:40,126 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 03:53:40,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:53:40,129 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 03:53:40,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-13 03:53:40,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:53:40,703 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-10-13 03:53:40,711 INFO L278 TraceCheckSpWp]: Computing forward predicates...