./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-8.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_fillercode_fillercodestructure_filler-pr-ci_file-8.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 3030444f88f9a17418da1dc67b4b4ded6b77914f13db39467d146bf41ea08d3d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 02:14:17,290 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 02:14:17,361 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 02:14:17,369 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 02:14:17,369 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 02:14:17,393 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 02:14:17,393 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 02:14:17,395 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 02:14:17,395 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 02:14:17,396 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 02:14:17,396 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 02:14:17,397 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 02:14:17,397 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 02:14:17,399 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 02:14:17,400 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 02:14:17,400 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 02:14:17,400 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 02:14:17,401 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 02:14:17,401 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 02:14:17,401 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 02:14:17,401 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 02:14:17,405 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 02:14:17,405 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 02:14:17,406 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 02:14:17,406 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 02:14:17,406 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 02:14:17,406 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 02:14:17,406 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 02:14:17,407 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 02:14:17,407 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 02:14:17,407 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 02:14:17,407 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 02:14:17,407 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:14:17,408 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 02:14:17,408 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 02:14:17,408 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 02:14:17,409 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 02:14:17,409 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 02:14:17,410 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 02:14:17,410 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 02:14:17,410 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 02:14:17,411 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 02:14:17,411 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 -> 3030444f88f9a17418da1dc67b4b4ded6b77914f13db39467d146bf41ea08d3d [2024-10-13 02:14:17,658 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 02:14:17,685 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 02:14:17,688 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 02:14:17,689 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 02:14:17,690 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 02:14:17,691 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-8.i [2024-10-13 02:14:19,155 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 02:14:19,366 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 02:14:19,367 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-8.i [2024-10-13 02:14:19,375 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7316d476c/5e2fee2921db44108f4424efd445a03c/FLAG821a2fd95 [2024-10-13 02:14:19,387 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7316d476c/5e2fee2921db44108f4424efd445a03c [2024-10-13 02:14:19,390 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 02:14:19,391 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 02:14:19,394 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 02:14:19,394 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 02:14:19,400 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 02:14:19,400 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:14:19" (1/1) ... [2024-10-13 02:14:19,401 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a733e38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:14:19, skipping insertion in model container [2024-10-13 02:14:19,401 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:14:19" (1/1) ... [2024-10-13 02:14:19,433 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 02:14:19,589 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-8.i[918,931] [2024-10-13 02:14:19,652 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:14:19,664 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 02:14:19,680 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-8.i[918,931] [2024-10-13 02:14:19,729 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:14:19,781 INFO L204 MainTranslator]: Completed translation [2024-10-13 02:14:19,787 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:14:19 WrapperNode [2024-10-13 02:14:19,787 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 02:14:19,788 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 02:14:19,788 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 02:14:19,788 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 02:14:19,796 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:14:19" (1/1) ... [2024-10-13 02:14:19,834 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:14:19" (1/1) ... [2024-10-13 02:14:19,880 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 182 [2024-10-13 02:14:19,881 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 02:14:19,882 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 02:14:19,882 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 02:14:19,882 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 02:14:19,896 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:14:19" (1/1) ... [2024-10-13 02:14:19,896 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:14:19" (1/1) ... [2024-10-13 02:14:19,900 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:14:19" (1/1) ... [2024-10-13 02:14:19,940 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 02:14:19,940 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:14:19" (1/1) ... [2024-10-13 02:14:19,941 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:14:19" (1/1) ... [2024-10-13 02:14:19,963 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:14:19" (1/1) ... [2024-10-13 02:14:19,970 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:14:19" (1/1) ... [2024-10-13 02:14:19,979 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:14:19" (1/1) ... [2024-10-13 02:14:19,982 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:14:19" (1/1) ... [2024-10-13 02:14:19,993 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 02:14:19,994 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 02:14:19,994 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 02:14:19,995 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 02:14:19,995 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:14:19" (1/1) ... [2024-10-13 02:14:20,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:14:20,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:14:20,041 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 02:14:20,044 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 02:14:20,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 02:14:20,095 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 02:14:20,096 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 02:14:20,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 02:14:20,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 02:14:20,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 02:14:20,184 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 02:14:20,186 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 02:14:20,655 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-13 02:14:20,655 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 02:14:20,707 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 02:14:20,707 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 02:14:20,708 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:14:20 BoogieIcfgContainer [2024-10-13 02:14:20,708 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 02:14:20,711 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 02:14:20,711 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 02:14:20,715 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 02:14:20,715 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 02:14:19" (1/3) ... [2024-10-13 02:14:20,716 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@335a4aa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:14:20, skipping insertion in model container [2024-10-13 02:14:20,717 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:14:19" (2/3) ... [2024-10-13 02:14:20,717 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@335a4aa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:14:20, skipping insertion in model container [2024-10-13 02:14:20,717 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:14:20" (3/3) ... [2024-10-13 02:14:20,718 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-8.i [2024-10-13 02:14:20,735 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 02:14:20,735 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 02:14:20,807 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 02:14:20,816 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;@15e0d1ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 02:14:20,817 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 02:14:20,821 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 52 states have (on average 1.6346153846153846) internal successors, (85), 53 states have internal predecessors, (85), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-13 02:14:20,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-13 02:14:20,836 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:14:20,837 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:14:20,837 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:14:20,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:14:20,843 INFO L85 PathProgramCache]: Analyzing trace with hash 181634471, now seen corresponding path program 1 times [2024-10-13 02:14:20,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:14:20,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831812251] [2024-10-13 02:14:20,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:14:20,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:14:20,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:21,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:14:21,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:21,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:14:21,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:21,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 02:14:21,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:21,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:14:21,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:21,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:14:21,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:21,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 02:14:21,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:21,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:14:21,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:21,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:14:21,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:21,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 02:14:21,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:21,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:14:21,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:21,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 02:14:21,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:21,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:14:21,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:21,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 02:14:21,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:21,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:14:21,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:21,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 02:14:21,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:21,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:14:21,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:21,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 02:14:21,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:21,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:14:21,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:21,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 02:14:21,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:21,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 02:14:21,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:21,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 02:14:21,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:21,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 02:14:21,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:21,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 02:14:21,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:21,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-13 02:14:21,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:14:21,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831812251] [2024-10-13 02:14:21,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831812251] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:14:21,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:14:21,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 02:14:21,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894509143] [2024-10-13 02:14:21,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:14:21,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 02:14:21,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:14:21,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 02:14:21,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 02:14:21,362 INFO L87 Difference]: Start difference. First operand has 78 states, 52 states have (on average 1.6346153846153846) internal successors, (85), 53 states have internal predecessors, (85), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-13 02:14:21,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:14:21,415 INFO L93 Difference]: Finished difference Result 153 states and 283 transitions. [2024-10-13 02:14:21,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 02:14:21,419 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 146 [2024-10-13 02:14:21,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:14:21,427 INFO L225 Difference]: With dead ends: 153 [2024-10-13 02:14:21,429 INFO L226 Difference]: Without dead ends: 76 [2024-10-13 02:14:21,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 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 02:14:21,442 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 02:14:21,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 122 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 02:14:21,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-13 02:14:21,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-10-13 02:14:21,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 51 states have (on average 1.5490196078431373) internal successors, (79), 51 states have internal predecessors, (79), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-13 02:14:21,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 125 transitions. [2024-10-13 02:14:21,530 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 125 transitions. Word has length 146 [2024-10-13 02:14:21,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:14:21,532 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 125 transitions. [2024-10-13 02:14:21,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-13 02:14:21,533 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 125 transitions. [2024-10-13 02:14:21,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-13 02:14:21,540 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:14:21,541 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:14:21,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 02:14:21,541 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:14:21,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:14:21,542 INFO L85 PathProgramCache]: Analyzing trace with hash 165696993, now seen corresponding path program 1 times [2024-10-13 02:14:21,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:14:21,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668347569] [2024-10-13 02:14:21,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:14:21,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:14:21,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:22,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:14:22,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:22,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:14:22,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:22,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 02:14:23,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:23,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:14:23,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:23,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:14:23,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:23,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 02:14:23,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:23,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:14:23,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:23,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:14:23,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:23,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 02:14:23,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:23,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:14:23,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:23,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 02:14:23,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:23,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:14:23,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:23,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 02:14:23,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:23,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:14:23,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:23,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 02:14:23,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:23,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:14:23,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:23,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 02:14:23,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:23,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:14:23,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:23,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 02:14:23,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:23,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 02:14:23,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:23,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 02:14:23,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:23,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 02:14:23,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:23,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 02:14:23,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:23,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 45 proven. 21 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-10-13 02:14:23,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:14:23,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668347569] [2024-10-13 02:14:23,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668347569] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 02:14:23,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1261148503] [2024-10-13 02:14:23,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:14:23,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 02:14:23,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:14:23,229 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 02:14:23,232 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 02:14:23,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:23,565 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-13 02:14:23,577 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:14:24,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 531 proven. 57 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2024-10-13 02:14:24,391 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 02:14:25,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 108 proven. 21 refuted. 0 times theorem prover too weak. 883 trivial. 0 not checked. [2024-10-13 02:14:25,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1261148503] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 02:14:25,014 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 02:14:25,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16, 11] total 29 [2024-10-13 02:14:25,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093793397] [2024-10-13 02:14:25,015 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 02:14:25,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-13 02:14:25,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:14:25,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-13 02:14:25,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=661, Unknown=0, NotChecked=0, Total=812 [2024-10-13 02:14:25,020 INFO L87 Difference]: Start difference. First operand 76 states and 125 transitions. Second operand has 29 states, 29 states have (on average 3.103448275862069) internal successors, (90), 27 states have internal predecessors, (90), 8 states have call successors, (53), 4 states have call predecessors, (53), 8 states have return successors, (55), 9 states have call predecessors, (55), 8 states have call successors, (55) [2024-10-13 02:14:37,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:14:37,838 INFO L93 Difference]: Finished difference Result 1589 states and 2398 transitions. [2024-10-13 02:14:37,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 241 states. [2024-10-13 02:14:37,839 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.103448275862069) internal successors, (90), 27 states have internal predecessors, (90), 8 states have call successors, (53), 4 states have call predecessors, (53), 8 states have return successors, (55), 9 states have call predecessors, (55), 8 states have call successors, (55) Word has length 146 [2024-10-13 02:14:37,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:14:37,861 INFO L225 Difference]: With dead ends: 1589 [2024-10-13 02:14:37,861 INFO L226 Difference]: Without dead ends: 1514 [2024-10-13 02:14:37,886 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 598 GetRequests, 343 SyntacticMatches, 1 SemanticMatches, 254 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28068 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=9580, Invalid=55700, Unknown=0, NotChecked=0, Total=65280 [2024-10-13 02:14:37,888 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 4024 mSDsluCounter, 1330 mSDsCounter, 0 mSdLazyCounter, 2695 mSolverCounterSat, 2096 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4055 SdHoareTripleChecker+Valid, 1504 SdHoareTripleChecker+Invalid, 4791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2096 IncrementalHoareTripleChecker+Valid, 2695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-10-13 02:14:37,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4055 Valid, 1504 Invalid, 4791 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2096 Valid, 2695 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-10-13 02:14:37,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2024-10-13 02:14:38,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 327. [2024-10-13 02:14:38,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 242 states have (on average 1.5041322314049588) internal successors, (364), 242 states have internal predecessors, (364), 69 states have call successors, (69), 15 states have call predecessors, (69), 15 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2024-10-13 02:14:38,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 502 transitions. [2024-10-13 02:14:38,047 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 502 transitions. Word has length 146 [2024-10-13 02:14:38,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:14:38,049 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 502 transitions. [2024-10-13 02:14:38,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.103448275862069) internal successors, (90), 27 states have internal predecessors, (90), 8 states have call successors, (53), 4 states have call predecessors, (53), 8 states have return successors, (55), 9 states have call predecessors, (55), 8 states have call successors, (55) [2024-10-13 02:14:38,049 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 502 transitions. [2024-10-13 02:14:38,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-13 02:14:38,052 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:14:38,052 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:14:38,072 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 02:14:38,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 02:14:38,257 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:14:38,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:14:38,258 INFO L85 PathProgramCache]: Analyzing trace with hash -2007441846, now seen corresponding path program 1 times [2024-10-13 02:14:38,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:14:38,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512339479] [2024-10-13 02:14:38,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:14:38,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:14:38,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:38,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:14:38,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:38,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:14:38,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:38,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 02:14:38,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:38,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:14:38,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:38,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:14:38,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:38,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 02:14:38,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:38,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:14:38,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:38,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:14:38,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:38,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 02:14:38,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:38,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:14:38,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:38,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 02:14:38,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:38,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:14:38,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:38,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 02:14:38,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:38,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:14:38,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:38,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 02:14:38,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:38,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:14:38,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:38,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 02:14:38,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:38,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:14:38,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:38,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 02:14:38,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:38,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 02:14:38,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:38,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 02:14:38,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:38,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 02:14:38,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:38,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 02:14:38,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:38,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 132 proven. 48 refuted. 0 times theorem prover too weak. 832 trivial. 0 not checked. [2024-10-13 02:14:38,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:14:39,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512339479] [2024-10-13 02:14:39,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512339479] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 02:14:39,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331771538] [2024-10-13 02:14:39,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:14:39,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 02:14:39,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:14:39,005 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 02:14:39,006 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 02:14:39,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:39,115 INFO L255 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-13 02:14:39,120 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:14:39,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 590 proven. 48 refuted. 0 times theorem prover too weak. 374 trivial. 0 not checked. [2024-10-13 02:14:39,520 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 02:14:40,207 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 132 proven. 57 refuted. 0 times theorem prover too weak. 823 trivial. 0 not checked. [2024-10-13 02:14:40,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1331771538] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 02:14:40,208 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 02:14:40,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 12] total 23 [2024-10-13 02:14:40,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178703539] [2024-10-13 02:14:40,209 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 02:14:40,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-13 02:14:40,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:14:40,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-13 02:14:40,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=379, Unknown=0, NotChecked=0, Total=506 [2024-10-13 02:14:40,212 INFO L87 Difference]: Start difference. First operand 327 states and 502 transitions. Second operand has 23 states, 23 states have (on average 3.3043478260869565) internal successors, (76), 22 states have internal predecessors, (76), 7 states have call successors, (40), 4 states have call predecessors, (40), 9 states have return successors, (42), 7 states have call predecessors, (42), 7 states have call successors, (42) [2024-10-13 02:14:42,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:14:42,143 INFO L93 Difference]: Finished difference Result 1093 states and 1634 transitions. [2024-10-13 02:14:42,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-10-13 02:14:42,145 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.3043478260869565) internal successors, (76), 22 states have internal predecessors, (76), 7 states have call successors, (40), 4 states have call predecessors, (40), 9 states have return successors, (42), 7 states have call predecessors, (42), 7 states have call successors, (42) Word has length 147 [2024-10-13 02:14:42,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:14:42,150 INFO L225 Difference]: With dead ends: 1093 [2024-10-13 02:14:42,150 INFO L226 Difference]: Without dead ends: 767 [2024-10-13 02:14:42,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 328 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 886 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=809, Invalid=2383, Unknown=0, NotChecked=0, Total=3192 [2024-10-13 02:14:42,154 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 521 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 312 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 873 SdHoareTripleChecker+Invalid, 1176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 312 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 02:14:42,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 873 Invalid, 1176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [312 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 02:14:42,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2024-10-13 02:14:42,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 366. [2024-10-13 02:14:42,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 272 states have (on average 1.4485294117647058) internal successors, (394), 272 states have internal predecessors, (394), 69 states have call successors, (69), 24 states have call predecessors, (69), 24 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2024-10-13 02:14:42,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 532 transitions. [2024-10-13 02:14:42,240 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 532 transitions. Word has length 147 [2024-10-13 02:14:42,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:14:42,241 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 532 transitions. [2024-10-13 02:14:42,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.3043478260869565) internal successors, (76), 22 states have internal predecessors, (76), 7 states have call successors, (40), 4 states have call predecessors, (40), 9 states have return successors, (42), 7 states have call predecessors, (42), 7 states have call successors, (42) [2024-10-13 02:14:42,242 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 532 transitions. [2024-10-13 02:14:42,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-13 02:14:42,247 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:14:42,247 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:14:42,268 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 02:14:42,448 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,SelfDestructingSolverStorable2 [2024-10-13 02:14:42,449 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:14:42,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:14:42,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1007661772, now seen corresponding path program 1 times [2024-10-13 02:14:42,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:14:42,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463252246] [2024-10-13 02:14:42,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:14:42,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:14:42,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:42,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:14:42,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:42,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:14:42,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:42,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 02:14:42,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:42,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:14:42,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:42,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:14:42,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:42,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 02:14:42,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:42,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:14:42,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:42,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:14:42,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:42,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 02:14:42,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:42,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:14:42,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:42,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 02:14:42,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:42,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:14:42,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:42,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 02:14:42,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:42,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:14:42,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:42,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 02:14:42,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:42,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:14:42,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:42,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 02:14:42,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:42,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:14:42,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:42,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 02:14:42,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:42,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 02:14:42,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:42,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 02:14:42,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:42,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 02:14:42,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:42,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 02:14:42,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:42,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-13 02:14:42,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:14:42,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463252246] [2024-10-13 02:14:42,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463252246] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:14:42,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:14:42,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 02:14:42,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843124112] [2024-10-13 02:14:42,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:14:42,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 02:14:42,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:14:42,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 02:14:42,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:14:42,566 INFO L87 Difference]: Start difference. First operand 366 states and 532 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-13 02:14:42,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:14:42,706 INFO L93 Difference]: Finished difference Result 919 states and 1374 transitions. [2024-10-13 02:14:42,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 02:14:42,707 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 147 [2024-10-13 02:14:42,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:14:42,711 INFO L225 Difference]: With dead ends: 919 [2024-10-13 02:14:42,711 INFO L226 Difference]: Without dead ends: 554 [2024-10-13 02:14:42,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:14:42,713 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 74 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 02:14:42,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 247 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 02:14:42,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2024-10-13 02:14:42,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 549. [2024-10-13 02:14:42,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 431 states have (on average 1.4988399071925753) internal successors, (646), 434 states have internal predecessors, (646), 90 states have call successors, (90), 27 states have call predecessors, (90), 27 states have return successors, (90), 87 states have call predecessors, (90), 90 states have call successors, (90) [2024-10-13 02:14:42,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 826 transitions. [2024-10-13 02:14:42,810 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 826 transitions. Word has length 147 [2024-10-13 02:14:42,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:14:42,813 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 826 transitions. [2024-10-13 02:14:42,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-13 02:14:42,814 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 826 transitions. [2024-10-13 02:14:42,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-13 02:14:42,818 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:14:42,818 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:14:42,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 02:14:42,819 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:14:42,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:14:42,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1944028943, now seen corresponding path program 1 times [2024-10-13 02:14:42,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:14:42,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339544741] [2024-10-13 02:14:42,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:14:42,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:14:42,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 02:14:42,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1400646723] [2024-10-13 02:14:42,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:14:42,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 02:14:42,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:14:42,887 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 02:14:42,888 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 02:14:43,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 02:14:43,107 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 02:14:43,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 02:14:43,303 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 02:14:43,304 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 02:14:43,306 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 02:14:43,319 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-13 02:14:43,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 02:14:43,513 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-13 02:14:43,623 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 02:14:43,629 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 02:14:43 BoogieIcfgContainer [2024-10-13 02:14:43,629 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 02:14:43,629 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 02:14:43,629 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 02:14:43,629 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 02:14:43,630 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:14:20" (3/4) ... [2024-10-13 02:14:43,634 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 02:14:43,636 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 02:14:43,636 INFO L158 Benchmark]: Toolchain (without parser) took 24245.45ms. Allocated memory was 176.2MB in the beginning and 348.1MB in the end (delta: 172.0MB). Free memory was 108.4MB in the beginning and 146.2MB in the end (delta: -37.7MB). Peak memory consumption was 134.9MB. Max. memory is 16.1GB. [2024-10-13 02:14:43,636 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 109.1MB. Free memory is still 71.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 02:14:43,637 INFO L158 Benchmark]: CACSL2BoogieTranslator took 393.29ms. Allocated memory is still 176.2MB. Free memory was 108.3MB in the beginning and 148.4MB in the end (delta: -40.2MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. [2024-10-13 02:14:43,637 INFO L158 Benchmark]: Boogie Procedure Inliner took 93.07ms. Allocated memory is still 176.2MB. Free memory was 148.4MB in the beginning and 142.6MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 02:14:43,637 INFO L158 Benchmark]: Boogie Preprocessor took 111.43ms. Allocated memory is still 176.2MB. Free memory was 142.6MB in the beginning and 134.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-13 02:14:43,637 INFO L158 Benchmark]: RCFGBuilder took 713.99ms. Allocated memory is still 176.2MB. Free memory was 134.2MB in the beginning and 99.2MB in the end (delta: 35.0MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-10-13 02:14:43,638 INFO L158 Benchmark]: TraceAbstraction took 22917.75ms. Allocated memory was 176.2MB in the beginning and 348.1MB in the end (delta: 172.0MB). Free memory was 98.5MB in the beginning and 146.2MB in the end (delta: -47.6MB). Peak memory consumption was 125.7MB. Max. memory is 16.1GB. [2024-10-13 02:14:43,638 INFO L158 Benchmark]: Witness Printer took 6.48ms. Allocated memory is still 348.1MB. Free memory is still 146.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 02:14:43,640 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.16ms. Allocated memory is still 109.1MB. Free memory is still 71.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 393.29ms. Allocated memory is still 176.2MB. Free memory was 108.3MB in the beginning and 148.4MB in the end (delta: -40.2MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 93.07ms. Allocated memory is still 176.2MB. Free memory was 148.4MB in the beginning and 142.6MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 111.43ms. Allocated memory is still 176.2MB. Free memory was 142.6MB in the beginning and 134.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 713.99ms. Allocated memory is still 176.2MB. Free memory was 134.2MB in the beginning and 99.2MB in the end (delta: 35.0MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 22917.75ms. Allocated memory was 176.2MB in the beginning and 348.1MB in the end (delta: 172.0MB). Free memory was 98.5MB in the beginning and 146.2MB in the end (delta: -47.6MB). Peak memory consumption was 125.7MB. Max. memory is 16.1GB. * Witness Printer took 6.48ms. Allocated memory is still 348.1MB. Free memory is still 146.2MB. 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 178, overapproximation of someBinaryDOUBLEComparisonOperation at line 178, overapproximation of someBinaryArithmeticFLOAToperation at line 53, overapproximation of someUnaryFLOAToperation at line 109. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 999999999.675; [L23] signed long int var_1_4 = -5; [L24] float var_1_5 = 7.875; [L25] float var_1_6 = 99.04; [L26] signed long int var_1_7 = -2; [L27] unsigned long int var_1_9 = 1; [L28] double var_1_10 = 63.25; [L29] unsigned char var_1_11 = 0; [L30] unsigned short int var_1_13 = 0; [L31] unsigned short int var_1_15 = 17766; [L32] unsigned short int var_1_16 = 28149; [L33] unsigned char var_1_19 = 4; [L34] unsigned char var_1_20 = 50; [L35] unsigned char var_1_21 = 64; [L36] unsigned char var_1_22 = 50; [L37] unsigned char var_1_23 = 5; [L38] unsigned char var_1_24 = 128; [L39] signed long int var_1_25 = -16; [L40] unsigned char var_1_26 = 0; [L41] signed short int var_1_27 = -4; [L42] unsigned short int var_1_33 = 2; [L43] signed long int var_1_36 = -1; [L44] float var_1_38 = 256.7; [L45] unsigned long int var_1_40 = 10; [L46] double var_1_42 = 100.5; [L47] signed char var_1_45 = 8; [L48] unsigned short int last_1_var_1_13 = 0; [L182] isInitial = 1 [L183] FCALL initially() [L184] COND TRUE 1 [L185] CALL updateLastVariables() [L175] last_1_var_1_13 = var_1_13 [L185] RET updateLastVariables() [L186] CALL updateVariables() [L138] var_1_4 = __VERIFIER_nondet_long() [L139] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L139] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L140] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L140] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L141] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L141] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L142] var_1_5 = __VERIFIER_nondet_float() [L143] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L143] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L144] var_1_6 = __VERIFIER_nondet_float() [L145] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L145] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L146] var_1_10 = __VERIFIER_nondet_double() [L147] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L147] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L148] CALL assume_abort_if_not(var_1_10 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L148] RET assume_abort_if_not(var_1_10 != 0.0F) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [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_13=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L150] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_13=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L151] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L151] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L152] var_1_15 = __VERIFIER_nondet_ushort() [L153] CALL assume_abort_if_not(var_1_15 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L153] RET assume_abort_if_not(var_1_15 >= 16383) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L154] CALL assume_abort_if_not(var_1_15 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L154] RET assume_abort_if_not(var_1_15 <= 32767) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L155] var_1_16 = __VERIFIER_nondet_ushort() [L156] CALL assume_abort_if_not(var_1_16 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L156] RET assume_abort_if_not(var_1_16 >= 16383) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L157] CALL assume_abort_if_not(var_1_16 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L157] RET assume_abort_if_not(var_1_16 <= 32767) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L158] var_1_20 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_20 >= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-193, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-193, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L159] RET assume_abort_if_not(var_1_20 >= 32) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-193, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L160] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-193, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-193, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L160] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-193, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L161] var_1_21 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_21 >= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-193, var_1_21=-129, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-193, var_1_21=-129, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L162] RET assume_abort_if_not(var_1_21 >= 64) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-193, var_1_21=-129, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L163] CALL assume_abort_if_not(var_1_21 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-193, var_1_21=-129, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-193, var_1_21=-129, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L163] RET assume_abort_if_not(var_1_21 <= 127) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-193, var_1_21=-129, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L164] var_1_22 = __VERIFIER_nondet_uchar() [L165] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-193, var_1_21=-129, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-193, var_1_21=-129, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L165] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-193, var_1_21=-129, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L166] CALL assume_abort_if_not(var_1_22 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-193, var_1_21=-129, var_1_22=0, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-193, var_1_21=-129, var_1_22=0, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L166] RET assume_abort_if_not(var_1_22 <= 64) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-193, var_1_21=-129, var_1_22=0, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L167] var_1_23 = __VERIFIER_nondet_uchar() [L168] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-193, var_1_21=-129, var_1_22=0, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-193, var_1_21=-129, var_1_22=0, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L168] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-193, var_1_21=-129, var_1_22=0, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L169] CALL assume_abort_if_not(var_1_23 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-193, var_1_21=-129, var_1_22=0, var_1_23=256, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-193, var_1_21=-129, var_1_22=0, var_1_23=256, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L169] RET assume_abort_if_not(var_1_23 <= 63) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-193, var_1_21=-129, var_1_22=0, var_1_23=256, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L170] var_1_24 = __VERIFIER_nondet_uchar() [L171] CALL assume_abort_if_not(var_1_24 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-193, var_1_21=-129, var_1_22=0, var_1_23=256, var_1_24=127, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-193, var_1_21=-129, var_1_22=0, var_1_23=256, var_1_24=127, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L171] RET assume_abort_if_not(var_1_24 >= 127) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-193, var_1_21=-129, var_1_22=0, var_1_23=256, var_1_24=127, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L172] CALL assume_abort_if_not(var_1_24 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-193, var_1_21=-129, var_1_22=0, var_1_23=256, var_1_24=127, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-193, var_1_21=-129, var_1_22=0, var_1_23=256, var_1_24=127, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L172] RET assume_abort_if_not(var_1_24 <= 254) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-193, var_1_21=-129, var_1_22=0, var_1_23=256, var_1_24=127, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L186] RET updateVariables() [L187] CALL step() [L52] COND TRUE last_1_var_1_13 == (last_1_var_1_13 % var_1_4) [L53] var_1_1 = (var_1_5 - var_1_6) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_20=-193, var_1_21=-129, var_1_22=0, var_1_23=256, var_1_24=127, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L55] COND TRUE \read(var_1_11) [L56] var_1_33 = ((((var_1_26) > (var_1_23)) ? (var_1_26) : (var_1_23))) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_20=-193, var_1_21=-129, var_1_22=0, var_1_23=256, var_1_24=127, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=0, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L58] COND FALSE !(var_1_10 == var_1_1) [L65] var_1_19 = var_1_24 VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=127, var_1_20=-193, var_1_21=-129, var_1_22=0, var_1_23=256, var_1_24=127, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=0, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L67] COND FALSE !(var_1_21 != (var_1_22 + var_1_19)) [L72] var_1_27 = var_1_24 VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=127, var_1_20=-193, var_1_21=-129, var_1_22=0, var_1_23=256, var_1_24=127, var_1_25=-16, var_1_26=0, var_1_27=127, var_1_33=0, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L74] COND FALSE !(var_1_19 < (var_1_21 / var_1_20)) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=127, var_1_20=-193, var_1_21=-129, var_1_22=0, var_1_23=256, var_1_24=127, var_1_25=-16, var_1_26=0, var_1_27=127, var_1_33=0, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L81] COND FALSE !(16 < var_1_22) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=127, var_1_20=-193, var_1_21=-129, var_1_22=0, var_1_23=256, var_1_24=127, var_1_25=-16, var_1_26=0, var_1_27=127, var_1_33=0, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L88] COND TRUE var_1_1 >= var_1_6 [L89] var_1_7 = var_1_19 VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=127, var_1_20=-193, var_1_21=-129, var_1_22=0, var_1_23=256, var_1_24=127, var_1_25=-16, var_1_26=0, var_1_27=127, var_1_33=0, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=127, var_1_9=1] [L91] COND FALSE !(var_1_20 <= var_1_13) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=127, var_1_20=-193, var_1_21=-129, var_1_22=0, var_1_23=256, var_1_24=127, var_1_25=-16, var_1_26=0, var_1_27=127, var_1_33=0, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=127, var_1_9=1] [L98] COND FALSE !(((var_1_6 * var_1_5) / var_1_10) > var_1_1) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=127, var_1_20=-193, var_1_21=-129, var_1_22=0, var_1_23=256, var_1_24=127, var_1_25=-16, var_1_26=0, var_1_27=127, var_1_33=0, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=127, var_1_9=1] [L105] COND FALSE !(var_1_26 < ((((((((var_1_22) > (var_1_26)) ? (var_1_22) : (var_1_26)))) > (var_1_22)) ? (((((var_1_22) > (var_1_26)) ? (var_1_22) : (var_1_26)))) : (var_1_22)))) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=127, var_1_20=-193, var_1_21=-129, var_1_22=0, var_1_23=256, var_1_24=127, var_1_25=-16, var_1_26=0, var_1_27=127, var_1_33=0, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=127, var_1_9=1] [L108] COND TRUE var_1_6 <= var_1_6 [L109] var_1_42 = (((((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))) < 0 ) ? -((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))) : ((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))))) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=127, var_1_20=-193, var_1_21=-129, var_1_22=0, var_1_23=256, var_1_24=127, var_1_25=-16, var_1_26=0, var_1_27=127, var_1_33=0, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=2, var_1_45=8, var_1_4=-1, var_1_6=0, var_1_7=127, var_1_9=1] [L116] COND FALSE !(var_1_7 < var_1_9) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=127, var_1_20=-193, var_1_21=-129, var_1_22=0, var_1_23=256, var_1_24=127, var_1_25=-16, var_1_26=0, var_1_27=127, var_1_33=0, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=2, var_1_45=8, var_1_4=-1, var_1_6=0, var_1_7=127, var_1_9=1] [L119] var_1_38 = var_1_5 VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=127, var_1_20=-193, var_1_21=-129, var_1_22=0, var_1_23=256, var_1_24=127, var_1_25=-16, var_1_26=0, var_1_27=127, var_1_33=0, var_1_36=-1, var_1_38=3, var_1_40=10, var_1_42=2, var_1_45=8, var_1_4=-1, var_1_5=3, var_1_6=0, var_1_7=127, var_1_9=1] [L120] COND TRUE (var_1_22 % var_1_15) < var_1_20 [L121] var_1_45 = ((var_1_23 - var_1_23) + var_1_20) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=127, var_1_20=-193, var_1_21=-129, var_1_22=0, var_1_23=256, var_1_24=127, var_1_25=-16, var_1_26=0, var_1_27=127, var_1_33=0, var_1_36=-1, var_1_38=3, var_1_40=10, var_1_42=2, var_1_45=63, var_1_4=-1, var_1_5=3, var_1_6=0, var_1_7=127, var_1_9=1] [L125] COND FALSE !((25.3 * var_1_5) != var_1_1) [L134] var_1_25 = var_1_20 VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=127, var_1_20=-193, var_1_21=-129, var_1_22=0, var_1_23=256, var_1_24=127, var_1_25=63, var_1_26=0, var_1_27=127, var_1_33=0, var_1_36=-1, var_1_38=3, var_1_40=10, var_1_42=2, var_1_45=63, var_1_4=-1, var_1_5=3, var_1_6=0, var_1_7=127, var_1_9=1] [L187] RET step() [L188] CALL, EXPR property() [L178-L179] return (((((((last_1_var_1_13 == (last_1_var_1_13 % var_1_4)) ? (var_1_1 == ((float) (var_1_5 - var_1_6))) : 1) && ((var_1_1 >= var_1_6) ? (var_1_7 == ((signed long int) var_1_19)) : 1)) && ((((var_1_6 * var_1_5) / var_1_10) > var_1_1) ? (var_1_11 ? (var_1_9 == ((unsigned long int) var_1_26)) : (var_1_9 == ((unsigned long int) var_1_26))) : 1)) && ((var_1_7 < var_1_9) ? (var_1_13 == ((unsigned short int) (var_1_26 + (((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16))) - (var_1_19 + var_1_19))))) : 1)) && ((var_1_10 == var_1_1) ? (var_1_11 ? (var_1_19 == ((unsigned char) (((32 + var_1_20) + var_1_21) - (var_1_22 + var_1_23)))) : (var_1_19 == ((unsigned char) (var_1_24 - var_1_23)))) : (var_1_19 == ((unsigned char) var_1_24)))) && (((25.3 * var_1_5) != var_1_1) ? (var_1_11 ? ((var_1_15 <= var_1_13) ? (var_1_25 == ((signed long int) var_1_26)) : 1) : (var_1_25 == ((signed long int) var_1_22))) : (var_1_25 == ((signed long int) var_1_20)))) && ((var_1_19 < (var_1_21 / var_1_20)) ? ((var_1_19 > var_1_19) ? (var_1_26 == ((unsigned char) ((((((((var_1_22) < (var_1_24)) ? (var_1_22) : (var_1_24)))) > (var_1_23)) ? (((((var_1_22) < (var_1_24)) ? (var_1_22) : (var_1_24)))) : (var_1_23))))) : (var_1_26 == ((unsigned char) var_1_22))) : 1) ; [L188] RET, EXPR property() [L188] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=127, var_1_20=-193, var_1_21=-129, var_1_22=0, var_1_23=256, var_1_24=127, var_1_25=63, var_1_26=0, var_1_27=127, var_1_33=0, var_1_36=-1, var_1_38=3, var_1_40=10, var_1_42=2, var_1_45=63, var_1_4=-1, var_1_5=3, var_1_6=0, var_1_7=127, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=127, var_1_20=-193, var_1_21=-129, var_1_22=0, var_1_23=256, var_1_24=127, var_1_25=63, var_1_26=0, var_1_27=127, var_1_33=0, var_1_36=-1, var_1_38=3, var_1_40=10, var_1_42=2, var_1_45=63, var_1_4=-1, var_1_5=3, var_1_6=0, var_1_7=127, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 78 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.7s, OverallIterations: 5, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 15.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4664 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4619 mSDsluCounter, 2746 SdHoareTripleChecker+Invalid, 3.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2136 mSDsCounter, 2415 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3581 IncrementalHoareTripleChecker+Invalid, 5996 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2415 mSolverCounterUnsat, 610 mSDtfsCounter, 3581 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1102 GetRequests, 790 SyntacticMatches, 2 SemanticMatches, 310 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28954 ImplicationChecksByTransitivity, 10.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=549occurred in iteration=4, InterpolantAutomatonStates: 291, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 4 MinimizatonAttempts, 1593 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 1173 NumberOfCodeBlocks, 1173 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1164 ConstructedInterpolants, 0 QuantifiedInterpolants, 3846 SizeOfPredicates, 18 NumberOfNonLiveVariables, 679 ConjunctsInSsa, 53 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 7844/8096 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 02:14:43,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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_fillercode_fillercodestructure_filler-pr-ci_file-8.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 3030444f88f9a17418da1dc67b4b4ded6b77914f13db39467d146bf41ea08d3d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 02:14:46,067 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 02:14:46,135 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 02:14:46,139 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 02:14:46,140 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 02:14:46,166 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 02:14:46,167 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 02:14:46,167 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 02:14:46,168 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 02:14:46,168 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 02:14:46,169 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 02:14:46,169 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 02:14:46,170 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 02:14:46,170 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 02:14:46,170 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 02:14:46,171 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 02:14:46,171 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 02:14:46,172 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 02:14:46,172 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 02:14:46,172 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 02:14:46,173 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 02:14:46,173 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 02:14:46,174 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 02:14:46,174 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 02:14:46,174 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 02:14:46,175 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 02:14:46,175 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 02:14:46,175 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 02:14:46,176 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 02:14:46,176 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 02:14:46,177 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 02:14:46,177 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 02:14:46,177 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 02:14:46,177 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 02:14:46,178 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:14:46,178 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 02:14:46,178 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 02:14:46,179 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 02:14:46,179 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 02:14:46,179 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 02:14:46,179 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 02:14:46,181 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 02:14:46,181 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 02:14:46,181 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 02:14:46,181 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 02:14:46,182 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 -> 3030444f88f9a17418da1dc67b4b4ded6b77914f13db39467d146bf41ea08d3d [2024-10-13 02:14:46,525 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 02:14:46,550 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 02:14:46,553 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 02:14:46,554 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 02:14:46,554 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 02:14:46,555 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-8.i [2024-10-13 02:14:48,034 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 02:14:48,261 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 02:14:48,262 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-8.i [2024-10-13 02:14:48,272 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eade992d0/9292e50ed23443dbaf44fca85bc9f277/FLAG849a4d1cb [2024-10-13 02:14:48,614 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eade992d0/9292e50ed23443dbaf44fca85bc9f277 [2024-10-13 02:14:48,616 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 02:14:48,617 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 02:14:48,618 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 02:14:48,618 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 02:14:48,624 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 02:14:48,625 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:14:48" (1/1) ... [2024-10-13 02:14:48,626 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e2b86e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:14:48, skipping insertion in model container [2024-10-13 02:14:48,626 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:14:48" (1/1) ... [2024-10-13 02:14:48,657 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 02:14:48,835 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-8.i[918,931] [2024-10-13 02:14:48,913 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:14:48,933 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 02:14:48,947 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-8.i[918,931] [2024-10-13 02:14:48,983 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:14:49,002 INFO L204 MainTranslator]: Completed translation [2024-10-13 02:14:49,003 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:14:49 WrapperNode [2024-10-13 02:14:49,003 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 02:14:49,004 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 02:14:49,004 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 02:14:49,004 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 02:14:49,010 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:14:49" (1/1) ... [2024-10-13 02:14:49,025 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:14:49" (1/1) ... [2024-10-13 02:14:49,063 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 170 [2024-10-13 02:14:49,067 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 02:14:49,068 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 02:14:49,068 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 02:14:49,068 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 02:14:49,081 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:14:49" (1/1) ... [2024-10-13 02:14:49,081 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:14:49" (1/1) ... [2024-10-13 02:14:49,088 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:14:49" (1/1) ... [2024-10-13 02:14:49,112 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 02:14:49,112 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:14:49" (1/1) ... [2024-10-13 02:14:49,112 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:14:49" (1/1) ... [2024-10-13 02:14:49,127 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:14:49" (1/1) ... [2024-10-13 02:14:49,130 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:14:49" (1/1) ... [2024-10-13 02:14:49,139 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:14:49" (1/1) ... [2024-10-13 02:14:49,141 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:14:49" (1/1) ... [2024-10-13 02:14:49,147 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 02:14:49,149 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 02:14:49,150 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 02:14:49,150 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 02:14:49,151 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:14:49" (1/1) ... [2024-10-13 02:14:49,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:14:49,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:14:49,183 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 02:14:49,185 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 02:14:49,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 02:14:49,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 02:14:49,244 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 02:14:49,244 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 02:14:49,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 02:14:49,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 02:14:49,344 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 02:14:49,346 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 02:15:10,699 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-13 02:15:10,699 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 02:15:10,781 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 02:15:10,781 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 02:15:10,782 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:15:10 BoogieIcfgContainer [2024-10-13 02:15:10,782 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 02:15:10,784 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 02:15:10,785 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 02:15:10,788 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 02:15:10,788 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 02:14:48" (1/3) ... [2024-10-13 02:15:10,789 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3972d566 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:15:10, skipping insertion in model container [2024-10-13 02:15:10,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:14:49" (2/3) ... [2024-10-13 02:15:10,790 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3972d566 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:15:10, skipping insertion in model container [2024-10-13 02:15:10,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:15:10" (3/3) ... [2024-10-13 02:15:10,793 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-8.i [2024-10-13 02:15:10,810 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 02:15:10,810 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 02:15:10,880 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 02:15:10,891 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;@46721297, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 02:15:10,891 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 02:15:10,896 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 48 states have (on average 1.625) internal successors, (78), 49 states have internal predecessors, (78), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-13 02:15:10,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-13 02:15:10,912 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:15:10,913 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:15:10,913 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:15:10,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:15:10,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1166628646, now seen corresponding path program 1 times [2024-10-13 02:15:10,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:15:10,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1851059602] [2024-10-13 02:15:10,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:15:10,936 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 02:15:10,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:15:10,940 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 02:15:10,941 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 02:15:12,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:15:12,089 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 02:15:12,099 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:15:12,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 528 proven. 0 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2024-10-13 02:15:12,155 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 02:15:12,155 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:15:12,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1851059602] [2024-10-13 02:15:12,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1851059602] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:15:12,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:15:12,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 02:15:12,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764992100] [2024-10-13 02:15:12,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:15:12,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 02:15:12,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:15:12,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 02:15:12,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 02:15:12,195 INFO L87 Difference]: Start difference. First operand has 74 states, 48 states have (on average 1.625) internal successors, (78), 49 states have internal predecessors, (78), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-13 02:15:16,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.49s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 02:15:16,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:15:16,771 INFO L93 Difference]: Finished difference Result 145 states and 269 transitions. [2024-10-13 02:15:16,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 02:15:16,978 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 146 [2024-10-13 02:15:16,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:15:16,985 INFO L225 Difference]: With dead ends: 145 [2024-10-13 02:15:16,985 INFO L226 Difference]: Without dead ends: 72 [2024-10-13 02:15:16,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 145 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 02:15:16,991 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-10-13 02:15:16,992 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2024-10-13 02:15:17,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-13 02:15:17,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-10-13 02:15:17,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 47 states have (on average 1.5319148936170213) internal successors, (72), 47 states have internal predecessors, (72), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-13 02:15:17,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 118 transitions. [2024-10-13 02:15:17,032 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 118 transitions. Word has length 146 [2024-10-13 02:15:17,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:15:17,038 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 118 transitions. [2024-10-13 02:15:17,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-13 02:15:17,039 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 118 transitions. [2024-10-13 02:15:17,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-13 02:15:17,046 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:15:17,047 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:15:17,078 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 02:15:17,247 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 02:15:17,248 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:15:17,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:15:17,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1182566124, now seen corresponding path program 1 times [2024-10-13 02:15:17,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:15:17,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1565732429] [2024-10-13 02:15:17,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:15:17,250 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 02:15:17,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:15:17,253 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 02:15:17,254 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 02:15:18,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:15:18,322 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-13 02:15:18,329 INFO L278 TraceCheckSpWp]: Computing forward predicates...