/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 false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/combinations/gcd_1+newton_3_3.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-20 11:48:21,010 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-20 11:48:21,091 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-20 11:48:21,097 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-20 11:48:21,098 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-20 11:48:21,124 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-20 11:48:21,125 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-20 11:48:21,125 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-20 11:48:21,126 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-20 11:48:21,129 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-20 11:48:21,129 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-20 11:48:21,130 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-20 11:48:21,130 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-20 11:48:21,131 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-20 11:48:21,132 INFO L153 SettingsManager]: * Use SBE=true [2023-12-20 11:48:21,132 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-20 11:48:21,132 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-20 11:48:21,132 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-20 11:48:21,132 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-20 11:48:21,133 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-20 11:48:21,134 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-20 11:48:21,134 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-20 11:48:21,134 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-20 11:48:21,134 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-20 11:48:21,135 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-20 11:48:21,135 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-20 11:48:21,135 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-20 11:48:21,135 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-20 11:48:21,136 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-20 11:48:21,136 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-20 11:48:21,137 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-20 11:48:21,137 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-20 11:48:21,137 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 11:48:21,137 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-20 11:48:21,138 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-20 11:48:21,138 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-20 11:48:21,138 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-20 11:48:21,138 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-20 11:48:21,138 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-20 11:48:21,138 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-20 11:48:21,139 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-20 11:48:21,139 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-20 11:48:21,139 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-20 11:48:21,139 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 -> false [2023-12-20 11:48:21,367 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-20 11:48:21,390 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-20 11:48:21,392 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-20 11:48:21,393 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-20 11:48:21,393 INFO L274 PluginConnector]: CDTParser initialized [2023-12-20 11:48:21,394 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/gcd_1+newton_3_3.i [2023-12-20 11:48:22,515 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-20 11:48:22,677 INFO L384 CDTParser]: Found 1 translation units. [2023-12-20 11:48:22,678 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/gcd_1+newton_3_3.i [2023-12-20 11:48:22,688 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63e342daf/2bb842bad1914f9d82562258d3d3c9d6/FLAG39c0eeb5b [2023-12-20 11:48:22,705 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63e342daf/2bb842bad1914f9d82562258d3d3c9d6 [2023-12-20 11:48:22,707 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-20 11:48:22,708 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-20 11:48:22,709 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-20 11:48:22,709 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-20 11:48:22,714 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-20 11:48:22,714 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 11:48:22" (1/1) ... [2023-12-20 11:48:22,715 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3602fa72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:48:22, skipping insertion in model container [2023-12-20 11:48:22,715 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 11:48:22" (1/1) ... [2023-12-20 11:48:22,740 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-20 11:48:22,894 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/gcd_1+newton_3_3.i[1226,1239] [2023-12-20 11:48:22,937 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/gcd_1+newton_3_3.i[2828,2841] [2023-12-20 11:48:22,939 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 11:48:22,949 INFO L202 MainTranslator]: Completed pre-run [2023-12-20 11:48:22,963 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/gcd_1+newton_3_3.i[1226,1239] [2023-12-20 11:48:22,987 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/gcd_1+newton_3_3.i[2828,2841] [2023-12-20 11:48:22,988 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 11:48:23,001 INFO L206 MainTranslator]: Completed translation [2023-12-20 11:48:23,001 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:48:23 WrapperNode [2023-12-20 11:48:23,002 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-20 11:48:23,004 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-20 11:48:23,004 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-20 11:48:23,004 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-20 11:48:23,010 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:48:23" (1/1) ... [2023-12-20 11:48:23,025 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:48:23" (1/1) ... [2023-12-20 11:48:23,053 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 91 [2023-12-20 11:48:23,054 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-20 11:48:23,054 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-20 11:48:23,054 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-20 11:48:23,054 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-20 11:48:23,063 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:48:23" (1/1) ... [2023-12-20 11:48:23,064 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:48:23" (1/1) ... [2023-12-20 11:48:23,068 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:48:23" (1/1) ... [2023-12-20 11:48:23,087 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2023-12-20 11:48:23,088 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:48:23" (1/1) ... [2023-12-20 11:48:23,088 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:48:23" (1/1) ... [2023-12-20 11:48:23,099 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:48:23" (1/1) ... [2023-12-20 11:48:23,102 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:48:23" (1/1) ... [2023-12-20 11:48:23,106 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:48:23" (1/1) ... [2023-12-20 11:48:23,107 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:48:23" (1/1) ... [2023-12-20 11:48:23,110 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-20 11:48:23,111 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-20 11:48:23,111 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-20 11:48:23,112 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-20 11:48:23,112 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:48:23" (1/1) ... [2023-12-20 11:48:23,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 11:48:23,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 11:48:23,145 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-20 11:48:23,167 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-20 11:48:23,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-20 11:48:23,173 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2023-12-20 11:48:23,173 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2023-12-20 11:48:23,174 INFO L130 BoogieDeclarations]: Found specification of procedure f [2023-12-20 11:48:23,174 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2023-12-20 11:48:23,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-20 11:48:23,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-20 11:48:23,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-20 11:48:23,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-20 11:48:23,240 INFO L241 CfgBuilder]: Building ICFG [2023-12-20 11:48:23,244 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-20 11:48:23,442 INFO L282 CfgBuilder]: Performing block encoding [2023-12-20 11:48:23,476 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-20 11:48:23,476 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-20 11:48:23,476 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 11:48:23 BoogieIcfgContainer [2023-12-20 11:48:23,477 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-20 11:48:23,479 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-20 11:48:23,479 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-20 11:48:23,483 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-20 11:48:23,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.12 11:48:22" (1/3) ... [2023-12-20 11:48:23,484 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11fd9231 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 11:48:23, skipping insertion in model container [2023-12-20 11:48:23,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:48:23" (2/3) ... [2023-12-20 11:48:23,484 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11fd9231 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 11:48:23, skipping insertion in model container [2023-12-20 11:48:23,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 11:48:23" (3/3) ... [2023-12-20 11:48:23,485 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_1+newton_3_3.i [2023-12-20 11:48:23,500 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-20 11:48:23,500 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-20 11:48:23,549 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-20 11:48:23,555 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;@6221994c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-20 11:48:23,555 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-20 11:48:23,558 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 22 states have (on average 1.5) internal successors, (33), 24 states have internal predecessors, (33), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-20 11:48:23,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-20 11:48:23,564 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 11:48:23,564 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 11:48:23,565 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 11:48:23,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 11:48:23,572 INFO L85 PathProgramCache]: Analyzing trace with hash 117379001, now seen corresponding path program 1 times [2023-12-20 11:48:23,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 11:48:23,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743870133] [2023-12-20 11:48:23,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:48:23,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 11:48:23,656 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-20 11:48:23,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1434973365] [2023-12-20 11:48:23,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:48:23,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 11:48:23,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 11:48:23,660 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-20 11:48:23,679 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-20 11:48:23,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:48:23,744 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-20 11:48:23,747 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 11:48:23,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 11:48:23,761 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 11:48:23,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 11:48:23,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743870133] [2023-12-20 11:48:23,762 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-20 11:48:23,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434973365] [2023-12-20 11:48:23,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434973365] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 11:48:23,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 11:48:23,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-20 11:48:23,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547726438] [2023-12-20 11:48:23,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 11:48:23,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-20 11:48:23,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 11:48:23,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-20 11:48:23,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-20 11:48:23,802 INFO L87 Difference]: Start difference. First operand has 33 states, 22 states have (on average 1.5) internal successors, (33), 24 states have internal predecessors, (33), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 11:48:23,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 11:48:23,841 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2023-12-20 11:48:23,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-20 11:48:23,843 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-12-20 11:48:23,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 11:48:23,849 INFO L225 Difference]: With dead ends: 59 [2023-12-20 11:48:23,849 INFO L226 Difference]: Without dead ends: 28 [2023-12-20 11:48:23,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 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-20 11:48:23,855 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 11:48:23,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 11:48:23,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-12-20 11:48:23,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-12-20 11:48:23,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-20 11:48:23,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2023-12-20 11:48:23,888 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 9 [2023-12-20 11:48:23,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 11:48:23,889 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2023-12-20 11:48:23,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 11:48:23,890 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2023-12-20 11:48:23,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-20 11:48:23,892 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 11:48:23,892 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 11:48:23,903 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-20 11:48:24,098 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-20 11:48:24,099 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 11:48:24,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 11:48:24,100 INFO L85 PathProgramCache]: Analyzing trace with hash 117259837, now seen corresponding path program 1 times [2023-12-20 11:48:24,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 11:48:24,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452065937] [2023-12-20 11:48:24,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:48:24,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 11:48:24,113 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-20 11:48:24,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [690592632] [2023-12-20 11:48:24,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:48:24,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 11:48:24,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 11:48:24,115 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-20 11:48:24,140 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-20 11:48:24,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:48:24,182 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-20 11:48:24,183 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 11:48:24,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 11:48:24,218 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 11:48:24,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 11:48:24,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452065937] [2023-12-20 11:48:24,219 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-20 11:48:24,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690592632] [2023-12-20 11:48:24,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [690592632] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 11:48:24,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 11:48:24,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 11:48:24,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627067520] [2023-12-20 11:48:24,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 11:48:24,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 11:48:24,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 11:48:24,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 11:48:24,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 11:48:24,223 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 11:48:24,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 11:48:24,243 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2023-12-20 11:48:24,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 11:48:24,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-12-20 11:48:24,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 11:48:24,245 INFO L225 Difference]: With dead ends: 34 [2023-12-20 11:48:24,245 INFO L226 Difference]: Without dead ends: 29 [2023-12-20 11:48:24,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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-20 11:48:24,246 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 2 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 11:48:24,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 50 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 11:48:24,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-12-20 11:48:24,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-12-20 11:48:24,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-20 11:48:24,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2023-12-20 11:48:24,252 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 9 [2023-12-20 11:48:24,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 11:48:24,253 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2023-12-20 11:48:24,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 11:48:24,253 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2023-12-20 11:48:24,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-20 11:48:24,253 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 11:48:24,254 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 11:48:24,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-20 11:48:24,459 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-20 11:48:24,460 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 11:48:24,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 11:48:24,460 INFO L85 PathProgramCache]: Analyzing trace with hash -603037507, now seen corresponding path program 1 times [2023-12-20 11:48:24,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 11:48:24,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469672029] [2023-12-20 11:48:24,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:48:24,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 11:48:24,472 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-20 11:48:24,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [494337280] [2023-12-20 11:48:24,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:48:24,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 11:48:24,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 11:48:24,474 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-20 11:48:24,477 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-20 11:48:24,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:48:24,533 INFO L262 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-20 11:48:24,534 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 11:48:24,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 11:48:24,585 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 11:48:24,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 11:48:24,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 11:48:24,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469672029] [2023-12-20 11:48:24,618 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-20 11:48:24,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494337280] [2023-12-20 11:48:24,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494337280] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 11:48:24,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-20 11:48:24,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2023-12-20 11:48:24,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847035195] [2023-12-20 11:48:24,618 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-20 11:48:24,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-20 11:48:24,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 11:48:24,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-20 11:48:24,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-20 11:48:24,620 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 11:48:24,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 11:48:24,664 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2023-12-20 11:48:24,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 11:48:24,665 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-12-20 11:48:24,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 11:48:24,667 INFO L225 Difference]: With dead ends: 34 [2023-12-20 11:48:24,667 INFO L226 Difference]: Without dead ends: 30 [2023-12-20 11:48:24,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-20 11:48:24,669 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 1 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 11:48:24,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 98 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 11:48:24,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-12-20 11:48:24,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-12-20 11:48:24,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-20 11:48:24,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2023-12-20 11:48:24,680 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 10 [2023-12-20 11:48:24,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 11:48:24,682 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2023-12-20 11:48:24,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 11:48:24,683 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2023-12-20 11:48:24,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-20 11:48:24,683 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 11:48:24,683 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 11:48:24,694 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-20 11:48:24,888 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-20 11:48:24,888 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 11:48:24,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 11:48:24,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1514676993, now seen corresponding path program 2 times [2023-12-20 11:48:24,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 11:48:24,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043463184] [2023-12-20 11:48:24,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:48:24,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 11:48:24,898 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-20 11:48:24,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1848954480] [2023-12-20 11:48:24,899 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-20 11:48:24,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 11:48:24,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 11:48:24,900 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-20 11:48:24,911 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-20 11:48:27,646 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-20 11:48:27,647 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-20 11:48:27,648 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 39 conjunts are in the unsatisfiable core [2023-12-20 11:48:27,651 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 11:48:56,812 WARN L293 SmtUtils]: Spent 5.61s on a formula simplification. DAG size of input: 7 DAG size of output: 1 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 11:48:56,813 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 11:48:56,813 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 11:50:32,208 WARN L293 SmtUtils]: Spent 7.19s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 11:52:03,279 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse26 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse25 (+ |c_ULTIMATE.start_gcd_test_~a#1| 1)) (.cse28 (mod (+ .cse26 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256)) (.cse27 (mod (+ .cse26 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse19 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse27) 256) 0))) (.cse21 (= .cse27 0)) (.cse23 (= .cse28 0)) (.cse24 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse28) 256) 0))) (.cse9 (< 0 .cse25))) (let ((.cse8 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse28)) 256) 0))) (.cse0 (< .cse28 128)) (.cse10 (< 127 .cse28)) (.cse5 (< .cse27 128)) (.cse6 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse12 (or .cse23 .cse24 .cse9)) (.cse13 (or .cse19 .cse21 .cse9)) (.cse1 (< 127 .cse27)) (.cse14 (< 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 1))) (.cse15 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse27)) 256) 0))) (.cse16 (mod .cse26 256))) (and (or (let ((.cse7 (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse16)) 256) 0)) (< |c_ULTIMATE.start_gcd_test_~a#1| 0)))) (let ((.cse4 (or .cse14 (and (or .cse15 .cse9) .cse7))) (.cse3 (or (and .cse7 .cse13) .cse14))) (and (or .cse0 (let ((.cse2 (or .cse6 (and .cse7 (or .cse8 .cse9))))) (and (or .cse1 (and .cse2 .cse3)) (or (and .cse4 .cse2) .cse5)))) (or .cse10 (let ((.cse11 (or (and .cse7 .cse12) .cse6))) (and (or .cse5 (and .cse11 .cse4)) (or (and .cse11 .cse3) .cse1))))))) (< .cse16 128)) (or (< 127 .cse16) (let ((.cse20 (= .cse26 0))) (let ((.cse18 (or (and (<= .cse25 0) (not .cse20)) (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse16) 256) 0)) (= .cse16 0)))) (let ((.cse22 (or .cse14 (and .cse18 (or .cse20 .cse15 .cse9))))) (and (or (let ((.cse17 (or (and .cse18 (or .cse20 .cse8 .cse9)) .cse6))) (and (or .cse1 (and .cse17 (or .cse14 (and .cse18 (or .cse19 .cse20 .cse21 .cse9))))) (or (and .cse17 .cse22) .cse5))) .cse0) (or .cse10 (and (or (and (or (and (or .cse20 .cse23 .cse24 .cse9) .cse18) .cse6) .cse22) .cse5) (or (and (or .cse6 (and .cse18 .cse12)) (or (and .cse13 .cse18) .cse14)) .cse1))))))))))))) (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) is different from false [2023-12-20 11:52:46,690 WARN L293 SmtUtils]: Spent 18.49s on a formula simplification that was a NOOP. DAG size: 64 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-20 11:53:16,938 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 11:53:31,591 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 11:54:34,599 WARN L293 SmtUtils]: Spent 25.43s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-20 11:54:46,627 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 11:54:54,635 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 11:55:28,065 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 11:55:39,391 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-20 11:55:39,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 11:55:39,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043463184] [2023-12-20 11:55:39,392 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-20 11:55:39,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848954480] [2023-12-20 11:55:39,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1848954480] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 11:55:39,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-20 11:55:39,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 13 [2023-12-20 11:55:39,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474923703] [2023-12-20 11:55:39,392 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-20 11:55:39,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-20 11:55:39,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 11:55:39,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-20 11:55:39,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=95, Unknown=11, NotChecked=20, Total=156 [2023-12-20 11:55:39,394 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 11:55:43,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-12-20 11:56:16,307 WARN L293 SmtUtils]: Spent 31.26s on a formula simplification. DAG size of input: 45 DAG size of output: 28 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-20 11:58:05,322 WARN L293 SmtUtils]: Spent 1.56m on a formula simplification. DAG size of input: 83 DAG size of output: 48 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-20 11:58:09,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-12-20 12:00:25,344 WARN L293 SmtUtils]: Spent 1.78m on a formula simplification. DAG size of input: 138 DAG size of output: 76 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-20 12:00:29,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-12-20 12:00:31,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.35s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-12-20 12:00:35,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-12-20 12:00:39,762 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse31 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse41 (+ |c_ULTIMATE.start_gcd_test_~a#1| 1)) (.cse43 (mod (+ .cse31 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256))) (let ((.cse42 (mod .cse31 256)) (.cse37 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse45 (= .cse43 0)) (.cse46 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse43) 256) 0))) (.cse15 (< 0 .cse41))) (let ((.cse26 (or .cse45 .cse46 .cse15)) (.cse11 (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse42)) 256) 0)) .cse37)) (.cse44 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse43)) 256) 0))) (.cse21 (= .cse31 0))) (let ((.cse17 (< 127 .cse42)) (.cse25 (or .cse21 .cse45 .cse46 .cse15)) (.cse24 (or .cse21 .cse44 .cse15)) (.cse28 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse42) 256) 0))) (.cse29 (= .cse42 0)) (.cse0 (< .cse43 128)) (.cse7 (and .cse11 (or .cse44 .cse15))) (.cse8 (< 127 .cse43)) (.cse10 (and .cse11 .cse26)) (.cse16 (< .cse42 128)) (.cse6 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse32 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse27 (<= .cse41 0))) (and (or (let ((.cse30 (mod (+ .cse31 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse20 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse30) 256) 0))) (.cse22 (= .cse30 0))) (let ((.cse5 (< .cse30 128)) (.cse12 (or .cse20 .cse22 .cse15)) (.cse1 (< 127 .cse30)) (.cse13 (< 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 1))) (.cse14 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse30)) 256) 0)))) (and (or (let ((.cse4 (or .cse13 (and (or .cse14 .cse15) .cse11))) (.cse3 (or (and .cse11 .cse12) .cse13))) (and (or .cse0 (let ((.cse2 (or .cse6 .cse7))) (and (or .cse1 (and .cse2 .cse3)) (or (and .cse4 .cse2) .cse5)))) (or .cse8 (let ((.cse9 (or .cse10 .cse6))) (and (or .cse5 (and .cse9 .cse4)) (or (and .cse9 .cse3) .cse1)))))) .cse16) (or .cse17 (let ((.cse19 (or (and .cse27 (not .cse21)) .cse28 .cse29))) (let ((.cse23 (or .cse13 (and .cse19 (or .cse21 .cse14 .cse15))))) (and (or (let ((.cse18 (or (and .cse19 .cse24) .cse6))) (and (or .cse1 (and .cse18 (or .cse13 (and .cse19 (or .cse20 .cse21 .cse22 .cse15))))) (or (and .cse18 .cse23) .cse5))) .cse0) (or .cse8 (and (or (and (or (and .cse25 .cse19) .cse6) .cse23) .cse5) (or (and (or .cse6 (and .cse19 .cse26)) (or (and .cse12 .cse19) .cse13)) .cse1))))))))))) .cse32) (or (not (= (mod |c_ULTIMATE.start_main1_~x~0#1| |c_ULTIMATE.start_main1_~y~0#1|) 0)) (let ((.cse33 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (and (let ((.cse34 (mod (mod .cse33 |c_ULTIMATE.start_main1_~y~0#1|) 256))) (or (< 127 .cse33) (not (= (mod (mod |c_ULTIMATE.start_main1_~y~0#1| .cse34) 256) 0)) (= .cse34 0))) (let ((.cse35 (mod (+ .cse33 (- 256)) |c_ULTIMATE.start_main1_~y~0#1|))) (or (< .cse33 128) (not (= (mod (mod |c_ULTIMATE.start_main1_~y~0#1| (+ (- 256) (mod (+ .cse35 (* |c_ULTIMATE.start_main1_~y~0#1| 255)) 256))) 256) 0)) (= .cse35 0))))) (< 0 (+ |c_ULTIMATE.start_main1_~x~0#1| 1)) (< |c_ULTIMATE.start_main1_~y~0#1| 1)) (<= |c_ULTIMATE.start_gcd_test_~b#1| 127) (or (and (or .cse17 (let ((.cse36 (or .cse37 .cse28 .cse29))) (and (or .cse8 (and .cse36 .cse25)) (or .cse0 (and .cse36 .cse24))))) (or (and (or .cse0 .cse7) (or .cse8 .cse10)) .cse16)) .cse6 .cse32) (<= 0 (+ 128 |c_ULTIMATE.start_main1_~x~0#1|)) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (let ((.cse39 (* |c_ULTIMATE.start_gcd_test_~a#1| 255))) (or (and (<= |c_ULTIMATE.start_gcd_test_~a#1| 127) (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|) (exists ((v_y_1 Int)) (let ((.cse38 (* 256 v_y_1))) (and (<= 0 (+ .cse38 .cse39 128)) (<= (+ .cse38 .cse39 1) 0) (= (mod (+ .cse38 .cse39) |c_ULTIMATE.start_gcd_test_~b#1|) 0))))) (and (<= 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 128)) (exists ((v_y_3 Int)) (let ((.cse40 (* 256 v_y_3))) (and (<= (+ 65281 .cse39 .cse40) 0) (= (mod (+ 65280 .cse39 .cse40) |c_ULTIMATE.start_gcd_test_~b#1|) 0) (<= 0 (+ 65408 .cse39 .cse40))))) .cse27))) (<= 1 |c_ULTIMATE.start_gcd_test_~b#1|))))))) is different from false [2023-12-20 12:00:43,770 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse31 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse41 (+ |c_ULTIMATE.start_gcd_test_~a#1| 1)) (.cse43 (mod (+ .cse31 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256))) (let ((.cse42 (mod .cse31 256)) (.cse37 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse45 (= .cse43 0)) (.cse46 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse43) 256) 0))) (.cse15 (< 0 .cse41))) (let ((.cse26 (or .cse45 .cse46 .cse15)) (.cse11 (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse42)) 256) 0)) .cse37)) (.cse44 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse43)) 256) 0))) (.cse21 (= .cse31 0))) (let ((.cse17 (< 127 .cse42)) (.cse25 (or .cse21 .cse45 .cse46 .cse15)) (.cse24 (or .cse21 .cse44 .cse15)) (.cse28 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse42) 256) 0))) (.cse29 (= .cse42 0)) (.cse0 (< .cse43 128)) (.cse7 (and .cse11 (or .cse44 .cse15))) (.cse8 (< 127 .cse43)) (.cse10 (and .cse11 .cse26)) (.cse16 (< .cse42 128)) (.cse6 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse32 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse27 (<= .cse41 0))) (and (or (let ((.cse30 (mod (+ .cse31 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse20 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse30) 256) 0))) (.cse22 (= .cse30 0))) (let ((.cse5 (< .cse30 128)) (.cse12 (or .cse20 .cse22 .cse15)) (.cse1 (< 127 .cse30)) (.cse13 (< 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 1))) (.cse14 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse30)) 256) 0)))) (and (or (let ((.cse4 (or .cse13 (and (or .cse14 .cse15) .cse11))) (.cse3 (or (and .cse11 .cse12) .cse13))) (and (or .cse0 (let ((.cse2 (or .cse6 .cse7))) (and (or .cse1 (and .cse2 .cse3)) (or (and .cse4 .cse2) .cse5)))) (or .cse8 (let ((.cse9 (or .cse10 .cse6))) (and (or .cse5 (and .cse9 .cse4)) (or (and .cse9 .cse3) .cse1)))))) .cse16) (or .cse17 (let ((.cse19 (or (and .cse27 (not .cse21)) .cse28 .cse29))) (let ((.cse23 (or .cse13 (and .cse19 (or .cse21 .cse14 .cse15))))) (and (or (let ((.cse18 (or (and .cse19 .cse24) .cse6))) (and (or .cse1 (and .cse18 (or .cse13 (and .cse19 (or .cse20 .cse21 .cse22 .cse15))))) (or (and .cse18 .cse23) .cse5))) .cse0) (or .cse8 (and (or (and (or (and .cse25 .cse19) .cse6) .cse23) .cse5) (or (and (or .cse6 (and .cse19 .cse26)) (or (and .cse12 .cse19) .cse13)) .cse1))))))))))) .cse32) (or (not (= (mod |c_ULTIMATE.start_main1_~x~0#1| |c_ULTIMATE.start_main1_~y~0#1|) 0)) (let ((.cse33 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (and (let ((.cse34 (mod (mod .cse33 |c_ULTIMATE.start_main1_~y~0#1|) 256))) (or (< 127 .cse33) (not (= (mod (mod |c_ULTIMATE.start_main1_~y~0#1| .cse34) 256) 0)) (= .cse34 0))) (let ((.cse35 (mod (+ .cse33 (- 256)) |c_ULTIMATE.start_main1_~y~0#1|))) (or (< .cse33 128) (not (= (mod (mod |c_ULTIMATE.start_main1_~y~0#1| (+ (- 256) (mod (+ .cse35 (* |c_ULTIMATE.start_main1_~y~0#1| 255)) 256))) 256) 0)) (= .cse35 0))))) (< 0 (+ |c_ULTIMATE.start_main1_~x~0#1| 1)) (< |c_ULTIMATE.start_main1_~y~0#1| 1)) (<= |c_ULTIMATE.start_gcd_test_~b#1| 127) (or (and (or .cse17 (let ((.cse36 (or .cse37 .cse28 .cse29))) (and (or .cse8 (and .cse36 .cse25)) (or .cse0 (and .cse36 .cse24))))) (or (and (or .cse0 .cse7) (or .cse8 .cse10)) .cse16)) .cse6 .cse32) (<= 0 (+ 128 |c_ULTIMATE.start_main1_~x~0#1|)) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (let ((.cse39 (* |c_ULTIMATE.start_gcd_test_~a#1| 255))) (or (and (<= |c_ULTIMATE.start_gcd_test_~a#1| 127) (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|) (exists ((v_y_1 Int)) (let ((.cse38 (* 256 v_y_1))) (and (<= 0 (+ .cse38 .cse39 128)) (<= (+ .cse38 .cse39 1) 0) (= (mod (+ .cse38 .cse39) |c_ULTIMATE.start_gcd_test_~b#1|) 0))))) (and (<= 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 128)) (exists ((v_y_3 Int)) (let ((.cse40 (* 256 v_y_3))) (and (<= (+ 65281 .cse39 .cse40) 0) (= (mod (+ 65280 .cse39 .cse40) |c_ULTIMATE.start_gcd_test_~b#1|) 0) (<= 0 (+ 65408 .cse39 .cse40))))) .cse27))) (<= 1 |c_ULTIMATE.start_gcd_test_~b#1|))))))) is different from true [2023-12-20 12:00:47,954 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse25 (+ |c_ULTIMATE.start_gcd_test_~a#1| 1)) (.cse26 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse20 (= .cse26 0)) (.cse6 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse30 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse9 (< 0 .cse25)) (.cse29 (* |c_ULTIMATE.start_gcd_test_~b#1| 255))) (and (or (let ((.cse28 (mod (+ .cse26 .cse29) 256)) (.cse27 (mod (+ .cse26 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse19 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse27) 256) 0))) (.cse21 (= .cse27 0)) (.cse23 (= .cse28 0)) (.cse24 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse28) 256) 0)))) (let ((.cse8 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse28)) 256) 0))) (.cse0 (< .cse28 128)) (.cse10 (< 127 .cse28)) (.cse5 (< .cse27 128)) (.cse12 (or .cse23 .cse24 .cse9)) (.cse13 (or .cse19 .cse21 .cse9)) (.cse1 (< 127 .cse27)) (.cse14 (< 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 1))) (.cse15 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse27)) 256) 0))) (.cse16 (mod .cse26 256))) (and (or (let ((.cse7 (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse16)) 256) 0)) (< |c_ULTIMATE.start_gcd_test_~a#1| 0)))) (let ((.cse4 (or .cse14 (and (or .cse15 .cse9) .cse7))) (.cse3 (or (and .cse7 .cse13) .cse14))) (and (or .cse0 (let ((.cse2 (or .cse6 (and .cse7 (or .cse8 .cse9))))) (and (or .cse1 (and .cse2 .cse3)) (or (and .cse4 .cse2) .cse5)))) (or .cse10 (let ((.cse11 (or (and .cse7 .cse12) .cse6))) (and (or .cse5 (and .cse11 .cse4)) (or (and .cse11 .cse3) .cse1))))))) (< .cse16 128)) (or (< 127 .cse16) (let ((.cse18 (or (and (<= .cse25 0) (not .cse20)) (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse16) 256) 0)) (= .cse16 0)))) (let ((.cse22 (or .cse14 (and .cse18 (or .cse20 .cse15 .cse9))))) (and (or (let ((.cse17 (or (and .cse18 (or .cse20 .cse8 .cse9)) .cse6))) (and (or .cse1 (and .cse17 (or .cse14 (and .cse18 (or .cse19 .cse20 .cse21 .cse9))))) (or (and .cse17 .cse22) .cse5))) .cse0) (or .cse10 (and (or (and (or (and (or .cse20 .cse23 .cse24 .cse9) .cse18) .cse6) .cse22) .cse5) (or (and (or .cse6 (and .cse18 .cse12)) (or (and .cse13 .cse18) .cse14)) .cse1))))))))))) .cse30) (or (not (= (mod |c_ULTIMATE.start_main1_~x~0#1| |c_ULTIMATE.start_main1_~y~0#1|) 0)) (let ((.cse31 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (and (let ((.cse32 (mod (mod .cse31 |c_ULTIMATE.start_main1_~y~0#1|) 256))) (or (< 127 .cse31) (not (= (mod (mod |c_ULTIMATE.start_main1_~y~0#1| .cse32) 256) 0)) (= .cse32 0))) (let ((.cse33 (mod (+ .cse31 (- 256)) |c_ULTIMATE.start_main1_~y~0#1|))) (or (< .cse31 128) (not (= (mod (mod |c_ULTIMATE.start_main1_~y~0#1| (+ (- 256) (mod (+ .cse33 (* |c_ULTIMATE.start_main1_~y~0#1| 255)) 256))) 256) 0)) (= .cse33 0))))) (< 0 (+ |c_ULTIMATE.start_main1_~x~0#1| 1)) (< |c_ULTIMATE.start_main1_~y~0#1| 1)) .cse20 (<= |c_ULTIMATE.start_gcd_test_~b#1| 127) (<= 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 128)) (or .cse6 .cse30 .cse9 (let ((.cse34 (mod (* |c_ULTIMATE.start_gcd_test_~a#1| 255) 256))) (and (let ((.cse35 (mod (mod .cse34 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< 127 .cse34) (= 0 .cse35) (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse35) 256) 0)))) (let ((.cse36 (mod (+ .cse34 (- 256)) |c_ULTIMATE.start_gcd_test_~b#1|))) (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) (mod (+ .cse36 .cse29) 256))) 256) 0)) (= .cse36 0) (< .cse34 128)))))) (<= 0 (+ 128 |c_ULTIMATE.start_main1_~x~0#1|)) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (<= 1 |c_ULTIMATE.start_gcd_test_~b#1|)))) is different from false [2023-12-20 12:00:51,961 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse25 (+ |c_ULTIMATE.start_gcd_test_~a#1| 1)) (.cse26 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse20 (= .cse26 0)) (.cse6 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse30 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse9 (< 0 .cse25)) (.cse29 (* |c_ULTIMATE.start_gcd_test_~b#1| 255))) (and (or (let ((.cse28 (mod (+ .cse26 .cse29) 256)) (.cse27 (mod (+ .cse26 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse19 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse27) 256) 0))) (.cse21 (= .cse27 0)) (.cse23 (= .cse28 0)) (.cse24 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse28) 256) 0)))) (let ((.cse8 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse28)) 256) 0))) (.cse0 (< .cse28 128)) (.cse10 (< 127 .cse28)) (.cse5 (< .cse27 128)) (.cse12 (or .cse23 .cse24 .cse9)) (.cse13 (or .cse19 .cse21 .cse9)) (.cse1 (< 127 .cse27)) (.cse14 (< 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 1))) (.cse15 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse27)) 256) 0))) (.cse16 (mod .cse26 256))) (and (or (let ((.cse7 (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse16)) 256) 0)) (< |c_ULTIMATE.start_gcd_test_~a#1| 0)))) (let ((.cse4 (or .cse14 (and (or .cse15 .cse9) .cse7))) (.cse3 (or (and .cse7 .cse13) .cse14))) (and (or .cse0 (let ((.cse2 (or .cse6 (and .cse7 (or .cse8 .cse9))))) (and (or .cse1 (and .cse2 .cse3)) (or (and .cse4 .cse2) .cse5)))) (or .cse10 (let ((.cse11 (or (and .cse7 .cse12) .cse6))) (and (or .cse5 (and .cse11 .cse4)) (or (and .cse11 .cse3) .cse1))))))) (< .cse16 128)) (or (< 127 .cse16) (let ((.cse18 (or (and (<= .cse25 0) (not .cse20)) (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse16) 256) 0)) (= .cse16 0)))) (let ((.cse22 (or .cse14 (and .cse18 (or .cse20 .cse15 .cse9))))) (and (or (let ((.cse17 (or (and .cse18 (or .cse20 .cse8 .cse9)) .cse6))) (and (or .cse1 (and .cse17 (or .cse14 (and .cse18 (or .cse19 .cse20 .cse21 .cse9))))) (or (and .cse17 .cse22) .cse5))) .cse0) (or .cse10 (and (or (and (or (and (or .cse20 .cse23 .cse24 .cse9) .cse18) .cse6) .cse22) .cse5) (or (and (or .cse6 (and .cse18 .cse12)) (or (and .cse13 .cse18) .cse14)) .cse1))))))))))) .cse30) (or (not (= (mod |c_ULTIMATE.start_main1_~x~0#1| |c_ULTIMATE.start_main1_~y~0#1|) 0)) (let ((.cse31 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (and (let ((.cse32 (mod (mod .cse31 |c_ULTIMATE.start_main1_~y~0#1|) 256))) (or (< 127 .cse31) (not (= (mod (mod |c_ULTIMATE.start_main1_~y~0#1| .cse32) 256) 0)) (= .cse32 0))) (let ((.cse33 (mod (+ .cse31 (- 256)) |c_ULTIMATE.start_main1_~y~0#1|))) (or (< .cse31 128) (not (= (mod (mod |c_ULTIMATE.start_main1_~y~0#1| (+ (- 256) (mod (+ .cse33 (* |c_ULTIMATE.start_main1_~y~0#1| 255)) 256))) 256) 0)) (= .cse33 0))))) (< 0 (+ |c_ULTIMATE.start_main1_~x~0#1| 1)) (< |c_ULTIMATE.start_main1_~y~0#1| 1)) .cse20 (<= |c_ULTIMATE.start_gcd_test_~b#1| 127) (<= 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 128)) (or .cse6 .cse30 .cse9 (let ((.cse34 (mod (* |c_ULTIMATE.start_gcd_test_~a#1| 255) 256))) (and (let ((.cse35 (mod (mod .cse34 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< 127 .cse34) (= 0 .cse35) (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse35) 256) 0)))) (let ((.cse36 (mod (+ .cse34 (- 256)) |c_ULTIMATE.start_gcd_test_~b#1|))) (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) (mod (+ .cse36 .cse29) 256))) 256) 0)) (= .cse36 0) (< .cse34 128)))))) (<= 0 (+ 128 |c_ULTIMATE.start_main1_~x~0#1|)) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (<= 1 |c_ULTIMATE.start_gcd_test_~b#1|)))) is different from true [2023-12-20 12:00:55,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.65s for a HTC check with result INVALID. Formula has sorts [Bool, Real, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-12-20 12:00:56,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, Real, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] Received shutdown request... [2023-12-20 12:03:04,833 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-20 12:03:04,833 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-20 12:03:05,844 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-20 12:03:06,034 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-12-20 12:03:06,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 [2023-12-20 12:03:06,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-20 12:03:06,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 408.3s TimeCoverageRelationStatistics Valid=54, Invalid=148, Unknown=20, NotChecked=84, Total=306 [2023-12-20 12:03:06,064 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 17 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 28 IncrementalHoareTripleChecker+Unchecked, 24.4s IncrementalHoareTripleChecker+Time [2023-12-20 12:03:06,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 58 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 4 Unknown, 28 Unchecked, 24.4s Time] [2023-12-20 12:03:06,065 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-12-20 12:03:06,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-20 12:03:06,065 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (30states) and FLOYD_HOARE automaton (currently 10 states, 13 states before enhancement),while PredicateUnifier was unifying predicates,while executing Executor. [2023-12-20 12:03:06,066 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-20 12:03:06,068 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2023-12-20 12:03:06,071 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-20 12:03:06,073 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.12 12:03:06 BoogieIcfgContainer [2023-12-20 12:03:06,073 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-20 12:03:06,073 INFO L158 Benchmark]: Toolchain (without parser) took 883364.98ms. Allocated memory was 268.4MB in the beginning and 323.0MB in the end (delta: 54.5MB). Free memory was 220.8MB in the beginning and 156.2MB in the end (delta: 64.6MB). Peak memory consumption was 120.1MB. Max. memory is 8.0GB. [2023-12-20 12:03:06,073 INFO L158 Benchmark]: CDTParser took 0.48ms. Allocated memory is still 211.8MB. Free memory was 165.2MB in the beginning and 165.0MB in the end (delta: 159.5kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-20 12:03:06,074 INFO L158 Benchmark]: CACSL2BoogieTranslator took 293.43ms. Allocated memory is still 268.4MB. Free memory was 220.4MB in the beginning and 208.5MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-20 12:03:06,074 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.79ms. Allocated memory is still 268.4MB. Free memory was 208.5MB in the beginning and 206.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-20 12:03:06,074 INFO L158 Benchmark]: Boogie Preprocessor took 55.95ms. Allocated memory is still 268.4MB. Free memory was 206.5MB in the beginning and 204.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-20 12:03:06,075 INFO L158 Benchmark]: RCFGBuilder took 365.42ms. Allocated memory is still 268.4MB. Free memory was 204.1MB in the beginning and 190.4MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-20 12:03:06,075 INFO L158 Benchmark]: TraceAbstraction took 882594.18ms. Allocated memory was 268.4MB in the beginning and 323.0MB in the end (delta: 54.5MB). Free memory was 189.7MB in the beginning and 156.2MB in the end (delta: 33.5MB). Peak memory consumption was 88.7MB. Max. memory is 8.0GB. [2023-12-20 12:03:06,076 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.48ms. Allocated memory is still 211.8MB. Free memory was 165.2MB in the beginning and 165.0MB in the end (delta: 159.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 293.43ms. Allocated memory is still 268.4MB. Free memory was 220.4MB in the beginning and 208.5MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 49.79ms. Allocated memory is still 268.4MB. Free memory was 208.5MB in the beginning and 206.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 55.95ms. Allocated memory is still 268.4MB. Free memory was 206.5MB in the beginning and 204.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 365.42ms. Allocated memory is still 268.4MB. Free memory was 204.1MB in the beginning and 190.4MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 882594.18ms. Allocated memory was 268.4MB in the beginning and 323.0MB in the end (delta: 54.5MB). Free memory was 189.7MB in the beginning and 156.2MB in the end (delta: 33.5MB). Peak memory consumption was 88.7MB. 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: 27]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 27). Cancelled while NwaCegarLoop was constructing difference of abstraction (30states) and FLOYD_HOARE automaton (currently 10 states, 13 states before enhancement),while PredicateUnifier was unifying predicates,while executing Executor. - TimeoutResultAtElement [Line: 102]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 102). Cancelled while NwaCegarLoop was constructing difference of abstraction (30states) and FLOYD_HOARE automaton (currently 10 states, 13 states before enhancement),while PredicateUnifier was unifying predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 33 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 882.5s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 446.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4 mSolverCounterUnknown, 20 SdHoareTripleChecker+Valid, 24.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 20 mSDsluCounter, 240 SdHoareTripleChecker+Invalid, 24.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 28 IncrementalHoareTripleChecker+Unchecked, 146 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 105 IncrementalHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 94 mSDtfsCounter, 105 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 408.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=0, InterpolantAutomatonStates: 10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 2.8s SatisfiabilityAnalysisTime, 431.9s InterpolantComputationTime, 39 NumberOfCodeBlocks, 39 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 54 ConstructedInterpolants, 3 QuantifiedInterpolants, 2017 SizeOfPredicates, 14 NumberOfNonLiveVariables, 320 ConjunctsInSsa, 62 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 2/8 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