/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench/geo3-ll.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-b030c9e [2022-03-20 13:42:58,563 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-20 13:42:58,565 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-20 13:42:58,595 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-20 13:42:58,595 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-20 13:42:58,596 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-20 13:42:58,596 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-20 13:42:58,598 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-20 13:42:58,599 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-20 13:42:58,599 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-20 13:42:58,600 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-20 13:42:58,601 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-20 13:42:58,601 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-20 13:42:58,602 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-20 13:42:58,602 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-20 13:42:58,603 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-20 13:42:58,604 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-20 13:42:58,604 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-20 13:42:58,606 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-20 13:42:58,607 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-20 13:42:58,608 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-20 13:42:58,608 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-20 13:42:58,609 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-20 13:42:58,609 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-20 13:42:58,610 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-20 13:42:58,612 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-20 13:42:58,612 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-20 13:42:58,612 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-20 13:42:58,613 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-20 13:42:58,613 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-20 13:42:58,613 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-20 13:42:58,613 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-20 13:42:58,614 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-20 13:42:58,614 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-20 13:42:58,615 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-20 13:42:58,615 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-20 13:42:58,615 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-20 13:42:58,616 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-20 13:42:58,616 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-20 13:42:58,616 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-20 13:42:58,617 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-20 13:42:58,620 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-20 13:42:58,621 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-03-20 13:42:58,626 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-20 13:42:58,626 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-20 13:42:58,627 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-20 13:42:58,627 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-20 13:42:58,627 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-20 13:42:58,627 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-20 13:42:58,627 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-20 13:42:58,627 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-20 13:42:58,627 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-20 13:42:58,628 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-20 13:42:58,628 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-20 13:42:58,628 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-20 13:42:58,628 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-20 13:42:58,628 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-20 13:42:58,628 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-20 13:42:58,628 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-20 13:42:58,628 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-20 13:42:58,628 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-20 13:42:58,629 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 13:42:58,629 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-20 13:42:58,629 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-20 13:42:58,629 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-03-20 13:42:58,629 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-03-20 13:42:58,629 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-20 13:42:58,629 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-03-20 13:42:58,629 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-03-20 13:42:58,806 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-20 13:42:58,822 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-20 13:42:58,823 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-20 13:42:58,824 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-20 13:42:58,825 INFO L275 PluginConnector]: CDTParser initialized [2022-03-20 13:42:58,826 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/geo3-ll.c [2022-03-20 13:42:58,871 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f46a796d7/cc17e99e528c4f43a9712f1b1e183b48/FLAGe4efd5902 [2022-03-20 13:42:59,231 INFO L306 CDTParser]: Found 1 translation units. [2022-03-20 13:42:59,231 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/geo3-ll.c [2022-03-20 13:42:59,235 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f46a796d7/cc17e99e528c4f43a9712f1b1e183b48/FLAGe4efd5902 [2022-03-20 13:42:59,243 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f46a796d7/cc17e99e528c4f43a9712f1b1e183b48 [2022-03-20 13:42:59,244 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-20 13:42:59,245 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-20 13:42:59,246 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-20 13:42:59,246 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-20 13:42:59,248 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-20 13:42:59,248 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 01:42:59" (1/1) ... [2022-03-20 13:42:59,249 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@533dd917 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 01:42:59, skipping insertion in model container [2022-03-20 13:42:59,249 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 01:42:59" (1/1) ... [2022-03-20 13:42:59,254 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-20 13:42:59,262 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-20 13:42:59,369 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/geo3-ll.c[525,538] [2022-03-20 13:42:59,377 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 13:42:59,381 INFO L203 MainTranslator]: Completed pre-run [2022-03-20 13:42:59,388 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/geo3-ll.c[525,538] [2022-03-20 13:42:59,392 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 13:42:59,401 INFO L208 MainTranslator]: Completed translation [2022-03-20 13:42:59,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 01:42:59 WrapperNode [2022-03-20 13:42:59,402 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-20 13:42:59,403 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-20 13:42:59,403 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-20 13:42:59,403 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-20 13:42:59,411 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 01:42:59" (1/1) ... [2022-03-20 13:42:59,411 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 01:42:59" (1/1) ... [2022-03-20 13:42:59,415 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 01:42:59" (1/1) ... [2022-03-20 13:42:59,415 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 01:42:59" (1/1) ... [2022-03-20 13:42:59,417 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 01:42:59" (1/1) ... [2022-03-20 13:42:59,419 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 01:42:59" (1/1) ... [2022-03-20 13:42:59,420 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 01:42:59" (1/1) ... [2022-03-20 13:42:59,421 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-20 13:42:59,422 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-20 13:42:59,422 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-20 13:42:59,422 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-20 13:42:59,426 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 01:42:59" (1/1) ... [2022-03-20 13:42:59,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 13:42:59,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 13:42:59,459 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-20 13:42:59,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-20 13:42:59,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-20 13:42:59,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-20 13:42:59,483 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-20 13:42:59,483 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-03-20 13:42:59,483 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-03-20 13:42:59,483 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-20 13:42:59,483 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-20 13:42:59,483 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-20 13:42:59,483 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-20 13:42:59,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-20 13:42:59,483 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-03-20 13:42:59,483 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-03-20 13:42:59,484 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-03-20 13:42:59,484 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-20 13:42:59,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-20 13:42:59,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-20 13:42:59,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-20 13:42:59,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-20 13:42:59,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-20 13:42:59,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-20 13:42:59,545 INFO L234 CfgBuilder]: Building ICFG [2022-03-20 13:42:59,547 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-20 13:42:59,680 INFO L275 CfgBuilder]: Performing block encoding [2022-03-20 13:42:59,684 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-20 13:42:59,684 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-03-20 13:42:59,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 01:42:59 BoogieIcfgContainer [2022-03-20 13:42:59,685 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-20 13:42:59,686 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-20 13:42:59,686 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-20 13:42:59,690 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-20 13:42:59,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.03 01:42:59" (1/3) ... [2022-03-20 13:42:59,690 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@337c0532 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 01:42:59, skipping insertion in model container [2022-03-20 13:42:59,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 01:42:59" (2/3) ... [2022-03-20 13:42:59,691 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@337c0532 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 01:42:59, skipping insertion in model container [2022-03-20 13:42:59,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 01:42:59" (3/3) ... [2022-03-20 13:42:59,692 INFO L111 eAbstractionObserver]: Analyzing ICFG geo3-ll.c [2022-03-20 13:42:59,695 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-20 13:42:59,695 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-20 13:42:59,760 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-20 13:42:59,765 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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 [2022-03-20 13:42:59,765 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-20 13:42:59,790 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-03-20 13:42:59,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-20 13:42:59,795 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 13:42:59,795 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 13:42:59,796 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 13:42:59,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 13:42:59,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1469283919, now seen corresponding path program 1 times [2022-03-20 13:42:59,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 13:42:59,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1874494398] [2022-03-20 13:42:59,826 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 13:42:59,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1469283919, now seen corresponding path program 2 times [2022-03-20 13:42:59,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 13:42:59,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184936447] [2022-03-20 13:42:59,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 13:42:59,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 13:42:59,906 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 13:42:59,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1301588334] [2022-03-20 13:42:59,907 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-20 13:42:59,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 13:42:59,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 13:42:59,908 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) [2022-03-20 13:42:59,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-20 13:42:59,949 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-20 13:42:59,949 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 13:42:59,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 1 conjunts are in the unsatisfiable core [2022-03-20 13:42:59,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 13:42:59,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 13:42:59,990 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-20 13:42:59,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 13:42:59,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184936447] [2022-03-20 13:42:59,990 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 13:42:59,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301588334] [2022-03-20 13:42:59,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301588334] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 13:42:59,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 13:42:59,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-20 13:42:59,993 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 13:42:59,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1874494398] [2022-03-20 13:42:59,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1874494398] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 13:42:59,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 13:42:59,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-20 13:42:59,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797731529] [2022-03-20 13:42:59,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 13:42:59,997 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-03-20 13:42:59,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 13:43:00,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-03-20 13:43:00,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-20 13:43:00,016 INFO L87 Difference]: Start difference. First operand has 21 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 13:43:00,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 13:43:00,027 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2022-03-20 13:43:00,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-20 13:43:00,029 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-03-20 13:43:00,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 13:43:00,035 INFO L225 Difference]: With dead ends: 36 [2022-03-20 13:43:00,035 INFO L226 Difference]: Without dead ends: 16 [2022-03-20 13:43:00,037 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-20 13:43:00,042 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 13:43:00,043 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 13:43:00,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-03-20 13:43:00,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-03-20 13:43:00,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-03-20 13:43:00,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-03-20 13:43:00,065 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2022-03-20 13:43:00,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 13:43:00,065 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-03-20 13:43:00,065 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 13:43:00,065 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-03-20 13:43:00,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-20 13:43:00,066 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 13:43:00,066 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 13:43:00,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-20 13:43:00,283 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-03-20 13:43:00,284 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 13:43:00,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 13:43:00,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1467496459, now seen corresponding path program 1 times [2022-03-20 13:43:00,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 13:43:00,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1090855078] [2022-03-20 13:43:00,286 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 13:43:00,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1467496459, now seen corresponding path program 2 times [2022-03-20 13:43:00,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 13:43:00,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700612777] [2022-03-20 13:43:00,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 13:43:00,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 13:43:00,294 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 13:43:00,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [368934419] [2022-03-20 13:43:00,294 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-20 13:43:00,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 13:43:00,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 13:43:00,300 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) [2022-03-20 13:43:00,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-20 13:43:00,341 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-20 13:43:00,341 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 13:43:00,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-20 13:43:00,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 13:43:00,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 13:43:00,440 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-20 13:43:00,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 13:43:00,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700612777] [2022-03-20 13:43:00,441 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 13:43:00,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368934419] [2022-03-20 13:43:00,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368934419] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 13:43:00,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 13:43:00,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-20 13:43:00,443 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 13:43:00,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1090855078] [2022-03-20 13:43:00,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1090855078] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 13:43:00,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 13:43:00,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-20 13:43:00,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723438225] [2022-03-20 13:43:00,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 13:43:00,446 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-20 13:43:00,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 13:43:00,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-20 13:43:00,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-20 13:43:00,447 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 13:43:00,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 13:43:00,485 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-03-20 13:43:00,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-20 13:43:00,485 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-03-20 13:43:00,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 13:43:00,486 INFO L225 Difference]: With dead ends: 26 [2022-03-20 13:43:00,486 INFO L226 Difference]: Without dead ends: 23 [2022-03-20 13:43:00,487 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-03-20 13:43:00,487 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 13:43:00,488 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 53 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 13:43:00,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-03-20 13:43:00,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-03-20 13:43:00,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-20 13:43:00,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2022-03-20 13:43:00,492 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 11 [2022-03-20 13:43:00,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 13:43:00,493 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2022-03-20 13:43:00,493 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 13:43:00,493 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-03-20 13:43:00,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-20 13:43:00,493 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 13:43:00,493 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 13:43:00,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-20 13:43:00,700 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-03-20 13:43:00,700 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 13:43:00,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 13:43:00,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1366100723, now seen corresponding path program 1 times [2022-03-20 13:43:00,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 13:43:00,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [335396170] [2022-03-20 13:43:00,714 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-03-20 13:43:00,714 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-03-20 13:43:00,714 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-03-20 13:43:00,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1366100723, now seen corresponding path program 2 times [2022-03-20 13:43:00,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 13:43:00,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332668333] [2022-03-20 13:43:00,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 13:43:00,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 13:43:00,722 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 13:43:00,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [785807512] [2022-03-20 13:43:00,722 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-20 13:43:00,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 13:43:00,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 13:43:00,724 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) [2022-03-20 13:43:00,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-20 13:43:00,758 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-20 13:43:00,759 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 13:43:00,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 22 conjunts are in the unsatisfiable core [2022-03-20 13:43:00,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 13:43:00,935 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 13:43:00,935 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 13:43:01,206 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 13:43:01,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 13:43:01,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332668333] [2022-03-20 13:43:01,206 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 13:43:01,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785807512] [2022-03-20 13:43:01,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785807512] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 13:43:01,207 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 13:43:01,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2022-03-20 13:43:01,207 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 13:43:01,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [335396170] [2022-03-20 13:43:01,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [335396170] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 13:43:01,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 13:43:01,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-20 13:43:01,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891805262] [2022-03-20 13:43:01,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 13:43:01,208 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-20 13:43:01,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 13:43:01,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-20 13:43:01,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-03-20 13:43:01,211 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-03-20 13:43:01,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 13:43:01,385 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-03-20 13:43:01,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-20 13:43:01,386 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-03-20 13:43:01,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 13:43:01,386 INFO L225 Difference]: With dead ends: 33 [2022-03-20 13:43:01,386 INFO L226 Difference]: Without dead ends: 30 [2022-03-20 13:43:01,387 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-03-20 13:43:01,388 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 13 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 13:43:01,388 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 72 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-20 13:43:01,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-03-20 13:43:01,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-03-20 13:43:01,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-03-20 13:43:01,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2022-03-20 13:43:01,393 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 18 [2022-03-20 13:43:01,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 13:43:01,393 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2022-03-20 13:43:01,393 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-03-20 13:43:01,393 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-03-20 13:43:01,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-20 13:43:01,394 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 13:43:01,394 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 13:43:01,414 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-20 13:43:01,595 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 13:43:01,595 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 13:43:01,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 13:43:01,596 INFO L85 PathProgramCache]: Analyzing trace with hash 673668341, now seen corresponding path program 3 times [2022-03-20 13:43:01,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 13:43:01,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1917655159] [2022-03-20 13:43:01,598 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-03-20 13:43:01,598 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-03-20 13:43:01,598 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-03-20 13:43:01,598 INFO L85 PathProgramCache]: Analyzing trace with hash 673668341, now seen corresponding path program 4 times [2022-03-20 13:43:01,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 13:43:01,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768275217] [2022-03-20 13:43:01,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 13:43:01,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 13:43:01,604 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 13:43:01,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [181396566] [2022-03-20 13:43:01,604 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-20 13:43:01,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 13:43:01,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 13:43:01,607 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 13:43:01,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-20 13:43:03,755 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-20 13:43:03,755 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 13:43:03,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 21 conjunts are in the unsatisfiable core [2022-03-20 13:43:03,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 13:43:03,795 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-03-20 13:43:03,799 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-03-20 13:43:03,804 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-03-20 13:43:13,882 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (= c_main_~z~0 0)) (.cse0 (+ (* (- 1) c_main_~a~0) c_main_~x~0))) (or (and (= (mod .cse0 c_main_~z~0) 0) (let ((.cse1 (= c_main_~az~0 0)) (.cse2 (let ((.cse3 (div .cse0 c_main_~z~0))) (+ (* .cse3 c_main_~z~0) (* (- 1) .cse3) c_main_~a~0)))) (or (and (= (mod c_main_~y~0 c_main_~z~0) 0) .cse1 (= .cse2 0)) (and (= (* (div .cse2 c_main_~az~0) c_main_~z~0) c_main_~y~0) (not .cse1) (= (mod .cse2 c_main_~az~0) 0)))) (not .cse4)) (and (exists ((v_main_~x~0_20 Int) (v_main_~y~0_19 Int)) (= (+ v_main_~x~0_20 (* v_main_~y~0_19 c_main_~az~0)) (+ (* v_main_~x~0_20 c_main_~z~0) c_main_~a~0))) (= c_main_~y~0 0) .cse4 (= 0 .cse0)))) is different from false [2022-03-20 13:44:22,477 WARN L232 SmtUtils]: Spent 40.99s on a formula simplification. DAG size of input: 47 DAG size of output: 39 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-20 13:44:22,485 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-03-20 13:44:22,489 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-03-20 13:44:22,495 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-03-20 13:44:22,498 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-03-20 13:44:56,879 WARN L232 SmtUtils]: Spent 16.67s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-20 13:45:10,136 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-03-20 13:45:10,191 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2022-03-20 13:45:10,191 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 13:45:14,350 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-20 13:45:14,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 13:45:14,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768275217] [2022-03-20 13:45:14,351 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 13:45:14,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181396566] [2022-03-20 13:45:14,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181396566] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 13:45:14,351 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 13:45:14,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 12 [2022-03-20 13:45:14,352 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 13:45:14,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1917655159] [2022-03-20 13:45:14,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1917655159] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 13:45:14,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 13:45:14,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-20 13:45:14,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237073399] [2022-03-20 13:45:14,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 13:45:14,352 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-20 13:45:14,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 13:45:14,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-20 13:45:14,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=81, Unknown=2, NotChecked=18, Total=132 [2022-03-20 13:45:14,353 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-03-20 13:45:15,906 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 13:45:17,910 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 13:45:19,914 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 13:45:22,070 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 13:45:24,078 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse4 (= c_main_~z~0 0)) (.cse0 (+ (* (- 1) c_main_~a~0) c_main_~x~0))) (or (and (= (mod .cse0 c_main_~z~0) 0) (let ((.cse1 (= c_main_~az~0 0)) (.cse2 (let ((.cse3 (div .cse0 c_main_~z~0))) (+ (* .cse3 c_main_~z~0) (* (- 1) .cse3) c_main_~a~0)))) (or (and (= (mod c_main_~y~0 c_main_~z~0) 0) .cse1 (= .cse2 0)) (and (= (* (div .cse2 c_main_~az~0) c_main_~z~0) c_main_~y~0) (not .cse1) (= (mod .cse2 c_main_~az~0) 0)))) (not .cse4)) (and (exists ((v_main_~x~0_20 Int) (v_main_~y~0_19 Int)) (= (+ v_main_~x~0_20 (* v_main_~y~0_19 c_main_~az~0)) (+ (* v_main_~x~0_20 c_main_~z~0) c_main_~a~0))) (= c_main_~y~0 0) .cse4 (= 0 .cse0)))) (= (+ (* c_main_~x~0 c_main_~z~0) c_main_~a~0) (+ (* c_main_~y~0 c_main_~az~0) c_main_~x~0))) is different from false [2022-03-20 13:45:26,097 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 13:46:01,124 WARN L232 SmtUtils]: Spent 26.57s on a formula simplification. DAG size of input: 64 DAG size of output: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-20 13:46:03,243 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 13:46:05,246 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 13:46:07,253 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 13:46:07,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 13:46:07,433 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-03-20 13:46:07,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-20 13:46:07,435 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-03-20 13:46:07,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 13:46:07,435 INFO L225 Difference]: With dead ends: 30 [2022-03-20 13:46:07,435 INFO L226 Difference]: Without dead ends: 0 [2022-03-20 13:46:07,436 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 103.4s TimeCoverageRelationStatistics Valid=52, Invalid=134, Unknown=4, NotChecked=50, Total=240 [2022-03-20 13:46:07,436 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 13 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 7 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 11 IncrementalHoareTripleChecker+Unchecked, 16.0s IncrementalHoareTripleChecker+Time [2022-03-20 13:46:07,437 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 74 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 34 Invalid, 7 Unknown, 11 Unchecked, 16.0s Time] [2022-03-20 13:46:07,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-03-20 13:46:07,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-03-20 13:46:07,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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) [2022-03-20 13:46:07,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-03-20 13:46:07,437 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2022-03-20 13:46:07,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 13:46:07,437 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-03-20 13:46:07,438 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-03-20 13:46:07,438 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-03-20 13:46:07,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-03-20 13:46:07,439 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-03-20 13:46:07,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-20 13:46:07,640 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 13:46:07,642 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-03-20 13:46:47,769 WARN L232 SmtUtils]: Spent 40.10s on a formula simplification. DAG size of input: 78 DAG size of output: 62 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-03-20 13:47:31,138 WARN L232 SmtUtils]: Spent 43.37s on a formula simplification. DAG size of input: 70 DAG size of output: 60 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-03-20 13:47:54,287 WARN L232 SmtUtils]: Spent 23.13s on a formula simplification that was a NOOP. DAG size: 57 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-03-20 13:48:38,082 WARN L232 SmtUtils]: Spent 43.78s on a formula simplification. DAG size of input: 76 DAG size of output: 60 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-03-20 13:48:38,095 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 8) no Hoare annotation was computed. [2022-03-20 13:48:38,095 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 8) no Hoare annotation was computed. [2022-03-20 13:48:38,095 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 8) no Hoare annotation was computed. [2022-03-20 13:48:38,095 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 11 13) no Hoare annotation was computed. [2022-03-20 13:48:38,096 INFO L882 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2022-03-20 13:48:38,096 INFO L882 garLoopResultBuilder]: For program point L12-2(lines 11 13) no Hoare annotation was computed. [2022-03-20 13:48:38,096 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 11 13) no Hoare annotation was computed. [2022-03-20 13:48:38,096 INFO L878 garLoopResultBuilder]: At program point L34-1(lines 33 42) the Hoare annotation is: (let ((.cse2 (* main_~a~0 main_~z~0))) (let ((.cse0 (= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))) (.cse1 (= .cse2 main_~az~0))) (or (and (= main_~y~0 1) .cse0 .cse1) (and (= .cse2 0) (= main_~y~0 0) (= main_~a~0 main_~x~0)) (and (= main_~z~0 main_~y~0) .cse0 .cse1) (let ((.cse7 (* (- 1) main_~a~0))) (let ((.cse3 (+ .cse7 main_~x~0))) (and (= 0 (mod .cse3 main_~z~0)) (let ((.cse6 (div .cse3 main_~z~0))) (let ((.cse10 (* .cse6 main_~z~0)) (.cse9 (= main_~az~0 0))) (or (let ((.cse8 (+ (* (- 1) .cse6) main_~a~0 .cse10))) (let ((.cse4 (div .cse8 main_~az~0))) (and (= .cse4 (* main_~z~0 (div (let ((.cse5 (div (+ .cse6 .cse7) main_~z~0))) (+ (* (- 1) .cse5) main_~a~0 (* main_~z~0 .cse5))) main_~az~0))) (= (mod .cse8 main_~az~0) 0) (not .cse9) (= (* .cse4 main_~z~0) main_~y~0)))) (and (= (mod main_~y~0 main_~z~0) 0) (= (mod (div main_~y~0 main_~z~0) main_~z~0) 0) (= .cse6 (+ main_~a~0 .cse10)) .cse9)))) (not (= main_~z~0 0)))))))) [2022-03-20 13:48:38,096 INFO L878 garLoopResultBuilder]: At program point L33-2(lines 33 42) the Hoare annotation is: (let ((.cse2 (* main_~a~0 main_~z~0))) (let ((.cse0 (= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))) (.cse1 (= .cse2 main_~az~0))) (or (and (= main_~y~0 1) .cse0 .cse1) (and (= .cse2 0) (= main_~y~0 0) (= main_~a~0 main_~x~0)) (and (= main_~z~0 main_~y~0) .cse0 .cse1) (let ((.cse7 (* (- 1) main_~a~0))) (let ((.cse3 (+ .cse7 main_~x~0))) (and (= 0 (mod .cse3 main_~z~0)) (let ((.cse6 (div .cse3 main_~z~0))) (let ((.cse10 (* .cse6 main_~z~0)) (.cse9 (= main_~az~0 0))) (or (let ((.cse8 (+ (* (- 1) .cse6) main_~a~0 .cse10))) (let ((.cse4 (div .cse8 main_~az~0))) (and (= .cse4 (* main_~z~0 (div (let ((.cse5 (div (+ .cse6 .cse7) main_~z~0))) (+ (* (- 1) .cse5) main_~a~0 (* main_~z~0 .cse5))) main_~az~0))) (= (mod .cse8 main_~az~0) 0) (not .cse9) (= (* .cse4 main_~z~0) main_~y~0)))) (and (= (mod main_~y~0 main_~z~0) 0) (= (mod (div main_~y~0 main_~z~0) main_~z~0) 0) (= .cse6 (+ main_~a~0 .cse10)) .cse9)))) (not (= main_~z~0 0)))))))) [2022-03-20 13:48:38,096 INFO L878 garLoopResultBuilder]: At program point L33-3(lines 33 42) the Hoare annotation is: (let ((.cse6 (* (- 1) main_~a~0)) (.cse9 (* main_~a~0 main_~z~0))) (let ((.cse1 (+ .cse9 main_~a~0)) (.cse0 (= .cse9 main_~az~0)) (.cse2 (+ .cse6 main_~x~0))) (or (and (= main_~y~0 1) (= main_~a~0 main_~x~0) .cse0) (and (= main_~a~0 .cse1) (= main_~y~0 0) (= .cse2 0)) (and (= main_~z~0 main_~y~0) (= main_~x~0 .cse1) .cse0) (and (= 0 (mod .cse2 main_~z~0)) (let ((.cse5 (div .cse2 main_~z~0))) (let ((.cse8 (= main_~az~0 0)) (.cse7 (+ (* (- 1) .cse5) main_~a~0 (* .cse5 main_~z~0)))) (or (let ((.cse3 (div .cse7 main_~az~0))) (and (= .cse3 (* main_~z~0 (div (let ((.cse4 (div (+ .cse5 .cse6) main_~z~0))) (+ (* (- 1) .cse4) main_~a~0 (* main_~z~0 .cse4))) main_~az~0))) (= (mod .cse7 main_~az~0) 0) (not .cse8) (= (* .cse3 main_~z~0) main_~y~0))) (and (= (mod main_~y~0 main_~z~0) 0) (= (mod (div main_~y~0 main_~z~0) main_~z~0) 0) .cse8 (= 0 .cse7))))) (not (= main_~z~0 0)))))) [2022-03-20 13:48:38,096 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 21 45) the Hoare annotation is: true [2022-03-20 13:48:38,096 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 21 45) the Hoare annotation is: true [2022-03-20 13:48:38,096 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 21 45) the Hoare annotation is: true [2022-03-20 13:48:38,096 INFO L885 garLoopResultBuilder]: At program point L43(line 43) the Hoare annotation is: true [2022-03-20 13:48:38,097 INFO L878 garLoopResultBuilder]: At program point L34(line 34) the Hoare annotation is: (let ((.cse1 (* main_~a~0 main_~z~0))) (let ((.cse0 (= .cse1 main_~az~0))) (or (and (= main_~y~0 1) (= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0)) .cse0) (and (= .cse1 0) (= main_~y~0 0) (= main_~a~0 main_~x~0)) (and (= main_~z~0 main_~y~0) (= main_~x~0 (+ .cse1 main_~a~0)) .cse0) (let ((.cse6 (* (- 1) main_~a~0))) (let ((.cse2 (+ .cse6 main_~x~0))) (and (= 0 (mod .cse2 main_~z~0)) (let ((.cse5 (div .cse2 main_~z~0))) (let ((.cse9 (* .cse5 main_~z~0)) (.cse8 (= main_~az~0 0))) (or (let ((.cse7 (+ (* (- 1) .cse5) main_~a~0 .cse9))) (let ((.cse3 (div .cse7 main_~az~0))) (and (= .cse3 (* main_~z~0 (div (let ((.cse4 (div (+ .cse5 .cse6) main_~z~0))) (+ (* (- 1) .cse4) main_~a~0 (* main_~z~0 .cse4))) main_~az~0))) (= (mod .cse7 main_~az~0) 0) (not .cse8) (= (* .cse3 main_~z~0) main_~y~0)))) (and (= (mod main_~y~0 main_~z~0) 0) (= (mod (div main_~y~0 main_~z~0) main_~z~0) 0) (= .cse5 (+ main_~a~0 .cse9)) .cse8)))) (not (= main_~z~0 0)))))))) [2022-03-20 13:48:38,097 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-03-20 13:48:38,097 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2022-03-20 13:48:38,097 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-03-20 13:48:38,097 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-03-20 13:48:38,097 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-03-20 13:48:38,097 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-03-20 13:48:38,097 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-03-20 13:48:38,097 INFO L878 garLoopResultBuilder]: At program point L16(lines 16 17) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-03-20 13:48:38,097 INFO L878 garLoopResultBuilder]: At program point L15(lines 15 18) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-03-20 13:48:38,097 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 20) the Hoare annotation is: true [2022-03-20 13:48:38,097 INFO L878 garLoopResultBuilder]: At program point L15-2(lines 14 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-03-20 13:48:38,097 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 14 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-03-20 13:48:38,097 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-03-20 13:48:38,099 INFO L719 BasicCegarLoop]: Path program histogram: [4, 2, 2] [2022-03-20 13:48:38,100 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-20 13:48:38,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.03 01:48:38 BoogieIcfgContainer [2022-03-20 13:48:38,111 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-20 13:48:38,112 INFO L158 Benchmark]: Toolchain (without parser) took 338866.52ms. Allocated memory was 188.7MB in the beginning and 226.5MB in the end (delta: 37.7MB). Free memory was 140.1MB in the beginning and 98.9MB in the end (delta: 41.2MB). Peak memory consumption was 80.4MB. Max. memory is 8.0GB. [2022-03-20 13:48:38,112 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 188.7MB. Free memory was 156.4MB in the beginning and 156.2MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-20 13:48:38,112 INFO L158 Benchmark]: CACSL2BoogieTranslator took 156.07ms. Allocated memory is still 188.7MB. Free memory was 140.0MB in the beginning and 165.0MB in the end (delta: -25.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-03-20 13:48:38,112 INFO L158 Benchmark]: Boogie Preprocessor took 18.33ms. Allocated memory is still 188.7MB. Free memory was 165.0MB in the beginning and 163.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-20 13:48:38,113 INFO L158 Benchmark]: RCFGBuilder took 263.35ms. Allocated memory is still 188.7MB. Free memory was 163.3MB in the beginning and 153.5MB in the end (delta: 9.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-03-20 13:48:38,113 INFO L158 Benchmark]: TraceAbstraction took 338425.38ms. Allocated memory was 188.7MB in the beginning and 226.5MB in the end (delta: 37.7MB). Free memory was 152.8MB in the beginning and 98.9MB in the end (delta: 53.9MB). Peak memory consumption was 92.6MB. Max. memory is 8.0GB. [2022-03-20 13:48:38,114 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 188.7MB. Free memory was 156.4MB in the beginning and 156.2MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 156.07ms. Allocated memory is still 188.7MB. Free memory was 140.0MB in the beginning and 165.0MB in the end (delta: -25.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 18.33ms. Allocated memory is still 188.7MB. Free memory was 165.0MB in the beginning and 163.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 263.35ms. Allocated memory is still 188.7MB. Free memory was 163.3MB in the beginning and 153.5MB in the end (delta: 9.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 338425.38ms. Allocated memory was 188.7MB in the beginning and 226.5MB in the end (delta: 37.7MB). Free memory was 152.8MB in the beginning and 98.9MB in the end (delta: 53.9MB). Peak memory consumption was 92.6MB. 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 - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 338.3s, OverallIterations: 4, TraceHistogramMax: 3, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 53.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 150.5s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 7 mSolverCounterUnknown, 34 SdHoareTripleChecker+Valid, 16.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 32 mSDsluCounter, 221 SdHoareTripleChecker+Invalid, 16.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 11 IncrementalHoareTripleChecker+Unchecked, 158 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 99 IncrementalHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 63 mSDtfsCounter, 99 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 112 GetRequests, 80 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 103.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=3, InterpolantAutomatonStates: 27, 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 63 PreInvPairs, 100 NumberOfFragments, 905 HoareAnnotationTreeSize, 63 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 21 FomulaSimplificationsInter, 456 FormulaSimplificationTreeSizeReductionInter, 150.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: ((((y == 1 && y * az + x == z * x + a) && a * z == az) || ((a * z == 0 && y == 0) && a == x)) || ((z == y && y * az + x == z * x + a) && a * z == az)) || ((0 == (-1 * a + x) % z && (((((-1 * ((-1 * a + x) / z) + a + (-1 * a + x) / z * z) / az == z * ((-1 * (((-1 * a + x) / z + -1 * a) / z) + a + z * (((-1 * a + x) / z + -1 * a) / z)) / az) && (-1 * ((-1 * a + x) / z) + a + (-1 * a + x) / z * z) % az == 0) && !(az == 0)) && (-1 * ((-1 * a + x) / z) + a + (-1 * a + x) / z * z) / az * z == y) || (((y % z == 0 && y / z % z == 0) && (-1 * a + x) / z == a + (-1 * a + x) / z * z) && az == 0))) && !(z == 0)) - ProcedureContractResult [Line: 21]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == cond || !(1 <= \old(cond)) RESULT: Ultimate proved your program to be correct! [2022-03-20 13:48:38,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...