./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-51.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-51.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 64360fc7d3c5d5814f250bc67771c1266affbe7be077c4ce76d53cff763882cf --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:32:01,795 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:32:01,863 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 23:32:01,868 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:32:01,869 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:32:01,892 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:32:01,893 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:32:01,894 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:32:01,894 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:32:01,895 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:32:01,895 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:32:01,895 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:32:01,896 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:32:01,896 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:32:01,897 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:32:01,897 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:32:01,897 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:32:01,898 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:32:01,898 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:32:01,898 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:32:01,898 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:32:01,899 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:32:01,899 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:32:01,899 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:32:01,899 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:32:01,899 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:32:01,900 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:32:01,900 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:32:01,900 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:32:01,900 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:32:01,900 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:32:01,901 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:32:01,901 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:32:01,901 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:32:01,901 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:32:01,902 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:32:01,902 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 23:32:01,902 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:32:01,902 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:32:01,902 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:32:01,903 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:32:01,905 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:32:01,905 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 64360fc7d3c5d5814f250bc67771c1266affbe7be077c4ce76d53cff763882cf [2024-11-08 23:32:02,112 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:32:02,134 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:32:02,136 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:32:02,137 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:32:02,137 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:32:02,138 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-51.i [2024-11-08 23:32:03,357 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:32:03,561 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:32:03,562 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-51.i [2024-11-08 23:32:03,572 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d1558003/4554e7788de140bea9a87594804651c7/FLAG514ac4685 [2024-11-08 23:32:03,923 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d1558003/4554e7788de140bea9a87594804651c7 [2024-11-08 23:32:03,925 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:32:03,925 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:32:03,927 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:32:03,927 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:32:03,932 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:32:03,932 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:32:03" (1/1) ... [2024-11-08 23:32:03,933 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55d3ce4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:32:03, skipping insertion in model container [2024-11-08 23:32:03,933 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:32:03" (1/1) ... [2024-11-08 23:32:03,963 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:32:04,115 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-51.i[916,929] [2024-11-08 23:32:04,181 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:32:04,191 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:32:04,200 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-51.i[916,929] [2024-11-08 23:32:04,238 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:32:04,258 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:32:04,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:32:04 WrapperNode [2024-11-08 23:32:04,259 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:32:04,260 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:32:04,260 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:32:04,260 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:32:04,265 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:32:04" (1/1) ... [2024-11-08 23:32:04,278 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:32:04" (1/1) ... [2024-11-08 23:32:04,314 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 209 [2024-11-08 23:32:04,315 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:32:04,315 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:32:04,315 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:32:04,316 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:32:04,324 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:32:04" (1/1) ... [2024-11-08 23:32:04,324 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:32:04" (1/1) ... [2024-11-08 23:32:04,327 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:32:04" (1/1) ... [2024-11-08 23:32:04,356 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 23:32:04,357 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:32:04" (1/1) ... [2024-11-08 23:32:04,357 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:32:04" (1/1) ... [2024-11-08 23:32:04,371 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:32:04" (1/1) ... [2024-11-08 23:32:04,375 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:32:04" (1/1) ... [2024-11-08 23:32:04,380 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:32:04" (1/1) ... [2024-11-08 23:32:04,382 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:32:04" (1/1) ... [2024-11-08 23:32:04,388 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:32:04,390 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:32:04,390 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:32:04,390 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:32:04,390 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:32:04" (1/1) ... [2024-11-08 23:32:04,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:32:04,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:32:04,416 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 23:32:04,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 23:32:04,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:32:04,457 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:32:04,457 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:32:04,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 23:32:04,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:32:04,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:32:04,540 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:32:04,542 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:32:04,901 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-08 23:32:04,902 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:32:04,916 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:32:04,916 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:32:04,916 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:32:04 BoogieIcfgContainer [2024-11-08 23:32:04,917 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:32:04,918 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:32:04,918 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:32:04,921 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:32:04,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:32:03" (1/3) ... [2024-11-08 23:32:04,922 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@339c740b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:32:04, skipping insertion in model container [2024-11-08 23:32:04,922 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:32:04" (2/3) ... [2024-11-08 23:32:04,922 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@339c740b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:32:04, skipping insertion in model container [2024-11-08 23:32:04,923 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:32:04" (3/3) ... [2024-11-08 23:32:04,924 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-51.i [2024-11-08 23:32:04,936 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:32:04,936 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:32:05,026 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:32:05,031 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;@51629b76, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:32:05,031 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:32:05,035 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 59 states have (on average 1.423728813559322) internal successors, (84), 60 states have internal predecessors, (84), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-08 23:32:05,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-08 23:32:05,052 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:32:05,053 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:32:05,053 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:32:05,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:32:05,057 INFO L85 PathProgramCache]: Analyzing trace with hash 37560582, now seen corresponding path program 1 times [2024-11-08 23:32:05,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:32:05,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105463215] [2024-11-08 23:32:05,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:32:05,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:32:05,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:05,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:32:05,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:05,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 23:32:05,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:05,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 23:32:05,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:05,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 23:32:05,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:05,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 23:32:05,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:05,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 23:32:05,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:05,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 23:32:05,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:05,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 23:32:05,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:05,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 23:32:05,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:05,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 23:32:05,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:05,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 23:32:05,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:05,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 23:32:05,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:05,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 23:32:05,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:05,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 23:32:05,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:05,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 23:32:05,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:05,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 23:32:05,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:05,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 23:32:05,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:05,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 23:32:05,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:05,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 23:32:05,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:05,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 23:32:05,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:05,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 23:32:05,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:05,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 23:32:05,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:05,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 23:32:05,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:05,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 23:32:05,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:05,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 23:32:05,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:05,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 23:32:05,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:05,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 23:32:05,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:05,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 23:32:05,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:05,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 23:32:05,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:05,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 23:32:05,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:05,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 23:32:05,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:05,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 23:32:05,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:05,437 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-08 23:32:05,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:32:05,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105463215] [2024-11-08 23:32:05,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105463215] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:32:05,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:32:05,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:32:05,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851146876] [2024-11-08 23:32:05,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:32:05,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:32:05,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:32:05,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:32:05,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:32:05,466 INFO L87 Difference]: Start difference. First operand has 94 states, 59 states have (on average 1.423728813559322) internal successors, (84), 60 states have internal predecessors, (84), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-08 23:32:05,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:32:05,491 INFO L93 Difference]: Finished difference Result 181 states and 322 transitions. [2024-11-08 23:32:05,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:32:05,493 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) Word has length 203 [2024-11-08 23:32:05,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:32:05,498 INFO L225 Difference]: With dead ends: 181 [2024-11-08 23:32:05,498 INFO L226 Difference]: Without dead ends: 90 [2024-11-08 23:32:05,501 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:32:05,503 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:32:05,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:32:05,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-08 23:32:05,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-08 23:32:05,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 56 states have (on average 1.375) internal successors, (77), 56 states have internal predecessors, (77), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-08 23:32:05,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 141 transitions. [2024-11-08 23:32:05,536 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 141 transitions. Word has length 203 [2024-11-08 23:32:05,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:32:05,536 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 141 transitions. [2024-11-08 23:32:05,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-08 23:32:05,536 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 141 transitions. [2024-11-08 23:32:05,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-08 23:32:05,539 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:32:05,539 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:32:05,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 23:32:05,540 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:32:05,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:32:05,540 INFO L85 PathProgramCache]: Analyzing trace with hash 653297218, now seen corresponding path program 1 times [2024-11-08 23:32:05,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:32:05,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860373974] [2024-11-08 23:32:05,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:32:05,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:32:05,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:06,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:32:06,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:06,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 23:32:06,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:06,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 23:32:06,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:06,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 23:32:06,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:06,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 23:32:06,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:06,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 23:32:06,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:06,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 23:32:06,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:06,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 23:32:06,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:06,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 23:32:06,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:06,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 23:32:06,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:06,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 23:32:06,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:06,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 23:32:06,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:06,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 23:32:06,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:06,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 23:32:06,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:06,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 23:32:06,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:06,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 23:32:06,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:06,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 23:32:06,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:06,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 23:32:06,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:06,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 23:32:06,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:06,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 23:32:06,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:06,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 23:32:06,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:06,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 23:32:06,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:06,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 23:32:06,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:06,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 23:32:06,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:06,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 23:32:06,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:06,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 23:32:06,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:06,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 23:32:06,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:06,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 23:32:06,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:06,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 23:32:06,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:06,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 23:32:06,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:06,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 23:32:06,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:06,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 23:32:06,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:06,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-08 23:32:06,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:32:06,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860373974] [2024-11-08 23:32:06,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860373974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:32:06,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:32:06,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 23:32:06,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34790925] [2024-11-08 23:32:06,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:32:06,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 23:32:06,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:32:06,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 23:32:06,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 23:32:06,630 INFO L87 Difference]: Start difference. First operand 90 states and 141 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-08 23:32:06,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:32:06,854 INFO L93 Difference]: Finished difference Result 264 states and 417 transitions. [2024-11-08 23:32:06,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 23:32:06,855 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 203 [2024-11-08 23:32:06,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:32:06,858 INFO L225 Difference]: With dead ends: 264 [2024-11-08 23:32:06,858 INFO L226 Difference]: Without dead ends: 177 [2024-11-08 23:32:06,861 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:32:06,864 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 70 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 23:32:06,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 365 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 23:32:06,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-08 23:32:06,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 175. [2024-11-08 23:32:06,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 108 states have (on average 1.3518518518518519) internal successors, (146), 108 states have internal predecessors, (146), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-08 23:32:06,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 274 transitions. [2024-11-08 23:32:06,905 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 274 transitions. Word has length 203 [2024-11-08 23:32:06,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:32:06,906 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 274 transitions. [2024-11-08 23:32:06,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-08 23:32:06,907 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 274 transitions. [2024-11-08 23:32:06,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-08 23:32:06,911 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:32:06,911 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:32:06,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 23:32:06,911 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:32:06,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:32:06,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1674365572, now seen corresponding path program 1 times [2024-11-08 23:32:06,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:32:06,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721843535] [2024-11-08 23:32:06,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:32:06,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:32:07,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:07,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:32:07,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:07,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 23:32:07,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:07,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 23:32:07,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:07,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 23:32:07,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:07,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 23:32:07,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:07,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 23:32:07,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:07,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 23:32:07,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:07,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 23:32:07,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:07,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 23:32:07,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:07,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 23:32:07,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:07,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 23:32:07,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:07,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 23:32:07,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:07,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 23:32:07,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:07,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 23:32:07,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:07,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 23:32:07,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:07,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 23:32:07,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:07,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 23:32:07,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:07,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 23:32:07,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:07,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 23:32:07,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:07,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 23:32:07,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:07,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 23:32:07,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:07,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 23:32:07,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:07,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 23:32:07,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:07,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 23:32:07,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:07,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 23:32:07,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:07,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 23:32:07,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:07,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 23:32:07,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:07,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 23:32:07,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:07,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 23:32:07,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:07,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 23:32:07,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:07,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 23:32:07,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:07,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 23:32:07,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:07,328 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 42 proven. 51 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-11-08 23:32:07,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:32:07,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721843535] [2024-11-08 23:32:07,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721843535] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 23:32:07,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545128043] [2024-11-08 23:32:07,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:32:07,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:32:07,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:32:07,332 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 23:32:07,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 23:32:07,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:07,479 INFO L255 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 23:32:07,488 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:32:07,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1011 proven. 51 refuted. 0 times theorem prover too weak. 922 trivial. 0 not checked. [2024-11-08 23:32:07,708 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:32:07,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 42 proven. 51 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-11-08 23:32:07,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1545128043] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 23:32:07,937 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 23:32:07,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-08 23:32:07,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14774272] [2024-11-08 23:32:07,937 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 23:32:07,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 23:32:07,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:32:07,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 23:32:07,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 23:32:07,939 INFO L87 Difference]: Start difference. First operand 175 states and 274 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2024-11-08 23:32:08,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:32:08,118 INFO L93 Difference]: Finished difference Result 363 states and 559 transitions. [2024-11-08 23:32:08,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 23:32:08,119 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) Word has length 203 [2024-11-08 23:32:08,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:32:08,121 INFO L225 Difference]: With dead ends: 363 [2024-11-08 23:32:08,121 INFO L226 Difference]: Without dead ends: 191 [2024-11-08 23:32:08,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 476 GetRequests, 466 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-08 23:32:08,123 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 72 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:32:08,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 243 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 23:32:08,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-08 23:32:08,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 183. [2024-11-08 23:32:08,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 114 states have (on average 1.3157894736842106) internal successors, (150), 114 states have internal predecessors, (150), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-08 23:32:08,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 278 transitions. [2024-11-08 23:32:08,156 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 278 transitions. Word has length 203 [2024-11-08 23:32:08,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:32:08,157 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 278 transitions. [2024-11-08 23:32:08,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2024-11-08 23:32:08,157 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 278 transitions. [2024-11-08 23:32:08,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-08 23:32:08,161 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:32:08,161 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:32:08,175 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 23:32:08,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:32:08,366 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:32:08,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:32:08,366 INFO L85 PathProgramCache]: Analyzing trace with hash 394501894, now seen corresponding path program 1 times [2024-11-08 23:32:08,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:32:08,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344525528] [2024-11-08 23:32:08,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:32:08,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:32:08,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:08,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:32:08,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:08,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 23:32:08,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:08,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 23:32:08,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:08,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 23:32:08,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:08,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 23:32:08,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:08,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 23:32:08,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:08,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 23:32:08,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:08,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 23:32:08,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:08,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 23:32:08,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:08,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 23:32:08,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:08,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 23:32:08,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:08,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 23:32:08,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:08,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 23:32:08,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:08,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 23:32:08,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:08,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 23:32:08,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:08,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 23:32:08,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:08,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 23:32:08,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:08,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 23:32:08,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:08,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 23:32:08,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:08,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 23:32:08,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:08,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 23:32:08,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:08,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 23:32:08,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:08,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 23:32:08,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:08,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 23:32:08,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:08,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 23:32:08,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:08,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 23:32:08,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:08,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 23:32:08,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:08,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 23:32:08,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:08,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 23:32:08,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:08,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 23:32:08,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:08,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 23:32:08,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:08,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 23:32:08,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:08,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-08 23:32:08,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:32:08,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344525528] [2024-11-08 23:32:08,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344525528] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:32:08,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:32:08,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 23:32:08,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40574303] [2024-11-08 23:32:08,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:32:08,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 23:32:08,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:32:08,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 23:32:08,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-08 23:32:08,855 INFO L87 Difference]: Start difference. First operand 183 states and 278 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-08 23:32:09,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:32:09,002 INFO L93 Difference]: Finished difference Result 366 states and 559 transitions. [2024-11-08 23:32:09,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 23:32:09,002 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 203 [2024-11-08 23:32:09,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:32:09,008 INFO L225 Difference]: With dead ends: 366 [2024-11-08 23:32:09,008 INFO L226 Difference]: Without dead ends: 275 [2024-11-08 23:32:09,008 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-08 23:32:09,009 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 128 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:32:09,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 494 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 23:32:09,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-11-08 23:32:09,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 183. [2024-11-08 23:32:09,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 114 states have (on average 1.3157894736842106) internal successors, (150), 114 states have internal predecessors, (150), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-08 23:32:09,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 278 transitions. [2024-11-08 23:32:09,044 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 278 transitions. Word has length 203 [2024-11-08 23:32:09,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:32:09,045 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 278 transitions. [2024-11-08 23:32:09,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-08 23:32:09,046 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 278 transitions. [2024-11-08 23:32:09,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-11-08 23:32:09,047 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:32:09,048 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:32:09,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 23:32:09,048 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:32:09,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:32:09,049 INFO L85 PathProgramCache]: Analyzing trace with hash -573679350, now seen corresponding path program 1 times [2024-11-08 23:32:09,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:32:09,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14593400] [2024-11-08 23:32:09,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:32:09,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:32:09,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:09,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:32:09,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:09,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 23:32:09,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:09,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 23:32:09,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:09,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 23:32:09,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:09,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 23:32:09,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:09,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 23:32:09,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:09,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 23:32:09,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:09,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 23:32:09,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:09,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 23:32:09,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:09,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 23:32:09,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:09,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 23:32:09,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:09,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 23:32:09,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:09,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 23:32:09,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:09,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 23:32:09,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:09,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 23:32:09,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:09,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 23:32:09,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:09,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 23:32:09,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:09,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 23:32:09,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:09,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 23:32:09,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:09,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 23:32:09,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:09,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 23:32:09,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:09,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 23:32:09,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:09,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 23:32:09,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:09,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 23:32:09,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:09,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 23:32:09,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:09,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 23:32:09,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:09,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 23:32:09,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:09,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 23:32:09,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:09,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 23:32:09,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:09,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 23:32:09,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:09,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 23:32:09,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:09,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 23:32:09,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:09,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-08 23:32:09,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:32:09,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14593400] [2024-11-08 23:32:09,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14593400] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:32:09,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:32:09,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 23:32:09,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552272971] [2024-11-08 23:32:09,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:32:09,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 23:32:09,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:32:09,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 23:32:09,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-08 23:32:09,530 INFO L87 Difference]: Start difference. First operand 183 states and 278 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-08 23:32:09,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:32:09,814 INFO L93 Difference]: Finished difference Result 533 states and 802 transitions. [2024-11-08 23:32:09,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 23:32:09,815 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 204 [2024-11-08 23:32:09,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:32:09,817 INFO L225 Difference]: With dead ends: 533 [2024-11-08 23:32:09,818 INFO L226 Difference]: Without dead ends: 442 [2024-11-08 23:32:09,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-08 23:32:09,819 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 182 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 23:32:09,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 450 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 23:32:09,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2024-11-08 23:32:09,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 372. [2024-11-08 23:32:09,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 233 states have (on average 1.3004291845493563) internal successors, (303), 233 states have internal predecessors, (303), 128 states have call successors, (128), 10 states have call predecessors, (128), 10 states have return successors, (128), 128 states have call predecessors, (128), 128 states have call successors, (128) [2024-11-08 23:32:09,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 559 transitions. [2024-11-08 23:32:09,872 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 559 transitions. Word has length 204 [2024-11-08 23:32:09,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:32:09,873 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 559 transitions. [2024-11-08 23:32:09,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-08 23:32:09,873 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 559 transitions. [2024-11-08 23:32:09,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-11-08 23:32:09,874 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:32:09,874 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:32:09,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 23:32:09,875 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:32:09,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:32:09,875 INFO L85 PathProgramCache]: Analyzing trace with hash 15377899, now seen corresponding path program 1 times [2024-11-08 23:32:09,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:32:09,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867553993] [2024-11-08 23:32:09,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:32:09,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:32:09,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:10,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:32:10,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:10,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 23:32:10,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:10,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 23:32:10,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:10,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 23:32:10,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:10,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 23:32:10,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:10,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 23:32:10,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:10,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 23:32:10,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:10,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 23:32:10,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:10,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 23:32:10,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:10,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 23:32:10,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:10,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 23:32:10,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:10,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 23:32:10,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:10,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 23:32:10,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:10,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 23:32:10,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:10,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 23:32:10,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:10,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 23:32:10,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:10,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 23:32:10,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:10,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 23:32:10,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:10,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 23:32:10,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:10,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 23:32:10,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:10,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 23:32:10,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:10,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 23:32:10,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:10,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 23:32:10,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:10,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 23:32:10,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:10,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 23:32:10,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:10,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 23:32:10,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:10,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 23:32:10,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:10,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 23:32:10,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:10,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 23:32:10,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:10,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 23:32:10,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:10,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 23:32:10,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:10,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 23:32:10,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:10,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 27 proven. 66 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-11-08 23:32:10,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:32:10,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867553993] [2024-11-08 23:32:10,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867553993] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 23:32:10,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1265351525] [2024-11-08 23:32:10,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:32:10,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:32:10,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:32:10,641 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 23:32:10,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 23:32:10,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:10,787 INFO L255 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-08 23:32:10,798 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:32:11,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 841 proven. 66 refuted. 0 times theorem prover too weak. 1077 trivial. 0 not checked. [2024-11-08 23:32:11,303 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:32:11,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 27 proven. 66 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-11-08 23:32:11,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1265351525] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 23:32:11,625 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 23:32:11,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 17 [2024-11-08 23:32:11,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134950608] [2024-11-08 23:32:11,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 23:32:11,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-08 23:32:11,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:32:11,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-08 23:32:11,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2024-11-08 23:32:11,632 INFO L87 Difference]: Start difference. First operand 372 states and 559 transitions. Second operand has 17 states, 17 states have (on average 6.470588235294118) internal successors, (110), 17 states have internal predecessors, (110), 6 states have call successors, (96), 3 states have call predecessors, (96), 6 states have return successors, (96), 6 states have call predecessors, (96), 6 states have call successors, (96) [2024-11-08 23:32:13,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:32:13,205 INFO L93 Difference]: Finished difference Result 2121 states and 3117 transitions. [2024-11-08 23:32:13,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-08 23:32:13,205 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.470588235294118) internal successors, (110), 17 states have internal predecessors, (110), 6 states have call successors, (96), 3 states have call predecessors, (96), 6 states have return successors, (96), 6 states have call predecessors, (96), 6 states have call successors, (96) Word has length 204 [2024-11-08 23:32:13,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:32:13,213 INFO L225 Difference]: With dead ends: 2121 [2024-11-08 23:32:13,213 INFO L226 Difference]: Without dead ends: 1752 [2024-11-08 23:32:13,214 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 511 GetRequests, 467 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=525, Invalid=1545, Unknown=0, NotChecked=0, Total=2070 [2024-11-08 23:32:13,215 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 1056 mSDsluCounter, 853 mSDsCounter, 0 mSdLazyCounter, 1123 mSolverCounterSat, 546 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1087 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 1669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 546 IncrementalHoareTripleChecker+Valid, 1123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:32:13,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1087 Valid, 965 Invalid, 1669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [546 Valid, 1123 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 23:32:13,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states. [2024-11-08 23:32:13,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 1238. [2024-11-08 23:32:13,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1238 states, 779 states have (on average 1.2798459563543003) internal successors, (997), 783 states have internal predecessors, (997), 420 states have call successors, (420), 38 states have call predecessors, (420), 38 states have return successors, (420), 416 states have call predecessors, (420), 420 states have call successors, (420) [2024-11-08 23:32:13,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1238 states to 1238 states and 1837 transitions. [2024-11-08 23:32:13,340 INFO L78 Accepts]: Start accepts. Automaton has 1238 states and 1837 transitions. Word has length 204 [2024-11-08 23:32:13,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:32:13,340 INFO L471 AbstractCegarLoop]: Abstraction has 1238 states and 1837 transitions. [2024-11-08 23:32:13,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.470588235294118) internal successors, (110), 17 states have internal predecessors, (110), 6 states have call successors, (96), 3 states have call predecessors, (96), 6 states have return successors, (96), 6 states have call predecessors, (96), 6 states have call successors, (96) [2024-11-08 23:32:13,340 INFO L276 IsEmpty]: Start isEmpty. Operand 1238 states and 1837 transitions. [2024-11-08 23:32:13,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-11-08 23:32:13,342 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:32:13,342 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:32:13,356 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-08 23:32:13,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-08 23:32:13,543 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:32:13,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:32:13,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1437370378, now seen corresponding path program 1 times [2024-11-08 23:32:13,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:32:13,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341953001] [2024-11-08 23:32:13,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:32:13,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:32:13,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:13,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:32:13,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:13,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 23:32:13,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:13,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 23:32:13,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:13,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 23:32:13,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:13,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 23:32:13,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:13,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 23:32:13,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:13,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 23:32:13,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:13,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 23:32:13,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:13,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 23:32:13,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:13,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 23:32:13,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:13,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 23:32:13,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:13,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 23:32:13,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:13,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 23:32:13,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:13,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 23:32:13,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:13,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 23:32:13,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:13,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 23:32:13,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:13,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 23:32:13,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:13,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 23:32:13,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:13,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 23:32:13,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:13,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 23:32:13,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:13,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 23:32:13,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:13,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 23:32:13,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:13,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 23:32:13,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:13,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 23:32:13,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:13,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 23:32:13,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:13,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 23:32:13,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:13,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 23:32:13,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:13,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 23:32:13,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:13,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 23:32:13,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:13,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 23:32:13,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:13,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 23:32:13,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:13,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 23:32:13,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:13,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-08 23:32:13,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:32:13,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341953001] [2024-11-08 23:32:13,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341953001] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:32:13,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:32:13,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 23:32:13,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687674454] [2024-11-08 23:32:13,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:32:13,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 23:32:13,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:32:13,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 23:32:13,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-08 23:32:13,979 INFO L87 Difference]: Start difference. First operand 1238 states and 1837 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-08 23:32:14,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:32:14,337 INFO L93 Difference]: Finished difference Result 1906 states and 2811 transitions. [2024-11-08 23:32:14,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 23:32:14,337 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 204 [2024-11-08 23:32:14,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:32:14,346 INFO L225 Difference]: With dead ends: 1906 [2024-11-08 23:32:14,346 INFO L226 Difference]: Without dead ends: 1604 [2024-11-08 23:32:14,347 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-08 23:32:14,348 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 205 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 23:32:14,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 274 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 23:32:14,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1604 states. [2024-11-08 23:32:14,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1604 to 638. [2024-11-08 23:32:14,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 405 states have (on average 1.2617283950617284) internal successors, (511), 407 states have internal predecessors, (511), 210 states have call successors, (210), 22 states have call predecessors, (210), 22 states have return successors, (210), 208 states have call predecessors, (210), 210 states have call successors, (210) [2024-11-08 23:32:14,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 931 transitions. [2024-11-08 23:32:14,443 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 931 transitions. Word has length 204 [2024-11-08 23:32:14,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:32:14,443 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 931 transitions. [2024-11-08 23:32:14,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-08 23:32:14,444 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 931 transitions. [2024-11-08 23:32:14,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-08 23:32:14,446 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:32:14,447 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:32:14,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 23:32:14,447 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:32:14,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:32:14,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1873733027, now seen corresponding path program 1 times [2024-11-08 23:32:14,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:32:14,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307431102] [2024-11-08 23:32:14,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:32:14,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:32:14,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:32:14,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [951137223] [2024-11-08 23:32:14,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:32:14,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:32:14,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:32:14,565 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 23:32:14,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 23:32:14,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:32:14,732 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 23:32:14,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:32:14,922 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 23:32:14,922 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 23:32:14,923 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 23:32:14,933 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 23:32:15,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:32:15,128 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:32:15,237 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 23:32:15,239 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:32:15 BoogieIcfgContainer [2024-11-08 23:32:15,239 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 23:32:15,240 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 23:32:15,240 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 23:32:15,240 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 23:32:15,240 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:32:04" (3/4) ... [2024-11-08 23:32:15,242 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 23:32:15,243 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 23:32:15,243 INFO L158 Benchmark]: Toolchain (without parser) took 11317.56ms. Allocated memory was 130.0MB in the beginning and 362.8MB in the end (delta: 232.8MB). Free memory was 60.5MB in the beginning and 177.5MB in the end (delta: -117.0MB). Peak memory consumption was 116.3MB. Max. memory is 16.1GB. [2024-11-08 23:32:15,243 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 130.0MB. Free memory was 93.0MB in the beginning and 92.9MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:32:15,243 INFO L158 Benchmark]: CACSL2BoogieTranslator took 332.39ms. Allocated memory was 130.0MB in the beginning and 174.1MB in the end (delta: 44.0MB). Free memory was 60.3MB in the beginning and 132.2MB in the end (delta: -71.9MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. [2024-11-08 23:32:15,244 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.08ms. Allocated memory is still 174.1MB. Free memory was 132.2MB in the beginning and 126.5MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 23:32:15,244 INFO L158 Benchmark]: Boogie Preprocessor took 73.22ms. Allocated memory is still 174.1MB. Free memory was 126.5MB in the beginning and 117.3MB in the end (delta: 9.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 23:32:15,244 INFO L158 Benchmark]: RCFGBuilder took 527.19ms. Allocated memory is still 174.1MB. Free memory was 117.3MB in the beginning and 84.8MB in the end (delta: 32.5MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-11-08 23:32:15,244 INFO L158 Benchmark]: TraceAbstraction took 10320.88ms. Allocated memory was 174.1MB in the beginning and 362.8MB in the end (delta: 188.7MB). Free memory was 84.8MB in the beginning and 178.5MB in the end (delta: -93.7MB). Peak memory consumption was 94.8MB. Max. memory is 16.1GB. [2024-11-08 23:32:15,244 INFO L158 Benchmark]: Witness Printer took 3.15ms. Allocated memory is still 362.8MB. Free memory was 178.5MB in the beginning and 177.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:32:15,245 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.14ms. Allocated memory is still 130.0MB. Free memory was 93.0MB in the beginning and 92.9MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 332.39ms. Allocated memory was 130.0MB in the beginning and 174.1MB in the end (delta: 44.0MB). Free memory was 60.3MB in the beginning and 132.2MB in the end (delta: -71.9MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.08ms. Allocated memory is still 174.1MB. Free memory was 132.2MB in the beginning and 126.5MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.22ms. Allocated memory is still 174.1MB. Free memory was 126.5MB in the beginning and 117.3MB in the end (delta: 9.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 527.19ms. Allocated memory is still 174.1MB. Free memory was 117.3MB in the beginning and 84.8MB in the end (delta: 32.5MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 10320.88ms. Allocated memory was 174.1MB in the beginning and 362.8MB in the end (delta: 188.7MB). Free memory was 84.8MB in the beginning and 178.5MB in the end (delta: -93.7MB). Peak memory consumption was 94.8MB. Max. memory is 16.1GB. * Witness Printer took 3.15ms. Allocated memory is still 362.8MB. Free memory was 178.5MB in the beginning and 177.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 198, overapproximation of someBinaryDOUBLEComparisonOperation at line 198, overapproximation of someUnaryDOUBLEoperation at line 23. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 0; [L23] float var_1_3 = -0.1; [L24] float var_1_4 = 127.25; [L25] float var_1_5 = 2.75; [L26] signed char var_1_6 = 1; [L27] signed char var_1_7 = -2; [L28] signed char var_1_8 = 25; [L29] signed char var_1_9 = 32; [L30] signed char var_1_11 = 0; [L31] signed long int var_1_12 = 2; [L32] unsigned long int var_1_13 = 256; [L33] unsigned long int var_1_16 = 3775050608; [L34] unsigned char var_1_18 = 16; [L35] unsigned char var_1_19 = 100; [L36] unsigned char var_1_20 = 0; [L37] unsigned char var_1_21 = 0; [L38] unsigned char var_1_22 = 0; [L39] unsigned char var_1_23 = 4; [L40] unsigned char var_1_24 = 32; [L41] unsigned char var_1_25 = 16; [L42] unsigned char var_1_26 = 32; [L43] unsigned char var_1_27 = 0; [L44] unsigned short int var_1_28 = 4; [L45] unsigned short int var_1_29 = 38930; [L46] unsigned short int var_1_30 = 59162; [L47] unsigned short int var_1_31 = 1; [L48] unsigned short int var_1_32 = 30817; [L49] unsigned long int var_1_33 = 50; [L50] double var_1_34 = 50.25; [L51] double var_1_35 = 10000000000000.75; [L52] unsigned long int last_1_var_1_13 = 256; [L53] unsigned short int last_1_var_1_31 = 1; [L54] unsigned long int last_1_var_1_33 = 50; VAL [isInitial=0, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_4=509/4, var_1_5=11/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L202] isInitial = 1 [L203] FCALL initially() [L204] COND TRUE 1 [L205] CALL updateLastVariables() [L193] last_1_var_1_13 = var_1_13 [L194] last_1_var_1_31 = var_1_31 [L195] last_1_var_1_33 = var_1_33 VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_4=509/4, var_1_5=11/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L205] RET updateLastVariables() [L206] CALL updateVariables() [L141] var_1_3 = __VERIFIER_nondet_float() [L142] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_4=509/4, var_1_5=11/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_4=509/4, var_1_5=11/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L142] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_4=509/4, var_1_5=11/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L143] var_1_4 = __VERIFIER_nondet_float() [L144] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_5=11/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_5=11/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L144] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_5=11/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L145] var_1_5 = __VERIFIER_nondet_float() [L146] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L146] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L147] var_1_6 = __VERIFIER_nondet_char() [L148] CALL assume_abort_if_not(var_1_6 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L148] RET assume_abort_if_not(var_1_6 >= -127) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L149] CALL assume_abort_if_not(var_1_6 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L149] RET assume_abort_if_not(var_1_6 <= 126) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L150] var_1_8 = __VERIFIER_nondet_char() [L151] CALL assume_abort_if_not(var_1_8 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L151] RET assume_abort_if_not(var_1_8 >= -127) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L152] CALL assume_abort_if_not(var_1_8 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L152] RET assume_abort_if_not(var_1_8 <= 126) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L153] var_1_11 = __VERIFIER_nondet_char() [L154] CALL assume_abort_if_not(var_1_11 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L154] RET assume_abort_if_not(var_1_11 >= -126) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L155] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L155] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L156] var_1_16 = __VERIFIER_nondet_ulong() [L157] CALL assume_abort_if_not(var_1_16 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L157] RET assume_abort_if_not(var_1_16 >= 2147483647) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L158] CALL assume_abort_if_not(var_1_16 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L158] RET assume_abort_if_not(var_1_16 <= 4294967294) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L159] var_1_19 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L160] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L161] CALL assume_abort_if_not(var_1_19 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L161] RET assume_abort_if_not(var_1_19 <= 254) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L162] var_1_21 = __VERIFIER_nondet_uchar() [L163] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L163] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L164] CALL assume_abort_if_not(var_1_21 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L164] RET assume_abort_if_not(var_1_21 <= 0) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L165] var_1_24 = __VERIFIER_nondet_uchar() [L166] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L166] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L167] CALL assume_abort_if_not(var_1_24 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L167] RET assume_abort_if_not(var_1_24 <= 64) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L168] var_1_25 = __VERIFIER_nondet_uchar() [L169] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L169] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L170] CALL assume_abort_if_not(var_1_25 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L170] RET assume_abort_if_not(var_1_25 <= 63) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L171] var_1_26 = __VERIFIER_nondet_uchar() [L172] CALL assume_abort_if_not(var_1_26 >= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L172] RET assume_abort_if_not(var_1_26 >= 31) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L173] CALL assume_abort_if_not(var_1_26 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L173] RET assume_abort_if_not(var_1_26 <= 64) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L174] var_1_27 = __VERIFIER_nondet_uchar() [L175] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L175] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L176] CALL assume_abort_if_not(var_1_27 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L176] RET assume_abort_if_not(var_1_27 <= 63) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L177] var_1_29 = __VERIFIER_nondet_ushort() [L178] CALL assume_abort_if_not(var_1_29 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=4, var_1_29=32768, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=4, var_1_29=32768, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L178] RET assume_abort_if_not(var_1_29 >= 32767) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=4, var_1_29=32768, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L179] CALL assume_abort_if_not(var_1_29 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=4, var_1_29=32768, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=4, var_1_29=32768, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L179] RET assume_abort_if_not(var_1_29 <= 65534) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=4, var_1_29=32768, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L180] var_1_30 = __VERIFIER_nondet_ushort() [L181] CALL assume_abort_if_not(var_1_30 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L181] RET assume_abort_if_not(var_1_30 >= 32767) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L182] CALL assume_abort_if_not(var_1_30 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L182] RET assume_abort_if_not(var_1_30 <= 65534) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L183] var_1_32 = __VERIFIER_nondet_ushort() [L184] CALL assume_abort_if_not(var_1_32 >= 16384) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=-32769, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=-32769, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L184] RET assume_abort_if_not(var_1_32 >= 16384) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=-32769, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L185] CALL assume_abort_if_not(var_1_32 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=-32769, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=-32769, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L185] RET assume_abort_if_not(var_1_32 <= 32767) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=-32769, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L186] var_1_34 = __VERIFIER_nondet_double() [L187] CALL assume_abort_if_not((var_1_34 >= -922337.2036854776000e+13F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 9223372.036854776000e+12F && var_1_34 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=-32769, var_1_33=50, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=-32769, var_1_33=50, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L187] RET assume_abort_if_not((var_1_34 >= -922337.2036854776000e+13F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 9223372.036854776000e+12F && var_1_34 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=-32769, var_1_33=50, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L188] var_1_35 = __VERIFIER_nondet_double() [L189] CALL assume_abort_if_not((var_1_35 >= -922337.2036854776000e+13F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854776000e+12F && var_1_35 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=-32769, var_1_33=50, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=-32769, var_1_33=50, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L189] RET assume_abort_if_not((var_1_35 >= -922337.2036854776000e+13F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854776000e+12F && var_1_35 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=-32769, var_1_33=50, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L190] CALL assume_abort_if_not(var_1_35 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=-32769, var_1_33=50, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=-32769, var_1_33=50, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L190] RET assume_abort_if_not(var_1_35 != 0.0F) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=-32769, var_1_33=50, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L206] RET updateVariables() [L207] CALL step() [L58] COND FALSE !(last_1_var_1_13 > ((((last_1_var_1_31) > (var_1_16)) ? (last_1_var_1_31) : (var_1_16)))) [L61] var_1_28 = (var_1_25 + var_1_19) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=-32769, var_1_33=50, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L63] COND FALSE !((- var_1_3) <= (var_1_4 - var_1_5)) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=-32769, var_1_33=50, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L70] COND TRUE var_1_4 != var_1_5 [L71] var_1_7 = var_1_6 VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=-32769, var_1_33=50, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=32] [L75] var_1_18 = var_1_19 VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=-512, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=-32769, var_1_33=50, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=32] [L76] COND FALSE !(var_1_18 > ((32u / var_1_16) + 32u)) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=-512, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=-32769, var_1_33=50, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=32] [L79] COND FALSE !(\read(var_1_21)) [L82] var_1_23 = var_1_27 VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=-512, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=-32769, var_1_33=50, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=32] [L84] COND TRUE var_1_5 <= (- ((((var_1_4) < (var_1_3)) ? (var_1_4) : (var_1_3)))) [L85] var_1_31 = ((25454 + var_1_32) - var_1_1) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=-512, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=58221, var_1_32=-32769, var_1_33=50, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=32] [L89] unsigned short int stepLocal_2 = var_1_31; VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, stepLocal_2=58221, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=-512, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=58221, var_1_32=-32769, var_1_33=50, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=32] [L90] COND FALSE !(stepLocal_2 == var_1_11) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=-512, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=58221, var_1_32=-32769, var_1_33=50, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=32] [L97] COND TRUE (var_1_31 / var_1_16) <= var_1_28 VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=-512, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=58221, var_1_32=-32769, var_1_33=50, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=32] [L98] COND TRUE var_1_28 <= var_1_18 [L99] var_1_20 = var_1_21 VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=-512, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=58221, var_1_32=-32769, var_1_33=50, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=32] [L102] unsigned char stepLocal_1 = var_1_20; [L103] unsigned char stepLocal_0 = var_1_22; VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, stepLocal_0=0, stepLocal_1=0, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=-512, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=58221, var_1_32=-32769, var_1_33=50, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=32] [L104] COND FALSE !(var_1_22 || stepLocal_1) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, stepLocal_0=0, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=-512, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=58221, var_1_32=-32769, var_1_33=50, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=32] [L107] COND FALSE !(var_1_20 && stepLocal_0) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=-512, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=58221, var_1_32=-32769, var_1_33=50, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=32] [L111] signed long int stepLocal_4 = (var_1_6 * var_1_1) / -64; [L112] unsigned short int stepLocal_3 = var_1_28; VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, stepLocal_3=0, stepLocal_4=0, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=-512, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=58221, var_1_32=-32769, var_1_33=50, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=32] [L113] COND TRUE stepLocal_4 >= var_1_28 [L114] var_1_13 = ((((var_1_28) < (var_1_31)) ? (var_1_28) : (var_1_31))) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, stepLocal_3=0, var_1_11=126, var_1_12=2, var_1_13=0, var_1_16=2147483680, var_1_18=-512, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=58221, var_1_32=-32769, var_1_33=50, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=32] [L120] unsigned long int stepLocal_6 = var_1_16; [L121] signed long int stepLocal_5 = (- var_1_18) / var_1_26; VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, stepLocal_3=0, stepLocal_5=0, stepLocal_6=2147483680, var_1_11=126, var_1_12=2, var_1_13=0, var_1_16=2147483680, var_1_18=-512, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=58221, var_1_32=-32769, var_1_33=50, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=32] [L122] COND FALSE !(var_1_34 < (var_1_5 / var_1_35)) [L137] var_1_33 = var_1_30 VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, stepLocal_3=0, stepLocal_5=0, stepLocal_6=2147483680, var_1_11=126, var_1_12=2, var_1_13=0, var_1_16=2147483680, var_1_18=-512, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=58221, var_1_32=-32769, var_1_33=32767, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=32] [L207] RET step() [L208] CALL, EXPR property() [L198-L199] return (((((((((((((- var_1_3) <= (var_1_4 - var_1_5)) ? ((var_1_3 >= (var_1_5 / 255.75f)) ? (var_1_1 == ((signed char) var_1_6)) : (var_1_1 == ((signed char) var_1_6))) : 1) && ((var_1_4 != var_1_5) ? (var_1_7 == ((signed char) var_1_6)) : (var_1_7 == ((signed char) var_1_8)))) && ((var_1_22 || var_1_20) ? (var_1_9 == ((signed char) ((((((((((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))) > (((((-2) < 0 ) ? -(-2) : (-2))))) ? (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))) : (((((-2) < 0 ) ? -(-2) : (-2))))))) > (var_1_6)) ? (((((((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))) > (((((-2) < 0 ) ? -(-2) : (-2))))) ? (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))) : (((((-2) < 0 ) ? -(-2) : (-2))))))) : (var_1_6))))) : ((var_1_20 && var_1_22) ? (var_1_9 == ((signed char) ((((var_1_11) < (var_1_8)) ? (var_1_11) : (var_1_8))))) : 1))) && ((var_1_31 == var_1_11) ? ((! var_1_22) ? (var_1_22 ? (var_1_12 == ((signed long int) var_1_18)) : 1) : 1) : 1)) && ((((var_1_6 * var_1_1) / -64) >= var_1_28) ? (var_1_13 == ((unsigned long int) ((((var_1_28) < (var_1_31)) ? (var_1_28) : (var_1_31))))) : ((50u >= var_1_28) ? (var_1_13 == ((unsigned long int) (var_1_16 - var_1_18))) : 1))) && (var_1_18 == ((unsigned char) var_1_19))) && (((var_1_31 / var_1_16) <= var_1_28) ? ((var_1_28 <= var_1_18) ? (var_1_20 == ((unsigned char) var_1_21)) : 1) : 1)) && ((var_1_18 > ((32u / var_1_16) + 32u)) ? (var_1_22 == ((unsigned char) var_1_21)) : 1)) && (var_1_21 ? (var_1_23 == ((unsigned char) ((var_1_24 + var_1_25) + ((var_1_26 + 32) - var_1_27)))) : (var_1_23 == ((unsigned char) var_1_27)))) && ((last_1_var_1_13 > ((((last_1_var_1_31) > (var_1_16)) ? (last_1_var_1_31) : (var_1_16)))) ? (var_1_28 == ((unsigned short int) (((((var_1_29) > (var_1_30)) ? (var_1_29) : (var_1_30))) - last_1_var_1_33))) : (var_1_28 == ((unsigned short int) (var_1_25 + var_1_19))))) && ((var_1_5 <= (- ((((var_1_4) < (var_1_3)) ? (var_1_4) : (var_1_3))))) ? (var_1_31 == ((unsigned short int) ((25454 + var_1_32) - var_1_1))) : (var_1_31 == ((unsigned short int) ((((((((var_1_19) < (var_1_23)) ? (var_1_19) : (var_1_23)))) > (var_1_29)) ? (((((var_1_19) < (var_1_23)) ? (var_1_19) : (var_1_23)))) : (var_1_29))))))) && ((var_1_34 < (var_1_5 / var_1_35)) ? ((var_1_16 > ((((64u) < (var_1_28)) ? (64u) : (var_1_28)))) ? (((var_1_4 - var_1_5) <= var_1_3) ? (var_1_33 == ((unsigned long int) (((((8u) < 0 ) ? -(8u) : (8u))) + 25u))) : (var_1_33 == ((unsigned long int) ((((var_1_27) > ((var_1_29 + ((((16u) < (var_1_18)) ? (16u) : (var_1_18)))))) ? (var_1_27) : ((var_1_29 + ((((16u) < (var_1_18)) ? (16u) : (var_1_18)))))))))) : ((((- var_1_18) / var_1_26) < var_1_25) ? (var_1_33 == ((unsigned long int) var_1_30)) : (var_1_33 == ((unsigned long int) var_1_7)))) : (var_1_33 == ((unsigned long int) var_1_30))) ; VAL [\result=0, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=0, var_1_16=2147483680, var_1_18=-512, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=58221, var_1_32=-32769, var_1_33=32767, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=32] [L208] RET, EXPR property() [L208] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=0, var_1_16=2147483680, var_1_18=-512, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=58221, var_1_32=-32769, var_1_33=32767, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=32] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=0, var_1_16=2147483680, var_1_18=-512, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=58221, var_1_32=-32769, var_1_33=32767, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=32] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 94 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.1s, OverallIterations: 8, TraceHistogramMax: 32, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1757 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1713 mSDsluCounter, 2932 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1986 mSDsCounter, 702 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1912 IncrementalHoareTripleChecker+Invalid, 2614 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 702 mSolverCounterUnsat, 946 mSDtfsCounter, 1912 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1375 GetRequests, 1301 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1238occurred in iteration=6, InterpolantAutomatonStates: 67, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 7 MinimizatonAttempts, 1652 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 2241 NumberOfCodeBlocks, 2241 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 2227 ConstructedInterpolants, 0 QuantifiedInterpolants, 7463 SizeOfPredicates, 7 NumberOfNonLiveVariables, 925 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 11 InterpolantComputations, 5 PerfectInterpolantSequences, 21473/21824 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 23:32:15,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-51.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 64360fc7d3c5d5814f250bc67771c1266affbe7be077c4ce76d53cff763882cf --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:32:17,005 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:32:17,069 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 23:32:17,073 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:32:17,074 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:32:17,096 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:32:17,098 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:32:17,099 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:32:17,099 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:32:17,100 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:32:17,101 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:32:17,101 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:32:17,102 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:32:17,104 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:32:17,104 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:32:17,104 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:32:17,104 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:32:17,104 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:32:17,105 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:32:17,105 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:32:17,105 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:32:17,106 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:32:17,106 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:32:17,106 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 23:32:17,106 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 23:32:17,107 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:32:17,107 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 23:32:17,107 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:32:17,107 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:32:17,107 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:32:17,107 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:32:17,108 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:32:17,108 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:32:17,108 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:32:17,109 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:32:17,109 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:32:17,109 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:32:17,114 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:32:17,114 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 23:32:17,115 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 23:32:17,115 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:32:17,115 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:32:17,115 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:32:17,115 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:32:17,116 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 64360fc7d3c5d5814f250bc67771c1266affbe7be077c4ce76d53cff763882cf [2024-11-08 23:32:17,342 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:32:17,357 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:32:17,360 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:32:17,361 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:32:17,361 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:32:17,362 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-51.i [2024-11-08 23:32:18,541 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:32:18,723 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:32:18,724 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-51.i [2024-11-08 23:32:18,737 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0b10efc5/46f2cd5d80964e3eaa6157959b02824c/FLAG5abe96749 [2024-11-08 23:32:18,750 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0b10efc5/46f2cd5d80964e3eaa6157959b02824c [2024-11-08 23:32:18,752 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:32:18,753 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:32:18,755 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:32:18,755 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:32:18,759 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:32:18,760 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:32:18" (1/1) ... [2024-11-08 23:32:18,761 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a2d97e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:32:18, skipping insertion in model container [2024-11-08 23:32:18,761 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:32:18" (1/1) ... [2024-11-08 23:32:18,785 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:32:18,905 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-51.i[916,929] [2024-11-08 23:32:18,982 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:32:18,998 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:32:19,008 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-51.i[916,929] [2024-11-08 23:32:19,062 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:32:19,085 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:32:19,086 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:32:19 WrapperNode [2024-11-08 23:32:19,086 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:32:19,087 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:32:19,087 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:32:19,087 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:32:19,093 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:32:19" (1/1) ... [2024-11-08 23:32:19,109 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:32:19" (1/1) ... [2024-11-08 23:32:19,139 INFO L138 Inliner]: procedures = 27, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 206 [2024-11-08 23:32:19,143 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:32:19,144 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:32:19,146 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:32:19,146 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:32:19,154 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:32:19" (1/1) ... [2024-11-08 23:32:19,154 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:32:19" (1/1) ... [2024-11-08 23:32:19,158 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:32:19" (1/1) ... [2024-11-08 23:32:19,176 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 23:32:19,176 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:32:19" (1/1) ... [2024-11-08 23:32:19,176 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:32:19" (1/1) ... [2024-11-08 23:32:19,188 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:32:19" (1/1) ... [2024-11-08 23:32:19,195 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:32:19" (1/1) ... [2024-11-08 23:32:19,200 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:32:19" (1/1) ... [2024-11-08 23:32:19,203 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:32:19" (1/1) ... [2024-11-08 23:32:19,206 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:32:19,210 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:32:19,210 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:32:19,210 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:32:19,211 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:32:19" (1/1) ... [2024-11-08 23:32:19,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:32:19,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:32:19,238 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 23:32:19,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 23:32:19,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:32:19,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 23:32:19,284 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:32:19,284 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:32:19,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:32:19,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:32:19,356 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:32:19,358 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:32:32,882 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-08 23:32:32,883 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:32:32,896 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:32:32,900 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:32:32,900 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:32:32 BoogieIcfgContainer [2024-11-08 23:32:32,900 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:32:32,902 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:32:32,902 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:32:32,904 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:32:32,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:32:18" (1/3) ... [2024-11-08 23:32:32,905 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38903141 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:32:32, skipping insertion in model container [2024-11-08 23:32:32,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:32:19" (2/3) ... [2024-11-08 23:32:32,905 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38903141 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:32:32, skipping insertion in model container [2024-11-08 23:32:32,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:32:32" (3/3) ... [2024-11-08 23:32:32,906 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-51.i [2024-11-08 23:32:32,921 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:32:32,921 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:32:32,983 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:32:32,990 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;@1e31e3a1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:32:32,990 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:32:32,997 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 59 states have (on average 1.423728813559322) internal successors, (84), 60 states have internal predecessors, (84), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-08 23:32:33,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-08 23:32:33,010 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:32:33,010 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:32:33,011 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:32:33,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:32:33,014 INFO L85 PathProgramCache]: Analyzing trace with hash 37560582, now seen corresponding path program 1 times [2024-11-08 23:32:33,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:32:33,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [270984407] [2024-11-08 23:32:33,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:32:33,026 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:32:33,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:32:33,030 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:32:33,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 23:32:33,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:33,853 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 23:32:33,861 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:32:33,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 1490 trivial. 0 not checked. [2024-11-08 23:32:33,912 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:32:33,913 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:32:33,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [270984407] [2024-11-08 23:32:33,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [270984407] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:32:33,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:32:33,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:32:33,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121177925] [2024-11-08 23:32:33,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:32:33,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:32:33,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:32:33,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:32:33,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:32:33,941 INFO L87 Difference]: Start difference. First operand has 94 states, 59 states have (on average 1.423728813559322) internal successors, (84), 60 states have internal predecessors, (84), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-08 23:32:33,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:32:33,969 INFO L93 Difference]: Finished difference Result 181 states and 322 transitions. [2024-11-08 23:32:33,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:32:33,971 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 203 [2024-11-08 23:32:33,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:32:33,977 INFO L225 Difference]: With dead ends: 181 [2024-11-08 23:32:33,977 INFO L226 Difference]: Without dead ends: 90 [2024-11-08 23:32:33,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:32:33,981 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:32:33,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:32:33,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-08 23:32:34,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-08 23:32:34,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 56 states have (on average 1.375) internal successors, (77), 56 states have internal predecessors, (77), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-08 23:32:34,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 141 transitions. [2024-11-08 23:32:34,015 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 141 transitions. Word has length 203 [2024-11-08 23:32:34,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:32:34,016 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 141 transitions. [2024-11-08 23:32:34,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-08 23:32:34,016 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 141 transitions. [2024-11-08 23:32:34,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-08 23:32:34,020 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:32:34,020 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:32:34,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 23:32:34,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:32:34,221 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:32:34,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:32:34,221 INFO L85 PathProgramCache]: Analyzing trace with hash 653297218, now seen corresponding path program 1 times [2024-11-08 23:32:34,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:32:34,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1141161388] [2024-11-08 23:32:34,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:32:34,222 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:32:34,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:32:34,224 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:32:34,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 23:32:34,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:35,023 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 23:32:35,029 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:32:39,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1011 proven. 51 refuted. 0 times theorem prover too weak. 922 trivial. 0 not checked. [2024-11-08 23:32:39,093 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:32:43,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 42 proven. 51 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-11-08 23:32:43,484 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:32:43,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1141161388] [2024-11-08 23:32:43,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1141161388] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 23:32:43,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 23:32:43,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-08 23:32:43,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156213533] [2024-11-08 23:32:43,485 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 23:32:43,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 23:32:43,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:32:43,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 23:32:43,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 23:32:43,488 INFO L87 Difference]: Start difference. First operand 90 states and 141 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2024-11-08 23:32:51,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.37s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:32:55,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:32:59,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:32:59,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:32:59,582 INFO L93 Difference]: Finished difference Result 185 states and 286 transitions. [2024-11-08 23:32:59,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 23:32:59,749 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) Word has length 203 [2024-11-08 23:32:59,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:32:59,753 INFO L225 Difference]: With dead ends: 185 [2024-11-08 23:32:59,753 INFO L226 Difference]: Without dead ends: 98 [2024-11-08 23:32:59,754 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 398 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-08 23:32:59,754 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 127 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 34 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.5s IncrementalHoareTripleChecker+Time [2024-11-08 23:32:59,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 241 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 173 Invalid, 3 Unknown, 0 Unchecked, 15.5s Time] [2024-11-08 23:32:59,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-08 23:32:59,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2024-11-08 23:32:59,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 59 states have (on average 1.3389830508474576) internal successors, (79), 59 states have internal predecessors, (79), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-08 23:32:59,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 143 transitions. [2024-11-08 23:32:59,774 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 143 transitions. Word has length 203 [2024-11-08 23:32:59,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:32:59,775 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 143 transitions. [2024-11-08 23:32:59,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2024-11-08 23:32:59,775 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 143 transitions. [2024-11-08 23:32:59,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-08 23:32:59,781 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:32:59,782 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:32:59,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-08 23:32:59,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:32:59,982 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:32:59,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:32:59,983 INFO L85 PathProgramCache]: Analyzing trace with hash -626566460, now seen corresponding path program 1 times [2024-11-08 23:32:59,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:32:59,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1288822016] [2024-11-08 23:32:59,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:32:59,984 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:32:59,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:32:59,985 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:32:59,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 23:33:00,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:00,739 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 23:33:00,743 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:33:14,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-08 23:33:14,924 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:33:14,924 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:33:14,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1288822016] [2024-11-08 23:33:14,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1288822016] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:33:14,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:33:14,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 23:33:14,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505089919] [2024-11-08 23:33:14,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:33:14,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 23:33:14,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:33:14,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 23:33:14,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 23:33:14,926 INFO L87 Difference]: Start difference. First operand 94 states and 143 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-08 23:33:21,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.37s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:33:25,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:33:29,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:33:33,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:33:33,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:33:33,260 INFO L93 Difference]: Finished difference Result 276 states and 423 transitions. [2024-11-08 23:33:33,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 23:33:33,413 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 203 [2024-11-08 23:33:33,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:33:33,417 INFO L225 Difference]: With dead ends: 276 [2024-11-08 23:33:33,419 INFO L226 Difference]: Without dead ends: 185 [2024-11-08 23:33:33,420 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:33:33,422 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 34 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.2s IncrementalHoareTripleChecker+Time [2024-11-08 23:33:33,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 362 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 4 Unknown, 0 Unchecked, 18.2s Time] [2024-11-08 23:33:33,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-08 23:33:33,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 183. [2024-11-08 23:33:33,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 114 states have (on average 1.3157894736842106) internal successors, (150), 114 states have internal predecessors, (150), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-08 23:33:33,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 278 transitions. [2024-11-08 23:33:33,458 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 278 transitions. Word has length 203 [2024-11-08 23:33:33,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:33:33,459 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 278 transitions. [2024-11-08 23:33:33,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-08 23:33:33,461 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 278 transitions. [2024-11-08 23:33:33,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-08 23:33:33,465 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:33:33,465 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:33:33,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-08 23:33:33,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:33:33,666 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:33:33,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:33:33,667 INFO L85 PathProgramCache]: Analyzing trace with hash 394501894, now seen corresponding path program 1 times [2024-11-08 23:33:33,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:33:33,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2011197349] [2024-11-08 23:33:33,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:33:33,667 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:33:33,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:33:33,670 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:33:33,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-08 23:33:34,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:34,396 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 23:33:34,403 INFO L278 TraceCheckSpWp]: Computing forward predicates...