/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_5.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-20 12:02:28,132 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-20 12:02:28,201 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-20 12:02:28,205 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-20 12:02:28,205 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-20 12:02:28,228 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-20 12:02:28,228 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-20 12:02:28,228 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-20 12:02:28,229 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-20 12:02:28,232 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-20 12:02:28,232 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-20 12:02:28,233 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-20 12:02:28,233 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-20 12:02:28,234 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-20 12:02:28,234 INFO L153 SettingsManager]: * Use SBE=true [2023-12-20 12:02:28,234 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-20 12:02:28,234 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-20 12:02:28,235 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-20 12:02:28,235 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-20 12:02:28,235 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-20 12:02:28,235 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-20 12:02:28,235 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-20 12:02:28,235 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-20 12:02:28,236 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-20 12:02:28,236 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-20 12:02:28,236 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-20 12:02:28,236 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-20 12:02:28,236 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-20 12:02:28,237 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-20 12:02:28,237 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-20 12:02:28,238 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-20 12:02:28,238 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-20 12:02:28,238 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 12:02:28,238 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-20 12:02:28,238 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-20 12:02:28,238 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-20 12:02:28,238 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-20 12:02:28,239 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-20 12:02:28,239 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-20 12:02:28,239 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-20 12:02:28,239 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-20 12:02:28,239 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-20 12:02:28,239 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-20 12:02:28,239 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-20 12:02:28,431 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-20 12:02:28,451 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-20 12:02:28,453 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-20 12:02:28,453 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-20 12:02:28,454 INFO L274 PluginConnector]: CDTParser initialized [2023-12-20 12:02:28,454 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/gcd_2+newton_2_5.i [2023-12-20 12:02:29,440 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-20 12:02:29,572 INFO L384 CDTParser]: Found 1 translation units. [2023-12-20 12:02:29,572 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/gcd_2+newton_2_5.i [2023-12-20 12:02:29,578 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/933359a87/e6cb770f2a4048b4b9c14ee7d9af29e2/FLAG3d18e179a [2023-12-20 12:02:29,587 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/933359a87/e6cb770f2a4048b4b9c14ee7d9af29e2 [2023-12-20 12:02:29,589 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-20 12:02:29,590 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-20 12:02:29,590 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-20 12:02:29,591 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-20 12:02:29,594 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-20 12:02:29,594 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 12:02:29" (1/1) ... [2023-12-20 12:02:29,595 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36372758 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:02:29, skipping insertion in model container [2023-12-20 12:02:29,595 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 12:02:29" (1/1) ... [2023-12-20 12:02:29,611 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-20 12:02:29,700 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_5.i[1226,1239] [2023-12-20 12:02:29,715 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_5.i[2841,2854] [2023-12-20 12:02:29,716 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 12:02:29,722 INFO L202 MainTranslator]: Completed pre-run [2023-12-20 12:02:29,731 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_5.i[1226,1239] [2023-12-20 12:02:29,744 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_5.i[2841,2854] [2023-12-20 12:02:29,744 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 12:02:29,753 INFO L206 MainTranslator]: Completed translation [2023-12-20 12:02:29,754 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:02:29 WrapperNode [2023-12-20 12:02:29,754 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-20 12:02:29,754 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-20 12:02:29,755 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-20 12:02:29,755 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-20 12:02:29,759 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:02:29" (1/1) ... [2023-12-20 12:02:29,764 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:02:29" (1/1) ... [2023-12-20 12:02:29,791 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 86 [2023-12-20 12:02:29,791 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-20 12:02:29,792 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-20 12:02:29,792 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-20 12:02:29,792 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-20 12:02:29,800 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:02:29" (1/1) ... [2023-12-20 12:02:29,800 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:02:29" (1/1) ... [2023-12-20 12:02:29,809 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:02:29" (1/1) ... [2023-12-20 12:02:29,828 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2023-12-20 12:02:29,836 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:02:29" (1/1) ... [2023-12-20 12:02:29,837 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:02:29" (1/1) ... [2023-12-20 12:02:29,846 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:02:29" (1/1) ... [2023-12-20 12:02:29,848 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:02:29" (1/1) ... [2023-12-20 12:02:29,848 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:02:29" (1/1) ... [2023-12-20 12:02:29,849 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:02:29" (1/1) ... [2023-12-20 12:02:29,850 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-20 12:02:29,851 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-20 12:02:29,851 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-20 12:02:29,851 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-20 12:02:29,851 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:02:29" (1/1) ... [2023-12-20 12:02:29,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 12:02:29,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 12:02:29,901 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-20 12:02:29,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-20 12:02:29,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-20 12:02:29,964 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2023-12-20 12:02:29,964 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2023-12-20 12:02:29,965 INFO L130 BoogieDeclarations]: Found specification of procedure f [2023-12-20 12:02:29,966 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2023-12-20 12:02:29,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-20 12:02:29,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-20 12:02:29,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-20 12:02:29,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-20 12:02:30,022 INFO L241 CfgBuilder]: Building ICFG [2023-12-20 12:02:30,027 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-20 12:02:30,168 INFO L282 CfgBuilder]: Performing block encoding [2023-12-20 12:02:30,190 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-20 12:02:30,191 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-20 12:02:30,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 12:02:30 BoogieIcfgContainer [2023-12-20 12:02:30,191 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-20 12:02:30,192 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-20 12:02:30,192 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-20 12:02:30,194 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-20 12:02:30,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.12 12:02:29" (1/3) ... [2023-12-20 12:02:30,195 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27addd13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 12:02:30, skipping insertion in model container [2023-12-20 12:02:30,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:02:29" (2/3) ... [2023-12-20 12:02:30,195 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27addd13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 12:02:30, skipping insertion in model container [2023-12-20 12:02:30,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 12:02:30" (3/3) ... [2023-12-20 12:02:30,196 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_2+newton_2_5.i [2023-12-20 12:02:30,207 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-20 12:02:30,207 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-20 12:02:30,233 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-20 12:02:30,237 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;@1c242f5c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-20 12:02:30,237 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-20 12:02:30,239 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-20 12:02:30,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-20 12:02:30,243 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:02:30,244 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 12:02:30,244 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:02:30,247 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:02:30,247 INFO L85 PathProgramCache]: Analyzing trace with hash -22013170, now seen corresponding path program 1 times [2023-12-20 12:02:30,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:02:30,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603028262] [2023-12-20 12:02:30,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:02:30,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:02:30,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:02:30,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 12:02:30,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:02:30,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603028262] [2023-12-20 12:02:30,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603028262] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 12:02:30,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 12:02:30,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 12:02:30,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659920532] [2023-12-20 12:02:30,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 12:02:30,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 12:02:30,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:02:30,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 12:02:30,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 12:02:30,447 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-20 12:02:30,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:02:30,556 INFO L93 Difference]: Finished difference Result 61 states and 82 transitions. [2023-12-20 12:02:30,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 12:02:30,557 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-20 12:02:30,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:02:30,561 INFO L225 Difference]: With dead ends: 61 [2023-12-20 12:02:30,562 INFO L226 Difference]: Without dead ends: 27 [2023-12-20 12:02:30,563 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-20 12:02:30,566 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-20 12:02:30,566 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-20 12:02:30,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-12-20 12:02:30,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2023-12-20 12:02:30,588 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-20 12:02:30,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2023-12-20 12:02:30,590 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 9 [2023-12-20 12:02:30,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:02:30,590 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2023-12-20 12:02:30,590 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-20 12:02:30,590 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2023-12-20 12:02:30,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-20 12:02:30,591 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:02:30,591 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 12:02:30,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-20 12:02:30,591 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:02:30,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:02:30,592 INFO L85 PathProgramCache]: Analyzing trace with hash 35245132, now seen corresponding path program 1 times [2023-12-20 12:02:30,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:02:30,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438808831] [2023-12-20 12:02:30,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:02:30,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:02:30,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:02:30,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 12:02:30,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:02:30,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438808831] [2023-12-20 12:02:30,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438808831] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 12:02:30,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 12:02:30,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 12:02:30,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490643891] [2023-12-20 12:02:30,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 12:02:30,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 12:02:30,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:02:30,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 12:02:30,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 12:02:30,646 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-20 12:02:30,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:02:30,675 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2023-12-20 12:02:30,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 12:02:30,676 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-20 12:02:30,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:02:30,677 INFO L225 Difference]: With dead ends: 31 [2023-12-20 12:02:30,677 INFO L226 Difference]: Without dead ends: 26 [2023-12-20 12:02:30,678 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-20 12:02:30,679 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-20 12:02:30,679 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-20 12:02:30,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-12-20 12:02:30,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-12-20 12:02:30,687 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-20 12:02:30,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2023-12-20 12:02:30,688 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 9 [2023-12-20 12:02:30,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:02:30,688 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2023-12-20 12:02:30,688 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-20 12:02:30,689 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2023-12-20 12:02:30,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-20 12:02:30,689 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:02:30,689 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 12:02:30,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-20 12:02:30,689 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:02:30,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:02:30,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1084284499, now seen corresponding path program 1 times [2023-12-20 12:02:30,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:02:30,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483788495] [2023-12-20 12:02:30,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:02:30,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:02:30,702 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-20 12:02:30,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [631757370] [2023-12-20 12:02:30,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:02:30,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 12:02:30,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 12:02:30,705 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 12:02:30,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-20 12:02:30,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:02:30,768 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-20 12:02:30,771 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 12:02:30,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 12:02:30,837 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 12:02:30,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 12:02:30,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:02:30,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483788495] [2023-12-20 12:02:30,881 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-20 12:02:30,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631757370] [2023-12-20 12:02:30,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631757370] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 12:02:30,882 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-20 12:02:30,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2023-12-20 12:02:30,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260769262] [2023-12-20 12:02:30,883 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-20 12:02:30,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-20 12:02:30,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:02:30,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-20 12:02:30,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-20 12:02:30,887 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-20 12:02:30,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:02:30,938 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2023-12-20 12:02:30,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-20 12:02:30,939 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-20 12:02:30,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:02:30,940 INFO L225 Difference]: With dead ends: 32 [2023-12-20 12:02:30,940 INFO L226 Difference]: Without dead ends: 27 [2023-12-20 12:02:30,940 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-20 12:02:30,941 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-20 12:02:30,942 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-20 12:02:30,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-12-20 12:02:30,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-12-20 12:02:30,944 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-20 12:02:30,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2023-12-20 12:02:30,944 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 10 [2023-12-20 12:02:30,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:02:30,944 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2023-12-20 12:02:30,945 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-20 12:02:30,945 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2023-12-20 12:02:30,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-20 12:02:30,945 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:02:30,945 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 12:02:30,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-20 12:02:31,145 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-20 12:02:31,146 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:02:31,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:02:31,147 INFO L85 PathProgramCache]: Analyzing trace with hash -755233492, now seen corresponding path program 2 times [2023-12-20 12:02:31,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:02:31,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978695269] [2023-12-20 12:02:31,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:02:31,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:02:31,154 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-20 12:02:31,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1258601544] [2023-12-20 12:02:31,154 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-20 12:02:31,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 12:02:31,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 12:02:31,159 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 12:02:31,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-20 12:02:31,214 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-20 12:02:31,215 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-20 12:02:31,234 INFO L262 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-20 12:02:31,236 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 12:02:53,851 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-20 12:02:53,851 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 12:03:25,940 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-20 12:03:25,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:03:25,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978695269] [2023-12-20 12:03:25,940 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-20 12:03:25,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258601544] [2023-12-20 12:03:25,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258601544] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 12:03:25,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-20 12:03:25,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-12-20 12:03:25,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954038984] [2023-12-20 12:03:25,941 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-20 12:03:25,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-20 12:03:25,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:03:25,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-20 12:03:25,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=138, Unknown=5, NotChecked=0, Total=182 [2023-12-20 12:03:25,942 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-20 12:04:05,842 WARN L293 SmtUtils]: Spent 26.57s 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-20 12:04:08,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.35s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0, 1] [2023-12-20 12:04:09,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0, 1] [2023-12-20 12:04:13,925 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-20 12:04:17,938 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-20 12:04:21,967 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, 1] [2023-12-20 12:04:41,343 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] [2023-12-20 12:04:45,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-12-20 12:05:09,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-12-20 12:05:13,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-12-20 12:05:18,584 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] [2023-12-20 12:05:23,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-12-20 12:05:28,609 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] [2023-12-20 12:05:33,003 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-20 12:05:43,748 WARN L293 SmtUtils]: Spent 5.88s on a formula simplification. DAG size of input: 139 DAG size of output: 432 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-20 12:05:47,775 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] [2023-12-20 12:05:51,891 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] [2023-12-20 12:05:55,905 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-20 12:05:59,932 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-20 12:06:04,025 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-20 12:06:22,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.33s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2023-12-20 12:06:23,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:06:23,478 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2023-12-20 12:06:23,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-20 12:06:23,482 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-20 12:06:23,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:06:23,482 INFO L225 Difference]: With dead ends: 37 [2023-12-20 12:06:23,482 INFO L226 Difference]: Without dead ends: 29 [2023-12-20 12:06:23,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 140.7s TimeCoverageRelationStatistics Valid=82, Invalid=283, Unknown=15, NotChecked=0, Total=380 [2023-12-20 12:06:23,483 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 4 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 6 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 77.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 78.3s IncrementalHoareTripleChecker+Time [2023-12-20 12:06:23,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 204 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 94 Invalid, 16 Unknown, 0 Unchecked, 78.3s Time] [2023-12-20 12:06:23,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-12-20 12:06:23,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-12-20 12:06:23,489 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-20 12:06:23,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2023-12-20 12:06:23,489 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 11 [2023-12-20 12:06:23,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:06:23,489 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2023-12-20 12:06:23,489 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-20 12:06:23,489 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2023-12-20 12:06:23,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-20 12:06:23,490 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:06:23,490 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 12:06:23,517 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-20 12:06:23,708 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-20 12:06:23,709 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:06:23,709 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:06:23,709 INFO L85 PathProgramCache]: Analyzing trace with hash -195979764, now seen corresponding path program 3 times [2023-12-20 12:06:23,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:06:23,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403937108] [2023-12-20 12:06:23,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:06:23,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:06:23,717 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-20 12:06:23,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [50832928] [2023-12-20 12:06:23,717 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-20 12:06:23,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 12:06:23,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 12:06:23,721 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 12:06:23,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-20 12:06:23,794 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-20 12:06:23,795 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-20 12:06:23,796 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 46 conjunts are in the unsatisfiable core [2023-12-20 12:06:23,797 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 12:06:30,792 WARN L876 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main1_~y~0#1| 0)) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|) 256)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse0 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (= (+ |c_ULTIMATE.start_gcd_test_~a#1| 256) (mod (+ (* |c_ULTIMATE.start_main1_~y~0#1| 255) .cse0) 256)) (not (= .cse0 0)))))) (<= 0 |c_ULTIMATE.start_main1_~y~0#1|) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (let ((.cse14 (* |c_ULTIMATE.start_gcd_test_~a#1| 255))) (let ((.cse35 (mod |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse36 (mod .cse14 256))) (let ((.cse23 (<= 128 .cse36)) (.cse13 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse21 (<= 128 .cse35)) (.cse32 (<= .cse36 127)) (.cse22 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse24 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (and (= (mod |v_ULTIMATE.start_gcd_test_~a#1_24| |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|)))) (.cse27 (<= .cse35 127))) (let ((.cse7 (or (and .cse32 .cse22 .cse24 .cse27) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (let ((.cse34 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse33 (mod .cse34 256))) (and (<= .cse33 127) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse33) (<= (mod (+ .cse34 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127) (<= (mod (+ .cse34 .cse14) 256) 127))))))) (.cse6 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (let ((.cse30 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse31 (mod .cse30 256))) (and (<= 128 (mod (+ .cse30 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (<= .cse31 127) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse31) (<= (mod (+ .cse30 .cse14) 256) 127))))) (and .cse21 .cse32 .cse22 .cse24))) (.cse8 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (let ((.cse29 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse28 (mod .cse29 256))) (and (<= 128 .cse28) (= .cse28 .cse13) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= (mod (+ .cse29 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127) (<= (mod (+ .cse29 .cse14) 256) 127)))))) (.cse3 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (let ((.cse26 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse25 (mod .cse26 256))) (and (<= .cse25 127) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse25) (<= (mod (+ .cse26 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127) (<= 128 (mod (+ .cse26 .cse14) 256)))))) (and .cse22 .cse23 .cse24 .cse27))) (.cse2 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (let ((.cse19 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse20 (mod .cse19 256))) (and (<= 128 (mod (+ .cse19 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (<= .cse20 127) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse20) (<= 128 (mod (+ .cse19 .cse14) 256)))))) (and .cse21 .cse22 .cse23 .cse24))) (.cse1 (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse4 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (let ((.cse17 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse18 (mod .cse17 256))) (and (<= 128 (mod (+ .cse17 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (<= 128 .cse18) (= .cse18 .cse13) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= (mod (+ .cse17 .cse14) 256) 127)))))) (.cse9 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (let ((.cse16 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse15 (mod .cse16 256))) (and (<= 128 .cse15) (= .cse15 .cse13) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= (mod (+ .cse16 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127) (<= 128 (mod (+ .cse16 .cse14) 256))))))) (.cse5 (<= (+ |c_ULTIMATE.start_gcd_test_~a#1| 1) 0)) (.cse10 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (let ((.cse11 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse12 (mod .cse11 256))) (and (<= 128 (mod (+ .cse11 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (<= 128 .cse12) (= .cse12 .cse13) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= 128 (mod (+ .cse11 .cse14) 256)))))))) (or (and .cse1 .cse2) (and .cse1 .cse3) (and .cse4 .cse1) (and .cse5 .cse6) (and .cse5 .cse7) (and .cse1 .cse7) (and .cse8 .cse1) (and .cse1 .cse6) (and .cse8 .cse5) (and .cse5 .cse3) (and .cse1 .cse9) (and .cse5 .cse2) (and .cse1 .cse10) (and .cse4 .cse5) (and .cse5 .cse9) (and .cse5 .cse10)))))) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0))) is different from true [2023-12-20 12:06:41,949 WARN L854 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main1_~y~0#1| 0)) (let ((.cse11 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse1 (* |c_ULTIMATE.start_gcd_test_~a#1| 255)) (.cse2 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse6 (* |c_ULTIMATE.start_main1_~y~0#1| 255)) (.cse7 (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|))) (or (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse3 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse5 (+ (- 256) (mod (+ .cse6 .cse3) 256)))) (let ((.cse0 (mod .cse5 |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse4 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse5))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (not (= .cse0 0)) (= (mod (+ .cse0 .cse1) 256) .cse2) (not (= .cse3 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= (mod (+ (* 255 .cse3) |c_ULTIMATE.start_main1_~y~0#1| .cse4) 256) 127) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse4 256))))))) .cse7) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse9 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse10 (mod .cse9 256))) (let ((.cse8 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse10))) (and (<= (mod (+ .cse8 .cse9) 256) 127) (= (mod (mod .cse10 |c_ULTIMATE.start_gcd_test_~a#1|) 256) |c_ULTIMATE.start_gcd_test_~b#1|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse8 256)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= 128 (mod (+ (* 255 .cse9) .cse8) 256))))))) .cse7) (and .cse11 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse12 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse14 (+ (- 256) (mod (+ .cse6 .cse12) 256)))) (let ((.cse13 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse14))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (not (= .cse12 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= (mod (+ (* 255 .cse12) |c_ULTIMATE.start_main1_~y~0#1| .cse13) 256) 127) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse13 256)) (= (mod .cse14 |c_ULTIMATE.start_gcd_test_~a#1|) 0))))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse15 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse17 (+ (- 256) (mod (+ .cse6 .cse15) 256)))) (let ((.cse16 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse17))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (<= 128 (mod (+ (* 255 .cse15) |c_ULTIMATE.start_main1_~y~0#1| .cse16) 256)) (not (= .cse15 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse16 256)) (= (mod .cse17 |c_ULTIMATE.start_gcd_test_~a#1|) 0)))))) .cse11) (and .cse7 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse19 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse21 (+ (- 256) (mod (+ .cse6 .cse19) 256)))) (let ((.cse18 (mod .cse21 |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse20 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse21))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (not (= .cse18 0)) (= (mod (+ .cse18 .cse1) 256) .cse2) (<= 128 (mod (+ (* 255 .cse19) |c_ULTIMATE.start_main1_~y~0#1| .cse20) 256)) (not (= .cse19 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse20 256)))))))) (and .cse7 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse23 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse24 (mod .cse23 256))) (let ((.cse22 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse24))) (let ((.cse25 (mod .cse22 256))) (and (<= 128 (mod (+ .cse22 .cse23) 256)) (= (mod (mod .cse24 |c_ULTIMATE.start_gcd_test_~a#1|) 256) |c_ULTIMATE.start_gcd_test_~b#1|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (= |c_ULTIMATE.start_gcd_test_~a#1| .cse25) (<= .cse25 127) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|)))))))))) (<= 0 |c_ULTIMATE.start_main1_~y~0#1|) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0))) is different from false [2023-12-20 12:07:06,898 WARN L293 SmtUtils]: Spent 14.39s on a formula simplification. DAG size of input: 81 DAG size of output: 74 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-20 12:07:29,173 WARN L293 SmtUtils]: Spent 8.06s 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-20 12:07:57,000 WARN L293 SmtUtils]: Spent 6.35s 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-20 12:08:01,827 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2023-12-20 12:08:01,827 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 12:08:58,347 WARN L293 SmtUtils]: Spent 5.04s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 12:10:45,374 WARN L293 SmtUtils]: Spent 1.25m 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-20 12:12:19,786 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 12:12:27,388 WARN L293 SmtUtils]: Spent 7.16s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 12:12:35,409 WARN L293 SmtUtils]: Spent 8.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-20 12:12:51,747 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 12:13:00,883 WARN L293 SmtUtils]: Spent 5.87s 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-20 12:13:06,020 WARN L293 SmtUtils]: Spent 5.03s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 12:13:18,697 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 12:13:24,822 WARN L293 SmtUtils]: Spent 6.12s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 12:13:30,484 WARN L293 SmtUtils]: Spent 5.65s 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-20 12:13:40,287 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 12:13:58,027 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 12:14:06,490 WARN L293 SmtUtils]: Spent 5.49s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 12:14:11,647 WARN L293 SmtUtils]: Spent 5.15s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 12:14:26,529 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 12:14:49,178 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-20 12:14:57,236 WARN L293 SmtUtils]: Spent 5.02s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 12:15:08,655 WARN L293 SmtUtils]: Spent 6.15s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 12:15:14,429 WARN L293 SmtUtils]: Spent 5.77s 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) Received shutdown request... [2023-12-20 12:17:14,260 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-20 12:17:14,270 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-20 12:17:15,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-20 12:17:15,461 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-12-20 12:17:15,525 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-12-20 12:17:15,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-20 12:17:15,525 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-20 12:17:15,526 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-20 12:17:15,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 [2023-12-20 12:17:15,550 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2023-12-20 12:17:15,551 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-20 12:17:15,553 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.12 12:17:15 BoogieIcfgContainer [2023-12-20 12:17:15,553 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-20 12:17:15,553 INFO L158 Benchmark]: Toolchain (without parser) took 885963.36ms. Allocated memory was 189.8MB in the beginning and 264.2MB in the end (delta: 74.4MB). Free memory was 144.1MB in the beginning and 149.4MB in the end (delta: -5.4MB). Peak memory consumption was 69.5MB. Max. memory is 8.0GB. [2023-12-20 12:17:15,553 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 189.8MB. Free memory was 147.5MB in the beginning and 147.3MB in the end (delta: 223.8kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-20 12:17:15,553 INFO L158 Benchmark]: CACSL2BoogieTranslator took 163.50ms. Allocated memory is still 189.8MB. Free memory was 144.1MB in the beginning and 132.0MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-20 12:17:15,554 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.98ms. Allocated memory is still 189.8MB. Free memory was 132.0MB in the beginning and 130.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-20 12:17:15,554 INFO L158 Benchmark]: Boogie Preprocessor took 58.39ms. Allocated memory is still 189.8MB. Free memory was 130.1MB in the beginning and 128.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-20 12:17:15,555 INFO L158 Benchmark]: RCFGBuilder took 340.30ms. Allocated memory is still 189.8MB. Free memory was 128.0MB in the beginning and 114.7MB in the end (delta: 13.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-20 12:17:15,555 INFO L158 Benchmark]: TraceAbstraction took 885360.38ms. Allocated memory was 189.8MB in the beginning and 264.2MB in the end (delta: 74.4MB). Free memory was 114.1MB in the beginning and 149.4MB in the end (delta: -35.4MB). Peak memory consumption was 40.1MB. Max. memory is 8.0GB. [2023-12-20 12:17:15,556 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 189.8MB. Free memory was 147.5MB in the beginning and 147.3MB in the end (delta: 223.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 163.50ms. Allocated memory is still 189.8MB. Free memory was 144.1MB in the beginning and 132.0MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.98ms. Allocated memory is still 189.8MB. Free memory was 132.0MB in the beginning and 130.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 58.39ms. Allocated memory is still 189.8MB. Free memory was 130.1MB in the beginning and 128.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 340.30ms. Allocated memory is still 189.8MB. Free memory was 128.0MB in the beginning and 114.7MB in the end (delta: 13.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 885360.38ms. Allocated memory was 189.8MB in the beginning and 264.2MB in the end (delta: 74.4MB). Free memory was 114.1MB in the beginning and 149.4MB in the end (delta: -35.4MB). Peak memory consumption was 40.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 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: 885.3s, OverallIterations: 5, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 177.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 16 mSolverCounterUnknown, 15 SdHoareTripleChecker+Valid, 78.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 15 mSDsluCounter, 424 SdHoareTripleChecker+Invalid, 78.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 338 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 196 IncrementalHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 86 mSDtfsCounter, 196 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 140.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, 55.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