/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_2+newton_2_1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 00:47:16,462 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 00:47:16,541 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-16 00:47:16,543 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 00:47:16,544 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 00:47:16,566 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 00:47:16,567 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 00:47:16,567 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 00:47:16,568 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 00:47:16,571 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 00:47:16,571 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 00:47:16,572 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 00:47:16,572 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 00:47:16,573 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 00:47:16,573 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 00:47:16,573 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 00:47:16,573 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 00:47:16,573 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 00:47:16,574 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 00:47:16,574 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 00:47:16,574 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 00:47:16,574 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 00:47:16,574 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 00:47:16,575 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 00:47:16,575 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 00:47:16,575 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 00:47:16,575 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 00:47:16,575 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 00:47:16,575 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 00:47:16,576 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 00:47:16,576 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 00:47:16,576 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 00:47:16,577 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 00:47:16,577 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 00:47:16,577 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 00:47:16,577 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 00:47:16,577 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 00:47:16,577 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 00:47:16,577 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 00:47:16,577 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 00:47:16,577 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 00:47:16,578 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 00:47:16,578 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 00:47:16,578 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-16 00:47:16,733 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 00:47:16,759 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 00:47:16,761 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 00:47:16,762 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 00:47:16,763 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 00:47:16,764 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/gcd_2+newton_2_1.i [2023-12-16 00:47:17,893 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 00:47:18,043 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 00:47:18,043 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/gcd_2+newton_2_1.i [2023-12-16 00:47:18,048 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f12076ab7/f6a1abda06ea40d5a800f22f925df5d1/FLAG6ca1fd467 [2023-12-16 00:47:18,057 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f12076ab7/f6a1abda06ea40d5a800f22f925df5d1 [2023-12-16 00:47:18,059 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 00:47:18,060 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 00:47:18,061 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 00:47:18,061 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 00:47:18,064 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 00:47:18,064 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 12:47:18" (1/1) ... [2023-12-16 00:47:18,065 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a6ce88f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:47:18, skipping insertion in model container [2023-12-16 00:47:18,065 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 12:47:18" (1/1) ... [2023-12-16 00:47:18,086 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 00:47:18,212 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_2+newton_2_1.i[1226,1239] [2023-12-16 00:47:18,250 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_2+newton_2_1.i[2841,2854] [2023-12-16 00:47:18,251 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 00:47:18,258 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 00:47:18,266 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_2+newton_2_1.i[1226,1239] [2023-12-16 00:47:18,273 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_2+newton_2_1.i[2841,2854] [2023-12-16 00:47:18,274 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 00:47:18,284 INFO L206 MainTranslator]: Completed translation [2023-12-16 00:47:18,284 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:47:18 WrapperNode [2023-12-16 00:47:18,284 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 00:47:18,285 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 00:47:18,285 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 00:47:18,285 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 00:47:18,290 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:47:18" (1/1) ... [2023-12-16 00:47:18,296 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:47:18" (1/1) ... [2023-12-16 00:47:18,311 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 86 [2023-12-16 00:47:18,311 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 00:47:18,311 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 00:47:18,311 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 00:47:18,312 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 00:47:18,318 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:47:18" (1/1) ... [2023-12-16 00:47:18,318 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:47:18" (1/1) ... [2023-12-16 00:47:18,320 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:47:18" (1/1) ... [2023-12-16 00:47:18,328 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-16 00:47:18,328 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:47:18" (1/1) ... [2023-12-16 00:47:18,328 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:47:18" (1/1) ... [2023-12-16 00:47:18,332 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:47:18" (1/1) ... [2023-12-16 00:47:18,334 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:47:18" (1/1) ... [2023-12-16 00:47:18,338 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:47:18" (1/1) ... [2023-12-16 00:47:18,339 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:47:18" (1/1) ... [2023-12-16 00:47:18,340 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 00:47:18,341 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 00:47:18,341 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 00:47:18,341 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 00:47:18,341 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:47:18" (1/1) ... [2023-12-16 00:47:18,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 00:47:18,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 00:47:18,364 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-16 00:47:18,388 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-16 00:47:18,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 00:47:18,405 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2023-12-16 00:47:18,405 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2023-12-16 00:47:18,406 INFO L130 BoogieDeclarations]: Found specification of procedure f [2023-12-16 00:47:18,406 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2023-12-16 00:47:18,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 00:47:18,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-16 00:47:18,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 00:47:18,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 00:47:18,451 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 00:47:18,453 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 00:47:18,600 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 00:47:18,619 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 00:47:18,619 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 00:47:18,620 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 12:47:18 BoogieIcfgContainer [2023-12-16 00:47:18,620 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 00:47:18,621 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 00:47:18,621 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 00:47:18,623 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 00:47:18,623 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 12:47:18" (1/3) ... [2023-12-16 00:47:18,624 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63ab987c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 12:47:18, skipping insertion in model container [2023-12-16 00:47:18,624 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:47:18" (2/3) ... [2023-12-16 00:47:18,624 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63ab987c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 12:47:18, skipping insertion in model container [2023-12-16 00:47:18,624 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 12:47:18" (3/3) ... [2023-12-16 00:47:18,625 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_2+newton_2_1.i [2023-12-16 00:47:18,637 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 00:47:18,637 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-16 00:47:18,666 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 00:47:18,670 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;@415e0a65, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 00:47:18,671 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-16 00:47:18,673 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 23 states have internal predecessors, (32), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-16 00:47:18,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-16 00:47:18,678 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 00:47:18,678 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 00:47:18,679 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 00:47:18,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 00:47:18,684 INFO L85 PathProgramCache]: Analyzing trace with hash -22013170, now seen corresponding path program 1 times [2023-12-16 00:47:18,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 00:47:18,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653266092] [2023-12-16 00:47:18,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:47:18,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 00:47:18,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:47:18,932 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-16 00:47:18,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 00:47:18,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653266092] [2023-12-16 00:47:18,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653266092] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 00:47:18,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 00:47:18,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 00:47:18,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787800848] [2023-12-16 00:47:18,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 00:47:18,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 00:47:18,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 00:47:18,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 00:47:18,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 00:47:18,970 INFO L87 Difference]: Start difference. First operand has 30 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 23 states have internal predecessors, (32), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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-16 00:47:19,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 00:47:19,103 INFO L93 Difference]: Finished difference Result 61 states and 82 transitions. [2023-12-16 00:47:19,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 00:47:19,106 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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-16 00:47:19,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 00:47:19,111 INFO L225 Difference]: With dead ends: 61 [2023-12-16 00:47:19,111 INFO L226 Difference]: Without dead ends: 27 [2023-12-16 00:47:19,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 00:47:19,121 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 7 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 00:47:19,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 66 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 00:47:19,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-12-16 00:47:19,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2023-12-16 00:47:19,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-16 00:47:19,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2023-12-16 00:47:19,163 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 9 [2023-12-16 00:47:19,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 00:47:19,163 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2023-12-16 00:47:19,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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-16 00:47:19,164 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2023-12-16 00:47:19,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-16 00:47:19,165 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 00:47:19,165 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 00:47:19,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 00:47:19,165 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 00:47:19,166 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 00:47:19,166 INFO L85 PathProgramCache]: Analyzing trace with hash 35245132, now seen corresponding path program 1 times [2023-12-16 00:47:19,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 00:47:19,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002337501] [2023-12-16 00:47:19,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:47:19,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 00:47:19,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:47:19,292 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-16 00:47:19,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 00:47:19,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002337501] [2023-12-16 00:47:19,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002337501] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 00:47:19,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 00:47:19,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 00:47:19,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371557169] [2023-12-16 00:47:19,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 00:47:19,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 00:47:19,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 00:47:19,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 00:47:19,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 00:47:19,295 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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-16 00:47:19,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 00:47:19,335 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2023-12-16 00:47:19,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 00:47:19,336 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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-16 00:47:19,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 00:47:19,337 INFO L225 Difference]: With dead ends: 31 [2023-12-16 00:47:19,337 INFO L226 Difference]: Without dead ends: 26 [2023-12-16 00:47:19,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 00:47:19,338 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 2 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 00:47:19,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 58 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 00:47:19,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-12-16 00:47:19,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-12-16 00:47:19,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-16 00:47:19,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2023-12-16 00:47:19,359 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 9 [2023-12-16 00:47:19,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 00:47:19,360 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2023-12-16 00:47:19,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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-16 00:47:19,361 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2023-12-16 00:47:19,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-16 00:47:19,361 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 00:47:19,361 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 00:47:19,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 00:47:19,362 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 00:47:19,362 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 00:47:19,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1084284499, now seen corresponding path program 1 times [2023-12-16 00:47:19,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 00:47:19,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90955919] [2023-12-16 00:47:19,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:47:19,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 00:47:19,376 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 00:47:19,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [417885090] [2023-12-16 00:47:19,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:47:19,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 00:47:19,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 00:47:19,400 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-16 00:47:19,405 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-16 00:47:19,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:47:19,484 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-16 00:47:19,487 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 00:47:19,588 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-16 00:47:19,589 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 00:47:19,641 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-16 00:47:19,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 00:47:19,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90955919] [2023-12-16 00:47:19,644 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 00:47:19,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417885090] [2023-12-16 00:47:19,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [417885090] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 00:47:19,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 00:47:19,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2023-12-16 00:47:19,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154715388] [2023-12-16 00:47:19,647 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 00:47:19,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 00:47:19,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 00:47:19,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 00:47:19,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-16 00:47:19,655 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 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-16 00:47:19,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 00:47:19,714 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2023-12-16 00:47:19,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 00:47:19,715 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 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-16 00:47:19,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 00:47:19,716 INFO L225 Difference]: With dead ends: 32 [2023-12-16 00:47:19,716 INFO L226 Difference]: Without dead ends: 27 [2023-12-16 00:47:19,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-16 00:47:19,716 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 2 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 00:47:19,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 96 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 00:47:19,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-12-16 00:47:19,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-12-16 00:47:19,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-16 00:47:19,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2023-12-16 00:47:19,736 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 10 [2023-12-16 00:47:19,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 00:47:19,737 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2023-12-16 00:47:19,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 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-16 00:47:19,737 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2023-12-16 00:47:19,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-16 00:47:19,737 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 00:47:19,737 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 00:47:19,745 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-16 00:47:19,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 00:47:19,938 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 00:47:19,938 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 00:47:19,939 INFO L85 PathProgramCache]: Analyzing trace with hash -755233492, now seen corresponding path program 2 times [2023-12-16 00:47:19,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 00:47:19,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285211377] [2023-12-16 00:47:19,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:47:19,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 00:47:19,951 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 00:47:19,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1933223216] [2023-12-16 00:47:19,952 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 00:47:19,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 00:47:19,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 00:47:19,956 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-16 00:47:19,976 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-16 00:47:20,007 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 00:47:20,007 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 00:47:20,008 INFO L262 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-16 00:47:20,009 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 00:47:42,510 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 00:47:42,510 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 00:48:09,590 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 00:48:09,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 00:48:09,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285211377] [2023-12-16 00:48:09,592 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 00:48:09,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933223216] [2023-12-16 00:48:09,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933223216] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 00:48:09,595 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 00:48:09,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-12-16 00:48:09,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553866422] [2023-12-16 00:48:09,595 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 00:48:09,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-16 00:48:09,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 00:48:09,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-16 00:48:09,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=139, Unknown=4, NotChecked=0, Total=182 [2023-12-16 00:48:09,598 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 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-16 00:48:12,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-12-16 00:48:16,950 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse10 (+ |c_ULTIMATE.start_main1_~y~0#1| 1))) (and (or (let ((.cse4 (* |c_ULTIMATE.start_gcd_test_~b#1| 255))) (let ((.cse71 (mod |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse72 (mod .cse4 256))) (let ((.cse57 (< .cse72 128)) (.cse2 (+ 257 |c_ULTIMATE.start_main1_~y~0#1|)) (.cse58 (< .cse71 128)) (.cse55 (< 0 .cse10)) (.cse66 (< 127 .cse72)) (.cse63 (< 127 .cse71)) (.cse56 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (not (= (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|) 0))))) (let ((.cse7 (or .cse55 .cse66 .cse63 .cse56)) (.cse8 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse70 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse69 (mod .cse70 256))) (or (< .cse69 .cse10) (< 127 (mod (+ .cse70 .cse4) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse69) (< 127 (mod (+ .cse70 |c_ULTIMATE.start_gcd_test_~b#1|) 256))))))) (.cse18 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse68 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse67 (mod .cse68 256))) (or (< .cse67 .cse10) (< (mod (+ .cse68 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 (mod (+ .cse68 .cse4) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse67)))))) (.cse21 (or .cse55 .cse66 .cse56 .cse58)) (.cse0 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse65 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse64 (mod .cse65 256))) (or (< .cse64 .cse2) (< .cse64 128) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 (mod (+ .cse65 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< (mod (+ .cse65 .cse4) 256) 128)))))) (.cse35 (or .cse55 .cse63 .cse56 .cse57)) (.cse36 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse62 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse61 (mod .cse62 256))) (or (< .cse61 .cse10) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse61) (< 127 (mod (+ .cse62 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< (mod (+ .cse62 .cse4) 256) 128)))))) (.cse26 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse60 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse59 (mod .cse60 256))) (or (< .cse59 .cse2) (< .cse59 128) (< (mod (+ .cse60 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 (mod (+ .cse60 .cse4) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))) (.cse12 (or .cse55 .cse56 .cse57 .cse58)) (.cse13 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse54 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse53 (mod .cse54 256))) (or (< .cse53 .cse10) (< (mod (+ .cse54 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse53) (< (mod (+ .cse54 .cse4) 256) 128)))))) (.cse5 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse32 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse52 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse51 (mod .cse52 256))) (or (< .cse51 .cse2) (< .cse51 128) (< 127 (mod (+ .cse52 .cse4) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 (mod (+ .cse52 |c_ULTIMATE.start_gcd_test_~b#1|) 256))))))) (.cse6 (< 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 1))) (.cse29 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse50 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse49 (mod .cse50 256))) (or (< .cse49 .cse2) (< .cse49 128) (< (mod (+ .cse50 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< (mod (+ .cse50 .cse4) 256) 128))))))) (and (or (and .cse0 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse3 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse1 (mod (+ .cse3 .cse4) 256))) (or (< .cse1 .cse2) (< (mod .cse3 256) 128) (< 127 (mod (+ .cse3 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< .cse1 128) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))) .cse5) (or .cse6 (and .cse7 .cse8 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse11 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse9 (mod (+ .cse11 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< .cse9 .cse10) (< 127 (mod (+ .cse11 .cse4) 256)) (< 127 (mod .cse11 256)) (< 127 .cse9) (= .cse11 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (or .cse6 (and .cse12 .cse13 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse15 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse14 (mod (+ .cse15 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< .cse14 128) (< .cse14 .cse2) (< 127 (mod .cse15 256)) (< (mod (+ .cse15 .cse4) 256) 128) (= .cse15 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (or .cse5 (and .cse7 .cse8 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse17 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse16 (mod (+ .cse17 .cse4) 256))) (or (< 127 .cse16) (< .cse16 .cse10) (< 127 (mod .cse17 256)) (< 127 (mod (+ .cse17 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (= .cse17 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (or (and .cse18 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse19 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse20 (mod (+ .cse19 .cse4) 256))) (or (< (mod (+ .cse19 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 .cse20) (< .cse20 .cse10) (< 127 (mod .cse19 256)) (= .cse19 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))) .cse21) .cse5) (or .cse6 (and .cse18 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse23 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse22 (mod (+ .cse23 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< .cse22 128) (< .cse22 .cse2) (< 127 (mod (+ .cse23 .cse4) 256)) (< 127 (mod .cse23 256)) (= .cse23 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))) .cse21)) (or .cse6 (and (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse24 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse25 (mod (+ .cse24 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< (mod .cse24 256) 128) (< .cse25 128) (< .cse25 .cse2) (< 127 (mod (+ .cse24 .cse4) 256)) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))) .cse26)) (or .cse5 (and (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse28 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse27 (mod (+ .cse28 .cse4) 256))) (or (< .cse27 .cse2) (< (mod .cse28 256) 128) (< (mod (+ .cse28 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< .cse27 128) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))) .cse29)) (or .cse6 (and .cse0 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse30 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse31 (mod (+ .cse30 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< (mod .cse30 256) 128) (< .cse31 .cse10) (< 127 .cse31) (< (mod (+ .cse30 .cse4) 256) 128) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (or .cse6 (and .cse32 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse33 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse34 (mod (+ .cse33 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< (mod .cse33 256) 128) (< .cse34 .cse10) (< 127 (mod (+ .cse33 .cse4) 256)) (< 127 .cse34) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (or .cse6 (and .cse35 .cse36 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse38 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse37 (mod (+ .cse38 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< .cse37 .cse10) (< 127 (mod .cse38 256)) (< 127 .cse37) (< (mod (+ .cse38 .cse4) 256) 128) (= .cse38 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (or .cse5 (and (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse40 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse39 (mod (+ .cse40 .cse4) 256))) (or (< .cse39 .cse2) (< 127 (mod .cse40 256)) (< 127 (mod (+ .cse40 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< .cse39 128) (= .cse40 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))) .cse35 .cse36)) (or (and (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse41 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse42 (mod (+ .cse41 .cse4) 256))) (or (< (mod .cse41 256) 128) (< (mod (+ .cse41 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 .cse42) (< .cse42 .cse10) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))) .cse26) .cse5) (or .cse5 (and (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse44 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse43 (mod (+ .cse44 .cse4) 256))) (or (< .cse43 .cse2) (< (mod (+ .cse44 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 (mod .cse44 256)) (< .cse43 128) (= .cse44 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))) .cse12 .cse13)) (or .cse5 (and .cse32 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse45 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse46 (mod (+ .cse45 .cse4) 256))) (or (< (mod .cse45 256) 128) (< 127 .cse46) (< .cse46 .cse10) (< 127 (mod (+ .cse45 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (or .cse6 (and .cse29 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse47 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse48 (mod (+ .cse47 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< (mod .cse47 256) 128) (< .cse48 128) (< .cse48 .cse2) (< (mod (+ .cse47 .cse4) 256) 128) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))))))))) (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (or (< |c_ULTIMATE.start_gcd_test_~a#1| .cse10) (< 126 |c_ULTIMATE.start_main1_~y~0#1|)) (let ((.cse73 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse86 (<= |c_ULTIMATE.start_gcd_test_~b#1| 0))) (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_15| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse75 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse74 (mod (+ .cse75 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256))) (and (<= .cse73 .cse74) (<= 128 (mod .cse75 256)) (<= 128 .cse74) (<= 128 (mod (+ .cse75 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_15| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse76 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse77 (mod (+ .cse76 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256))) (and (not (= .cse76 0)) (<= (mod .cse76 256) 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0) (<= .cse77 127) (<= (mod (+ .cse76 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256) 127) (<= |c_ULTIMATE.start_gcd_test_~b#1| .cse77))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse78 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse79 (mod (+ .cse78 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256))) (and (not (= .cse78 0)) (<= 128 (mod (+ .cse78 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256)) (<= (mod .cse78 256) 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0) (<= .cse79 127) (<= |c_ULTIMATE.start_gcd_test_~b#1| .cse79))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_15| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse81 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse80 (mod .cse81 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (<= |c_ULTIMATE.start_gcd_test_~b#1| .cse80) (<= .cse80 127) (<= (mod (+ .cse81 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256) 127) (<= (mod (+ .cse81 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256) 127))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse83 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse82 (mod .cse83 256))) (and (<= 128 .cse82) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (<= (mod (+ .cse83 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256) 127) (<= (mod (+ .cse83 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256) 127) (<= .cse73 .cse82))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse84 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse85 (mod .cse84 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (<= 128 (mod (+ .cse84 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256)) (<= |c_ULTIMATE.start_gcd_test_~b#1| .cse85) (<= .cse85 127) (<= (mod (+ .cse84 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256) 127))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|))) (and .cse86 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int) (v_y_7 Int) (v_z_9 Int) (v_y_9 Int)) (let ((.cse89 (* 256 v_y_9)) (.cse90 (* 255 v_z_9))) (let ((.cse87 (+ .cse89 .cse90)) (.cse88 (+ .cse89 .cse90 (* 256 v_y_7)))) (and (<= v_z_9 255) (<= 128 .cse87) (<= .cse88 |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 v_z_9) (<= .cse87 255) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_18| .cse88) 0) (<= 0 .cse88)))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse92 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse91 (mod (+ .cse92 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256))) (and (<= .cse73 .cse91) (<= 128 (mod .cse92 256)) (<= 128 .cse91) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0) (<= (mod (+ .cse92 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256) 127))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse94 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse93 (mod .cse94 256))) (and (<= 128 .cse93) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (<= 128 (mod (+ .cse94 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256)) (<= (mod (+ .cse94 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256) 127) (<= .cse73 .cse93))))) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse96 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse95 (mod .cse96 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (<= |c_ULTIMATE.start_gcd_test_~b#1| .cse95) (<= 128 (mod (+ .cse96 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256)) (<= .cse95 127) (<= (mod (+ .cse96 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256) 127))))))) (and .cse86 (exists ((v_z_3 Int) (v_y_3 Int) (|v_ULTIMATE.start_gcd_test_~a#1_18| Int) (v_y_1 Int)) (let ((.cse99 (* 255 v_z_3)) (.cse100 (* 256 v_y_3))) (let ((.cse97 (+ (* 256 v_y_1) .cse99 .cse100)) (.cse98 (+ .cse99 .cse100))) (and (= (mod |v_ULTIMATE.start_gcd_test_~a#1_18| .cse97) 0) (<= 0 .cse98) (<= 0 .cse97) (<= .cse97 |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 v_z_3) (<= v_z_3 255) (<= .cse98 127)))))) (and (exists ((v_y_4 Int) (|v_ULTIMATE.start_gcd_test_~a#1_18| Int) (v_y_6 Int) (v_z_6 Int)) (let ((.cse103 (* 256 v_y_6)) (.cse104 (* 255 v_z_6))) (let ((.cse102 (+ (* 256 v_y_4) .cse103 .cse104)) (.cse101 (+ .cse103 .cse104))) (and (<= .cse101 127) (<= v_z_6 127) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_18| .cse102) 0) (<= .cse102 |c_ULTIMATE.start_main1_~y~0#1|) (<= 0 v_z_6) (not (= .cse102 0)) (<= 0 .cse102) (<= 0 .cse101))))) .cse86) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_15| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse106 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse105 (mod .cse106 256))) (and (<= 128 .cse105) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (<= 128 (mod (+ .cse106 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256)) (<= 128 (mod (+ .cse106 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256)) (<= .cse73 .cse105))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse108 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse107 (mod (+ .cse108 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256))) (and (<= .cse73 .cse107) (not (= .cse108 0)) (<= 128 .cse107) (<= (mod .cse108 256) 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0) (<= (mod (+ .cse108 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256) 127))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse109 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse110 (mod .cse109 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (<= 128 (mod (+ .cse109 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256)) (<= |c_ULTIMATE.start_gcd_test_~b#1| .cse110) (<= 128 (mod (+ .cse109 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256)) (<= .cse110 127))))) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse112 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse111 (mod .cse112 256))) (and (<= 128 .cse111) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (<= 128 (mod (+ .cse112 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256)) (<= (mod (+ .cse112 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256) 127) (<= .cse73 .cse111))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse113 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse114 (mod (+ .cse113 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256))) (and (<= 128 (mod .cse113 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0) (<= .cse114 127) (<= (mod (+ .cse113 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256) 127) (<= |c_ULTIMATE.start_gcd_test_~b#1| .cse114))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse116 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse115 (mod (+ .cse116 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256))) (and (<= .cse73 .cse115) (not (= .cse116 0)) (<= 128 .cse115) (<= 128 (mod (+ .cse116 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256)) (<= (mod .cse116 256) 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse117 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse118 (mod (+ .cse117 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256))) (and (<= 128 (mod .cse117 256)) (<= 128 (mod (+ .cse117 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0) (<= .cse118 127) (<= |c_ULTIMATE.start_gcd_test_~b#1| .cse118))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|))) (and .cse86 (exists ((v_y_12 Int) (|v_ULTIMATE.start_gcd_test_~a#1_18| Int) (v_z_12 Int) (v_y_11 Int)) (let ((.cse121 (* v_y_12 256)) (.cse122 (* v_z_12 255))) (let ((.cse120 (+ .cse121 .cse122 (* v_y_11 256))) (.cse119 (+ .cse121 .cse122))) (and (<= 128 .cse119) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_18| .cse120) 0) (<= v_z_12 127) (<= .cse120 |c_ULTIMATE.start_main1_~y~0#1|) (<= 0 v_z_12) (<= 0 .cse120) (<= .cse119 255)))))))))) is different from true [2023-12-16 00:48:32,039 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] Received shutdown request... [2023-12-16 00:48:35,869 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 00:48:35,869 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-16 00:48:36,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 00:48:36,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 50.2s TimeCoverageRelationStatistics Valid=47, Invalid=161, Unknown=6, NotChecked=26, Total=240 [2023-12-16 00:48:36,300 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 2 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 10 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2023-12-16 00:48:36,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 58 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 1 Unknown, 10 Unchecked, 8.5s Time] [2023-12-16 00:48:36,301 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-12-16 00:48:36,316 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-16 00:48:36,509 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,SelfDestructingSolverStorable3 [2023-12-16 00:48:36,509 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (27states) and FLOYD_HOARE automaton (currently 6 states, 14 states before enhancement),while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 16 known predicates. [2023-12-16 00:48:36,510 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-16 00:48:36,513 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2023-12-16 00:48:36,514 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 00:48:36,516 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 12:48:36 BoogieIcfgContainer [2023-12-16 00:48:36,516 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 00:48:36,540 INFO L158 Benchmark]: Toolchain (without parser) took 78480.12ms. Allocated memory was 242.2MB in the beginning and 314.6MB in the end (delta: 72.4MB). Free memory was 192.4MB in the beginning and 228.8MB in the end (delta: -36.4MB). Peak memory consumption was 36.9MB. Max. memory is 8.0GB. [2023-12-16 00:48:36,541 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 177.2MB. Free memory was 130.6MB in the beginning and 130.5MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 00:48:36,541 INFO L158 Benchmark]: CACSL2BoogieTranslator took 224.03ms. Allocated memory is still 242.2MB. Free memory was 192.4MB in the beginning and 180.3MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-16 00:48:36,541 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.68ms. Allocated memory is still 242.2MB. Free memory was 180.3MB in the beginning and 178.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-16 00:48:36,541 INFO L158 Benchmark]: Boogie Preprocessor took 28.71ms. Allocated memory is still 242.2MB. Free memory was 178.8MB in the beginning and 176.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 00:48:36,541 INFO L158 Benchmark]: RCFGBuilder took 279.05ms. Allocated memory is still 242.2MB. Free memory was 176.1MB in the beginning and 162.9MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-16 00:48:36,542 INFO L158 Benchmark]: TraceAbstraction took 77894.45ms. Allocated memory was 242.2MB in the beginning and 314.6MB in the end (delta: 72.4MB). Free memory was 162.0MB in the beginning and 228.8MB in the end (delta: -66.8MB). Peak memory consumption was 6.5MB. Max. memory is 8.0GB. [2023-12-16 00:48:36,542 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.09ms. Allocated memory is still 177.2MB. Free memory was 130.6MB in the beginning and 130.5MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 224.03ms. Allocated memory is still 242.2MB. Free memory was 192.4MB in the beginning and 180.3MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.68ms. Allocated memory is still 242.2MB. Free memory was 180.3MB in the beginning and 178.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.71ms. Allocated memory is still 242.2MB. Free memory was 178.8MB in the beginning and 176.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 279.05ms. Allocated memory is still 242.2MB. Free memory was 176.1MB in the beginning and 162.9MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 77894.45ms. Allocated memory was 242.2MB in the beginning and 314.6MB in the end (delta: 72.4MB). Free memory was 162.0MB in the beginning and 228.8MB in the end (delta: -66.8MB). Peak memory consumption was 6.5MB. 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 (27states) and FLOYD_HOARE automaton (currently 6 states, 14 states before enhancement),while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 16 known predicates. - 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 (27states) and FLOYD_HOARE automaton (currently 6 states, 14 states before enhancement),while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 16 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 30 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 77.9s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 27.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 13 SdHoareTripleChecker+Valid, 8.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13 mSDsluCounter, 278 SdHoareTripleChecker+Invalid, 8.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 10 IncrementalHoareTripleChecker+Unchecked, 205 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 154 IncrementalHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 73 mSDtfsCounter, 154 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 50.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=0, InterpolantAutomatonStates: 16, 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, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 50.0s InterpolantComputationTime, 39 NumberOfCodeBlocks, 39 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 54 ConstructedInterpolants, 7 QuantifiedInterpolants, 8014 SizeOfPredicates, 13 NumberOfNonLiveVariables, 165 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 0/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