/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/combinations/gcd_2+newton_2_2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-18 22:53:01,695 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-18 22:53:01,778 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-18 22:53:01,783 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-18 22:53:01,783 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-18 22:53:01,815 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-18 22:53:01,815 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-18 22:53:01,815 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-18 22:53:01,816 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-18 22:53:01,819 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-18 22:53:01,820 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-18 22:53:01,820 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-18 22:53:01,820 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-18 22:53:01,822 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-18 22:53:01,822 INFO L153 SettingsManager]: * Use SBE=true [2023-12-18 22:53:01,822 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-18 22:53:01,822 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-18 22:53:01,823 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-18 22:53:01,823 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-18 22:53:01,823 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-18 22:53:01,824 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-18 22:53:01,824 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-18 22:53:01,825 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-18 22:53:01,825 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-18 22:53:01,825 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-18 22:53:01,825 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-18 22:53:01,826 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-18 22:53:01,826 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-18 22:53:01,826 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-18 22:53:01,826 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-18 22:53:01,827 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-18 22:53:01,827 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-18 22:53:01,828 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-18 22:53:01,828 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-18 22:53:01,828 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-18 22:53:01,828 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-18 22:53:01,828 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-18 22:53:01,829 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-18 22:53:01,829 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-18 22:53:01,829 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-18 22:53:01,829 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-18 22:53:01,829 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-18 22:53:01,830 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-18 22:53:01,830 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-18 22:53:01,996 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-18 22:53:02,015 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-18 22:53:02,017 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-18 22:53:02,018 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-18 22:53:02,018 INFO L274 PluginConnector]: CDTParser initialized [2023-12-18 22:53:02,019 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/gcd_2+newton_2_2.i [2023-12-18 22:53:03,155 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-18 22:53:03,363 INFO L384 CDTParser]: Found 1 translation units. [2023-12-18 22:53:03,364 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/gcd_2+newton_2_2.i [2023-12-18 22:53:03,371 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9547554ec/c5c6ced1103a4394b4e4f24765ad54c5/FLAG5659f587d [2023-12-18 22:53:03,382 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9547554ec/c5c6ced1103a4394b4e4f24765ad54c5 [2023-12-18 22:53:03,384 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-18 22:53:03,385 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-18 22:53:03,386 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-18 22:53:03,386 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-18 22:53:03,391 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-18 22:53:03,392 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:53:03" (1/1) ... [2023-12-18 22:53:03,393 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ac0dd86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:53:03, skipping insertion in model container [2023-12-18 22:53:03,393 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:53:03" (1/1) ... [2023-12-18 22:53:03,411 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-18 22:53:03,541 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_2.i[1226,1239] [2023-12-18 22:53:03,561 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_2.i[2841,2854] [2023-12-18 22:53:03,562 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-18 22:53:03,570 INFO L202 MainTranslator]: Completed pre-run [2023-12-18 22:53:03,581 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_2.i[1226,1239] [2023-12-18 22:53:03,590 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_2.i[2841,2854] [2023-12-18 22:53:03,591 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-18 22:53:03,602 INFO L206 MainTranslator]: Completed translation [2023-12-18 22:53:03,603 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:53:03 WrapperNode [2023-12-18 22:53:03,603 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-18 22:53:03,603 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-18 22:53:03,604 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-18 22:53:03,604 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-18 22:53:03,608 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:53:03" (1/1) ... [2023-12-18 22:53:03,613 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:53:03" (1/1) ... [2023-12-18 22:53:03,631 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 86 [2023-12-18 22:53:03,631 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-18 22:53:03,632 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-18 22:53:03,632 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-18 22:53:03,632 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-18 22:53:03,641 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:53:03" (1/1) ... [2023-12-18 22:53:03,641 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:53:03" (1/1) ... [2023-12-18 22:53:03,643 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:53:03" (1/1) ... [2023-12-18 22:53:03,653 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-18 22:53:03,654 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:53:03" (1/1) ... [2023-12-18 22:53:03,654 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:53:03" (1/1) ... [2023-12-18 22:53:03,658 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:53:03" (1/1) ... [2023-12-18 22:53:03,662 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:53:03" (1/1) ... [2023-12-18 22:53:03,663 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:53:03" (1/1) ... [2023-12-18 22:53:03,664 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:53:03" (1/1) ... [2023-12-18 22:53:03,666 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-18 22:53:03,667 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-18 22:53:03,667 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-18 22:53:03,667 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-18 22:53:03,668 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:53:03" (1/1) ... [2023-12-18 22:53:03,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-18 22:53:03,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 22:53:03,705 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-18 22:53:03,735 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-18 22:53:03,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-18 22:53:03,741 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2023-12-18 22:53:03,741 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2023-12-18 22:53:03,742 INFO L130 BoogieDeclarations]: Found specification of procedure f [2023-12-18 22:53:03,742 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2023-12-18 22:53:03,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-18 22:53:03,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-18 22:53:03,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-18 22:53:03,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-18 22:53:03,814 INFO L241 CfgBuilder]: Building ICFG [2023-12-18 22:53:03,818 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-18 22:53:03,998 INFO L282 CfgBuilder]: Performing block encoding [2023-12-18 22:53:04,021 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-18 22:53:04,021 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-18 22:53:04,022 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:53:04 BoogieIcfgContainer [2023-12-18 22:53:04,022 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-18 22:53:04,024 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-18 22:53:04,024 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-18 22:53:04,027 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-18 22:53:04,027 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 10:53:03" (1/3) ... [2023-12-18 22:53:04,027 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a0d2233 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:53:04, skipping insertion in model container [2023-12-18 22:53:04,028 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:53:03" (2/3) ... [2023-12-18 22:53:04,028 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a0d2233 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:53:04, skipping insertion in model container [2023-12-18 22:53:04,028 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:53:04" (3/3) ... [2023-12-18 22:53:04,029 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_2+newton_2_2.i [2023-12-18 22:53:04,045 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-18 22:53:04,045 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-18 22:53:04,078 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-18 22:53:04,083 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;@20ad787a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-18 22:53:04,083 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-18 22:53:04,086 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-18 22:53:04,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-18 22:53:04,092 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:53:04,093 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-18 22:53:04,093 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:53:04,098 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:53:04,098 INFO L85 PathProgramCache]: Analyzing trace with hash -22013170, now seen corresponding path program 1 times [2023-12-18 22:53:04,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:53:04,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521365751] [2023-12-18 22:53:04,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:53:04,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:53:04,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:53:04,351 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-18 22:53:04,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:53:04,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521365751] [2023-12-18 22:53:04,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521365751] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 22:53:04,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-18 22:53:04,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-18 22:53:04,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426894017] [2023-12-18 22:53:04,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 22:53:04,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-18 22:53:04,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:53:04,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-18 22:53:04,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-18 22:53:04,401 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-18 22:53:04,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:53:04,503 INFO L93 Difference]: Finished difference Result 61 states and 82 transitions. [2023-12-18 22:53:04,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-18 22:53:04,508 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-18 22:53:04,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:53:04,513 INFO L225 Difference]: With dead ends: 61 [2023-12-18 22:53:04,513 INFO L226 Difference]: Without dead ends: 27 [2023-12-18 22:53:04,516 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-18 22:53:04,520 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 7 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-18 22:53:04,521 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-18 22:53:04,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-12-18 22:53:04,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2023-12-18 22:53:04,547 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-18 22:53:04,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2023-12-18 22:53:04,549 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 9 [2023-12-18 22:53:04,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:53:04,549 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2023-12-18 22:53:04,549 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-18 22:53:04,549 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2023-12-18 22:53:04,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-18 22:53:04,550 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:53:04,550 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-18 22:53:04,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-18 22:53:04,551 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:53:04,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:53:04,552 INFO L85 PathProgramCache]: Analyzing trace with hash 35245132, now seen corresponding path program 1 times [2023-12-18 22:53:04,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:53:04,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058215443] [2023-12-18 22:53:04,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:53:04,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:53:04,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:53:04,652 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-18 22:53:04,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:53:04,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058215443] [2023-12-18 22:53:04,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058215443] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 22:53:04,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-18 22:53:04,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-18 22:53:04,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135879612] [2023-12-18 22:53:04,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 22:53:04,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-18 22:53:04,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:53:04,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-18 22:53:04,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-18 22:53:04,656 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-18 22:53:04,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:53:04,705 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2023-12-18 22:53:04,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-18 22:53:04,707 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-18 22:53:04,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:53:04,708 INFO L225 Difference]: With dead ends: 31 [2023-12-18 22:53:04,708 INFO L226 Difference]: Without dead ends: 26 [2023-12-18 22:53:04,708 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-18 22:53:04,709 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-18 22:53:04,710 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-18 22:53:04,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-12-18 22:53:04,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-12-18 22:53:04,715 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-18 22:53:04,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2023-12-18 22:53:04,716 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 9 [2023-12-18 22:53:04,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:53:04,716 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2023-12-18 22:53:04,716 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-18 22:53:04,716 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2023-12-18 22:53:04,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-18 22:53:04,717 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:53:04,717 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-18 22:53:04,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-18 22:53:04,717 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:53:04,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:53:04,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1084284499, now seen corresponding path program 1 times [2023-12-18 22:53:04,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:53:04,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536090370] [2023-12-18 22:53:04,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:53:04,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:53:04,753 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-18 22:53:04,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [525208623] [2023-12-18 22:53:04,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:53:04,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 22:53:04,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 22:53:04,756 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-18 22:53:04,762 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-18 22:53:04,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:53:04,808 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-18 22:53:04,812 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 22:53:04,900 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-18 22:53:04,900 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-18 22:53:04,942 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-18 22:53:04,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:53:04,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536090370] [2023-12-18 22:53:04,943 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-18 22:53:04,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525208623] [2023-12-18 22:53:04,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525208623] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-18 22:53:04,943 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-18 22:53:04,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2023-12-18 22:53:04,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266509691] [2023-12-18 22:53:04,944 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-18 22:53:04,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-18 22:53:04,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:53:04,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-18 22:53:04,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-18 22:53:04,945 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-18 22:53:05,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:53:05,010 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2023-12-18 22:53:05,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-18 22:53:05,011 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-18 22:53:05,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:53:05,013 INFO L225 Difference]: With dead ends: 32 [2023-12-18 22:53:05,013 INFO L226 Difference]: Without dead ends: 27 [2023-12-18 22:53:05,014 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-18 22:53:05,016 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-18 22:53:05,017 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-18 22:53:05,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-12-18 22:53:05,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-12-18 22:53:05,028 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-18 22:53:05,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2023-12-18 22:53:05,029 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 10 [2023-12-18 22:53:05,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:53:05,030 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2023-12-18 22:53:05,030 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-18 22:53:05,030 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2023-12-18 22:53:05,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-18 22:53:05,031 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:53:05,032 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-18 22:53:05,041 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-18 22:53:05,237 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-18 22:53:05,238 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:53:05,238 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:53:05,239 INFO L85 PathProgramCache]: Analyzing trace with hash -755233492, now seen corresponding path program 2 times [2023-12-18 22:53:05,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:53:05,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265697067] [2023-12-18 22:53:05,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:53:05,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:53:05,252 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-18 22:53:05,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1611370039] [2023-12-18 22:53:05,252 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-18 22:53:05,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 22:53:05,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 22:53:05,268 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-18 22:53:05,270 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-18 22:53:05,329 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-18 22:53:05,329 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-18 22:53:05,330 INFO L262 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-18 22:53:05,331 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 22:53:19,848 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse2 (<= |c_ULTIMATE.start_gcd_test_~a#1| 0))) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int) (|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (let ((.cse0 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse1 (mod .cse0 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (<= 128 (mod (+ .cse0 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256)) (<= .cse1 127) (<= (mod (+ .cse0 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256) 127) (<= |c_ULTIMATE.start_gcd_test_~a#1| .cse1) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|))))) (and .cse2 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int) (v_y_7 Int) (v_z_9 Int) (v_y_9 Int)) (let ((.cse5 (* 256 v_y_9)) (.cse6 (* 255 v_z_9))) (let ((.cse3 (+ .cse5 .cse6)) (.cse4 (+ .cse5 .cse6 (* 256 v_y_7)))) (and (<= v_z_9 255) (<= 128 .cse3) (<= .cse4 |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 v_z_9) (<= .cse3 255) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_18| .cse4) 0) (<= 0 .cse4)))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int) (|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (let ((.cse7 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse8 (mod .cse7 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (<= 128 (mod (+ .cse7 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256)) (<= .cse8 127) (<= (mod (+ .cse7 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256) 127) (<= |c_ULTIMATE.start_gcd_test_~a#1| .cse8) (<= |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) (|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (let ((.cse11 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse10 (mod .cse11 256))) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_15| 0)) (<= .cse9 .cse10) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (<= 128 .cse10) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (<= 128 (mod (+ .cse11 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256)) (<= 128 (mod (+ .cse11 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256)) (<= |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) (|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (let ((.cse12 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse13 (mod (+ .cse12 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (not (= .cse12 0)) (<= .cse9 .cse13) (<= 128 .cse13) (<= 128 (mod (+ .cse12 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256)) (<= (mod .cse12 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|))))) (and (exists ((v_y_4 Int) (|v_ULTIMATE.start_gcd_test_~a#1_18| Int) (v_y_6 Int) (v_z_6 Int)) (let ((.cse16 (* 256 v_y_6)) (.cse17 (* 255 v_z_6))) (let ((.cse15 (+ (* 256 v_y_4) .cse16 .cse17)) (.cse14 (+ .cse16 .cse17))) (and (<= .cse14 127) (<= v_z_6 127) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_18| .cse15) 0) (<= .cse15 |c_ULTIMATE.start_main1_~y~0#1|) (<= 0 v_z_6) (not (= .cse15 0)) (<= 0 .cse15) (<= 0 .cse14))))) .cse2) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int) (|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (let ((.cse18 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse19 (mod (+ .cse18 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256))) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_15| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (not (= .cse18 0)) (<= |c_ULTIMATE.start_gcd_test_~a#1| .cse19) (<= (mod .cse18 256) 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0) (<= .cse19 127) (<= (mod (+ .cse18 |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_~a#1_18| Int) (|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (let ((.cse21 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse20 (mod .cse21 256))) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_15| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (<= .cse20 127) (<= (mod (+ .cse21 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256) 127) (<= (mod (+ .cse21 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256) 127) (<= |c_ULTIMATE.start_gcd_test_~a#1| .cse20) (<= |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) (|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (let ((.cse22 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse23 (mod .cse22 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (<= 128 (mod (+ .cse22 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256)) (<= 128 (mod (+ .cse22 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256)) (<= .cse23 127) (<= |c_ULTIMATE.start_gcd_test_~a#1| .cse23) (<= |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) (|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (let ((.cse25 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse24 (mod .cse25 256))) (and (<= .cse9 .cse24) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (<= 128 .cse24) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (<= (mod (+ .cse25 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256) 127) (<= (mod (+ .cse25 |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_~a#1_18| Int) (|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (let ((.cse26 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse27 (mod (+ .cse26 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (not (= .cse26 0)) (<= .cse9 .cse27) (<= 128 .cse27) (<= (mod .cse26 256) 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0) (<= (mod (+ .cse26 |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 .cse2 (exists ((v_z_3 Int) (v_y_3 Int) (|v_ULTIMATE.start_gcd_test_~a#1_18| Int) (v_y_1 Int)) (let ((.cse30 (* 255 v_z_3)) (.cse31 (* 256 v_y_3))) (let ((.cse28 (+ (* 256 v_y_1) .cse30 .cse31)) (.cse29 (+ .cse30 .cse31))) (and (= (mod |v_ULTIMATE.start_gcd_test_~a#1_18| .cse28) 0) (<= 0 .cse29) (<= 0 .cse28) (<= .cse28 |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 v_z_3) (<= v_z_3 255) (<= .cse29 127)))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int) (|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (let ((.cse32 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse33 (mod (+ .cse32 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (not (= .cse32 0)) (<= |c_ULTIMATE.start_gcd_test_~a#1| .cse33) (<= 128 (mod (+ .cse32 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256)) (<= (mod .cse32 256) 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0) (<= .cse33 127) (<= |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) (|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (let ((.cse35 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse34 (mod .cse35 256))) (and (<= .cse9 .cse34) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (<= 128 .cse34) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (<= 128 (mod (+ .cse35 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256)) (<= (mod (+ .cse35 |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_~a#1_18| Int) (|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (let ((.cse36 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse37 (mod (+ .cse36 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (<= 128 (mod .cse36 256)) (<= |c_ULTIMATE.start_gcd_test_~a#1| .cse37) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0) (<= .cse37 127) (<= (mod (+ .cse36 |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_~a#1_18| Int) (|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (let ((.cse39 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse38 (mod (+ .cse39 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (<= .cse9 .cse38) (<= 128 (mod .cse39 256)) (<= 128 .cse38) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0) (<= (mod (+ .cse39 |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_~a#1_18| Int) (|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (let ((.cse41 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse40 (mod (+ .cse41 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256))) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_15| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (<= .cse9 .cse40) (<= 128 (mod .cse41 256)) (<= 128 .cse40) (<= 128 (mod (+ .cse41 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256)) (<= (+ |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_~a#1_18| Int) (|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (let ((.cse43 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse42 (mod .cse43 256))) (and (<= .cse9 .cse42) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (<= 128 .cse42) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (<= 128 (mod (+ .cse43 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256)) (<= (mod (+ .cse43 (* 255 |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_~a#1_18| Int) (|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (let ((.cse44 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse45 (mod (+ .cse44 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (<= 128 (mod .cse44 256)) (<= |c_ULTIMATE.start_gcd_test_~a#1| .cse45) (<= 128 (mod (+ .cse44 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0) (<= .cse45 127) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|))))) (and .cse2 (exists ((v_y_12 Int) (|v_ULTIMATE.start_gcd_test_~a#1_18| Int) (v_z_12 Int) (v_y_11 Int)) (let ((.cse48 (* v_y_12 256)) (.cse49 (* v_z_12 255))) (let ((.cse47 (+ .cse48 .cse49 (* v_y_11 256))) (.cse46 (+ .cse48 .cse49))) (and (<= 128 .cse46) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_18| .cse47) 0) (<= v_z_12 127) (<= .cse47 |c_ULTIMATE.start_main1_~y~0#1|) (<= 0 v_z_12) (<= 0 .cse47) (<= .cse46 255)))))))) is different from false [2023-12-18 22:53:25,597 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 1 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-18 22:53:25,598 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-18 22:53:59,517 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-18 22:53:59,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:53:59,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265697067] [2023-12-18 22:53:59,518 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-18 22:53:59,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611370039] [2023-12-18 22:53:59,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1611370039] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-18 22:53:59,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-18 22:53:59,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-12-18 22:53:59,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485604693] [2023-12-18 22:53:59,519 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-18 22:53:59,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-18 22:53:59,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:53:59,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-18 22:53:59,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=116, Unknown=6, NotChecked=22, Total=182 [2023-12-18 22:53:59,520 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-18 22:54:26,888 WARN L293 SmtUtils]: Spent 20.09s on a formula simplification. DAG size of input: 312 DAG size of output: 313 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-18 22:54:30,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0, 1] [2023-12-18 22:54:34,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0, 1] [2023-12-18 22:54:39,363 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, 1] [2023-12-18 22:54:43,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0, 1] [2023-12-18 22:55:08,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-12-18 22:55:12,307 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-18 22:55:32,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-12-18 22:55:37,237 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, 1] [2023-12-18 22:55:41,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-12-18 22:55:46,442 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0, 1] [2023-12-18 22:55:50,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-12-18 22:56:07,130 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, 1] [2023-12-18 22:56:11,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-12-18 22:56:28,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:56:28,077 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2023-12-18 22:56:28,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-18 22:56:28,078 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 11 [2023-12-18 22:56:28,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:56:28,078 INFO L225 Difference]: With dead ends: 37 [2023-12-18 22:56:28,078 INFO L226 Difference]: Without dead ends: 29 [2023-12-18 22:56:28,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 135.7s TimeCoverageRelationStatistics Valid=79, Invalid=250, Unknown=17, NotChecked=34, Total=380 [2023-12-18 22:56:28,079 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 4 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 6 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 52.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 18 IncrementalHoareTripleChecker+Unchecked, 52.7s IncrementalHoareTripleChecker+Time [2023-12-18 22:56:28,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 204 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 84 Invalid, 11 Unknown, 18 Unchecked, 52.7s Time] [2023-12-18 22:56:28,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-12-18 22:56:28,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-12-18 22:56:28,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 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-18 22:56:28,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2023-12-18 22:56:28,093 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 11 [2023-12-18 22:56:28,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:56:28,093 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2023-12-18 22:56:28,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has 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-18 22:56:28,093 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2023-12-18 22:56:28,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-18 22:56:28,094 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:56:28,094 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-18 22:56:28,102 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-18 22:56:28,295 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-18 22:56:28,295 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:56:28,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:56:28,296 INFO L85 PathProgramCache]: Analyzing trace with hash -195979764, now seen corresponding path program 3 times [2023-12-18 22:56:28,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:56:28,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337387749] [2023-12-18 22:56:28,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:56:28,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:56:28,304 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-18 22:56:28,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [777396827] [2023-12-18 22:56:28,304 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-18 22:56:28,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 22:56:28,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 22:56:28,305 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-18 22:56:28,311 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-18 22:56:28,412 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-18 22:56:28,412 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-18 22:56:28,414 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 46 conjunts are in the unsatisfiable core [2023-12-18 22:56:28,415 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 22:57:05,551 WARN L293 SmtUtils]: Spent 10.28s on a formula simplification. DAG size of input: 80 DAG size of output: 75 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-18 22:58:13,330 WARN L293 SmtUtils]: Spent 7.11s on a formula simplification that was a NOOP. DAG size: 73 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-18 22:58:39,805 WARN L293 SmtUtils]: Spent 8.58s on a formula simplification. DAG size of input: 74 DAG size of output: 73 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-18 22:58:44,971 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 22:58:44,971 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-18 22:59:18,332 WARN L293 SmtUtils]: Spent 7.14s 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-18 23:01:32,787 WARN L293 SmtUtils]: Spent 59.23s on a formula simplification. DAG size of input: 90 DAG size of output: 56 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-18 23:01:51,496 WARN L293 SmtUtils]: Spent 6.00s 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-18 23:02:12,989 WARN L293 SmtUtils]: Spent 5.17s 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-18 23:02:20,516 WARN L293 SmtUtils]: Spent 5.84s 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-18 23:03:01,122 WARN L293 SmtUtils]: Spent 5.02s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-18 23:03:19,514 WARN L293 SmtUtils]: Spent 5.41s 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-18 23:03:37,618 WARN L293 SmtUtils]: Spent 5.28s 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-18 23:03:54,048 WARN L293 SmtUtils]: Spent 5.20s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-18 23:04:02,442 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-18 23:04:12,521 WARN L293 SmtUtils]: Spent 5.38s 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-18 23:04:22,371 WARN L293 SmtUtils]: Spent 7.37s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-18 23:04:41,828 WARN L293 SmtUtils]: Spent 8.02s 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-18 23:05:19,573 WARN L293 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-18 23:05:33,901 WARN L293 SmtUtils]: Spent 5.21s 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-18 23:05:47,980 WARN L293 SmtUtils]: Spent 6.58s 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) Received shutdown request... [2023-12-18 23:07:41,615 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-18 23:07:41,615 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-18 23:07:42,624 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-18 23:07:42,816 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-18 23:07:42,915 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-18 23:07:42,917 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-12-18 23:07:42,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-18 23:07:42,917 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 14 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while executing Executor. [2023-12-18 23:07:42,918 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-18 23:07:42,921 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2023-12-18 23:07:42,923 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-18 23:07:42,925 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 11:07:42 BoogieIcfgContainer [2023-12-18 23:07:42,925 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-18 23:07:42,925 INFO L158 Benchmark]: Toolchain (without parser) took 879539.86ms. Allocated memory was 286.3MB in the beginning and 343.9MB in the end (delta: 57.7MB). Free memory was 238.2MB in the beginning and 260.6MB in the end (delta: -22.4MB). Peak memory consumption was 36.2MB. Max. memory is 8.0GB. [2023-12-18 23:07:42,925 INFO L158 Benchmark]: CDTParser took 0.45ms. Allocated memory is still 195.0MB. Free memory was 148.0MB in the beginning and 147.9MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-18 23:07:42,926 INFO L158 Benchmark]: CACSL2BoogieTranslator took 216.92ms. Allocated memory is still 286.3MB. Free memory was 238.2MB in the beginning and 226.1MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-18 23:07:42,926 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.82ms. Allocated memory is still 286.3MB. Free memory was 226.1MB in the beginning and 224.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-18 23:07:42,926 INFO L158 Benchmark]: Boogie Preprocessor took 34.49ms. Allocated memory is still 286.3MB. Free memory was 224.1MB in the beginning and 222.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-18 23:07:42,926 INFO L158 Benchmark]: RCFGBuilder took 354.95ms. Allocated memory is still 286.3MB. Free memory was 222.0MB in the beginning and 208.9MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-18 23:07:42,927 INFO L158 Benchmark]: TraceAbstraction took 878901.11ms. Allocated memory was 286.3MB in the beginning and 343.9MB in the end (delta: 57.7MB). Free memory was 208.3MB in the beginning and 260.6MB in the end (delta: -52.3MB). Peak memory consumption was 6.9MB. Max. memory is 8.0GB. [2023-12-18 23:07:42,928 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.45ms. Allocated memory is still 195.0MB. Free memory was 148.0MB in the beginning and 147.9MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 216.92ms. Allocated memory is still 286.3MB. Free memory was 238.2MB in the beginning and 226.1MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.82ms. Allocated memory is still 286.3MB. Free memory was 226.1MB in the beginning and 224.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.49ms. Allocated memory is still 286.3MB. Free memory was 224.1MB in the beginning and 222.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 354.95ms. Allocated memory is still 286.3MB. Free memory was 222.0MB in the beginning and 208.9MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 878901.11ms. Allocated memory was 286.3MB in the beginning and 343.9MB in the end (delta: 57.7MB). Free memory was 208.3MB in the beginning and 260.6MB in the end (delta: -52.3MB). Peak memory consumption was 6.9MB. 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 analyzing trace of length 14 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,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 analyzing trace of length 14 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 30 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 878.9s, OverallIterations: 5, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 148.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 11 mSolverCounterUnknown, 15 SdHoareTripleChecker+Valid, 52.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 15 mSDsluCounter, 424 SdHoareTripleChecker+Invalid, 52.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 18 IncrementalHoareTripleChecker+Unchecked, 338 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 186 IncrementalHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 86 mSDtfsCounter, 186 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 135.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=0, InterpolantAutomatonStates: 30, 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, 4 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 54.6s 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