/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-23.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 20:33:56,250 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 20:33:56,330 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-15 20:33:56,336 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 20:33:56,336 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 20:33:56,360 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 20:33:56,361 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 20:33:56,361 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 20:33:56,362 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 20:33:56,362 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 20:33:56,363 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 20:33:56,363 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 20:33:56,363 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 20:33:56,366 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 20:33:56,366 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 20:33:56,366 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 20:33:56,368 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 20:33:56,370 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 20:33:56,370 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 20:33:56,371 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 20:33:56,372 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 20:33:56,372 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 20:33:56,372 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 20:33:56,372 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 20:33:56,373 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 20:33:56,373 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 20:33:56,373 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 20:33:56,373 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 20:33:56,374 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 20:33:56,374 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 20:33:56,375 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 20:33:56,375 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 20:33:56,375 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 20:33:56,375 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 20:33:56,376 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 20:33:56,376 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 20:33:56,376 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 20:33:56,376 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 20:33:56,376 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 20:33:56,376 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 20:33:56,377 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 20:33:56,377 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 20:33:56,377 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 20:33:56,377 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: Use bitabs translation -> true [2023-12-15 20:33:56,577 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 20:33:56,598 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 20:33:56,600 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 20:33:56,601 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 20:33:56,601 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 20:33:56,602 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-23.i [2023-12-15 20:33:57,786 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 20:33:57,982 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 20:33:57,983 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-23.i [2023-12-15 20:33:57,991 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/629e632bf/54b157fc0033443fb9ea4e1c36726c2c/FLAG8b494c264 [2023-12-15 20:33:58,004 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/629e632bf/54b157fc0033443fb9ea4e1c36726c2c [2023-12-15 20:33:58,006 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 20:33:58,007 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 20:33:58,012 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 20:33:58,012 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 20:33:58,023 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 20:33:58,024 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 08:33:58" (1/1) ... [2023-12-15 20:33:58,024 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ccec14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:33:58, skipping insertion in model container [2023-12-15 20:33:58,025 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 08:33:58" (1/1) ... [2023-12-15 20:33:58,064 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 20:33:58,230 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-23.i[919,932] [2023-12-15 20:33:58,323 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 20:33:58,337 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 20:33:58,360 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-23.i[919,932] [2023-12-15 20:33:58,403 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 20:33:58,422 INFO L206 MainTranslator]: Completed translation [2023-12-15 20:33:58,423 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:33:58 WrapperNode [2023-12-15 20:33:58,423 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 20:33:58,424 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 20:33:58,424 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 20:33:58,424 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 20:33:58,430 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:33:58" (1/1) ... [2023-12-15 20:33:58,441 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:33:58" (1/1) ... [2023-12-15 20:33:58,485 INFO L138 Inliner]: procedures = 26, calls = 52, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 236 [2023-12-15 20:33:58,486 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 20:33:58,486 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 20:33:58,487 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 20:33:58,487 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 20:33:58,496 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:33:58" (1/1) ... [2023-12-15 20:33:58,496 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:33:58" (1/1) ... [2023-12-15 20:33:58,500 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:33:58" (1/1) ... [2023-12-15 20:33:58,524 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]. [2023-12-15 20:33:58,524 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:33:58" (1/1) ... [2023-12-15 20:33:58,524 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:33:58" (1/1) ... [2023-12-15 20:33:58,537 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:33:58" (1/1) ... [2023-12-15 20:33:58,541 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:33:58" (1/1) ... [2023-12-15 20:33:58,544 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:33:58" (1/1) ... [2023-12-15 20:33:58,547 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:33:58" (1/1) ... [2023-12-15 20:33:58,551 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 20:33:58,552 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 20:33:58,552 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 20:33:58,552 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 20:33:58,553 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:33:58" (1/1) ... [2023-12-15 20:33:58,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 20:33:58,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 20:33:58,592 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) [2023-12-15 20:33:58,609 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 [2023-12-15 20:33:58,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 20:33:58,626 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-15 20:33:58,627 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-15 20:33:58,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 20:33:58,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 20:33:58,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 20:33:58,736 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 20:33:58,740 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 20:33:59,187 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 20:33:59,238 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 20:33:59,238 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-15 20:33:59,239 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 08:33:59 BoogieIcfgContainer [2023-12-15 20:33:59,239 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 20:33:59,242 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 20:33:59,242 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 20:33:59,244 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 20:33:59,245 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 08:33:58" (1/3) ... [2023-12-15 20:33:59,245 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67125eef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 08:33:59, skipping insertion in model container [2023-12-15 20:33:59,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:33:58" (2/3) ... [2023-12-15 20:33:59,246 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67125eef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 08:33:59, skipping insertion in model container [2023-12-15 20:33:59,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 08:33:59" (3/3) ... [2023-12-15 20:33:59,247 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-23.i [2023-12-15 20:33:59,262 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 20:33:59,263 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 20:33:59,318 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 20:33:59,325 INFO L357 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, mHoare=true, 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;@75d1a1e4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 20:33:59,325 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 20:33:59,330 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 57 states have (on average 1.4385964912280702) internal successors, (82), 58 states have internal predecessors, (82), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2023-12-15 20:33:59,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2023-12-15 20:33:59,344 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:33:59,345 INFO L195 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:33:59,345 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:33:59,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:33:59,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1374089802, now seen corresponding path program 1 times [2023-12-15 20:33:59,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:33:59,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642420722] [2023-12-15 20:33:59,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:33:59,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:33:59,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:33:59,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:33:59,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642420722] [2023-12-15 20:33:59,663 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-12-15 20:33:59,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744458680] [2023-12-15 20:33:59,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:33:59,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:33:59,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 20:33:59,668 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) [2023-12-15 20:33:59,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-15 20:33:59,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:33:59,850 INFO L262 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-15 20:33:59,872 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 20:33:59,926 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 2888 trivial. 0 not checked. [2023-12-15 20:33:59,926 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 20:33:59,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744458680] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:33:59,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:33:59,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 20:33:59,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539100855] [2023-12-15 20:33:59,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:33:59,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-15 20:33:59,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:33:59,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-15 20:33:59,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 20:33:59,962 INFO L87 Difference]: Start difference. First operand has 99 states, 57 states have (on average 1.4385964912280702) internal successors, (82), 58 states have internal predecessors, (82), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (39), 2 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 2 states have call successors, (39) [2023-12-15 20:34:00,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:34:00,006 INFO L93 Difference]: Finished difference Result 195 states and 357 transitions. [2023-12-15 20:34:00,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-15 20:34:00,009 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (39), 2 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 2 states have call successors, (39) Word has length 238 [2023-12-15 20:34:00,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:34:00,019 INFO L225 Difference]: With dead ends: 195 [2023-12-15 20:34:00,020 INFO L226 Difference]: Without dead ends: 97 [2023-12-15 20:34:00,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 20:34:00,030 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 20:34:00,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 150 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:34:00,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-12-15 20:34:00,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2023-12-15 20:34:00,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 56 states have internal predecessors, (75), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2023-12-15 20:34:00,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 153 transitions. [2023-12-15 20:34:00,078 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 153 transitions. Word has length 238 [2023-12-15 20:34:00,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:34:00,079 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 153 transitions. [2023-12-15 20:34:00,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (39), 2 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 2 states have call successors, (39) [2023-12-15 20:34:00,079 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 153 transitions. [2023-12-15 20:34:00,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2023-12-15 20:34:00,084 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:34:00,084 INFO L195 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:34:00,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-15 20:34:00,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-12-15 20:34:00,291 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:34:00,292 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:34:00,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1977444188, now seen corresponding path program 1 times [2023-12-15 20:34:00,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:34:00,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478655693] [2023-12-15 20:34:00,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:34:00,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:34:00,386 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 20:34:00,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1268577694] [2023-12-15 20:34:00,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:34:00,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:34:00,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 20:34:00,388 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) [2023-12-15 20:34:00,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-15 20:34:00,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:34:00,558 INFO L262 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-15 20:34:00,568 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 20:34:01,409 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2023-12-15 20:34:01,409 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 20:34:01,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:34:01,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478655693] [2023-12-15 20:34:01,410 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 20:34:01,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1268577694] [2023-12-15 20:34:01,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1268577694] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:34:01,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:34:01,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 20:34:01,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147318288] [2023-12-15 20:34:01,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:34:01,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 20:34:01,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:34:01,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 20:34:01,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 20:34:01,421 INFO L87 Difference]: Start difference. First operand 97 states and 153 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2023-12-15 20:34:01,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:34:01,512 INFO L93 Difference]: Finished difference Result 277 states and 439 transitions. [2023-12-15 20:34:01,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 20:34:01,512 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 238 [2023-12-15 20:34:01,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:34:01,517 INFO L225 Difference]: With dead ends: 277 [2023-12-15 20:34:01,517 INFO L226 Difference]: Without dead ends: 181 [2023-12-15 20:34:01,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 20:34:01,519 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 23 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 20:34:01,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 286 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:34:01,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2023-12-15 20:34:01,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 173. [2023-12-15 20:34:01,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 92 states have (on average 1.2717391304347827) internal successors, (117), 92 states have internal predecessors, (117), 78 states have call successors, (78), 2 states have call predecessors, (78), 2 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2023-12-15 20:34:01,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 273 transitions. [2023-12-15 20:34:01,569 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 273 transitions. Word has length 238 [2023-12-15 20:34:01,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:34:01,570 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 273 transitions. [2023-12-15 20:34:01,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2023-12-15 20:34:01,571 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 273 transitions. [2023-12-15 20:34:01,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2023-12-15 20:34:01,581 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:34:01,581 INFO L195 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:34:01,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-15 20:34:01,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-12-15 20:34:01,787 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:34:01,787 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:34:01,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1457575269, now seen corresponding path program 1 times [2023-12-15 20:34:01,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:34:01,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463738780] [2023-12-15 20:34:01,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:34:01,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:34:01,836 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 20:34:01,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [83165003] [2023-12-15 20:34:01,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:34:01,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:34:01,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 20:34:01,850 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) [2023-12-15 20:34:01,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-15 20:34:02,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:34:02,011 INFO L262 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-15 20:34:02,051 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 20:34:02,260 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2023-12-15 20:34:02,261 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 20:34:02,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:34:02,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463738780] [2023-12-15 20:34:02,261 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 20:34:02,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83165003] [2023-12-15 20:34:02,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [83165003] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:34:02,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:34:02,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 20:34:02,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796857895] [2023-12-15 20:34:02,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:34:02,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 20:34:02,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:34:02,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 20:34:02,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 20:34:02,267 INFO L87 Difference]: Start difference. First operand 173 states and 273 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2023-12-15 20:34:02,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:34:02,335 INFO L93 Difference]: Finished difference Result 367 states and 579 transitions. [2023-12-15 20:34:02,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 20:34:02,336 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 239 [2023-12-15 20:34:02,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:34:02,343 INFO L225 Difference]: With dead ends: 367 [2023-12-15 20:34:02,343 INFO L226 Difference]: Without dead ends: 266 [2023-12-15 20:34:02,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 20:34:02,347 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 38 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 20:34:02,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 305 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:34:02,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2023-12-15 20:34:02,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 264. [2023-12-15 20:34:02,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 143 states have (on average 1.2517482517482517) internal successors, (179), 143 states have internal predecessors, (179), 117 states have call successors, (117), 3 states have call predecessors, (117), 3 states have return successors, (117), 117 states have call predecessors, (117), 117 states have call successors, (117) [2023-12-15 20:34:02,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 413 transitions. [2023-12-15 20:34:02,399 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 413 transitions. Word has length 239 [2023-12-15 20:34:02,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:34:02,401 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 413 transitions. [2023-12-15 20:34:02,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2023-12-15 20:34:02,401 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 413 transitions. [2023-12-15 20:34:02,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2023-12-15 20:34:02,405 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:34:02,405 INFO L195 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:34:02,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-15 20:34:02,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:34:02,612 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:34:02,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:34:02,613 INFO L85 PathProgramCache]: Analyzing trace with hash 843247321, now seen corresponding path program 1 times [2023-12-15 20:34:02,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:34:02,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570842914] [2023-12-15 20:34:02,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:34:02,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:34:02,662 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 20:34:02,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1734430941] [2023-12-15 20:34:02,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:34:02,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:34:02,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 20:34:02,667 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 20:34:02,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-15 20:34:02,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:34:02,846 INFO L262 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 31 conjunts are in the unsatisfiable core [2023-12-15 20:34:02,851 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 20:34:04,767 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 1834 proven. 237 refuted. 0 times theorem prover too weak. 893 trivial. 0 not checked. [2023-12-15 20:34:04,767 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 20:34:51,246 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse33 (= (mod c_~last_1_var_1_19~0 c_~var_1_20~0) 0)) (.cse3 (mod c_~var_1_13~0 256)) (.cse4 (mod c_~var_1_22~0 65536)) (.cse32 (< 0 (+ c_~last_1_var_1_19~0 1))) (.cse0 (div c_~last_1_var_1_19~0 c_~var_1_20~0))) (let ((.cse22 (+ .cse0 65535)) (.cse131 (or (forall ((v_z_18 Int) (v_y_18 Int)) (let ((.cse193 (+ v_z_18 .cse4)) (.cse194 (+ (* 65536 v_y_18) (* v_z_18 65535)))) (or (< .cse0 .cse193) (= .cse193 .cse0) (< (div c_~last_1_var_1_19~0 .cse194) .cse193) (= (mod c_~last_1_var_1_19~0 .cse194) 0) (< 65535 v_z_18) (< v_z_18 0) (< .cse194 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< (div .cse3 .cse194) 5)))) .cse32)) (.cse24 (< c_~var_1_20~0 0)) (.cse5 (not .cse33)) (.cse7 (+ 65536 .cse0))) (and (forall ((v_z_18 Int)) (let ((.cse1 (+ v_z_18 .cse4))) (or (< .cse0 .cse1) (= .cse1 .cse0) (< .cse1 65536) (< 65535 v_z_18) (forall ((v_y_18 Int)) (let ((.cse2 (+ (* 65536 v_y_18) (* v_z_18 65535)))) (or (< (div c_~last_1_var_1_19~0 .cse2) .cse1) (< .cse2 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< (div .cse3 .cse2) 5))))))) (or .cse5 (and (forall ((v_z_9 Int) (v_y_9 Int)) (let ((.cse8 (+ (* 65536 v_y_9) (* v_z_9 65535))) (.cse6 (+ .cse4 v_z_9))) (or (= .cse6 .cse0) (= .cse7 .cse6) (< .cse7 .cse6) (< .cse8 c_~var_1_20~0) (< 65535 v_z_9) (< .cse8 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< (div .cse3 .cse8) 5) (< .cse6 65536)))) (forall ((v_z_9 Int) (v_y_9 Int)) (let ((.cse9 (+ .cse4 v_z_9)) (.cse10 (+ (* 65536 v_y_9) (* v_z_9 65535)))) (or (= .cse9 .cse0) (< v_z_9 0) (< .cse0 .cse9) (< .cse10 c_~var_1_20~0) (< 65535 v_z_9) (< .cse10 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< (div .cse3 .cse10) 5)))))) (forall ((v_z_18 Int)) (let ((.cse12 (+ v_z_18 .cse4))) (or (forall ((v_y_18 Int)) (let ((.cse13 (+ (* 65536 v_y_18) (* v_z_18 65535)))) (let ((.cse11 (+ (div c_~last_1_var_1_19~0 .cse13) 65536))) (or (< .cse11 .cse12) (= .cse12 .cse11) (< .cse13 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< (div .cse3 .cse13) 5))))) (< .cse0 .cse12) (= .cse12 .cse0) (< .cse12 65536) (< 65535 v_z_18)))) (forall ((v_z_9 Int) (v_y_9 Int)) (let ((.cse14 (+ .cse4 v_z_9)) (.cse15 (+ (* 65536 v_y_9) (* v_z_9 65535)))) (or (= .cse14 .cse0) (< v_z_9 0) (< .cse0 .cse14) (= .cse0 (+ .cse4 v_z_9 1)) (< .cse15 c_~var_1_20~0) (< 65535 v_z_9) (< .cse15 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< (div .cse3 .cse15) 5)))) (forall ((v_z_18 Int)) (let ((.cse16 (+ v_z_18 .cse4))) (or (< .cse0 .cse16) (= .cse16 .cse0) (= .cse0 (+ v_z_18 .cse4 1)) (< .cse16 65536) (< 65535 v_z_18) (forall ((v_y_18 Int)) (let ((.cse17 (+ (* 65536 v_y_18) (* v_z_18 65535)))) (or (< (div c_~last_1_var_1_19~0 .cse17) .cse16) (< .cse17 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< (div .cse3 .cse17) 5))))))) (forall ((v_z_25 Int)) (or (forall ((v_y_25 Int)) (let ((.cse19 (* v_z_25 65535)) (.cse20 (* 65536 v_y_25))) (let ((.cse18 (+ .cse19 .cse20))) (or (< .cse18 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< c_~var_1_20~0 (+ .cse19 1 .cse20)) (< (div .cse3 .cse18) 5))))) (< (+ v_z_25 .cse4) 65536) (< .cse0 (+ v_z_25 .cse4 1)) (< 65535 v_z_25))) (forall ((v_z_18 Int)) (let ((.cse21 (+ v_z_18 .cse4))) (or (= .cse7 .cse21) (= .cse22 .cse21) (< .cse7 .cse21) (< .cse21 65536) (< 65535 v_z_18) (forall ((v_y_18 Int)) (let ((.cse23 (+ (* 65536 v_y_18) (* v_z_18 65535)))) (or (< (div c_~last_1_var_1_19~0 .cse23) .cse21) (< .cse23 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< (div .cse3 .cse23) 5))))))) (or .cse24 (and (forall ((v_z_11 Int) (v_y_11 Int)) (let ((.cse26 (+ (* 65536 v_y_11) (* v_z_11 65535))) (.cse25 (+ v_z_11 .cse4))) (or (= .cse25 .cse0) (< .cse26 c_~var_1_20~0) (< v_z_11 0) (< (div .cse3 .cse26) 5) (< .cse26 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< .cse0 .cse25) (< 65535 .cse25)))) (forall ((v_z_11 Int) (v_y_11 Int)) (let ((.cse28 (+ (* 65536 v_y_11) (* v_z_11 65535))) (.cse27 (+ v_z_11 .cse4))) (or (= .cse27 .cse0) (< .cse28 c_~var_1_20~0) (< v_z_11 0) (< (div .cse3 .cse28) 5) (< .cse28 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< .cse0 .cse27) (< 65535 v_z_11)))) (or (and (forall ((v_z_11 Int) (v_y_11 Int)) (let ((.cse30 (+ (* 65536 v_y_11) (* v_z_11 65535))) (.cse29 (+ v_z_11 .cse4))) (or (< .cse29 65536) (< (div .cse3 .cse30) 5) (< .cse30 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< .cse7 .cse29) (< 65535 v_z_11)))) (forall ((v_z_11 Int) (v_y_11 Int)) (let ((.cse31 (+ (* 65536 v_y_11) (* v_z_11 65535)))) (or (< v_z_11 0) (< (div .cse3 .cse31) 5) (< .cse31 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< .cse0 (+ v_z_11 .cse4)) (< 65535 v_z_11))))) .cse32 .cse33) (forall ((v_z_11 Int) (v_y_11 Int)) (let ((.cse35 (+ (* 65536 v_y_11) (* v_z_11 65535))) (.cse34 (+ v_z_11 .cse4))) (or (= .cse34 .cse0) (< .cse34 65536) (< .cse35 c_~var_1_20~0) (= .cse7 .cse34) (< (div .cse3 .cse35) 5) (< .cse35 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< .cse7 .cse34) (< 65535 v_z_11)))) (forall ((v_z_11 Int) (v_y_11 Int)) (let ((.cse37 (+ (* 65536 v_y_11) (* v_z_11 65535))) (.cse36 (+ v_z_11 .cse4))) (or (< .cse36 65536) (< .cse37 c_~var_1_20~0) (= .cse7 .cse36) (< (div .cse3 .cse37) 5) (< .cse37 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< .cse7 .cse36) (< 65535 v_z_11)))))) (forall ((v_z_9 Int) (v_y_9 Int)) (let ((.cse39 (+ (* 65536 v_y_9) (* v_z_9 65535))) (.cse38 (+ .cse4 v_z_9))) (or (= .cse38 .cse0) (= .cse22 .cse38) (= .cse7 .cse38) (< .cse7 .cse38) (< .cse39 c_~var_1_20~0) (< 65535 v_z_9) (< .cse39 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< (div .cse3 .cse39) 5) (< .cse38 65536)))) (forall ((v_z_9 Int) (v_y_9 Int)) (let ((.cse41 (+ (* 65536 v_y_9) (* v_z_9 65535))) (.cse40 (+ .cse4 v_z_9))) (or (= .cse40 .cse0) (= .cse22 .cse40) (= .cse7 .cse40) (= .cse0 (+ .cse4 v_z_9 1)) (< .cse7 .cse40) (< .cse41 c_~var_1_20~0) (< 65535 v_z_9) (< .cse41 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< (div .cse3 .cse41) 5) (< .cse40 65536)))) (forall ((v_z_9 Int) (v_y_9 Int)) (let ((.cse43 (+ (* 65536 v_y_9) (* v_z_9 65535))) (.cse42 (+ .cse4 v_z_9))) (or (= .cse22 .cse42) (= .cse7 .cse42) (< .cse7 .cse42) (< .cse43 c_~var_1_20~0) (< 65535 v_z_9) (< .cse43 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< (div .cse3 .cse43) 5) (< .cse42 65536)))) (forall ((v_z_18 Int)) (let ((.cse44 (+ v_z_18 .cse4))) (or (= .cse7 .cse44) (forall ((v_y_18 Int)) (let ((.cse46 (+ (* 65536 v_y_18) (* v_z_18 65535)))) (let ((.cse45 (+ (div c_~last_1_var_1_19~0 .cse46) 65536))) (or (< .cse45 .cse44) (= .cse44 .cse45) (< .cse46 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< (div .cse3 .cse46) 5))))) (= .cse22 .cse44) (< .cse7 .cse44) (< .cse44 65536) (< 65535 v_z_18)))) (forall ((v_z_25 Int)) (let ((.cse50 (+ v_z_25 .cse4 1))) (or (forall ((v_y_25 Int)) (let ((.cse48 (* v_z_25 65535)) (.cse49 (* 65536 v_y_25))) (let ((.cse47 (+ .cse48 .cse49))) (or (< .cse47 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< c_~var_1_20~0 (+ .cse48 1 .cse49)) (< (div .cse3 .cse47) 5))))) (< (+ v_z_25 .cse4) 65536) (< .cse0 .cse50) (< 65535 v_z_25) (= .cse0 .cse50)))) (forall ((v_z_18 Int)) (let ((.cse51 (+ v_z_18 .cse4))) (or (< .cse0 .cse51) (< 65535 .cse51) (= .cse51 .cse0) (= .cse0 (+ v_z_18 .cse4 1)) (forall ((v_y_18 Int)) (let ((.cse53 (+ (* 65536 v_y_18) (* v_z_18 65535)))) (let ((.cse52 (div c_~last_1_var_1_19~0 .cse53))) (or (= .cse52 .cse51) (< .cse52 .cse51) (< .cse53 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< (div .cse3 .cse53) 5))))) (< v_z_18 0)))) (forall ((v_z_9 Int) (v_y_9 Int)) (let ((.cse55 (+ (* 65536 v_y_9) (* v_z_9 65535))) (.cse54 (+ .cse4 v_z_9))) (or (= .cse54 .cse0) (< v_z_9 0) (< .cse0 .cse54) (= .cse0 (+ .cse4 v_z_9 1)) (< .cse55 c_~var_1_20~0) (< .cse55 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< (div .cse3 .cse55) 5) (< 65535 .cse54)))) (forall ((v_z_18 Int)) (let ((.cse56 (+ v_z_18 .cse4))) (or (= .cse7 .cse56) (= .cse22 .cse56) (< .cse7 .cse56) (= .cse56 .cse0) (< .cse56 65536) (< 65535 v_z_18) (forall ((v_y_18 Int)) (let ((.cse57 (+ (* 65536 v_y_18) (* v_z_18 65535)))) (or (< (div c_~last_1_var_1_19~0 .cse57) .cse56) (< .cse57 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< (div .cse3 .cse57) 5))))))) (or .cse32 (forall ((v_z_18 Int) (v_y_18 Int)) (let ((.cse58 (+ v_z_18 .cse4)) (.cse59 (+ (* 65536 v_y_18) (* v_z_18 65535)))) (or (< .cse0 .cse58) (= .cse58 .cse0) (< (div c_~last_1_var_1_19~0 .cse59) .cse58) (= .cse0 (+ v_z_18 .cse4 1)) (= (mod c_~last_1_var_1_19~0 .cse59) 0) (< 65535 v_z_18) (< v_z_18 0) (< .cse59 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< (div .cse3 .cse59) 5))))) (forall ((v_z_25 Int)) (let ((.cse63 (+ v_z_25 .cse4))) (or (forall ((v_y_25 Int)) (let ((.cse61 (* v_z_25 65535)) (.cse62 (* 65536 v_y_25))) (let ((.cse60 (+ .cse61 .cse62))) (or (< .cse60 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< c_~var_1_20~0 (+ .cse61 1 .cse62)) (< (div .cse3 .cse60) 5))))) (< .cse63 65536) (= .cse22 .cse63) (< .cse22 .cse63) (< 65535 v_z_25)))) (forall ((v_z_18 Int)) (let ((.cse64 (+ v_z_18 .cse4))) (or (= .cse7 .cse64) (= .cse22 .cse64) (< .cse7 .cse64) (forall ((v_y_18 Int)) (let ((.cse66 (+ (* 65536 v_y_18) (* v_z_18 65535)))) (let ((.cse65 (div c_~last_1_var_1_19~0 .cse66))) (or (= .cse65 .cse64) (< .cse65 .cse64) (< .cse66 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< (div .cse3 .cse66) 5))))) (< .cse64 65536) (< 65535 v_z_18)))) (forall ((v_z_18 Int)) (let ((.cse68 (+ v_z_18 .cse4))) (or (forall ((v_y_18 Int)) (let ((.cse69 (+ (* 65536 v_y_18) (* v_z_18 65535)))) (let ((.cse67 (+ (div c_~last_1_var_1_19~0 .cse69) 65536))) (or (< .cse67 .cse68) (= .cse68 .cse67) (< .cse69 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< (div .cse3 .cse69) 5))))) (< .cse0 .cse68) (= .cse68 .cse0) (= .cse0 (+ v_z_18 .cse4 1)) (< .cse68 65536) (< 65535 v_z_18)))) (forall ((v_z_18 Int)) (let ((.cse70 (+ v_z_18 .cse4))) (or (= .cse7 .cse70) (forall ((v_y_18 Int)) (let ((.cse72 (+ (* 65536 v_y_18) (* v_z_18 65535)))) (let ((.cse71 (+ (div c_~last_1_var_1_19~0 .cse72) 65536))) (or (< .cse71 .cse70) (= .cse70 .cse71) (< .cse72 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< (div .cse3 .cse72) 5))))) (= .cse22 .cse70) (< .cse7 .cse70) (= .cse70 .cse0) (< .cse70 65536) (< 65535 v_z_18)))) (or .cse24 (and (forall ((v_z_15 Int)) (let ((.cse74 (+ v_z_15 .cse4))) (or (forall ((v_y_15 Int)) (let ((.cse73 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (or (< (div .cse3 .cse73) 5) (< .cse73 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< (div c_~last_1_var_1_19~0 .cse73) .cse74)))) (< .cse0 .cse74) (< .cse74 65536) (< 65535 v_z_15)))) (forall ((v_z_15 Int)) (let ((.cse75 (+ v_z_15 .cse4))) (or (= .cse7 .cse75) (forall ((v_y_15 Int)) (let ((.cse76 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse77 (+ 65536 (div c_~last_1_var_1_19~0 .cse76)))) (or (< (div .cse3 .cse76) 5) (< .cse76 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< .cse77 .cse75) (= .cse77 .cse75))))) (< .cse75 65536) (< .cse7 .cse75) (< 65535 v_z_15)))) (or (forall ((v_z_15 Int) (v_y_15 Int)) (let ((.cse78 (+ (* v_z_15 65535) (* 65536 v_y_15))) (.cse79 (+ v_z_15 .cse4))) (or (= (mod c_~last_1_var_1_19~0 .cse78) 0) (< v_z_15 0) (< .cse0 .cse79) (< (div .cse3 .cse78) 5) (< .cse78 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (= .cse0 .cse79) (< 65535 v_z_15) (< (div c_~last_1_var_1_19~0 .cse78) .cse79)))) .cse32) (forall ((v_z_15 Int)) (let ((.cse81 (+ v_z_15 .cse4))) (or (forall ((v_y_15 Int)) (let ((.cse80 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (or (< (div .cse3 .cse80) 5) (< .cse80 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< (div c_~last_1_var_1_19~0 .cse80) .cse81)))) (< .cse0 .cse81) (< .cse81 65536) (= .cse0 .cse81) (< 65535 v_z_15)))) (or (and (forall ((v_z_15 Int)) (let ((.cse83 (+ v_z_15 .cse4))) (or (forall ((v_y_15 Int)) (let ((.cse82 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (or (< (div .cse3 .cse82) 5) (< .cse82 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< (div c_~last_1_var_1_19~0 .cse82) .cse83)))) (< v_z_15 0) (< .cse0 .cse83) (< 65535 v_z_15)))) (forall ((v_z_15 Int)) (let ((.cse84 (+ v_z_15 .cse4))) (or (< v_z_15 0) (< .cse0 .cse84) (forall ((v_y_15 Int)) (let ((.cse85 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse86 (div c_~last_1_var_1_19~0 .cse85))) (or (< (div .cse3 .cse85) 5) (< .cse85 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< .cse86 .cse84) (= .cse86 .cse84))))) (< 65535 v_z_15))))) .cse32 .cse33) (forall ((v_z_15 Int)) (let ((.cse87 (+ v_z_15 .cse4))) (or (< .cse0 .cse87) (forall ((v_y_15 Int)) (let ((.cse88 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse89 (+ 65536 (div c_~last_1_var_1_19~0 .cse88)))) (or (< (div .cse3 .cse88) 5) (< .cse88 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< .cse89 .cse87) (= .cse89 .cse87))))) (< .cse87 65536) (= .cse0 .cse87) (< 65535 v_z_15)))) (forall ((v_z_15 Int)) (let ((.cse90 (+ v_z_15 .cse4))) (or (< v_z_15 0) (< .cse0 .cse90) (forall ((v_y_15 Int)) (let ((.cse91 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse92 (div c_~last_1_var_1_19~0 .cse91))) (or (< (div .cse3 .cse91) 5) (< .cse91 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< .cse92 .cse90) (= .cse92 .cse90))))) (= .cse0 .cse90) (< 65535 v_z_15)))) (forall ((v_z_15 Int)) (let ((.cse93 (+ v_z_15 .cse4))) (or (< .cse0 .cse93) (forall ((v_y_15 Int)) (let ((.cse94 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse95 (div c_~last_1_var_1_19~0 .cse94))) (or (< (div .cse3 .cse94) 5) (< .cse94 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< .cse95 .cse93) (= .cse95 .cse93))))) (< .cse93 65536) (< 65535 v_z_15)))) (forall ((v_z_15 Int)) (let ((.cse96 (+ v_z_15 .cse4))) (or (< .cse0 .cse96) (forall ((v_y_15 Int)) (let ((.cse97 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse98 (+ 65536 (div c_~last_1_var_1_19~0 .cse97)))) (or (< (div .cse3 .cse97) 5) (< .cse97 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< .cse98 .cse96) (= .cse98 .cse96))))) (< .cse96 65536) (< 65535 v_z_15)))) (forall ((v_z_15 Int)) (let ((.cse99 (+ v_z_15 .cse4))) (or (= .cse7 .cse99) (forall ((v_y_15 Int)) (let ((.cse100 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse101 (div c_~last_1_var_1_19~0 .cse100))) (or (< (div .cse3 .cse100) 5) (< .cse100 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< .cse101 .cse99) (= .cse101 .cse99))))) (< .cse99 65536) (< .cse7 .cse99) (< 65535 v_z_15)))) (forall ((v_z_15 Int)) (let ((.cse103 (+ v_z_15 .cse4))) (or (forall ((v_y_15 Int)) (let ((.cse102 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (or (< (div .cse3 .cse102) 5) (< .cse102 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< (div c_~last_1_var_1_19~0 .cse102) .cse103)))) (= .cse7 .cse103) (< .cse103 65536) (< .cse7 .cse103) (< 65535 v_z_15)))) (forall ((v_z_15 Int)) (let ((.cse104 (+ v_z_15 .cse4))) (or (< v_z_15 0) (< .cse0 .cse104) (< 65535 .cse104) (forall ((v_y_15 Int)) (let ((.cse105 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse106 (div c_~last_1_var_1_19~0 .cse105))) (or (< (div .cse3 .cse105) 5) (< .cse105 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< .cse106 .cse104) (= .cse106 .cse104))))) (= .cse0 .cse104)))) (or (forall ((v_z_15 Int) (v_y_15 Int)) (let ((.cse107 (+ (* v_z_15 65535) (* 65536 v_y_15))) (.cse108 (+ v_z_15 .cse4))) (or (= (mod c_~last_1_var_1_19~0 .cse107) 0) (< v_z_15 0) (< .cse0 .cse108) (< (div .cse3 .cse107) 5) (< .cse107 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< 65535 .cse108) (= .cse0 .cse108) (< (div c_~last_1_var_1_19~0 .cse107) .cse108)))) .cse32))) (or .cse5 (and (forall ((v_z_25 Int)) (let ((.cse112 (+ v_z_25 .cse4))) (or (forall ((v_y_25 Int)) (let ((.cse110 (* v_z_25 65535)) (.cse111 (* 65536 v_y_25))) (let ((.cse109 (+ .cse110 .cse111))) (or (< .cse109 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< c_~var_1_20~0 (+ .cse110 1 .cse111)) (< (div .cse3 .cse109) 5))))) (< .cse112 65536) (< .cse22 .cse112) (< 65535 v_z_25)))) (forall ((v_z_25 Int)) (let ((.cse113 (+ v_z_25 .cse4))) (or (< .cse113 65536) (forall ((v_y_25 Int)) (let ((.cse116 (* v_z_25 65535)) (.cse117 (* 65536 v_y_25))) (let ((.cse114 (+ .cse116 .cse117))) (let ((.cse115 (div c_~last_1_var_1_19~0 .cse114))) (or (< .cse114 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (= .cse113 .cse115) (< c_~var_1_20~0 (+ .cse116 1 .cse117)) (< .cse115 .cse113) (< (div .cse3 .cse114) 5)))))) (< .cse22 .cse113) (< 65535 v_z_25)))) (forall ((v_z_25 Int)) (let ((.cse118 (+ v_z_25 .cse4))) (or (< .cse118 65536) (< .cse22 .cse118) (forall ((v_y_25 Int)) (let ((.cse120 (* v_z_25 65535)) (.cse121 (* 65536 v_y_25))) (let ((.cse119 (+ .cse120 .cse121))) (or (< .cse119 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (= .cse118 (div c_~last_1_var_1_19~0 .cse119)) (< c_~var_1_20~0 (+ .cse120 1 .cse121)) (< (div .cse3 .cse119) 5))))) (< 65535 v_z_25)))))) (forall ((v_z_25 Int)) (let ((.cse127 (+ v_z_25 .cse4 1))) (or (forall ((v_y_25 Int)) (let ((.cse125 (* v_z_25 65535)) (.cse126 (* 65536 v_y_25))) (let ((.cse122 (+ .cse125 .cse126))) (let ((.cse124 (div c_~last_1_var_1_19~0 .cse122)) (.cse123 (+ v_z_25 .cse4))) (or (< .cse122 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (= .cse123 .cse124) (< c_~var_1_20~0 (+ .cse125 1 .cse126)) (< .cse124 .cse123) (< (div .cse3 .cse122) 5)))))) (< .cse0 .cse127) (< 65535 v_z_25) (< v_z_25 0) (= .cse0 .cse127)))) (or .cse5 (and (forall ((v_z_18 Int)) (let ((.cse128 (+ v_z_18 .cse4))) (or (< .cse0 .cse128) (= .cse128 .cse0) (forall ((v_y_18 Int)) (let ((.cse130 (+ (* 65536 v_y_18) (* v_z_18 65535)))) (let ((.cse129 (div c_~last_1_var_1_19~0 .cse130))) (or (= .cse129 .cse128) (< .cse129 .cse128) (< .cse130 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< (div .cse3 .cse130) 5))))) (< 65535 v_z_18) (< v_z_18 0)))) .cse131)) (or .cse5 (forall ((v_z_25 Int)) (or (forall ((v_y_25 Int)) (let ((.cse135 (* v_z_25 65535)) (.cse136 (* 65536 v_y_25))) (let ((.cse132 (+ .cse135 .cse136))) (let ((.cse134 (div c_~last_1_var_1_19~0 .cse132)) (.cse133 (+ v_z_25 .cse4))) (or (< .cse132 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (= .cse133 .cse134) (< c_~var_1_20~0 (+ .cse135 1 .cse136)) (< .cse134 .cse133) (< (div .cse3 .cse132) 5)))))) (< .cse0 (+ v_z_25 .cse4 1)) (< 65535 v_z_25) (< v_z_25 0)))) (forall ((v_z_25 Int)) (let ((.cse137 (+ v_z_25 .cse4))) (or (< .cse137 65536) (forall ((v_y_25 Int)) (let ((.cse140 (* v_z_25 65535)) (.cse141 (* 65536 v_y_25))) (let ((.cse138 (+ .cse140 .cse141))) (let ((.cse139 (div c_~last_1_var_1_19~0 .cse138))) (or (< .cse138 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (= .cse137 .cse139) (< c_~var_1_20~0 (+ .cse140 1 .cse141)) (< .cse139 .cse137) (< (div .cse3 .cse138) 5)))))) (= .cse22 .cse137) (< .cse22 .cse137) (< 65535 v_z_25)))) (forall ((v_z_25 Int)) (let ((.cse142 (+ v_z_25 .cse4))) (or (< .cse142 65536) (= .cse22 .cse142) (< .cse22 .cse142) (forall ((v_y_25 Int)) (let ((.cse144 (* v_z_25 65535)) (.cse145 (* 65536 v_y_25))) (let ((.cse143 (+ .cse144 .cse145))) (or (< .cse143 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (= .cse142 (div c_~last_1_var_1_19~0 .cse143)) (< c_~var_1_20~0 (+ .cse144 1 .cse145)) (< (div .cse3 .cse143) 5))))) (< 65535 v_z_25)))) (forall ((v_z_18 Int)) (let ((.cse146 (+ v_z_18 .cse4))) (or (= .cse7 .cse146) (= .cse22 .cse146) (< .cse7 .cse146) (= .cse146 .cse0) (forall ((v_y_18 Int)) (let ((.cse148 (+ (* 65536 v_y_18) (* v_z_18 65535)))) (let ((.cse147 (div c_~last_1_var_1_19~0 .cse148))) (or (= .cse147 .cse146) (< .cse147 .cse146) (< .cse148 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< (div .cse3 .cse148) 5))))) (< .cse146 65536) (< 65535 v_z_18)))) (or .cse5 (and .cse131 (forall ((v_z_18 Int)) (let ((.cse149 (+ v_z_18 .cse4))) (or (< .cse0 .cse149) (< 65535 .cse149) (= .cse149 .cse0) (forall ((v_y_18 Int)) (let ((.cse151 (+ (* 65536 v_y_18) (* v_z_18 65535)))) (let ((.cse150 (div c_~last_1_var_1_19~0 .cse151))) (or (= .cse150 .cse149) (< .cse150 .cse149) (< .cse151 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< (div .cse3 .cse151) 5))))) (< v_z_18 0)))))) (or .cse24 (and (forall ((v_z_22 Int)) (let ((.cse152 (+ v_z_22 .cse4))) (or (forall ((v_y_22 Int)) (let ((.cse155 (* v_z_22 65535)) (.cse156 (* 65536 v_y_22))) (let ((.cse154 (+ .cse155 .cse156))) (let ((.cse153 (+ (div c_~last_1_var_1_19~0 .cse154) 65536))) (or (= .cse152 .cse153) (< .cse154 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< .cse153 .cse152) (< c_~var_1_20~0 (+ .cse155 1 .cse156)) (< (div .cse3 .cse154) 5)))))) (< .cse152 65536) (< 65535 v_z_22)))) (forall ((v_z_22 Int)) (let ((.cse157 (+ v_z_22 .cse4))) (or (< .cse157 65536) (< 65535 v_z_22) (forall ((v_y_22 Int)) (let ((.cse159 (* v_z_22 65535)) (.cse160 (* 65536 v_y_22))) (let ((.cse158 (+ .cse159 .cse160))) (or (< .cse158 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< c_~var_1_20~0 (+ .cse159 1 .cse160)) (< (div .cse3 .cse158) 5) (< (div c_~last_1_var_1_19~0 .cse158) .cse157)))))))) (or .cse32 (forall ((v_y_24 Int) (v_z_24 Int)) (let ((.cse162 (* 65536 v_y_24)) (.cse163 (* v_z_24 65535))) (let ((.cse161 (+ .cse162 .cse163))) (or (< .cse161 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< 65535 v_z_24) (< v_z_24 0) (< c_~var_1_20~0 (+ .cse162 .cse163 1)) (< (div .cse3 .cse161) 5) (= (mod c_~last_1_var_1_19~0 .cse161) 0) (< (div c_~last_1_var_1_19~0 .cse161) (+ v_z_24 .cse4))))))) (forall ((v_z_22 Int)) (or (forall ((v_y_22 Int)) (let ((.cse167 (* v_z_22 65535)) (.cse168 (* 65536 v_y_22))) (let ((.cse164 (+ .cse167 .cse168))) (let ((.cse165 (div c_~last_1_var_1_19~0 .cse164)) (.cse166 (+ v_z_22 .cse4))) (or (< .cse164 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (= .cse165 .cse166) (< c_~var_1_20~0 (+ .cse167 1 .cse168)) (< (div .cse3 .cse164) 5) (< .cse165 .cse166)))))) (< 65535 v_z_22) (< v_z_22 0))))) (or .cse5 (and (forall ((v_z_18 Int)) (let ((.cse169 (+ v_z_18 .cse4))) (or (= .cse7 .cse169) (< .cse7 .cse169) (forall ((v_y_18 Int)) (let ((.cse171 (+ (* 65536 v_y_18) (* v_z_18 65535)))) (let ((.cse170 (div c_~last_1_var_1_19~0 .cse171))) (or (= .cse170 .cse169) (< .cse170 .cse169) (< .cse171 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< (div .cse3 .cse171) 5))))) (< .cse169 65536) (< 65535 v_z_18)))) (forall ((v_z_18 Int)) (let ((.cse172 (+ v_z_18 .cse4))) (or (= .cse7 .cse172) (< .cse7 .cse172) (< .cse172 65536) (< 65535 v_z_18) (forall ((v_y_18 Int)) (let ((.cse173 (+ (* 65536 v_y_18) (* v_z_18 65535)))) (or (< (div c_~last_1_var_1_19~0 .cse173) .cse172) (< .cse173 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< (div .cse3 .cse173) 5))))))) (forall ((v_z_18 Int)) (let ((.cse174 (+ v_z_18 .cse4))) (or (= .cse7 .cse174) (forall ((v_y_18 Int)) (let ((.cse176 (+ (* 65536 v_y_18) (* v_z_18 65535)))) (let ((.cse175 (+ (div c_~last_1_var_1_19~0 .cse176) 65536))) (or (< .cse175 .cse174) (= .cse174 .cse175) (< .cse176 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< (div .cse3 .cse176) 5))))) (< .cse7 .cse174) (< .cse174 65536) (< 65535 v_z_18)))))) (forall ((v_z_18 Int)) (let ((.cse177 (+ v_z_18 .cse4))) (or (< .cse0 .cse177) (= .cse177 .cse0) (= .cse0 (+ v_z_18 .cse4 1)) (forall ((v_y_18 Int)) (let ((.cse179 (+ (* 65536 v_y_18) (* v_z_18 65535)))) (let ((.cse178 (div c_~last_1_var_1_19~0 .cse179))) (or (= .cse178 .cse177) (< .cse178 .cse177) (< .cse179 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< (div .cse3 .cse179) 5))))) (< 65535 v_z_18) (< v_z_18 0)))) (or .cse5 (forall ((v_z_9 Int) (v_y_9 Int)) (let ((.cse181 (+ (* 65536 v_y_9) (* v_z_9 65535))) (.cse180 (+ .cse4 v_z_9))) (or (= .cse7 .cse180) (< .cse7 .cse180) (< .cse181 c_~var_1_20~0) (< 65535 v_z_9) (< .cse181 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< (div .cse3 .cse181) 5) (< .cse180 65536))))) (forall ((v_z_18 Int)) (let ((.cse182 (+ v_z_18 .cse4))) (or (< .cse0 .cse182) (= .cse182 .cse0) (forall ((v_y_18 Int)) (let ((.cse184 (+ (* 65536 v_y_18) (* v_z_18 65535)))) (let ((.cse183 (div c_~last_1_var_1_19~0 .cse184))) (or (= .cse183 .cse182) (< .cse183 .cse182) (< .cse184 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< (div .cse3 .cse184) 5))))) (< .cse182 65536) (< 65535 v_z_18)))) (or .cse5 (and (forall ((v_z_18 Int)) (let ((.cse185 (+ v_z_18 .cse4))) (or (= .cse7 .cse185) (< .cse7 .cse185) (= .cse185 .cse0) (< .cse185 65536) (< 65535 v_z_18) (forall ((v_y_18 Int)) (let ((.cse186 (+ (* 65536 v_y_18) (* v_z_18 65535)))) (or (< (div c_~last_1_var_1_19~0 .cse186) .cse185) (< .cse186 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< (div .cse3 .cse186) 5))))))) (forall ((v_z_18 Int)) (let ((.cse187 (+ v_z_18 .cse4))) (or (= .cse7 .cse187) (< .cse7 .cse187) (= .cse187 .cse0) (forall ((v_y_18 Int)) (let ((.cse189 (+ (* 65536 v_y_18) (* v_z_18 65535)))) (let ((.cse188 (div c_~last_1_var_1_19~0 .cse189))) (or (= .cse188 .cse187) (< .cse188 .cse187) (< .cse189 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< (div .cse3 .cse189) 5))))) (< .cse187 65536) (< 65535 v_z_18)))) (forall ((v_z_18 Int)) (let ((.cse190 (+ v_z_18 .cse4))) (or (= .cse7 .cse190) (forall ((v_y_18 Int)) (let ((.cse192 (+ (* 65536 v_y_18) (* v_z_18 65535)))) (let ((.cse191 (+ (div c_~last_1_var_1_19~0 .cse192) 65536))) (or (< .cse191 .cse190) (= .cse190 .cse191) (< .cse192 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< (div .cse3 .cse192) 5))))) (< .cse7 .cse190) (= .cse190 .cse0) (< .cse190 65536) (< 65535 v_z_18))))))))) is different from true Received shutdown request... [2023-12-15 20:35:06,380 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-15 20:35:06,380 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-15 20:35:06,617 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 20:35:06,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-15 20:35:06,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:35:06,818 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 240 with TraceHistMax 39,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-7-1 term,while PolyPacSimplificationTermWalker was simplifying 7 xjuncts wrt. a ATOM-1 context. [2023-12-15 20:35:06,823 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-12-15 20:35:06,826 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 20:35:06,828 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 08:35:06 BoogieIcfgContainer [2023-12-15 20:35:06,828 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 20:35:06,828 INFO L158 Benchmark]: Toolchain (without parser) took 68821.12ms. Allocated memory was 184.5MB in the beginning and 270.5MB in the end (delta: 86.0MB). Free memory was 142.1MB in the beginning and 78.4MB in the end (delta: 63.7MB). Peak memory consumption was 157.0MB. Max. memory is 8.0GB. [2023-12-15 20:35:06,828 INFO L158 Benchmark]: CDTParser took 0.49ms. Allocated memory is still 184.5MB. Free memory is still 140.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 20:35:06,829 INFO L158 Benchmark]: CACSL2BoogieTranslator took 411.57ms. Allocated memory is still 184.5MB. Free memory was 142.1MB in the beginning and 125.8MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-15 20:35:06,839 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.72ms. Allocated memory is still 184.5MB. Free memory was 125.8MB in the beginning and 120.6MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-15 20:35:06,840 INFO L158 Benchmark]: Boogie Preprocessor took 64.94ms. Allocated memory is still 184.5MB. Free memory was 120.6MB in the beginning and 113.8MB in the end (delta: 6.8MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2023-12-15 20:35:06,840 INFO L158 Benchmark]: RCFGBuilder took 686.94ms. Allocated memory is still 184.5MB. Free memory was 113.7MB in the beginning and 81.8MB in the end (delta: 32.0MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. [2023-12-15 20:35:06,841 INFO L158 Benchmark]: TraceAbstraction took 67586.21ms. Allocated memory was 184.5MB in the beginning and 270.5MB in the end (delta: 86.0MB). Free memory was 80.7MB in the beginning and 78.4MB in the end (delta: 2.4MB). Peak memory consumption was 95.1MB. Max. memory is 8.0GB. [2023-12-15 20:35:06,842 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.49ms. Allocated memory is still 184.5MB. Free memory is still 140.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 411.57ms. Allocated memory is still 184.5MB. Free memory was 142.1MB in the beginning and 125.8MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 61.72ms. Allocated memory is still 184.5MB. Free memory was 125.8MB in the beginning and 120.6MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 64.94ms. Allocated memory is still 184.5MB. Free memory was 120.6MB in the beginning and 113.8MB in the end (delta: 6.8MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * RCFGBuilder took 686.94ms. Allocated memory is still 184.5MB. Free memory was 113.7MB in the beginning and 81.8MB in the end (delta: 32.0MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. * TraceAbstraction took 67586.21ms. Allocated memory was 184.5MB in the beginning and 270.5MB in the end (delta: 86.0MB). Free memory was 80.7MB in the beginning and 78.4MB in the end (delta: 2.4MB). Peak memory consumption was 95.1MB. Max. memory is 8.0GB. * 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 - TimeoutResultAtElement [Line: 19]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 19). Cancelled while NwaCegarLoop was analyzing trace of length 240 with TraceHistMax 39,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-7-1 term,while PolyPacSimplificationTermWalker was simplifying 7 xjuncts wrt. a ATOM-1 context. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 99 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 67.5s, OverallIterations: 4, TraceHistogramMax: 39, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 61 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 61 mSDsluCounter, 741 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 275 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 46 IncrementalHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 466 mSDtfsCounter, 46 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 712 GetRequests, 710 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=264occurred in iteration=3, InterpolantAutomatonStates: 8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 10 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 953 NumberOfCodeBlocks, 953 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 712 ConstructedInterpolants, 0 QuantifiedInterpolants, 2946 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1615 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 8892/8892 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: Timeout Completed graceful shutdown