./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-77.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-77.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 8c062e0b52e5b782e5946e5616c1aea186202785894035b8b4bb967c003e9581 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 20:23:24,921 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 20:23:24,980 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 20:23:24,985 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 20:23:24,986 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 20:23:25,011 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 20:23:25,011 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 20:23:25,012 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 20:23:25,012 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 20:23:25,013 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 20:23:25,013 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 20:23:25,013 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 20:23:25,014 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 20:23:25,014 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 20:23:25,015 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 20:23:25,015 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 20:23:25,015 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 20:23:25,016 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 20:23:25,016 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 20:23:25,016 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 20:23:25,016 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 20:23:25,021 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 20:23:25,022 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 20:23:25,022 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 20:23:25,022 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 20:23:25,022 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 20:23:25,022 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 20:23:25,023 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 20:23:25,023 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 20:23:25,023 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 20:23:25,023 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 20:23:25,024 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 20:23:25,024 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:23:25,024 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 20:23:25,024 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 20:23:25,025 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 20:23:25,025 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 20:23:25,027 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 20:23:25,027 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 20:23:25,027 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 20:23:25,027 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 20:23:25,028 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 20:23:25,028 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 -> 8c062e0b52e5b782e5946e5616c1aea186202785894035b8b4bb967c003e9581 [2024-11-08 20:23:25,327 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 20:23:25,349 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 20:23:25,352 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 20:23:25,354 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 20:23:25,354 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 20:23:25,355 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-77.i [2024-11-08 20:23:26,727 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 20:23:26,946 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 20:23:26,947 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-77.i [2024-11-08 20:23:26,956 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b13a6aa6/4df23fc85a9d49f38b38b2457b35604c/FLAG3d9fda47a [2024-11-08 20:23:27,310 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b13a6aa6/4df23fc85a9d49f38b38b2457b35604c [2024-11-08 20:23:27,313 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 20:23:27,315 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 20:23:27,316 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 20:23:27,317 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 20:23:27,322 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 20:23:27,322 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:23:27" (1/1) ... [2024-11-08 20:23:27,323 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a273d9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:23:27, skipping insertion in model container [2024-11-08 20:23:27,324 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:23:27" (1/1) ... [2024-11-08 20:23:27,354 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 20:23:27,522 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-77.i[915,928] [2024-11-08 20:23:27,615 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:23:27,635 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 20:23:27,649 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-77.i[915,928] [2024-11-08 20:23:27,693 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:23:27,717 INFO L204 MainTranslator]: Completed translation [2024-11-08 20:23:27,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:23:27 WrapperNode [2024-11-08 20:23:27,718 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 20:23:27,719 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 20:23:27,720 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 20:23:27,720 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 20:23:27,727 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:23:27" (1/1) ... [2024-11-08 20:23:27,741 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:23:27" (1/1) ... [2024-11-08 20:23:27,785 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 171 [2024-11-08 20:23:27,786 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 20:23:27,786 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 20:23:27,786 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 20:23:27,786 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 20:23:27,801 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:23:27" (1/1) ... [2024-11-08 20:23:27,802 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:23:27" (1/1) ... [2024-11-08 20:23:27,805 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:23:27" (1/1) ... [2024-11-08 20:23:27,824 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 20:23:27,825 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:23:27" (1/1) ... [2024-11-08 20:23:27,825 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:23:27" (1/1) ... [2024-11-08 20:23:27,839 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:23:27" (1/1) ... [2024-11-08 20:23:27,848 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:23:27" (1/1) ... [2024-11-08 20:23:27,853 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:23:27" (1/1) ... [2024-11-08 20:23:27,856 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:23:27" (1/1) ... [2024-11-08 20:23:27,861 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 20:23:27,865 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 20:23:27,865 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 20:23:27,865 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 20:23:27,866 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:23:27" (1/1) ... [2024-11-08 20:23:27,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:23:27,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:23:27,905 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 20:23:27,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 20:23:27,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 20:23:27,954 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 20:23:27,954 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 20:23:27,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 20:23:27,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 20:23:27,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 20:23:28,059 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 20:23:28,061 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 20:23:28,452 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-08 20:23:28,453 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 20:23:28,470 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 20:23:28,471 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 20:23:28,471 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:23:28 BoogieIcfgContainer [2024-11-08 20:23:28,471 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 20:23:28,473 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 20:23:28,474 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 20:23:28,477 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 20:23:28,478 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 08:23:27" (1/3) ... [2024-11-08 20:23:28,479 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cf9ff86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:23:28, skipping insertion in model container [2024-11-08 20:23:28,479 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:23:27" (2/3) ... [2024-11-08 20:23:28,480 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cf9ff86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:23:28, skipping insertion in model container [2024-11-08 20:23:28,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:23:28" (3/3) ... [2024-11-08 20:23:28,481 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-77.i [2024-11-08 20:23:28,496 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 20:23:28,496 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 20:23:28,559 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 20:23:28,565 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;@6aab4dd7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 20:23:28,565 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 20:23:28,568 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 46 states have internal predecessors, (62), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 20:23:28,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-08 20:23:28,580 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:23:28,580 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:23:28,581 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:23:28,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:23:28,585 INFO L85 PathProgramCache]: Analyzing trace with hash -529169918, now seen corresponding path program 1 times [2024-11-08 20:23:28,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:23:28,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686664910] [2024-11-08 20:23:28,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:23:28,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:23:28,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:28,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:23:28,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:28,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 20:23:28,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:28,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 20:23:28,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:28,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 20:23:28,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:28,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 20:23:28,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:28,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 20:23:28,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:28,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 20:23:28,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:28,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 20:23:28,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:28,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 20:23:28,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:28,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 20:23:28,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:28,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 20:23:28,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:28,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 20:23:28,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:28,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 20:23:28,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:28,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 20:23:28,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:28,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 20:23:28,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:28,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 20:23:28,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:28,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 20:23:28,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:28,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 20:23:28,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:28,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 20:23:28,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:28,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 20:23:28,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:28,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 20:23:28,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:28,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 20:23:28,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:28,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 20:23:28,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:29,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 20:23:29,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:29,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-08 20:23:29,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:23:29,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686664910] [2024-11-08 20:23:29,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686664910] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:23:29,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:23:29,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 20:23:29,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509598220] [2024-11-08 20:23:29,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:23:29,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 20:23:29,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:23:29,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 20:23:29,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 20:23:29,048 INFO L87 Difference]: Start difference. First operand has 72 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 46 states have internal predecessors, (62), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-08 20:23:29,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:23:29,081 INFO L93 Difference]: Finished difference Result 137 states and 238 transitions. [2024-11-08 20:23:29,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 20:23:29,083 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 153 [2024-11-08 20:23:29,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:23:29,092 INFO L225 Difference]: With dead ends: 137 [2024-11-08 20:23:29,092 INFO L226 Difference]: Without dead ends: 68 [2024-11-08 20:23:29,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 20:23:29,099 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 20:23:29,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 20:23:29,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-08 20:23:29,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-11-08 20:23:29,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 42 states have internal predecessors, (55), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 20:23:29,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 103 transitions. [2024-11-08 20:23:29,141 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 103 transitions. Word has length 153 [2024-11-08 20:23:29,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:23:29,142 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 103 transitions. [2024-11-08 20:23:29,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-08 20:23:29,142 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 103 transitions. [2024-11-08 20:23:29,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-08 20:23:29,145 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:23:29,146 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:23:29,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 20:23:29,147 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:23:29,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:23:29,147 INFO L85 PathProgramCache]: Analyzing trace with hash 106605442, now seen corresponding path program 1 times [2024-11-08 20:23:29,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:23:29,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405304777] [2024-11-08 20:23:29,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:23:29,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:23:29,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:29,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:23:29,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:29,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 20:23:29,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:29,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 20:23:29,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:29,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 20:23:29,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:29,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 20:23:29,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:29,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 20:23:29,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:29,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 20:23:29,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:29,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 20:23:29,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:29,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 20:23:29,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:29,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 20:23:29,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:29,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 20:23:29,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:29,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 20:23:29,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:29,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 20:23:29,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:29,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 20:23:29,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:29,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 20:23:29,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:29,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 20:23:29,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:29,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 20:23:29,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:29,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 20:23:29,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:29,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 20:23:29,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:29,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 20:23:29,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:29,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 20:23:29,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:29,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 20:23:29,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:29,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 20:23:29,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:29,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 20:23:29,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:29,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-08 20:23:29,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:23:29,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405304777] [2024-11-08 20:23:29,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405304777] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:23:29,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:23:29,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 20:23:29,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996834255] [2024-11-08 20:23:29,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:23:29,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 20:23:29,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:23:29,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 20:23:29,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-08 20:23:29,849 INFO L87 Difference]: Start difference. First operand 68 states and 103 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-08 20:23:30,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:23:30,206 INFO L93 Difference]: Finished difference Result 205 states and 310 transitions. [2024-11-08 20:23:30,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 20:23:30,207 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 153 [2024-11-08 20:23:30,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:23:30,212 INFO L225 Difference]: With dead ends: 205 [2024-11-08 20:23:30,212 INFO L226 Difference]: Without dead ends: 140 [2024-11-08 20:23:30,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-11-08 20:23:30,215 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 145 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 20:23:30,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 416 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 20:23:30,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-08 20:23:30,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 130. [2024-11-08 20:23:30,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 79 states have internal predecessors, (103), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-08 20:23:30,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 199 transitions. [2024-11-08 20:23:30,258 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 199 transitions. Word has length 153 [2024-11-08 20:23:30,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:23:30,261 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 199 transitions. [2024-11-08 20:23:30,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-08 20:23:30,262 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 199 transitions. [2024-11-08 20:23:30,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-08 20:23:30,266 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:23:30,266 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:23:30,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 20:23:30,267 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:23:30,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:23:30,268 INFO L85 PathProgramCache]: Analyzing trace with hash 108452484, now seen corresponding path program 1 times [2024-11-08 20:23:30,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:23:30,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499588530] [2024-11-08 20:23:30,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:23:30,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:23:30,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:30,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:23:30,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:30,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 20:23:30,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:30,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 20:23:30,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:30,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 20:23:30,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:30,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 20:23:30,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:30,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 20:23:30,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:30,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 20:23:30,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:30,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 20:23:30,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:30,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 20:23:30,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:30,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 20:23:30,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:30,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 20:23:30,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:30,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 20:23:30,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:30,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 20:23:30,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:30,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 20:23:30,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:30,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 20:23:30,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:30,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 20:23:30,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:30,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 20:23:30,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:30,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 20:23:30,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:30,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 20:23:30,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:30,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 20:23:30,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:30,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 20:23:30,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:30,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 20:23:30,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:30,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 20:23:30,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:30,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 20:23:30,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:30,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-08 20:23:30,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:23:30,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499588530] [2024-11-08 20:23:30,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499588530] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:23:30,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:23:30,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 20:23:30,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593480279] [2024-11-08 20:23:30,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:23:30,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 20:23:30,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:23:30,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 20:23:30,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 20:23:30,510 INFO L87 Difference]: Start difference. First operand 130 states and 199 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 20:23:30,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:23:30,561 INFO L93 Difference]: Finished difference Result 251 states and 387 transitions. [2024-11-08 20:23:30,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 20:23:30,562 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 153 [2024-11-08 20:23:30,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:23:30,566 INFO L225 Difference]: With dead ends: 251 [2024-11-08 20:23:30,569 INFO L226 Difference]: Without dead ends: 124 [2024-11-08 20:23:30,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 20:23:30,571 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 0 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 20:23:30,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 189 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 20:23:30,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-08 20:23:30,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 67. [2024-11-08 20:23:30,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 41 states have internal predecessors, (52), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 20:23:30,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 100 transitions. [2024-11-08 20:23:30,595 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 100 transitions. Word has length 153 [2024-11-08 20:23:30,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:23:30,595 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 100 transitions. [2024-11-08 20:23:30,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 20:23:30,596 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 100 transitions. [2024-11-08 20:23:30,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-08 20:23:30,598 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:23:30,598 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:23:30,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 20:23:30,602 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:23:30,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:23:30,603 INFO L85 PathProgramCache]: Analyzing trace with hash 343026818, now seen corresponding path program 1 times [2024-11-08 20:23:30,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:23:30,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639415335] [2024-11-08 20:23:30,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:23:30,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:23:30,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 20:23:30,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [253393202] [2024-11-08 20:23:30,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:23:30,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 20:23:30,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:23:30,792 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 20:23:30,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 20:23:30,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 20:23:30,990 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 20:23:31,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 20:23:31,142 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 20:23:31,142 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 20:23:31,143 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 20:23:31,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 20:23:31,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 20:23:31,350 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-08 20:23:31,472 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 20:23:31,480 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 08:23:31 BoogieIcfgContainer [2024-11-08 20:23:31,481 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 20:23:31,481 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 20:23:31,482 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 20:23:31,482 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 20:23:31,482 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:23:28" (3/4) ... [2024-11-08 20:23:31,484 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 20:23:31,485 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 20:23:31,485 INFO L158 Benchmark]: Toolchain (without parser) took 4170.13ms. Allocated memory was 165.7MB in the beginning and 205.5MB in the end (delta: 39.8MB). Free memory was 135.2MB in the beginning and 76.9MB in the end (delta: 58.3MB). Peak memory consumption was 97.4MB. Max. memory is 16.1GB. [2024-11-08 20:23:31,486 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 109.1MB. Free memory is still 80.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 20:23:31,486 INFO L158 Benchmark]: CACSL2BoogieTranslator took 402.20ms. Allocated memory is still 165.7MB. Free memory was 135.2MB in the beginning and 118.8MB in the end (delta: 16.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 20:23:31,486 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.27ms. Allocated memory is still 165.7MB. Free memory was 118.8MB in the beginning and 114.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 20:23:31,487 INFO L158 Benchmark]: Boogie Preprocessor took 75.51ms. Allocated memory is still 165.7MB. Free memory was 114.6MB in the beginning and 109.3MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 20:23:31,487 INFO L158 Benchmark]: RCFGBuilder took 606.60ms. Allocated memory is still 165.7MB. Free memory was 109.3MB in the beginning and 119.3MB in the end (delta: -10.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 20:23:31,487 INFO L158 Benchmark]: TraceAbstraction took 3008.00ms. Allocated memory was 165.7MB in the beginning and 205.5MB in the end (delta: 39.8MB). Free memory was 119.3MB in the beginning and 78.0MB in the end (delta: 41.3MB). Peak memory consumption was 83.3MB. Max. memory is 16.1GB. [2024-11-08 20:23:31,488 INFO L158 Benchmark]: Witness Printer took 3.33ms. Allocated memory is still 205.5MB. Free memory was 78.0MB in the beginning and 76.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 20:23:31,492 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.18ms. Allocated memory is still 109.1MB. Free memory is still 80.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 402.20ms. Allocated memory is still 165.7MB. Free memory was 135.2MB in the beginning and 118.8MB in the end (delta: 16.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.27ms. Allocated memory is still 165.7MB. Free memory was 118.8MB in the beginning and 114.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.51ms. Allocated memory is still 165.7MB. Free memory was 114.6MB in the beginning and 109.3MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 606.60ms. Allocated memory is still 165.7MB. Free memory was 109.3MB in the beginning and 119.3MB in the end (delta: -10.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3008.00ms. Allocated memory was 165.7MB in the beginning and 205.5MB in the end (delta: 39.8MB). Free memory was 119.3MB in the beginning and 78.0MB in the end (delta: 41.3MB). Peak memory consumption was 83.3MB. Max. memory is 16.1GB. * Witness Printer took 3.33ms. Allocated memory is still 205.5MB. Free memory was 78.0MB in the beginning and 76.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 156. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 2; [L23] float var_1_2 = 255.5; [L24] float var_1_3 = 99.8; [L25] signed char var_1_4 = -25; [L26] float var_1_6 = 255.25; [L27] unsigned short int var_1_7 = 16; [L28] signed char var_1_8 = -10; [L29] signed char var_1_9 = -8; [L30] unsigned short int var_1_10 = 8; [L31] unsigned short int var_1_11 = 10000; [L32] unsigned short int var_1_12 = 5; [L33] signed short int var_1_13 = 200; [L34] unsigned char var_1_15 = 0; [L35] unsigned short int var_1_16 = 35895; [L36] unsigned short int var_1_17 = 18336; [L37] unsigned char var_1_18 = 0; [L38] signed long int var_1_19 = -50; [L39] unsigned char var_1_20 = 10; [L40] unsigned char var_1_21 = 32; [L41] float var_1_22 = 255.2; [L42] float var_1_23 = 32.4; [L43] float var_1_24 = 3.25; [L44] signed char var_1_25 = 25; [L45] signed char var_1_26 = 25; [L46] signed char var_1_27 = -50; [L47] unsigned short int var_1_28 = 8; [L48] signed char last_1_var_1_8 = -10; [L49] unsigned char last_1_var_1_15 = 0; [L50] signed long int last_1_var_1_19 = -50; VAL [isInitial=0, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_2=511/2, var_1_3=499/5, var_1_4=-25, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L160] isInitial = 1 [L161] FCALL initially() [L162] COND TRUE 1 [L163] CALL updateLastVariables() [L151] last_1_var_1_8 = var_1_8 [L152] last_1_var_1_15 = var_1_15 [L153] last_1_var_1_19 = var_1_19 VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_2=511/2, var_1_3=499/5, var_1_4=-25, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L163] RET updateLastVariables() [L164] CALL updateVariables() [L111] var_1_2 = __VERIFIER_nondet_float() [L112] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_3=499/5, var_1_4=-25, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_3=499/5, var_1_4=-25, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L112] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_3=499/5, var_1_4=-25, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L113] var_1_3 = __VERIFIER_nondet_float() [L114] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=-25, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=-25, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L114] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=-25, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L115] var_1_4 = __VERIFIER_nondet_char() [L116] CALL assume_abort_if_not(var_1_4 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L116] RET assume_abort_if_not(var_1_4 >= -127) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L117] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L117] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L118] var_1_6 = __VERIFIER_nondet_float() [L119] CALL assume_abort_if_not((var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=16, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=16, var_1_8=-10, var_1_9=-8] [L119] RET assume_abort_if_not((var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=16, var_1_8=-10, var_1_9=-8] [L120] var_1_7 = __VERIFIER_nondet_ushort() [L121] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_8=-10, var_1_9=-8] [L121] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_8=-10, var_1_9=-8] [L122] CALL assume_abort_if_not(var_1_7 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=-8] [L122] RET assume_abort_if_not(var_1_7 <= 65534) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=-8] [L123] var_1_9 = __VERIFIER_nondet_char() [L124] CALL assume_abort_if_not(var_1_9 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L124] RET assume_abort_if_not(var_1_9 >= -127) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L125] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L125] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L126] var_1_11 = __VERIFIER_nondet_ushort() [L127] CALL assume_abort_if_not(var_1_11 >= 8191) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55487, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55487, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L127] RET assume_abort_if_not(var_1_11 >= 8191) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55487, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L128] CALL assume_abort_if_not(var_1_11 <= 16384) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55487, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55487, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L128] RET assume_abort_if_not(var_1_11 <= 16384) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55487, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L129] var_1_12 = __VERIFIER_nondet_ushort() [L130] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55487, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55487, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L130] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55487, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L131] CALL assume_abort_if_not(var_1_12 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55487, var_1_12=0, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55487, var_1_12=0, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L131] RET assume_abort_if_not(var_1_12 <= 16383) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55487, var_1_12=0, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L132] var_1_16 = __VERIFIER_nondet_ushort() [L133] CALL assume_abort_if_not(var_1_16 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55487, var_1_12=0, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55487, var_1_12=0, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L133] RET assume_abort_if_not(var_1_16 >= 32767) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55487, var_1_12=0, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L134] CALL assume_abort_if_not(var_1_16 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55487, var_1_12=0, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55487, var_1_12=0, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L134] RET assume_abort_if_not(var_1_16 <= 65535) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55487, var_1_12=0, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L135] var_1_17 = __VERIFIER_nondet_ushort() [L136] CALL assume_abort_if_not(var_1_17 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55487, var_1_12=0, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55487, var_1_12=0, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L136] RET assume_abort_if_not(var_1_17 >= 16383) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55487, var_1_12=0, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L137] CALL assume_abort_if_not(var_1_17 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55487, var_1_12=0, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55487, var_1_12=0, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L137] RET assume_abort_if_not(var_1_17 <= 32767) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55487, var_1_12=0, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L138] var_1_18 = __VERIFIER_nondet_uchar() [L139] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55487, var_1_12=0, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55487, var_1_12=0, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L139] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55487, var_1_12=0, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L140] CALL assume_abort_if_not(var_1_18 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55487, var_1_12=0, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55487, var_1_12=0, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L140] RET assume_abort_if_not(var_1_18 <= 0) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55487, var_1_12=0, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L141] var_1_21 = __VERIFIER_nondet_uchar() [L142] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55487, var_1_12=0, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55487, var_1_12=0, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L142] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55487, var_1_12=0, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L143] CALL assume_abort_if_not(var_1_21 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55487, var_1_12=0, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=0, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55487, var_1_12=0, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=0, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L143] RET assume_abort_if_not(var_1_21 <= 254) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55487, var_1_12=0, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=0, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L144] var_1_23 = __VERIFIER_nondet_float() [L145] CALL assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55487, var_1_12=0, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=0, var_1_22=1276/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55487, var_1_12=0, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=0, var_1_22=1276/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L145] RET assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55487, var_1_12=0, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=0, var_1_22=1276/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L146] var_1_26 = __VERIFIER_nondet_char() [L147] CALL assume_abort_if_not(var_1_26 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55487, var_1_12=0, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=0, var_1_22=1276/5, var_1_24=13/4, var_1_25=25, var_1_26=0, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55487, var_1_12=0, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=0, var_1_22=1276/5, var_1_24=13/4, var_1_25=25, var_1_26=0, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L147] RET assume_abort_if_not(var_1_26 >= -127) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55487, var_1_12=0, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=0, var_1_22=1276/5, var_1_24=13/4, var_1_25=25, var_1_26=0, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L148] CALL assume_abort_if_not(var_1_26 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55487, var_1_12=0, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=0, var_1_22=1276/5, var_1_24=13/4, var_1_25=25, var_1_26=0, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55487, var_1_12=0, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=0, var_1_22=1276/5, var_1_24=13/4, var_1_25=25, var_1_26=0, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L148] RET assume_abort_if_not(var_1_26 <= 126) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55487, var_1_12=0, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=0, var_1_22=1276/5, var_1_24=13/4, var_1_25=25, var_1_26=0, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L164] RET updateVariables() [L165] CALL step() [L54] var_1_20 = var_1_21 [L55] var_1_22 = var_1_23 [L56] var_1_24 = var_1_23 [L57] var_1_25 = var_1_26 [L58] var_1_27 = var_1_26 VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55487, var_1_12=0, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2, var_1_23=2, var_1_24=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=8, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L59] COND FALSE !(var_1_27 > var_1_20) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55487, var_1_12=0, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2, var_1_23=2, var_1_24=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=8, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L64] signed long int stepLocal_0 = (((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4)); VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_0=1, var_1_10=8, var_1_11=-55487, var_1_12=0, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2, var_1_23=2, var_1_24=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=8, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L65] COND FALSE !(stepLocal_0 <= last_1_var_1_8) [L72] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55487, var_1_12=0, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=-65535, var_1_20=0, var_1_21=0, var_1_22=2, var_1_23=2, var_1_24=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=8, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L74] COND TRUE (- var_1_7) < (var_1_1 * var_1_4) [L75] var_1_8 = var_1_9 VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55487, var_1_12=0, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=-65535, var_1_20=0, var_1_21=0, var_1_22=2, var_1_23=2, var_1_24=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=8, var_1_4=1, var_1_7=-65535, var_1_8=1, var_1_9=1] [L77] COND FALSE !((var_1_6 * var_1_2) <= var_1_3) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55487, var_1_12=0, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=-65535, var_1_20=0, var_1_21=0, var_1_22=2, var_1_23=2, var_1_24=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=8, var_1_4=1, var_1_7=-65535, var_1_8=1, var_1_9=1] [L84] signed long int stepLocal_1 = var_1_16 - (var_1_17 - 256); VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_1=256, var_1_10=8, var_1_11=-55487, var_1_12=0, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=-65535, var_1_20=0, var_1_21=0, var_1_22=2, var_1_23=2, var_1_24=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=8, var_1_4=1, var_1_7=-65535, var_1_8=1, var_1_9=1] [L85] COND FALSE !(var_1_3 != var_1_6) [L92] var_1_15 = var_1_18 VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_1=256, var_1_10=8, var_1_11=-55487, var_1_12=0, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=-65535, var_1_20=0, var_1_21=0, var_1_22=2, var_1_23=2, var_1_24=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=8, var_1_4=1, var_1_7=-65535, var_1_8=1, var_1_9=1] [L94] var_1_10 = (50 + ((var_1_11 + 10000) - var_1_12)) [L95] unsigned short int stepLocal_4 = var_1_1; [L96] signed long int stepLocal_3 = var_1_7 + (128 + var_1_1); [L97] signed long int stepLocal_2 = - var_1_10; VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_1=256, stepLocal_2=-20099, stepLocal_3=130, stepLocal_4=-65535, var_1_10=20099, var_1_11=-55487, var_1_12=0, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=-65535, var_1_20=0, var_1_21=0, var_1_22=2, var_1_23=2, var_1_24=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=8, var_1_4=1, var_1_7=-65535, var_1_8=1, var_1_9=1] [L98] COND FALSE !(var_1_1 < stepLocal_2) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_1=256, stepLocal_3=130, stepLocal_4=-65535, var_1_10=20099, var_1_11=-55487, var_1_12=0, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=-65535, var_1_20=0, var_1_21=0, var_1_22=2, var_1_23=2, var_1_24=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=8, var_1_4=1, var_1_7=-65535, var_1_8=1, var_1_9=1] [L103] COND TRUE stepLocal_4 < (((((var_1_10) < (var_1_17)) ? (var_1_10) : (var_1_17))) / var_1_11) [L104] var_1_19 = ((((var_1_7) > (var_1_9)) ? (var_1_7) : (var_1_9))) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_1=256, stepLocal_3=130, var_1_10=20099, var_1_11=-55487, var_1_12=0, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=1, var_1_1=-65535, var_1_20=0, var_1_21=0, var_1_22=2, var_1_23=2, var_1_24=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=8, var_1_4=1, var_1_7=-65535, var_1_8=1, var_1_9=1] [L165] RET step() [L166] CALL, EXPR property() [L156-L157] return ((((((((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) <= last_1_var_1_8) ? (((- var_1_3) > ((((var_1_2) > (var_1_6)) ? (var_1_2) : (var_1_6)))) ? (var_1_1 == ((unsigned short int) var_1_7)) : (var_1_1 == ((unsigned short int) var_1_7))) : (var_1_1 == ((unsigned short int) var_1_7))) && (((- var_1_7) < (var_1_1 * var_1_4)) ? (var_1_8 == ((signed char) var_1_9)) : 1)) && (var_1_10 == ((unsigned short int) (50 + ((var_1_11 + 10000) - var_1_12))))) && (((var_1_6 * var_1_2) <= var_1_3) ? (last_1_var_1_15 ? (var_1_13 == ((signed short int) (-10 + var_1_12))) : (var_1_13 == ((signed short int) var_1_4))) : 1)) && ((var_1_3 != var_1_6) ? ((var_1_13 >= (var_1_16 - (var_1_17 - 256))) ? (var_1_15 == ((unsigned char) var_1_18)) : (var_1_15 == ((unsigned char) var_1_18))) : (var_1_15 == ((unsigned char) var_1_18)))) && ((var_1_1 < (- var_1_10)) ? (((var_1_7 + (128 + var_1_1)) <= last_1_var_1_19) ? (var_1_19 == ((signed long int) var_1_4)) : 1) : ((var_1_1 < (((((var_1_10) < (var_1_17)) ? (var_1_10) : (var_1_17))) / var_1_11)) ? (var_1_19 == ((signed long int) ((((var_1_7) > (var_1_9)) ? (var_1_7) : (var_1_9))))) : (var_1_19 == ((signed long int) var_1_16)))) ; VAL [\result=0, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=20099, var_1_11=-55487, var_1_12=0, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=1, var_1_1=-65535, var_1_20=0, var_1_21=0, var_1_22=2, var_1_23=2, var_1_24=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=8, var_1_4=1, var_1_7=-65535, var_1_8=1, var_1_9=1] [L166] RET, EXPR property() [L166] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=20099, var_1_11=-55487, var_1_12=0, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=1, var_1_1=-65535, var_1_20=0, var_1_21=0, var_1_22=2, var_1_23=2, var_1_24=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=8, var_1_4=1, var_1_7=-65535, var_1_8=1, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=20099, var_1_11=-55487, var_1_12=0, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=1, var_1_1=-65535, var_1_20=0, var_1_21=0, var_1_22=2, var_1_23=2, var_1_24=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=8, var_1_4=1, var_1_7=-65535, var_1_8=1, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 72 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.8s, OverallIterations: 4, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 145 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 145 mSDsluCounter, 708 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 405 mSDsCounter, 116 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 102 IncrementalHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 116 mSolverCounterUnsat, 303 mSDtfsCounter, 102 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 184 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=130occurred in iteration=2, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 67 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 765 NumberOfCodeBlocks, 765 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 456 ConstructedInterpolants, 0 QuantifiedInterpolants, 754 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 3312/3312 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 20:23:31,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-77.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 8c062e0b52e5b782e5946e5616c1aea186202785894035b8b4bb967c003e9581 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 20:23:33,680 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 20:23:33,760 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 20:23:33,769 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 20:23:33,770 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 20:23:33,806 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 20:23:33,807 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 20:23:33,808 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 20:23:33,808 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 20:23:33,810 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 20:23:33,810 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 20:23:33,810 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 20:23:33,811 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 20:23:33,811 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 20:23:33,811 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 20:23:33,812 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 20:23:33,812 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 20:23:33,812 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 20:23:33,813 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 20:23:33,813 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 20:23:33,815 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 20:23:33,815 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 20:23:33,815 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 20:23:33,816 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 20:23:33,816 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 20:23:33,817 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 20:23:33,817 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 20:23:33,817 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 20:23:33,818 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 20:23:33,818 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 20:23:33,818 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 20:23:33,819 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 20:23:33,819 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 20:23:33,819 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 20:23:33,820 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:23:33,820 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 20:23:33,820 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 20:23:33,821 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 20:23:33,821 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 20:23:33,821 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 20:23:33,822 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 20:23:33,822 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 20:23:33,822 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 20:23:33,823 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 20:23:33,823 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 -> 8c062e0b52e5b782e5946e5616c1aea186202785894035b8b4bb967c003e9581 [2024-11-08 20:23:34,168 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 20:23:34,195 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 20:23:34,198 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 20:23:34,199 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 20:23:34,200 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 20:23:34,201 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-77.i [2024-11-08 20:23:35,816 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 20:23:36,056 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 20:23:36,057 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-77.i [2024-11-08 20:23:36,070 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8a83fcce/fae4f306164a4cd8b145ec8e7800cd76/FLAGcc8b52c45 [2024-11-08 20:23:36,087 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8a83fcce/fae4f306164a4cd8b145ec8e7800cd76 [2024-11-08 20:23:36,091 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 20:23:36,093 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 20:23:36,095 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 20:23:36,095 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 20:23:36,100 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 20:23:36,101 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:23:36" (1/1) ... [2024-11-08 20:23:36,103 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43050811 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:23:36, skipping insertion in model container [2024-11-08 20:23:36,103 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:23:36" (1/1) ... [2024-11-08 20:23:36,134 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 20:23:36,316 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-77.i[915,928] [2024-11-08 20:23:36,391 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:23:36,410 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 20:23:36,422 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-77.i[915,928] [2024-11-08 20:23:36,460 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:23:36,481 INFO L204 MainTranslator]: Completed translation [2024-11-08 20:23:36,481 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:23:36 WrapperNode [2024-11-08 20:23:36,481 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 20:23:36,482 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 20:23:36,482 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 20:23:36,482 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 20:23:36,489 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:23:36" (1/1) ... [2024-11-08 20:23:36,503 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:23:36" (1/1) ... [2024-11-08 20:23:36,537 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 168 [2024-11-08 20:23:36,538 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 20:23:36,539 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 20:23:36,539 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 20:23:36,539 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 20:23:36,557 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:23:36" (1/1) ... [2024-11-08 20:23:36,557 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:23:36" (1/1) ... [2024-11-08 20:23:36,564 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:23:36" (1/1) ... [2024-11-08 20:23:36,580 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 20:23:36,581 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:23:36" (1/1) ... [2024-11-08 20:23:36,581 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:23:36" (1/1) ... [2024-11-08 20:23:36,589 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:23:36" (1/1) ... [2024-11-08 20:23:36,592 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:23:36" (1/1) ... [2024-11-08 20:23:36,594 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:23:36" (1/1) ... [2024-11-08 20:23:36,596 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:23:36" (1/1) ... [2024-11-08 20:23:36,599 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 20:23:36,600 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 20:23:36,600 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 20:23:36,600 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 20:23:36,601 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:23:36" (1/1) ... [2024-11-08 20:23:36,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:23:36,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:23:36,641 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 20:23:36,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 20:23:36,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 20:23:36,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 20:23:36,692 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 20:23:36,692 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 20:23:36,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 20:23:36,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 20:23:36,773 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 20:23:36,776 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 20:23:37,711 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-08 20:23:37,711 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 20:23:37,726 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 20:23:37,726 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 20:23:37,726 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:23:37 BoogieIcfgContainer [2024-11-08 20:23:37,726 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 20:23:37,728 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 20:23:37,728 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 20:23:37,731 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 20:23:37,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 08:23:36" (1/3) ... [2024-11-08 20:23:37,732 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a58b50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:23:37, skipping insertion in model container [2024-11-08 20:23:37,732 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:23:36" (2/3) ... [2024-11-08 20:23:37,733 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a58b50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:23:37, skipping insertion in model container [2024-11-08 20:23:37,734 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:23:37" (3/3) ... [2024-11-08 20:23:37,735 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-77.i [2024-11-08 20:23:37,756 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 20:23:37,757 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 20:23:37,818 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 20:23:37,824 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;@4daa4414, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 20:23:37,824 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 20:23:37,828 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 46 states have internal predecessors, (62), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 20:23:37,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-08 20:23:37,839 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:23:37,840 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:23:37,840 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:23:37,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:23:37,844 INFO L85 PathProgramCache]: Analyzing trace with hash -529169918, now seen corresponding path program 1 times [2024-11-08 20:23:37,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:23:37,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1575873813] [2024-11-08 20:23:37,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:23:37,857 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 20:23:37,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:23:37,861 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 20:23:37,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 20:23:38,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:38,170 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 20:23:38,180 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:23:38,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 350 proven. 0 refuted. 0 times theorem prover too weak. 754 trivial. 0 not checked. [2024-11-08 20:23:38,238 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 20:23:38,240 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 20:23:38,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1575873813] [2024-11-08 20:23:38,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1575873813] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:23:38,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:23:38,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 20:23:38,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533645666] [2024-11-08 20:23:38,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:23:38,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 20:23:38,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 20:23:38,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 20:23:38,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 20:23:38,277 INFO L87 Difference]: Start difference. First operand has 72 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 46 states have internal predecessors, (62), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-08 20:23:38,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:23:38,315 INFO L93 Difference]: Finished difference Result 137 states and 238 transitions. [2024-11-08 20:23:38,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 20:23:38,318 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 153 [2024-11-08 20:23:38,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:23:38,327 INFO L225 Difference]: With dead ends: 137 [2024-11-08 20:23:38,328 INFO L226 Difference]: Without dead ends: 68 [2024-11-08 20:23:38,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 20:23:38,335 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 20:23:38,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 20:23:38,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-08 20:23:38,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-11-08 20:23:38,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 42 states have internal predecessors, (55), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 20:23:38,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 103 transitions. [2024-11-08 20:23:38,386 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 103 transitions. Word has length 153 [2024-11-08 20:23:38,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:23:38,386 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 103 transitions. [2024-11-08 20:23:38,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-08 20:23:38,387 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 103 transitions. [2024-11-08 20:23:38,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-08 20:23:38,392 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:23:38,392 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:23:38,404 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 20:23:38,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 20:23:38,597 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:23:38,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:23:38,598 INFO L85 PathProgramCache]: Analyzing trace with hash 106605442, now seen corresponding path program 1 times [2024-11-08 20:23:38,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:23:38,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1984799091] [2024-11-08 20:23:38,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:23:38,600 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 20:23:38,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:23:38,601 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 20:23:38,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 20:23:38,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:38,927 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 20:23:38,932 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:23:38,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-08 20:23:38,999 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 20:23:38,999 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 20:23:39,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1984799091] [2024-11-08 20:23:39,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1984799091] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:23:39,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:23:39,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 20:23:39,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792583628] [2024-11-08 20:23:39,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:23:39,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 20:23:39,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 20:23:39,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 20:23:39,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 20:23:39,005 INFO L87 Difference]: Start difference. First operand 68 states and 103 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 20:23:39,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:23:39,185 INFO L93 Difference]: Finished difference Result 132 states and 201 transitions. [2024-11-08 20:23:39,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 20:23:39,193 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 153 [2024-11-08 20:23:39,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:23:39,196 INFO L225 Difference]: With dead ends: 132 [2024-11-08 20:23:39,196 INFO L226 Difference]: Without dead ends: 67 [2024-11-08 20:23:39,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 20:23:39,198 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 0 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 20:23:39,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 195 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 20:23:39,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-08 20:23:39,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-11-08 20:23:39,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 41 states have internal predecessors, (52), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 20:23:39,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 100 transitions. [2024-11-08 20:23:39,210 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 100 transitions. Word has length 153 [2024-11-08 20:23:39,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:23:39,212 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 100 transitions. [2024-11-08 20:23:39,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 20:23:39,212 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 100 transitions. [2024-11-08 20:23:39,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-08 20:23:39,214 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:23:39,214 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:23:39,228 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-08 20:23:39,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 20:23:39,415 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:23:39,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:23:39,416 INFO L85 PathProgramCache]: Analyzing trace with hash 343026818, now seen corresponding path program 1 times [2024-11-08 20:23:39,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:23:39,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [972437860] [2024-11-08 20:23:39,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:23:39,418 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 20:23:39,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:23:39,421 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 20:23:39,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 20:23:39,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:39,744 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-08 20:23:39,756 INFO L278 TraceCheckSpWp]: Computing forward predicates...