./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-8.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-8.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 517e27336460af7ba2854a8d7aa1a1bf348bd2f4daf99eaa687977dfb875eed5 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 12:15:23,844 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 12:15:23,948 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 12:15:23,954 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 12:15:23,956 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 12:15:23,989 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 12:15:23,991 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 12:15:23,992 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 12:15:23,993 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 12:15:23,994 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 12:15:23,995 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 12:15:23,995 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 12:15:23,996 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 12:15:23,998 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 12:15:23,999 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 12:15:23,999 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 12:15:23,999 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 12:15:24,000 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 12:15:24,000 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 12:15:24,000 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 12:15:24,000 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 12:15:24,004 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 12:15:24,005 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 12:15:24,005 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 12:15:24,005 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 12:15:24,006 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 12:15:24,006 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 12:15:24,006 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 12:15:24,006 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 12:15:24,007 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 12:15:24,007 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 12:15:24,007 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 12:15:24,008 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:15:24,008 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 12:15:24,009 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 12:15:24,009 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 12:15:24,010 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 12:15:24,010 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 12:15:24,010 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 12:15:24,010 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 12:15:24,011 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 12:15:24,012 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 12:15:24,012 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-clean/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-clean/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 -> 517e27336460af7ba2854a8d7aa1a1bf348bd2f4daf99eaa687977dfb875eed5 [2024-10-11 12:15:24,304 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 12:15:24,340 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 12:15:24,343 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 12:15:24,344 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 12:15:24,345 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 12:15:24,346 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-8.i [2024-10-11 12:15:25,919 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 12:15:26,190 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 12:15:26,192 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-8.i [2024-10-11 12:15:26,207 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a6dec1f24/89aab620b64546a3ba2f264b8004f066/FLAGeafbc89f9 [2024-10-11 12:15:26,226 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a6dec1f24/89aab620b64546a3ba2f264b8004f066 [2024-10-11 12:15:26,229 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 12:15:26,231 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 12:15:26,233 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 12:15:26,233 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 12:15:26,240 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 12:15:26,241 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:15:26" (1/1) ... [2024-10-11 12:15:26,242 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@534e7c4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:15:26, skipping insertion in model container [2024-10-11 12:15:26,242 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:15:26" (1/1) ... [2024-10-11 12:15:26,283 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 12:15:26,484 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-8.i[915,928] [2024-10-11 12:15:26,607 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:15:26,631 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 12:15:26,647 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-8.i[915,928] [2024-10-11 12:15:26,699 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:15:26,724 INFO L204 MainTranslator]: Completed translation [2024-10-11 12:15:26,725 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:15:26 WrapperNode [2024-10-11 12:15:26,725 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 12:15:26,727 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 12:15:26,728 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 12:15:26,728 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 12:15:26,736 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:15:26" (1/1) ... [2024-10-11 12:15:26,749 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:15:26" (1/1) ... [2024-10-11 12:15:26,792 INFO L138 Inliner]: procedures = 26, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 250 [2024-10-11 12:15:26,793 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 12:15:26,794 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 12:15:26,794 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 12:15:26,794 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 12:15:26,813 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:15:26" (1/1) ... [2024-10-11 12:15:26,814 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:15:26" (1/1) ... [2024-10-11 12:15:26,823 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:15:26" (1/1) ... [2024-10-11 12:15:26,862 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 12:15:26,863 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:15:26" (1/1) ... [2024-10-11 12:15:26,863 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:15:26" (1/1) ... [2024-10-11 12:15:26,875 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:15:26" (1/1) ... [2024-10-11 12:15:26,880 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:15:26" (1/1) ... [2024-10-11 12:15:26,883 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:15:26" (1/1) ... [2024-10-11 12:15:26,885 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:15:26" (1/1) ... [2024-10-11 12:15:26,894 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 12:15:26,899 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 12:15:26,900 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 12:15:26,900 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 12:15:26,901 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:15:26" (1/1) ... [2024-10-11 12:15:26,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:15:26,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:15:26,973 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 12:15:26,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 12:15:27,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 12:15:27,036 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 12:15:27,039 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 12:15:27,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 12:15:27,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 12:15:27,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 12:15:27,136 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 12:15:27,139 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 12:15:27,632 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-10-11 12:15:27,632 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 12:15:27,688 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 12:15:27,689 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 12:15:27,690 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:15:27 BoogieIcfgContainer [2024-10-11 12:15:27,690 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 12:15:27,694 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 12:15:27,694 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 12:15:27,698 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 12:15:27,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:15:26" (1/3) ... [2024-10-11 12:15:27,700 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d33bf25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:15:27, skipping insertion in model container [2024-10-11 12:15:27,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:15:26" (2/3) ... [2024-10-11 12:15:27,701 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d33bf25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:15:27, skipping insertion in model container [2024-10-11 12:15:27,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:15:27" (3/3) ... [2024-10-11 12:15:27,704 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-8.i [2024-10-11 12:15:27,724 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 12:15:27,725 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 12:15:27,789 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 12:15:27,795 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;@1f1f4bb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 12:15:27,796 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 12:15:27,805 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 69 states have (on average 1.4927536231884058) internal successors, (103), 70 states have internal predecessors, (103), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 12:15:27,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-10-11 12:15:27,820 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:15:27,821 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:15:27,821 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:15:27,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:15:27,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1559828949, now seen corresponding path program 1 times [2024-10-11 12:15:27,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:15:27,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243573141] [2024-10-11 12:15:27,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:15:27,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:15:28,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:28,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:15:28,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:28,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:15:28,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:28,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 12:15:28,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:28,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:15:28,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:28,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:15:28,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:28,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 12:15:28,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:28,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:15:28,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:28,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 12:15:28,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:28,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:15:28,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:28,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 12:15:28,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:28,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:15:28,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:28,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 12:15:28,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:28,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 12:15:28,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:28,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 12:15:28,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:28,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 12:15:28,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:28,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 12:15:28,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:28,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 12:15:28,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:28,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 12:15:28,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:28,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 12:15:28,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:28,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 12:15:28,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:28,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 12:15:28,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:28,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 12:15:28,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:28,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 12:15:28,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:28,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 12:15:28,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:28,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 12:15:28,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:28,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 12:15:28,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:28,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 12:15:28,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:28,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 12:15:28,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:28,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 12:15:28,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:28,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 12:15:28,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:28,727 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-11 12:15:28,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:15:28,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243573141] [2024-10-11 12:15:28,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243573141] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:15:28,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:15:28,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 12:15:28,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287786593] [2024-10-11 12:15:28,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:15:28,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 12:15:28,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:15:28,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 12:15:28,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 12:15:28,780 INFO L87 Difference]: Start difference. First operand has 102 states, 69 states have (on average 1.4927536231884058) internal successors, (103), 70 states have internal predecessors, (103), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-11 12:15:28,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:15:28,967 INFO L93 Difference]: Finished difference Result 300 states and 545 transitions. [2024-10-11 12:15:28,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 12:15:28,970 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 194 [2024-10-11 12:15:28,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:15:28,986 INFO L225 Difference]: With dead ends: 300 [2024-10-11 12:15:28,987 INFO L226 Difference]: Without dead ends: 199 [2024-10-11 12:15:28,993 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 12:15:29,001 INFO L432 NwaCegarLoop]: 288 mSDtfsCounter, 150 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 12:15:29,003 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 429 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 12:15:29,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-10-11 12:15:29,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 112. [2024-10-11 12:15:29,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 80 states have (on average 1.45) internal successors, (116), 80 states have internal predecessors, (116), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 12:15:29,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 176 transitions. [2024-10-11 12:15:29,074 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 176 transitions. Word has length 194 [2024-10-11 12:15:29,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:15:29,079 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 176 transitions. [2024-10-11 12:15:29,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-11 12:15:29,079 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 176 transitions. [2024-10-11 12:15:29,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-10-11 12:15:29,085 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:15:29,085 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:15:29,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 12:15:29,086 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:15:29,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:15:29,087 INFO L85 PathProgramCache]: Analyzing trace with hash 973022935, now seen corresponding path program 1 times [2024-10-11 12:15:29,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:15:29,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497137889] [2024-10-11 12:15:29,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:15:29,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:15:29,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:29,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:15:29,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:29,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:15:29,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:29,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 12:15:29,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:29,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:15:29,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:29,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:15:29,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:29,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 12:15:29,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:29,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:15:29,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:29,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 12:15:29,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:29,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:15:29,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:29,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 12:15:29,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:29,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:15:29,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:29,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 12:15:29,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:29,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 12:15:29,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:29,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 12:15:29,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:29,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 12:15:29,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:29,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 12:15:29,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:29,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 12:15:29,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:29,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 12:15:29,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:29,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 12:15:29,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:29,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 12:15:29,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:29,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 12:15:29,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:29,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 12:15:29,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:29,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 12:15:29,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:29,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 12:15:29,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:29,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 12:15:29,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:29,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 12:15:29,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:29,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 12:15:29,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:29,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 12:15:29,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:29,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 12:15:29,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:29,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 12:15:29,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:29,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-11 12:15:29,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:15:29,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497137889] [2024-10-11 12:15:29,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497137889] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:15:29,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:15:29,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 12:15:29,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150489215] [2024-10-11 12:15:29,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:15:29,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 12:15:29,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:15:29,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 12:15:29,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 12:15:29,520 INFO L87 Difference]: Start difference. First operand 112 states and 176 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-11 12:15:29,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:15:29,579 INFO L93 Difference]: Finished difference Result 296 states and 470 transitions. [2024-10-11 12:15:29,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 12:15:29,581 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 194 [2024-10-11 12:15:29,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:15:29,585 INFO L225 Difference]: With dead ends: 296 [2024-10-11 12:15:29,585 INFO L226 Difference]: Without dead ends: 185 [2024-10-11 12:15:29,590 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 12:15:29,592 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 150 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 12:15:29,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 377 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 12:15:29,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-10-11 12:15:29,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 100. [2024-10-11 12:15:29,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 68 states have (on average 1.411764705882353) internal successors, (96), 68 states have internal predecessors, (96), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 12:15:29,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 156 transitions. [2024-10-11 12:15:29,623 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 156 transitions. Word has length 194 [2024-10-11 12:15:29,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:15:29,624 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 156 transitions. [2024-10-11 12:15:29,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-11 12:15:29,628 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 156 transitions. [2024-10-11 12:15:29,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-10-11 12:15:29,634 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:15:29,634 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:15:29,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 12:15:29,635 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:15:29,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:15:29,636 INFO L85 PathProgramCache]: Analyzing trace with hash 11060391, now seen corresponding path program 1 times [2024-10-11 12:15:29,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:15:29,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432887659] [2024-10-11 12:15:29,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:15:29,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:15:29,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:29,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:15:29,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:29,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:15:29,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:29,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 12:15:29,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:29,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:15:29,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:29,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:15:29,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:29,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 12:15:29,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:29,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:15:29,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:29,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 12:15:29,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:29,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:15:29,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:29,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 12:15:29,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:29,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:15:29,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:29,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 12:15:29,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:29,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 12:15:29,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:29,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 12:15:29,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:29,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 12:15:29,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:29,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 12:15:29,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:29,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 12:15:29,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:29,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 12:15:29,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:29,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 12:15:29,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:29,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 12:15:29,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:29,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 12:15:29,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:29,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 12:15:29,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:29,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 12:15:29,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:29,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 12:15:29,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:29,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 12:15:29,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:29,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 12:15:29,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:30,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 12:15:30,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:30,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 12:15:30,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:30,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 12:15:30,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:30,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 12:15:30,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:30,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-11 12:15:30,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:15:30,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432887659] [2024-10-11 12:15:30,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432887659] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:15:30,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:15:30,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 12:15:30,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576581010] [2024-10-11 12:15:30,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:15:30,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 12:15:30,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:15:30,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 12:15:30,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 12:15:30,048 INFO L87 Difference]: Start difference. First operand 100 states and 156 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-11 12:15:30,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:15:30,145 INFO L93 Difference]: Finished difference Result 298 states and 466 transitions. [2024-10-11 12:15:30,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 12:15:30,145 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 195 [2024-10-11 12:15:30,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:15:30,150 INFO L225 Difference]: With dead ends: 298 [2024-10-11 12:15:30,153 INFO L226 Difference]: Without dead ends: 199 [2024-10-11 12:15:30,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 12:15:30,155 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 86 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 12:15:30,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 277 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 12:15:30,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-10-11 12:15:30,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 196. [2024-10-11 12:15:30,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 133 states have (on average 1.3984962406015038) internal successors, (186), 133 states have internal predecessors, (186), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-11 12:15:30,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 306 transitions. [2024-10-11 12:15:30,194 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 306 transitions. Word has length 195 [2024-10-11 12:15:30,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:15:30,195 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 306 transitions. [2024-10-11 12:15:30,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-11 12:15:30,196 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 306 transitions. [2024-10-11 12:15:30,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-10-11 12:15:30,199 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:15:30,199 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:15:30,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 12:15:30,200 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:15:30,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:15:30,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1203462374, now seen corresponding path program 1 times [2024-10-11 12:15:30,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:15:30,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962958397] [2024-10-11 12:15:30,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:15:30,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:15:30,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:30,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:15:30,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:30,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:15:30,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:30,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 12:15:30,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:30,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:15:30,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:30,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:15:30,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:30,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 12:15:30,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:30,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:15:30,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:30,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 12:15:30,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:30,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:15:30,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:30,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 12:15:30,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:30,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:15:30,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:30,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 12:15:30,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:30,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 12:15:30,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:30,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 12:15:30,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:30,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 12:15:30,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:30,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 12:15:30,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:30,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 12:15:30,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:30,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 12:15:30,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:30,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 12:15:30,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:30,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 12:15:30,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:30,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 12:15:30,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:30,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 12:15:30,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:30,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 12:15:30,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:30,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 12:15:30,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:30,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 12:15:30,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:30,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 12:15:30,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:30,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 12:15:30,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:30,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 12:15:30,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:30,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 12:15:30,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:30,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 12:15:30,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:30,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-11 12:15:30,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:15:30,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962958397] [2024-10-11 12:15:30,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962958397] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:15:30,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:15:30,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 12:15:30,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472577349] [2024-10-11 12:15:30,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:15:30,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 12:15:30,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:15:30,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 12:15:30,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 12:15:30,586 INFO L87 Difference]: Start difference. First operand 196 states and 306 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-11 12:15:31,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:15:31,053 INFO L93 Difference]: Finished difference Result 493 states and 767 transitions. [2024-10-11 12:15:31,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 12:15:31,054 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 196 [2024-10-11 12:15:31,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:15:31,058 INFO L225 Difference]: With dead ends: 493 [2024-10-11 12:15:31,060 INFO L226 Difference]: Without dead ends: 298 [2024-10-11 12:15:31,064 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 12:15:31,065 INFO L432 NwaCegarLoop]: 272 mSDtfsCounter, 262 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 12:15:31,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 469 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 12:15:31,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-10-11 12:15:31,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 210. [2024-10-11 12:15:31,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 147 states have (on average 1.3877551020408163) internal successors, (204), 147 states have internal predecessors, (204), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-11 12:15:31,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 324 transitions. [2024-10-11 12:15:31,112 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 324 transitions. Word has length 196 [2024-10-11 12:15:31,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:15:31,115 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 324 transitions. [2024-10-11 12:15:31,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-11 12:15:31,115 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 324 transitions. [2024-10-11 12:15:31,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-10-11 12:15:31,119 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:15:31,119 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:15:31,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 12:15:31,120 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:15:31,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:15:31,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1811641244, now seen corresponding path program 1 times [2024-10-11 12:15:31,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:15:31,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346684347] [2024-10-11 12:15:31,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:15:31,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:15:31,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:31,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:15:31,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:31,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:15:31,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:31,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 12:15:31,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:31,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:15:31,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:31,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:15:31,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:31,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 12:15:31,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:31,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:15:31,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:31,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 12:15:31,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:31,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:15:31,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:31,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 12:15:31,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:31,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:15:31,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:31,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 12:15:31,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:31,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 12:15:31,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:31,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 12:15:31,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:31,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 12:15:31,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:31,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 12:15:31,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:31,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 12:15:31,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:31,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 12:15:31,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:31,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 12:15:31,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:31,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 12:15:31,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:31,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 12:15:31,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:31,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 12:15:31,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:31,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 12:15:31,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:31,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 12:15:31,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:31,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 12:15:31,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:31,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 12:15:31,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:31,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 12:15:31,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:31,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 12:15:31,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:31,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 12:15:31,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:31,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 12:15:31,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:31,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-11 12:15:31,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:15:31,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346684347] [2024-10-11 12:15:31,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346684347] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:15:31,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:15:31,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 12:15:31,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722760162] [2024-10-11 12:15:31,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:15:31,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 12:15:31,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:15:31,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 12:15:31,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 12:15:31,427 INFO L87 Difference]: Start difference. First operand 210 states and 324 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-11 12:15:31,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:15:31,796 INFO L93 Difference]: Finished difference Result 495 states and 769 transitions. [2024-10-11 12:15:31,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 12:15:31,797 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 196 [2024-10-11 12:15:31,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:15:31,800 INFO L225 Difference]: With dead ends: 495 [2024-10-11 12:15:31,802 INFO L226 Difference]: Without dead ends: 286 [2024-10-11 12:15:31,804 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 12:15:31,805 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 171 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 12:15:31,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 485 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 12:15:31,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-10-11 12:15:31,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 196. [2024-10-11 12:15:31,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 133 states have (on average 1.3834586466165413) internal successors, (184), 133 states have internal predecessors, (184), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-11 12:15:31,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 304 transitions. [2024-10-11 12:15:31,844 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 304 transitions. Word has length 196 [2024-10-11 12:15:31,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:15:31,846 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 304 transitions. [2024-10-11 12:15:31,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-11 12:15:31,847 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 304 transitions. [2024-10-11 12:15:31,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-10-11 12:15:31,849 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:15:31,849 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:15:31,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 12:15:31,850 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:15:31,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:15:31,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1646457031, now seen corresponding path program 1 times [2024-10-11 12:15:31,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:15:31,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069492934] [2024-10-11 12:15:31,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:15:31,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:15:31,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:32,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:15:32,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:32,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:15:32,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:32,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 12:15:32,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:32,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:15:32,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:32,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:15:32,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:32,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 12:15:32,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:32,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:15:32,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:32,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 12:15:32,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:32,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:15:32,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:32,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 12:15:32,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:32,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:15:32,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:32,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 12:15:32,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:32,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 12:15:32,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:32,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 12:15:32,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:32,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 12:15:32,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:32,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 12:15:32,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:32,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 12:15:32,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:32,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 12:15:32,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:32,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 12:15:32,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:32,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 12:15:32,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:32,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 12:15:32,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:32,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 12:15:32,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:32,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 12:15:32,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:32,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 12:15:32,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:32,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 12:15:32,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:32,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 12:15:32,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:32,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 12:15:32,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:32,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 12:15:32,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:32,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 12:15:32,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:32,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 12:15:32,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:32,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-11 12:15:32,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:15:32,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069492934] [2024-10-11 12:15:32,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069492934] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:15:32,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:15:32,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 12:15:32,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540808863] [2024-10-11 12:15:32,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:15:32,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 12:15:32,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:15:32,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 12:15:32,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 12:15:32,132 INFO L87 Difference]: Start difference. First operand 196 states and 304 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-11 12:15:32,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:15:32,347 INFO L93 Difference]: Finished difference Result 512 states and 797 transitions. [2024-10-11 12:15:32,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 12:15:32,347 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 196 [2024-10-11 12:15:32,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:15:32,352 INFO L225 Difference]: With dead ends: 512 [2024-10-11 12:15:32,353 INFO L226 Difference]: Without dead ends: 413 [2024-10-11 12:15:32,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 12:15:32,355 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 182 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 12:15:32,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 550 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 12:15:32,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2024-10-11 12:15:32,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 201. [2024-10-11 12:15:32,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 138 states have (on average 1.3840579710144927) internal successors, (191), 138 states have internal predecessors, (191), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-11 12:15:32,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 311 transitions. [2024-10-11 12:15:32,426 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 311 transitions. Word has length 196 [2024-10-11 12:15:32,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:15:32,426 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 311 transitions. [2024-10-11 12:15:32,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-11 12:15:32,427 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 311 transitions. [2024-10-11 12:15:32,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-10-11 12:15:32,429 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:15:32,429 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:15:32,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 12:15:32,429 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:15:32,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:15:32,430 INFO L85 PathProgramCache]: Analyzing trace with hash 158981303, now seen corresponding path program 1 times [2024-10-11 12:15:32,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:15:32,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962390954] [2024-10-11 12:15:32,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:15:32,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:15:32,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 12:15:32,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1695017742] [2024-10-11 12:15:32,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:15:32,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 12:15:32,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:15:32,610 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 12:15:32,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 12:15:32,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 12:15:32,797 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 12:15:32,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 12:15:33,056 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 12:15:33,057 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 12:15:33,058 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 12:15:33,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 12:15:33,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 12:15:33,264 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:15:33,420 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 12:15:33,425 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 12:15:33 BoogieIcfgContainer [2024-10-11 12:15:33,425 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 12:15:33,426 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 12:15:33,426 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 12:15:33,426 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 12:15:33,427 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:15:27" (3/4) ... [2024-10-11 12:15:33,429 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 12:15:33,430 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 12:15:33,431 INFO L158 Benchmark]: Toolchain (without parser) took 7199.85ms. Allocated memory was 148.9MB in the beginning and 226.5MB in the end (delta: 77.6MB). Free memory was 93.8MB in the beginning and 103.8MB in the end (delta: -10.1MB). Peak memory consumption was 68.9MB. Max. memory is 16.1GB. [2024-10-11 12:15:33,431 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 148.9MB. Free memory is still 108.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:15:33,431 INFO L158 Benchmark]: CACSL2BoogieTranslator took 492.97ms. Allocated memory is still 148.9MB. Free memory was 93.4MB in the beginning and 75.6MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 12:15:33,433 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.16ms. Allocated memory is still 148.9MB. Free memory was 75.3MB in the beginning and 71.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 12:15:33,433 INFO L158 Benchmark]: Boogie Preprocessor took 100.99ms. Allocated memory is still 148.9MB. Free memory was 71.1MB in the beginning and 65.5MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 12:15:33,434 INFO L158 Benchmark]: RCFGBuilder took 790.50ms. Allocated memory was 148.9MB in the beginning and 188.7MB in the end (delta: 39.8MB). Free memory was 65.5MB in the beginning and 129.2MB in the end (delta: -63.7MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. [2024-10-11 12:15:33,434 INFO L158 Benchmark]: TraceAbstraction took 5731.56ms. Allocated memory was 188.7MB in the beginning and 226.5MB in the end (delta: 37.7MB). Free memory was 128.2MB in the beginning and 103.8MB in the end (delta: 24.3MB). Peak memory consumption was 63.1MB. Max. memory is 16.1GB. [2024-10-11 12:15:33,434 INFO L158 Benchmark]: Witness Printer took 4.80ms. Allocated memory is still 226.5MB. Free memory is still 103.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:15:33,436 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.21ms. Allocated memory is still 148.9MB. Free memory is still 108.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 492.97ms. Allocated memory is still 148.9MB. Free memory was 93.4MB in the beginning and 75.6MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.16ms. Allocated memory is still 148.9MB. Free memory was 75.3MB in the beginning and 71.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 100.99ms. Allocated memory is still 148.9MB. Free memory was 71.1MB in the beginning and 65.5MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 790.50ms. Allocated memory was 148.9MB in the beginning and 188.7MB in the end (delta: 39.8MB). Free memory was 65.5MB in the beginning and 129.2MB in the end (delta: -63.7MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. * TraceAbstraction took 5731.56ms. Allocated memory was 188.7MB in the beginning and 226.5MB in the end (delta: 37.7MB). Free memory was 128.2MB in the beginning and 103.8MB in the end (delta: 24.3MB). Peak memory consumption was 63.1MB. Max. memory is 16.1GB. * Witness Printer took 4.80ms. Allocated memory is still 226.5MB. Free memory is still 103.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 193, overapproximation of someUnaryDOUBLEoperation at line 30, overapproximation of someBinaryArithmeticDOUBLEoperation at line 68, overapproximation of someBinaryDOUBLEComparisonOperation at line 193, overapproximation of someBinaryArithmeticFLOAToperation at line 125. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 256.8; [L23] signed long int var_1_4 = -5; [L24] float var_1_5 = 7.875; [L25] float var_1_6 = 99.04; [L26] signed long int var_1_7 = -2; [L27] signed long int var_1_8 = 1227169815; [L28] signed short int var_1_11 = 4; [L29] unsigned char var_1_12 = 1; [L30] double var_1_14 = -0.5; [L31] double var_1_15 = 7.5; [L32] unsigned char var_1_16 = 1; [L33] double var_1_17 = 25.2; [L34] double var_1_18 = 256.4; [L35] signed long int var_1_19 = 4; [L36] unsigned char var_1_20 = 1; [L37] unsigned char var_1_22 = 50; [L38] float var_1_23 = 15.4; [L39] signed short int var_1_24 = -32; [L40] signed short int var_1_25 = 20388; [L41] signed long int var_1_26 = 0; [L42] double var_1_27 = 0.6; [L43] unsigned char var_1_28 = 128; [L44] unsigned char var_1_29 = 5; [L45] signed char var_1_30 = -2; [L46] signed char var_1_31 = 5; [L47] signed char var_1_32 = 10; [L48] signed char var_1_33 = 4; [L49] signed char var_1_34 = 8; [L50] float last_1_var_1_1 = 256.8; [L51] unsigned char last_1_var_1_20 = 1; [L52] float last_1_var_1_23 = 15.4; [L197] isInitial = 1 [L198] FCALL initially() [L199] COND TRUE 1 [L200] CALL updateLastVariables() [L188] last_1_var_1_1 = var_1_1 [L189] last_1_var_1_20 = var_1_20 [L190] last_1_var_1_23 = var_1_23 [L200] RET updateLastVariables() [L201] CALL updateVariables() [L140] var_1_4 = __VERIFIER_nondet_long() [L141] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_8=1227169815] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_8=1227169815] [L141] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_8=1227169815] [L142] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_8=1227169815] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_8=1227169815] [L142] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_8=1227169815] [L143] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_8=1227169815] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_8=1227169815] [L143] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_8=1227169815] [L144] var_1_5 = __VERIFIER_nondet_float() [L145] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_6=2476/25, var_1_7=-2, var_1_8=1227169815] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_6=2476/25, var_1_7=-2, var_1_8=1227169815] [L145] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_6=2476/25, var_1_7=-2, var_1_8=1227169815] [L146] var_1_6 = __VERIFIER_nondet_float() [L147] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1227169815] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1227169815] [L147] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1227169815] [L148] var_1_8 = __VERIFIER_nondet_long() [L149] CALL assume_abort_if_not(var_1_8 >= 1073741822) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L149] RET assume_abort_if_not(var_1_8 >= 1073741822) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L150] CALL assume_abort_if_not(var_1_8 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L150] RET assume_abort_if_not(var_1_8 <= 2147483646) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L151] var_1_12 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L152] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L153] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L153] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L154] var_1_16 = __VERIFIER_nondet_uchar() [L155] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L155] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L156] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L156] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L157] var_1_17 = __VERIFIER_nondet_double() [L158] CALL assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L158] RET assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L159] var_1_18 = __VERIFIER_nondet_double() [L160] CALL assume_abort_if_not((var_1_18 >= -461168.6018427382800e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L160] RET assume_abort_if_not((var_1_18 >= -461168.6018427382800e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L161] var_1_22 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L162] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L163] CALL assume_abort_if_not(var_1_22 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-256, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-256, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L163] RET assume_abort_if_not(var_1_22 <= 254) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-256, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L164] var_1_24 = __VERIFIER_nondet_short() [L165] CALL assume_abort_if_not(var_1_24 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-256, var_1_23=77/5, var_1_24=-9, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-256, var_1_23=77/5, var_1_24=-9, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L165] RET assume_abort_if_not(var_1_24 >= -32768) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-256, var_1_23=77/5, var_1_24=-9, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L166] CALL assume_abort_if_not(var_1_24 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-256, var_1_23=77/5, var_1_24=-9, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-256, var_1_23=77/5, var_1_24=-9, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L166] RET assume_abort_if_not(var_1_24 <= 32767) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-256, var_1_23=77/5, var_1_24=-9, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L167] CALL assume_abort_if_not(var_1_24 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-256, var_1_23=77/5, var_1_24=-9, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-256, var_1_23=77/5, var_1_24=-9, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L167] RET assume_abort_if_not(var_1_24 != 0) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-256, var_1_23=77/5, var_1_24=-9, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L168] var_1_25 = __VERIFIER_nondet_short() [L169] CALL assume_abort_if_not(var_1_25 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-256, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-256, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L169] RET assume_abort_if_not(var_1_25 >= 16383) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-256, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L170] CALL assume_abort_if_not(var_1_25 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-256, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-256, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L170] RET assume_abort_if_not(var_1_25 <= 32767) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-256, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L171] var_1_29 = __VERIFIER_nondet_uchar() [L172] CALL assume_abort_if_not(var_1_29 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-256, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-256, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L172] RET assume_abort_if_not(var_1_29 >= 0) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-256, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L173] CALL assume_abort_if_not(var_1_29 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-256, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=0, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-256, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=0, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L173] RET assume_abort_if_not(var_1_29 <= 254) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-256, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=0, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L174] var_1_31 = __VERIFIER_nondet_char() [L175] CALL assume_abort_if_not(var_1_31 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-256, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=0, var_1_30=-2, var_1_31=-63, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-256, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=0, var_1_30=-2, var_1_31=-63, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L175] RET assume_abort_if_not(var_1_31 >= -63) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-256, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=0, var_1_30=-2, var_1_31=-63, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L176] CALL assume_abort_if_not(var_1_31 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-256, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=0, var_1_30=-2, var_1_31=-63, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-256, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=0, var_1_30=-2, var_1_31=-63, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L176] RET assume_abort_if_not(var_1_31 <= 63) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-256, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=0, var_1_30=-2, var_1_31=-63, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L177] var_1_32 = __VERIFIER_nondet_char() [L178] CALL assume_abort_if_not(var_1_32 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-256, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=0, var_1_30=-2, var_1_31=-63, var_1_32=-63, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-256, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=0, var_1_30=-2, var_1_31=-63, var_1_32=-63, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L178] RET assume_abort_if_not(var_1_32 >= -63) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-256, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=0, var_1_30=-2, var_1_31=-63, var_1_32=-63, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L179] CALL assume_abort_if_not(var_1_32 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-256, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=0, var_1_30=-2, var_1_31=-63, var_1_32=-63, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-256, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=0, var_1_30=-2, var_1_31=-63, var_1_32=-63, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L179] RET assume_abort_if_not(var_1_32 <= 63) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-256, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=0, var_1_30=-2, var_1_31=-63, var_1_32=-63, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L180] var_1_33 = __VERIFIER_nondet_char() [L181] CALL assume_abort_if_not(var_1_33 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-256, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=0, var_1_30=-2, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-256, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=0, var_1_30=-2, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L181] RET assume_abort_if_not(var_1_33 >= -127) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-256, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=0, var_1_30=-2, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L182] CALL assume_abort_if_not(var_1_33 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-256, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=0, var_1_30=-2, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-256, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=0, var_1_30=-2, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L182] RET assume_abort_if_not(var_1_33 <= 126) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-256, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=0, var_1_30=-2, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L183] var_1_34 = __VERIFIER_nondet_char() [L184] CALL assume_abort_if_not(var_1_34 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-256, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=0, var_1_30=-2, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-256, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=0, var_1_30=-2, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L184] RET assume_abort_if_not(var_1_34 >= -127) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-256, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=0, var_1_30=-2, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L185] CALL assume_abort_if_not(var_1_34 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-256, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=0, var_1_30=-2, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-256, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=0, var_1_30=-2, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L185] RET assume_abort_if_not(var_1_34 <= 126) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-256, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=0, var_1_30=-2, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L201] RET updateVariables() [L202] CALL step() [L56] COND FALSE !(var_1_18 < last_1_var_1_23) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-256, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=0, var_1_30=-2, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L67] COND TRUE (var_1_22 + (var_1_20 / var_1_24)) <= var_1_20 [L68] var_1_27 = (10000.2 + (((((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18))) < 0 ) ? -((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18))) : ((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18)))))) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-256, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_28=128, var_1_29=0, var_1_30=-2, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L72] COND TRUE var_1_8 > var_1_4 [L73] var_1_11 = 0 VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=0, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-256, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_28=128, var_1_29=0, var_1_30=-2, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L85] signed long int stepLocal_5 = 10000000; VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, stepLocal_5=10000000, var_1_11=0, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-256, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_28=128, var_1_29=0, var_1_30=-2, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L86] COND TRUE (var_1_5 - var_1_6) >= var_1_27 VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, stepLocal_5=10000000, var_1_11=0, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-256, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_28=128, var_1_29=0, var_1_30=-2, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L87] COND TRUE stepLocal_5 > var_1_11 [L88] var_1_30 = (((((var_1_31 + var_1_32)) > (var_1_33)) ? ((var_1_31 + var_1_32)) : (var_1_33))) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=0, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-256, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_28=128, var_1_29=0, var_1_30=0, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L93] signed char stepLocal_4 = var_1_30; VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, stepLocal_4=0, var_1_11=0, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-256, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_28=128, var_1_29=0, var_1_30=0, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L94] COND TRUE ((var_1_30 + var_1_20) / var_1_4) > stepLocal_4 [L95] var_1_28 = ((((var_1_22) < (var_1_29)) ? (var_1_22) : (var_1_29))) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=0, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-256, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L97] var_1_19 = (var_1_28 + (var_1_30 + var_1_11)) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=0, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=0, var_1_1=1284/5, var_1_20=1, var_1_22=-256, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L98] EXPR 8 << var_1_19 VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=0, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=0, var_1_1=1284/5, var_1_20=1, var_1_22=-256, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L98] COND FALSE !(var_1_20 < ((8 << var_1_19) / ((((var_1_4) < (var_1_24)) ? (var_1_4) : (var_1_24))))) [L103] unsigned char stepLocal_1 = var_1_4 >= var_1_11; VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, stepLocal_1=1, var_1_11=0, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=0, var_1_1=1284/5, var_1_20=1, var_1_22=-256, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L104] COND TRUE ((var_1_6 - var_1_5) < var_1_23) || stepLocal_1 [L105] var_1_7 = ((var_1_8 - var_1_28) - var_1_28) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=0, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=0, var_1_1=1284/5, var_1_20=1, var_1_22=-256, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_7=1073741822, var_1_8=1073741822] [L109] COND FALSE !(\read(var_1_12)) [L116] var_1_14 = var_1_6 VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=0, var_1_12=0, var_1_14=2, var_1_15=15/2, var_1_16=0, var_1_19=0, var_1_1=1284/5, var_1_20=1, var_1_22=-256, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_6=2, var_1_7=1073741822, var_1_8=1073741822] [L118] COND TRUE 1.000000004E8 == var_1_23 [L119] var_1_26 = (64 + var_1_20) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=0, var_1_12=0, var_1_14=2, var_1_15=15/2, var_1_16=0, var_1_19=0, var_1_1=1284/5, var_1_20=1, var_1_22=-256, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=65, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_6=2, var_1_7=1073741822, var_1_8=1073741822] [L123] signed long int stepLocal_0 = var_1_7 % var_1_4; VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, stepLocal_0=0, var_1_11=0, var_1_12=0, var_1_14=2, var_1_15=15/2, var_1_16=0, var_1_19=0, var_1_1=1284/5, var_1_20=1, var_1_22=-256, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=65, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_6=2, var_1_7=1073741822, var_1_8=1073741822] [L124] COND TRUE var_1_19 == stepLocal_0 [L125] var_1_1 = (var_1_5 - var_1_6) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=0, var_1_12=0, var_1_14=2, var_1_15=15/2, var_1_16=0, var_1_19=0, var_1_20=1, var_1_22=-256, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=65, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_6=2, var_1_7=1073741822, var_1_8=1073741822] [L127] unsigned char stepLocal_3 = var_1_16; [L128] signed long int stepLocal_2 = var_1_8; VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, stepLocal_2=1073741822, stepLocal_3=0, var_1_11=0, var_1_12=0, var_1_14=2, var_1_15=15/2, var_1_16=0, var_1_19=0, var_1_20=1, var_1_22=-256, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=65, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_6=2, var_1_7=1073741822, var_1_8=1073741822] [L129] EXPR var_1_26 ^ var_1_30 VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, stepLocal_2=1073741822, stepLocal_3=0, var_1_11=0, var_1_12=0, var_1_14=2, var_1_15=15/2, var_1_16=0, var_1_19=0, var_1_20=1, var_1_22=-256, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=65, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_6=2, var_1_7=1073741822, var_1_8=1073741822] [L129] COND FALSE !(stepLocal_2 < (var_1_26 ^ var_1_30)) [L136] var_1_15 = var_1_17 VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, stepLocal_3=0, var_1_11=0, var_1_12=0, var_1_14=2, var_1_15=3, var_1_16=0, var_1_17=3, var_1_19=0, var_1_20=1, var_1_22=-256, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=65, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_6=2, var_1_7=1073741822, var_1_8=1073741822] [L202] RET step() [L203] CALL, EXPR property() [L193] EXPR (((((var_1_19 == (var_1_7 % var_1_4)) ? (var_1_1 == ((float) (var_1_5 - var_1_6))) : 1) && ((((var_1_6 - var_1_5) < var_1_23) || (var_1_4 >= var_1_11)) ? (var_1_7 == ((signed long int) ((var_1_8 - var_1_28) - var_1_28))) : (var_1_7 == ((signed long int) -32)))) && ((var_1_8 > var_1_4) ? (var_1_11 == ((signed short int) 0)) : ((var_1_8 <= (last_1_var_1_20 + (last_1_var_1_20 / var_1_4))) ? (var_1_12 ? (var_1_11 == ((signed short int) last_1_var_1_20)) : (var_1_11 == ((signed short int) last_1_var_1_20))) : (var_1_11 == ((signed short int) last_1_var_1_20))))) && (var_1_12 ? ((((var_1_19 + var_1_20) * var_1_20) == ((var_1_8 + var_1_4) * var_1_20)) ? (var_1_14 == ((double) var_1_6)) : (var_1_14 == ((double) var_1_6))) : (var_1_14 == ((double) var_1_6)))) && ((var_1_8 < (var_1_26 ^ var_1_30)) ? (((! var_1_12) || var_1_16) ? (var_1_15 == ((double) ((((var_1_6) < ((var_1_17 + var_1_18))) ? (var_1_6) : ((var_1_17 + var_1_18)))))) : (var_1_15 == ((double) var_1_17))) : (var_1_15 == ((double) var_1_17))) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=0, var_1_12=0, var_1_14=2, var_1_15=3, var_1_16=0, var_1_17=3, var_1_19=0, var_1_20=1, var_1_22=-256, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=65, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_6=2, var_1_7=1073741822, var_1_8=1073741822] [L193] EXPR ((((((((var_1_19 == (var_1_7 % var_1_4)) ? (var_1_1 == ((float) (var_1_5 - var_1_6))) : 1) && ((((var_1_6 - var_1_5) < var_1_23) || (var_1_4 >= var_1_11)) ? (var_1_7 == ((signed long int) ((var_1_8 - var_1_28) - var_1_28))) : (var_1_7 == ((signed long int) -32)))) && ((var_1_8 > var_1_4) ? (var_1_11 == ((signed short int) 0)) : ((var_1_8 <= (last_1_var_1_20 + (last_1_var_1_20 / var_1_4))) ? (var_1_12 ? (var_1_11 == ((signed short int) last_1_var_1_20)) : (var_1_11 == ((signed short int) last_1_var_1_20))) : (var_1_11 == ((signed short int) last_1_var_1_20))))) && (var_1_12 ? ((((var_1_19 + var_1_20) * var_1_20) == ((var_1_8 + var_1_4) * var_1_20)) ? (var_1_14 == ((double) var_1_6)) : (var_1_14 == ((double) var_1_6))) : (var_1_14 == ((double) var_1_6)))) && ((var_1_8 < (var_1_26 ^ var_1_30)) ? (((! var_1_12) || var_1_16) ? (var_1_15 == ((double) ((((var_1_6) < ((var_1_17 + var_1_18))) ? (var_1_6) : ((var_1_17 + var_1_18)))))) : (var_1_15 == ((double) var_1_17))) : (var_1_15 == ((double) var_1_17)))) && (var_1_19 == ((signed long int) (var_1_28 + (var_1_30 + var_1_11))))) && ((var_1_18 < last_1_var_1_23) ? (var_1_12 ? (((last_1_var_1_1 + var_1_6) != last_1_var_1_1) ? (var_1_20 == ((unsigned char) var_1_22)) : (var_1_20 == ((unsigned char) var_1_22))) : (var_1_20 == ((unsigned char) var_1_22))) : 1)) && ((var_1_20 < ((8 << var_1_19) / ((((var_1_4) < (var_1_24)) ? (var_1_4) : (var_1_24))))) ? (((256 - (var_1_25 - var_1_22)) >= var_1_11) ? (var_1_23 == ((float) (((((var_1_5 - var_1_6)) < (var_1_17)) ? ((var_1_5 - var_1_6)) : (var_1_17))))) : 1) : 1) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=0, var_1_12=0, var_1_14=2, var_1_15=3, var_1_16=0, var_1_17=3, var_1_19=0, var_1_20=1, var_1_22=-256, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=65, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_6=2, var_1_7=1073741822, var_1_8=1073741822] [L193-L194] return ((((((((((((var_1_19 == (var_1_7 % var_1_4)) ? (var_1_1 == ((float) (var_1_5 - var_1_6))) : 1) && ((((var_1_6 - var_1_5) < var_1_23) || (var_1_4 >= var_1_11)) ? (var_1_7 == ((signed long int) ((var_1_8 - var_1_28) - var_1_28))) : (var_1_7 == ((signed long int) -32)))) && ((var_1_8 > var_1_4) ? (var_1_11 == ((signed short int) 0)) : ((var_1_8 <= (last_1_var_1_20 + (last_1_var_1_20 / var_1_4))) ? (var_1_12 ? (var_1_11 == ((signed short int) last_1_var_1_20)) : (var_1_11 == ((signed short int) last_1_var_1_20))) : (var_1_11 == ((signed short int) last_1_var_1_20))))) && (var_1_12 ? ((((var_1_19 + var_1_20) * var_1_20) == ((var_1_8 + var_1_4) * var_1_20)) ? (var_1_14 == ((double) var_1_6)) : (var_1_14 == ((double) var_1_6))) : (var_1_14 == ((double) var_1_6)))) && ((var_1_8 < (var_1_26 ^ var_1_30)) ? (((! var_1_12) || var_1_16) ? (var_1_15 == ((double) ((((var_1_6) < ((var_1_17 + var_1_18))) ? (var_1_6) : ((var_1_17 + var_1_18)))))) : (var_1_15 == ((double) var_1_17))) : (var_1_15 == ((double) var_1_17)))) && (var_1_19 == ((signed long int) (var_1_28 + (var_1_30 + var_1_11))))) && ((var_1_18 < last_1_var_1_23) ? (var_1_12 ? (((last_1_var_1_1 + var_1_6) != last_1_var_1_1) ? (var_1_20 == ((unsigned char) var_1_22)) : (var_1_20 == ((unsigned char) var_1_22))) : (var_1_20 == ((unsigned char) var_1_22))) : 1)) && ((var_1_20 < ((8 << var_1_19) / ((((var_1_4) < (var_1_24)) ? (var_1_4) : (var_1_24))))) ? (((256 - (var_1_25 - var_1_22)) >= var_1_11) ? (var_1_23 == ((float) (((((var_1_5 - var_1_6)) < (var_1_17)) ? ((var_1_5 - var_1_6)) : (var_1_17))))) : 1) : 1)) && ((1.000000004E8 == var_1_23) ? (var_1_26 == ((signed long int) (64 + var_1_20))) : (var_1_26 == ((signed long int) ((((-4) < 0 ) ? -(-4) : (-4))))))) && (((var_1_22 + (var_1_20 / var_1_24)) <= var_1_20) ? (var_1_27 == ((double) (10000.2 + (((((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18))) < 0 ) ? -((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18))) : ((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18)))))))) : (var_1_27 == ((double) (var_1_5 - var_1_6))))) && ((((var_1_30 + var_1_20) / var_1_4) > var_1_30) ? (var_1_28 == ((unsigned char) ((((var_1_22) < (var_1_29)) ? (var_1_22) : (var_1_29))))) : 1)) && (((var_1_5 - var_1_6) >= var_1_27) ? ((10000000 > var_1_11) ? (var_1_30 == ((signed char) (((((var_1_31 + var_1_32)) > (var_1_33)) ? ((var_1_31 + var_1_32)) : (var_1_33))))) : (var_1_30 == ((signed char) var_1_34))) : 1) ; [L203] RET, EXPR property() [L203] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=0, var_1_12=0, var_1_14=2, var_1_15=3, var_1_16=0, var_1_17=3, var_1_19=0, var_1_20=1, var_1_22=-256, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=65, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_6=2, var_1_7=1073741822, var_1_8=1073741822] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=0, var_1_12=0, var_1_14=2, var_1_15=3, var_1_16=0, var_1_17=3, var_1_19=0, var_1_20=1, var_1_22=-256, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=65, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_6=2, var_1_7=1073741822, var_1_8=1073741822] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 102 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.5s, OverallIterations: 7, TraceHistogramMax: 30, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1001 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1001 mSDsluCounter, 2587 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1104 mSDsCounter, 157 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 476 IncrementalHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 157 mSolverCounterUnsat, 1483 mSDtfsCounter, 476 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 385 GetRequests, 373 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=210occurred in iteration=4, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 6 MinimizatonAttempts, 565 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1563 NumberOfCodeBlocks, 1563 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1165 ConstructedInterpolants, 0 QuantifiedInterpolants, 2055 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 10440/10440 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 12:15:33,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-8.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 517e27336460af7ba2854a8d7aa1a1bf348bd2f4daf99eaa687977dfb875eed5 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 12:15:35,865 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 12:15:35,960 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 12:15:35,967 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 12:15:35,967 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 12:15:36,002 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 12:15:36,005 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 12:15:36,006 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 12:15:36,006 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 12:15:36,007 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 12:15:36,008 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 12:15:36,008 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 12:15:36,009 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 12:15:36,010 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 12:15:36,012 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 12:15:36,012 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 12:15:36,012 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 12:15:36,013 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 12:15:36,013 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 12:15:36,013 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 12:15:36,014 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 12:15:36,018 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 12:15:36,018 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 12:15:36,018 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 12:15:36,018 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 12:15:36,018 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 12:15:36,019 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 12:15:36,019 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 12:15:36,019 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 12:15:36,019 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 12:15:36,020 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 12:15:36,020 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 12:15:36,020 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 12:15:36,020 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 12:15:36,020 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:15:36,021 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 12:15:36,033 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 12:15:36,035 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 12:15:36,035 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 12:15:36,035 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 12:15:36,035 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 12:15:36,036 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 12:15:36,036 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 12:15:36,037 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 12:15:36,037 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 12:15:36,037 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-clean/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-clean/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 -> 517e27336460af7ba2854a8d7aa1a1bf348bd2f4daf99eaa687977dfb875eed5 [2024-10-11 12:15:36,403 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 12:15:36,431 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 12:15:36,435 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 12:15:36,436 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 12:15:36,437 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 12:15:36,440 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-8.i [2024-10-11 12:15:38,144 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 12:15:38,404 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 12:15:38,405 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-8.i [2024-10-11 12:15:38,417 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/45f7c46ce/2d6bedb3ac8849389ed8c3025369ee4b/FLAGb6e854df9 [2024-10-11 12:15:38,433 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/45f7c46ce/2d6bedb3ac8849389ed8c3025369ee4b [2024-10-11 12:15:38,437 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 12:15:38,438 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 12:15:38,440 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 12:15:38,440 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 12:15:38,446 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 12:15:38,447 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:15:38" (1/1) ... [2024-10-11 12:15:38,448 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bf8a67e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:15:38, skipping insertion in model container [2024-10-11 12:15:38,448 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:15:38" (1/1) ... [2024-10-11 12:15:38,491 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 12:15:38,698 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-8.i[915,928] [2024-10-11 12:15:38,809 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:15:38,828 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 12:15:38,840 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-8.i[915,928] [2024-10-11 12:15:38,903 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:15:38,934 INFO L204 MainTranslator]: Completed translation [2024-10-11 12:15:38,934 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:15:38 WrapperNode [2024-10-11 12:15:38,934 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 12:15:38,935 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 12:15:38,935 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 12:15:38,936 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 12:15:38,942 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:15:38" (1/1) ... [2024-10-11 12:15:38,960 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:15:38" (1/1) ... [2024-10-11 12:15:39,005 INFO L138 Inliner]: procedures = 27, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 196 [2024-10-11 12:15:39,005 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 12:15:39,006 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 12:15:39,006 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 12:15:39,006 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 12:15:39,021 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:15:38" (1/1) ... [2024-10-11 12:15:39,022 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:15:38" (1/1) ... [2024-10-11 12:15:39,041 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:15:38" (1/1) ... [2024-10-11 12:15:39,066 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 12:15:39,067 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:15:38" (1/1) ... [2024-10-11 12:15:39,067 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:15:38" (1/1) ... [2024-10-11 12:15:39,087 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:15:38" (1/1) ... [2024-10-11 12:15:39,095 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:15:38" (1/1) ... [2024-10-11 12:15:39,102 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:15:38" (1/1) ... [2024-10-11 12:15:39,108 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:15:38" (1/1) ... [2024-10-11 12:15:39,117 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 12:15:39,122 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 12:15:39,122 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 12:15:39,122 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 12:15:39,123 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:15:38" (1/1) ... [2024-10-11 12:15:39,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:15:39,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:15:39,163 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 12:15:39,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 12:15:39,221 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 12:15:39,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 12:15:39,221 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 12:15:39,221 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 12:15:39,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 12:15:39,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 12:15:39,332 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 12:15:39,334 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 12:15:47,409 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-11 12:15:47,410 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 12:15:47,499 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 12:15:47,499 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 12:15:47,499 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:15:47 BoogieIcfgContainer [2024-10-11 12:15:47,499 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 12:15:47,502 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 12:15:47,503 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 12:15:47,508 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 12:15:47,508 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:15:38" (1/3) ... [2024-10-11 12:15:47,509 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f89b6d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:15:47, skipping insertion in model container [2024-10-11 12:15:47,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:15:38" (2/3) ... [2024-10-11 12:15:47,510 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f89b6d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:15:47, skipping insertion in model container [2024-10-11 12:15:47,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:15:47" (3/3) ... [2024-10-11 12:15:47,513 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-8.i [2024-10-11 12:15:47,534 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 12:15:47,534 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 12:15:47,613 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 12:15:47,621 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;@3fcb72fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 12:15:47,621 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 12:15:47,626 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 51 states have (on average 1.4705882352941178) internal successors, (75), 52 states have internal predecessors, (75), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 12:15:47,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-10-11 12:15:47,642 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:15:47,644 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:15:47,645 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:15:47,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:15:47,652 INFO L85 PathProgramCache]: Analyzing trace with hash -874084751, now seen corresponding path program 1 times [2024-10-11 12:15:47,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:15:47,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1140234691] [2024-10-11 12:15:47,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:15:47,671 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:15:47,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:15:47,675 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 12:15:47,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 12:15:48,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:15:48,402 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-10-11 12:15:48,446 INFO L278 TraceCheckSpWp]: Computing forward predicates...