/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/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/geo3-ll_unwindbound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-06 22:53:18,369 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-06 22:53:18,370 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-06 22:53:18,397 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-06 22:53:18,397 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-06 22:53:18,398 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-06 22:53:18,400 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-06 22:53:18,405 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-06 22:53:18,406 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-06 22:53:18,406 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-06 22:53:18,409 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-06 22:53:18,409 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-06 22:53:18,410 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-06 22:53:18,410 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-06 22:53:18,411 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-06 22:53:18,411 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-06 22:53:18,412 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-06 22:53:18,412 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-06 22:53:18,413 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-06 22:53:18,414 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-06 22:53:18,415 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-06 22:53:18,416 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-06 22:53:18,417 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-06 22:53:18,418 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-06 22:53:18,418 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-06 22:53:18,419 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-06 22:53:18,420 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-06 22:53:18,420 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-06 22:53:18,420 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-06 22:53:18,421 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-06 22:53:18,421 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-06 22:53:18,421 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-06 22:53:18,422 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-06 22:53:18,425 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-06 22:53:18,425 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-06 22:53:18,426 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-06 22:53:18,426 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-06 22:53:18,426 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-06 22:53:18,427 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-06 22:53:18,428 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-06 22:53:18,428 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-06 22:53:18,430 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-06 22:53:18,430 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-06 22:53:18,436 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-06 22:53:18,436 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-06 22:53:18,437 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-06 22:53:18,437 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-06 22:53:18,437 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-06 22:53:18,437 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-06 22:53:18,437 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-06 22:53:18,437 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-06 22:53:18,437 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-06 22:53:18,437 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-06 22:53:18,437 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-06 22:53:18,437 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-06 22:53:18,437 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-06 22:53:18,438 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-06 22:53:18,438 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-06 22:53:18,438 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-06 22:53:18,438 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-06 22:53:18,438 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-06 22:53:18,438 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-06 22:53:18,438 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-06 22:53:18,438 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-06 22:53:18,438 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-06 22:53:18,438 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-04-06 22:53:18,610 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-06 22:53:18,628 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-06 22:53:18,630 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-06 22:53:18,631 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-06 22:53:18,632 INFO L275 PluginConnector]: CDTParser initialized [2022-04-06 22:53:18,633 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/geo3-ll_unwindbound20.c [2022-04-06 22:53:18,678 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d690068b/4bcc94e001c64f89aeac172a47a9b4b2/FLAGe830f6413 [2022-04-06 22:53:18,981 INFO L306 CDTParser]: Found 1 translation units. [2022-04-06 22:53:18,981 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo3-ll_unwindbound20.c [2022-04-06 22:53:18,986 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d690068b/4bcc94e001c64f89aeac172a47a9b4b2/FLAGe830f6413 [2022-04-06 22:53:19,413 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d690068b/4bcc94e001c64f89aeac172a47a9b4b2 [2022-04-06 22:53:19,415 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-06 22:53:19,416 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-06 22:53:19,424 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-06 22:53:19,424 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-06 22:53:19,427 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-06 22:53:19,427 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 10:53:19" (1/1) ... [2022-04-06 22:53:19,428 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47c90e45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 10:53:19, skipping insertion in model container [2022-04-06 22:53:19,428 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 10:53:19" (1/1) ... [2022-04-06 22:53:19,432 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-06 22:53:19,444 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-06 22:53:19,581 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-scaling/geo3-ll_unwindbound20.c[525,538] [2022-04-06 22:53:19,598 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-06 22:53:19,603 INFO L203 MainTranslator]: Completed pre-run [2022-04-06 22:53:19,611 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-scaling/geo3-ll_unwindbound20.c[525,538] [2022-04-06 22:53:19,614 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-06 22:53:19,623 INFO L208 MainTranslator]: Completed translation [2022-04-06 22:53:19,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 10:53:19 WrapperNode [2022-04-06 22:53:19,623 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-06 22:53:19,624 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-06 22:53:19,624 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-06 22:53:19,624 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-06 22:53:19,631 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 10:53:19" (1/1) ... [2022-04-06 22:53:19,631 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 10:53:19" (1/1) ... [2022-04-06 22:53:19,635 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 10:53:19" (1/1) ... [2022-04-06 22:53:19,635 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 10:53:19" (1/1) ... [2022-04-06 22:53:19,638 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 10:53:19" (1/1) ... [2022-04-06 22:53:19,640 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 10:53:19" (1/1) ... [2022-04-06 22:53:19,641 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 10:53:19" (1/1) ... [2022-04-06 22:53:19,642 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-06 22:53:19,643 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-06 22:53:19,643 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-06 22:53:19,643 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-06 22:53:19,646 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 10:53:19" (1/1) ... [2022-04-06 22:53:19,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-06 22:53:19,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 22:53:19,666 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-04-06 22:53:19,679 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-04-06 22:53:19,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-06 22:53:19,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-06 22:53:19,704 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-06 22:53:19,705 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-06 22:53:19,705 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-06 22:53:19,705 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-06 22:53:19,705 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-06 22:53:19,705 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-06 22:53:19,705 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-06 22:53:19,706 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-06 22:53:19,706 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-06 22:53:19,706 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-06 22:53:19,706 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-06 22:53:19,706 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-06 22:53:19,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-06 22:53:19,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-06 22:53:19,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-06 22:53:19,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-06 22:53:19,709 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-06 22:53:19,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-06 22:53:19,750 INFO L234 CfgBuilder]: Building ICFG [2022-04-06 22:53:19,751 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-06 22:53:19,851 INFO L275 CfgBuilder]: Performing block encoding [2022-04-06 22:53:19,855 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-06 22:53:19,856 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-06 22:53:19,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 10:53:19 BoogieIcfgContainer [2022-04-06 22:53:19,857 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-06 22:53:19,858 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-06 22:53:19,858 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-06 22:53:19,861 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-06 22:53:19,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.04 10:53:19" (1/3) ... [2022-04-06 22:53:19,861 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@be9ec61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 10:53:19, skipping insertion in model container [2022-04-06 22:53:19,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 10:53:19" (2/3) ... [2022-04-06 22:53:19,861 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@be9ec61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 10:53:19, skipping insertion in model container [2022-04-06 22:53:19,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 10:53:19" (3/3) ... [2022-04-06 22:53:19,862 INFO L111 eAbstractionObserver]: Analyzing ICFG geo3-ll_unwindbound20.c [2022-04-06 22:53:19,866 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-06 22:53:19,866 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-06 22:53:19,930 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-06 22:53:19,934 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-04-06 22:53:19,934 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-06 22:53:19,948 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 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-04-06 22:53:19,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-06 22:53:19,961 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 22:53:19,962 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 22:53:19,963 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 22:53:19,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 22:53:19,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1665267581, now seen corresponding path program 1 times [2022-04-06 22:53:19,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 22:53:19,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1987466885] [2022-04-06 22:53:19,986 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 22:53:19,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1665267581, now seen corresponding path program 2 times [2022-04-06 22:53:19,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 22:53:19,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223471215] [2022-04-06 22:53:19,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 22:53:19,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 22:53:20,072 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 22:53:20,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1164071868] [2022-04-06 22:53:20,073 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-06 22:53:20,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 22:53:20,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 22:53:20,075 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-04-06 22:53:20,100 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-04-06 22:53:20,169 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-06 22:53:20,170 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 22:53:20,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 1 conjunts are in the unsatisfiable core [2022-04-06 22:53:20,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 22:53:20,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 22:53:20,217 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-06 22:53:20,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 22:53:20,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223471215] [2022-04-06 22:53:20,218 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 22:53:20,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164071868] [2022-04-06 22:53:20,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164071868] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 22:53:20,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 22:53:20,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-06 22:53:20,221 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 22:53:20,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1987466885] [2022-04-06 22:53:20,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1987466885] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 22:53:20,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 22:53:20,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-06 22:53:20,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337463860] [2022-04-06 22:53:20,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 22:53:20,226 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-06 22:53:20,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 22:53:20,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-06 22:53:20,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-06 22:53:20,254 INFO L87 Difference]: Start difference. First operand has 22 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 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-04-06 22:53:20,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 22:53:20,269 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-06 22:53:20,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-06 22:53:20,272 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-04-06 22:53:20,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 22:53:20,279 INFO L225 Difference]: With dead ends: 38 [2022-04-06 22:53:20,279 INFO L226 Difference]: Without dead ends: 17 [2022-04-06 22:53:20,281 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-04-06 22:53:20,284 INFO L913 BasicCegarLoop]: 24 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, 24 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-04-06 22:53:20,285 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-06 22:53:20,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-06 22:53:20,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-06 22:53:20,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 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-04-06 22:53:20,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-06 22:53:20,316 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2022-04-06 22:53:20,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 22:53:20,316 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-06 22:53:20,316 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-04-06 22:53:20,317 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-06 22:53:20,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-06 22:53:20,318 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 22:53:20,318 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 22:53:20,356 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-04-06 22:53:20,531 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-04-06 22:53:20,534 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 22:53:20,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 22:53:20,534 INFO L85 PathProgramCache]: Analyzing trace with hash -318583316, now seen corresponding path program 1 times [2022-04-06 22:53:20,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 22:53:20,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2129353879] [2022-04-06 22:53:20,537 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 22:53:20,537 INFO L85 PathProgramCache]: Analyzing trace with hash -318583316, now seen corresponding path program 2 times [2022-04-06 22:53:20,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 22:53:20,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589043046] [2022-04-06 22:53:20,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 22:53:20,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 22:53:20,550 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 22:53:20,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [609354913] [2022-04-06 22:53:20,551 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-06 22:53:20,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 22:53:20,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 22:53:20,558 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-04-06 22:53:20,592 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-04-06 22:53:20,641 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-06 22:53:20,642 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 22:53:20,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-06 22:53:20,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 22:53:20,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 22:53:20,727 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-06 22:53:20,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 22:53:20,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589043046] [2022-04-06 22:53:20,727 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 22:53:20,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609354913] [2022-04-06 22:53:20,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [609354913] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 22:53:20,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 22:53:20,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 22:53:20,734 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 22:53:20,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2129353879] [2022-04-06 22:53:20,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2129353879] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 22:53:20,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 22:53:20,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 22:53:20,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948451623] [2022-04-06 22:53:20,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 22:53:20,735 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 22:53:20,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 22:53:20,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 22:53:20,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 22:53:20,736 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 22:53:20,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 22:53:20,751 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-06 22:53:20,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 22:53:20,751 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 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 12 [2022-04-06 22:53:20,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 22:53:20,753 INFO L225 Difference]: With dead ends: 26 [2022-04-06 22:53:20,753 INFO L226 Difference]: Without dead ends: 19 [2022-04-06 22:53:20,753 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 22:53:20,758 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-06 22:53:20,758 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-06 22:53:20,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-06 22:53:20,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-06 22:53:20,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 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-04-06 22:53:20,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-04-06 22:53:20,768 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 12 [2022-04-06 22:53:20,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 22:53:20,768 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-04-06 22:53:20,768 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 22:53:20,769 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-06 22:53:20,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-06 22:53:20,769 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 22:53:20,769 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 22:53:20,787 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-04-06 22:53:20,986 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-04-06 22:53:20,987 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 22:53:20,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 22:53:20,987 INFO L85 PathProgramCache]: Analyzing trace with hash -316795856, now seen corresponding path program 1 times [2022-04-06 22:53:20,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 22:53:20,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [922605790] [2022-04-06 22:53:20,988 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 22:53:20,988 INFO L85 PathProgramCache]: Analyzing trace with hash -316795856, now seen corresponding path program 2 times [2022-04-06 22:53:20,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 22:53:20,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413518077] [2022-04-06 22:53:20,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 22:53:20,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 22:53:21,007 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 22:53:21,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1194679342] [2022-04-06 22:53:21,009 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-06 22:53:21,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 22:53:21,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 22:53:21,010 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-04-06 22:53:21,035 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-04-06 22:53:21,055 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-06 22:53:21,056 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 22:53:21,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-06 22:53:21,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 22:53:21,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 22:53:21,160 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-06 22:53:21,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 22:53:21,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413518077] [2022-04-06 22:53:21,160 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 22:53:21,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194679342] [2022-04-06 22:53:21,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194679342] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 22:53:21,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 22:53:21,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-06 22:53:21,161 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 22:53:21,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [922605790] [2022-04-06 22:53:21,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [922605790] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 22:53:21,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 22:53:21,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-06 22:53:21,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551829034] [2022-04-06 22:53:21,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 22:53:21,162 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-06 22:53:21,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 22:53:21,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-06 22:53:21,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-06 22:53:21,162 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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-04-06 22:53:21,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 22:53:21,188 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-04-06 22:53:21,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-06 22:53:21,188 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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 12 [2022-04-06 22:53:21,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 22:53:21,189 INFO L225 Difference]: With dead ends: 28 [2022-04-06 22:53:21,189 INFO L226 Difference]: Without dead ends: 25 [2022-04-06 22:53:21,189 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 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-04-06 22:53:21,190 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 6 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-06 22:53:21,190 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 57 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-06 22:53:21,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-06 22:53:21,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-06 22:53:21,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 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-04-06 22:53:21,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-04-06 22:53:21,194 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 12 [2022-04-06 22:53:21,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 22:53:21,195 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-04-06 22:53:21,195 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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-04-06 22:53:21,195 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-06 22:53:21,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-06 22:53:21,195 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 22:53:21,195 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 22:53:21,214 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-04-06 22:53:21,412 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-04-06 22:53:21,412 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 22:53:21,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 22:53:21,413 INFO L85 PathProgramCache]: Analyzing trace with hash -2089867248, now seen corresponding path program 1 times [2022-04-06 22:53:21,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 22:53:21,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [138995914] [2022-04-06 22:53:21,427 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-06 22:53:21,427 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-06 22:53:21,427 INFO L85 PathProgramCache]: Analyzing trace with hash -2089867248, now seen corresponding path program 2 times [2022-04-06 22:53:21,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 22:53:21,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136851918] [2022-04-06 22:53:21,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 22:53:21,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 22:53:21,438 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 22:53:21,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1253101431] [2022-04-06 22:53:21,438 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-06 22:53:21,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 22:53:21,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 22:53:21,440 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-04-06 22:53:21,441 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-04-06 22:53:21,473 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-06 22:53:21,474 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 22:53:21,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-06 22:53:21,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 22:53:21,558 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 22:53:21,558 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 22:53:21,640 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 22:53:21,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 22:53:21,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136851918] [2022-04-06 22:53:21,640 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 22:53:21,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253101431] [2022-04-06 22:53:21,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1253101431] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 22:53:21,641 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-06 22:53:21,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-06 22:53:21,641 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 22:53:21,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [138995914] [2022-04-06 22:53:21,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [138995914] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 22:53:21,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 22:53:21,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-06 22:53:21,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698072562] [2022-04-06 22:53:21,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 22:53:21,643 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-06 22:53:21,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 22:53:21,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-06 22:53:21,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-06 22:53:21,645 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-06 22:53:21,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 22:53:21,678 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-06 22:53:21,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-06 22:53:21,678 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (4), 4 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 20 [2022-04-06 22:53:21,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 22:53:21,680 INFO L225 Difference]: With dead ends: 34 [2022-04-06 22:53:21,680 INFO L226 Difference]: Without dead ends: 27 [2022-04-06 22:53:21,680 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-06 22:53:21,682 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 2 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-06 22:53:21,683 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 58 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-06 22:53:21,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-06 22:53:21,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-06 22:53:21,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 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-04-06 22:53:21,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-04-06 22:53:21,694 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 20 [2022-04-06 22:53:21,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 22:53:21,695 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-04-06 22:53:21,695 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-06 22:53:21,695 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-06 22:53:21,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-06 22:53:21,696 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 22:53:21,696 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 22:53:21,715 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-04-06 22:53:21,911 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-04-06 22:53:21,912 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 22:53:21,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 22:53:21,912 INFO L85 PathProgramCache]: Analyzing trace with hash -2088079788, now seen corresponding path program 1 times [2022-04-06 22:53:21,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 22:53:21,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1656986445] [2022-04-06 22:53:21,915 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-06 22:53:21,916 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-06 22:53:21,916 INFO L85 PathProgramCache]: Analyzing trace with hash -2088079788, now seen corresponding path program 2 times [2022-04-06 22:53:21,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 22:53:21,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038502680] [2022-04-06 22:53:21,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 22:53:21,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 22:53:21,922 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 22:53:21,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1430184104] [2022-04-06 22:53:21,923 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-06 22:53:21,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 22:53:21,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 22:53:21,941 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 22:53:21,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-06 22:53:22,001 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-06 22:53:22,001 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 22:53:22,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-06 22:53:22,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 22:53:22,162 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 22:53:22,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 22:53:22,474 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 22:53:22,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 22:53:22,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038502680] [2022-04-06 22:53:22,475 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 22:53:22,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430184104] [2022-04-06 22:53:22,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1430184104] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 22:53:22,475 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-06 22:53:22,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2022-04-06 22:53:22,475 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 22:53:22,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1656986445] [2022-04-06 22:53:22,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1656986445] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 22:53:22,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 22:53:22,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-06 22:53:22,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163112085] [2022-04-06 22:53:22,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 22:53:22,476 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-06 22:53:22,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 22:53:22,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-06 22:53:22,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-06 22:53:22,477 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 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-04-06 22:53:22,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 22:53:22,749 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-06 22:53:22,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-06 22:53:22,749 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 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 20 [2022-04-06 22:53:22,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 22:53:22,750 INFO L225 Difference]: With dead ends: 36 [2022-04-06 22:53:22,750 INFO L226 Difference]: Without dead ends: 33 [2022-04-06 22:53:22,750 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 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-04-06 22:53:22,751 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 12 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-06 22:53:22,751 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 92 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-06 22:53:22,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-06 22:53:22,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-06 22:53:22,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 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-04-06 22:53:22,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2022-04-06 22:53:22,755 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 20 [2022-04-06 22:53:22,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 22:53:22,755 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2022-04-06 22:53:22,755 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 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-04-06 22:53:22,755 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-06 22:53:22,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-06 22:53:22,756 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 22:53:22,756 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 22:53:22,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-06 22:53:22,967 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 22:53:22,968 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 22:53:22,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 22:53:22,968 INFO L85 PathProgramCache]: Analyzing trace with hash -696181196, now seen corresponding path program 3 times [2022-04-06 22:53:22,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 22:53:22,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [184739084] [2022-04-06 22:53:22,970 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-06 22:53:22,970 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-06 22:53:22,971 INFO L85 PathProgramCache]: Analyzing trace with hash -696181196, now seen corresponding path program 4 times [2022-04-06 22:53:22,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 22:53:22,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750949886] [2022-04-06 22:53:22,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 22:53:22,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 22:53:22,977 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 22:53:22,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1157752785] [2022-04-06 22:53:22,977 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-06 22:53:22,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 22:53:22,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 22:53:22,979 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 22:53:22,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-06 22:53:23,396 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-06 22:53:23,396 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 22:53:23,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-06 22:53:23,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 22:53:23,432 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-06 22:53:23,435 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-06 22:53:23,439 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-06 22:53:29,489 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 (= c_main_~y~0 0) (exists ((v_main_~x~0_29 Int) (v_main_~y~0_28 Int)) (= (+ c_main_~a~0 (* v_main_~x~0_29 c_main_~z~0)) (+ v_main_~x~0_29 (* v_main_~y~0_28 c_main_~az~0)))) .cse4 (= 0 .cse0)))) is different from false [2022-04-06 22:54:20,352 WARN L232 SmtUtils]: Spent 28.15s 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-04-06 22:54:20,378 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-06 22:54:20,383 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-06 22:54:20,398 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-06 22:54:20,419 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-06 22:54:52,410 WARN L232 SmtUtils]: Spent 20.55s 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-04-06 22:55:13,186 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-06 22:55:13,385 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2022-04-06 22:55:13,385 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 22:55:13,572 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-06 22:55:13,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 22:55:13,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750949886] [2022-04-06 22:55:13,572 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 22:55:13,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1157752785] [2022-04-06 22:55:13,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1157752785] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 22:55:13,572 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-06 22:55:13,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 12 [2022-04-06 22:55:13,573 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 22:55:13,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [184739084] [2022-04-06 22:55:13,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [184739084] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 22:55:13,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 22:55:13,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-06 22:55:13,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235060407] [2022-04-06 22:55:13,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 22:55:13,573 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-06 22:55:13,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 22:55:13,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-06 22:55:13,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=81, Unknown=2, NotChecked=18, Total=132 [2022-04-06 22:55:13,574 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 7 states have internal predecessors, (17), 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-04-06 22:55:15,916 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-04-06 22:55:17,923 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 (= c_main_~y~0 0) (exists ((v_main_~x~0_29 Int) (v_main_~y~0_28 Int)) (= (+ c_main_~a~0 (* v_main_~x~0_29 c_main_~z~0)) (+ v_main_~x~0_29 (* v_main_~y~0_28 c_main_~az~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-04-06 22:55:19,939 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-04-06 22:55:30,568 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-04-06 22:55:33,252 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-04-06 22:55:35,257 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-04-06 22:55:37,260 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-04-06 22:55:39,265 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-04-06 22:55:39,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 22:55:39,265 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-06 22:55:39,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-06 22:55:39,268 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 7 states have internal predecessors, (17), 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 28 [2022-04-06 22:55:39,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 22:55:39,268 INFO L225 Difference]: With dead ends: 33 [2022-04-06 22:55:39,268 INFO L226 Difference]: Without dead ends: 0 [2022-04-06 22:55:39,269 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 66.2s TimeCoverageRelationStatistics Valid=46, Invalid=115, Unknown=3, NotChecked=46, Total=210 [2022-04-06 22:55:39,269 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 20 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 5 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 15.1s IncrementalHoareTripleChecker+Time [2022-04-06 22:55:39,269 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 64 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 39 Invalid, 7 Unknown, 19 Unchecked, 15.1s Time] [2022-04-06 22:55:39,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-06 22:55:39,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-06 22:55:39,270 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-04-06 22:55:39,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-06 22:55:39,270 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2022-04-06 22:55:39,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 22:55:39,270 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-06 22:55:39,270 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 7 states have internal predecessors, (17), 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-04-06 22:55:39,270 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-06 22:55:39,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-06 22:55:39,272 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-06 22:55:39,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-06 22:55:39,476 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 22:55:39,478 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-06 22:56:21,803 WARN L232 SmtUtils]: Spent 42.28s on a formula simplification. DAG size of input: 82 DAG size of output: 66 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-06 22:56:59,930 WARN L232 SmtUtils]: Spent 38.13s on a formula simplification. DAG size of input: 81 DAG size of output: 66 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-06 22:57:22,439 WARN L232 SmtUtils]: Spent 22.50s on a formula simplification. DAG size of input: 84 DAG size of output: 70 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-06 22:57:47,797 WARN L232 SmtUtils]: Spent 25.36s on a formula simplification that was a NOOP. DAG size: 60 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-06 22:58:20,735 WARN L232 SmtUtils]: Spent 32.91s on a formula simplification. DAG size of input: 75 DAG size of output: 65 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-06 22:58:20,762 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 8) no Hoare annotation was computed. [2022-04-06 22:58:20,762 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 8) no Hoare annotation was computed. [2022-04-06 22:58:20,762 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 8) no Hoare annotation was computed. [2022-04-06 22:58:20,762 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 11 13) no Hoare annotation was computed. [2022-04-06 22:58:20,762 INFO L882 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2022-04-06 22:58:20,763 INFO L882 garLoopResultBuilder]: For program point L12-2(lines 11 13) no Hoare annotation was computed. [2022-04-06 22:58:20,763 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 11 13) no Hoare annotation was computed. [2022-04-06 22:58:20,763 INFO L878 garLoopResultBuilder]: At program point L34-1(lines 34 43) the Hoare annotation is: (let ((.cse1 (* main_~a~0 main_~z~0))) (let ((.cse0 (= .cse1 main_~az~0))) (or (and (<= ~counter~0 1) (= main_~y~0 1) (<= |main_#t~post7| 0) (= (+ (* 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)) (not (<= |old(~counter~0)| 0)) (and (<= |main_#t~post7| 1) (= 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-04-06 22:58:20,763 INFO L878 garLoopResultBuilder]: At program point L34-3(lines 34 43) 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_~z~0 main_~y~0) (<= ~counter~0 1) .cse0 .cse1) (and (= .cse2 0) (= main_~y~0 0) (= main_~a~0 main_~x~0)) (not (<= |old(~counter~0)| 0)) (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))))) (and (= main_~y~0 1) (<= ~counter~0 0) .cse0 .cse1)))) [2022-04-06 22:58:20,763 INFO L878 garLoopResultBuilder]: At program point L34-4(lines 34 43) 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)) (not (<= |old(~counter~0)| 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-04-06 22:58:20,763 INFO L878 garLoopResultBuilder]: At program point mainENTRY(lines 22 46) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (<= ~counter~0 0)) [2022-04-06 22:58:20,763 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 22 46) the Hoare annotation is: true [2022-04-06 22:58:20,763 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 22 46) the Hoare annotation is: true [2022-04-06 22:58:20,763 INFO L885 garLoopResultBuilder]: At program point L44(line 44) the Hoare annotation is: true [2022-04-06 22:58:20,763 INFO L878 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (let ((.cse0 (* main_~a~0 main_~z~0))) (let ((.cse1 (= .cse0 main_~az~0))) (or (and (= .cse0 0) (= main_~y~0 0) (= main_~a~0 main_~x~0)) (not (<= |old(~counter~0)| 0)) (and (= main_~z~0 main_~y~0) (= main_~x~0 (+ .cse0 main_~a~0)) .cse1) (and (<= ~counter~0 1) (= main_~y~0 1) (= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0)) .cse1) (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-04-06 22:58:20,764 INFO L878 garLoopResultBuilder]: At program point L35-1(lines 34 43) the Hoare annotation is: (let ((.cse0 (* main_~a~0 main_~z~0))) (let ((.cse1 (= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))) (.cse2 (= .cse0 main_~az~0))) (or (and (= .cse0 0) (= main_~y~0 0) (= main_~a~0 main_~x~0)) (not (<= |old(~counter~0)| 0)) (and (= main_~z~0 main_~y~0) .cse1 .cse2) (and (<= ~counter~0 1) (= main_~y~0 1) .cse1 .cse2) (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-04-06 22:58:20,764 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (<= ~counter~0 0) [2022-04-06 22:58:20,764 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2022-04-06 22:58:20,764 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (<= ~counter~0 0) [2022-04-06 22:58:20,764 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-06 22:58:20,764 INFO L878 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (<= ~counter~0 0) [2022-04-06 22:58:20,764 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-06 22:58:20,764 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-06 22:58:20,764 INFO L878 garLoopResultBuilder]: At program point L16(lines 16 17) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-06 22:58:20,764 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-04-06 22:58:20,764 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 20) the Hoare annotation is: true [2022-04-06 22:58:20,764 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-04-06 22:58:20,764 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-04-06 22:58:20,764 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-06 22:58:20,766 INFO L719 BasicCegarLoop]: Path program histogram: [4, 2, 2, 2, 2] [2022-04-06 22:58:20,771 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-06 22:58:20,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.04 10:58:20 BoogieIcfgContainer [2022-04-06 22:58:20,793 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-06 22:58:20,794 INFO L158 Benchmark]: Toolchain (without parser) took 301378.02ms. Allocated memory was 183.5MB in the beginning and 227.5MB in the end (delta: 44.0MB). Free memory was 131.6MB in the beginning and 87.5MB in the end (delta: 44.1MB). Peak memory consumption was 88.0MB. Max. memory is 8.0GB. [2022-04-06 22:58:20,794 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 183.5MB. Free memory is still 147.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-06 22:58:20,794 INFO L158 Benchmark]: CACSL2BoogieTranslator took 199.98ms. Allocated memory was 183.5MB in the beginning and 227.5MB in the end (delta: 44.0MB). Free memory was 131.3MB in the beginning and 201.4MB in the end (delta: -70.1MB). Peak memory consumption was 9.7MB. Max. memory is 8.0GB. [2022-04-06 22:58:20,795 INFO L158 Benchmark]: Boogie Preprocessor took 18.16ms. Allocated memory is still 227.5MB. Free memory was 201.4MB in the beginning and 199.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-06 22:58:20,795 INFO L158 Benchmark]: RCFGBuilder took 214.42ms. Allocated memory is still 227.5MB. Free memory was 199.9MB in the beginning and 188.3MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-06 22:58:20,795 INFO L158 Benchmark]: TraceAbstraction took 300935.45ms. Allocated memory is still 227.5MB. Free memory was 187.8MB in the beginning and 87.5MB in the end (delta: 100.3MB). Peak memory consumption was 101.4MB. Max. memory is 8.0GB. [2022-04-06 22:58:20,796 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.12ms. Allocated memory is still 183.5MB. Free memory is still 147.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 199.98ms. Allocated memory was 183.5MB in the beginning and 227.5MB in the end (delta: 44.0MB). Free memory was 131.3MB in the beginning and 201.4MB in the end (delta: -70.1MB). Peak memory consumption was 9.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 18.16ms. Allocated memory is still 227.5MB. Free memory was 201.4MB in the beginning and 199.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 214.42ms. Allocated memory is still 227.5MB. Free memory was 199.9MB in the beginning and 188.3MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 300935.45ms. Allocated memory is still 227.5MB. Free memory was 187.8MB in the beginning and 87.5MB in the end (delta: 100.3MB). Peak memory consumption was 101.4MB. 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, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 300.8s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 26.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 161.3s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 7 mSolverCounterUnknown, 43 SdHoareTripleChecker+Valid, 15.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 40 mSDsluCounter, 340 SdHoareTripleChecker+Invalid, 15.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 19 IncrementalHoareTripleChecker+Unchecked, 232 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 144 IncrementalHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 108 mSDtfsCounter, 144 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 174 GetRequests, 133 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 66.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=5, InterpolantAutomatonStates: 36, 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, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 76 PreInvPairs, 120 NumberOfFragments, 1172 HoareAnnotationTreeSize, 76 FomulaSimplifications, 19 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 22 FomulaSimplificationsInter, 645 FormulaSimplificationTreeSizeReductionInter, 161.2s 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: 34]: Loop Invariant Derived loop invariant: ((((((z == y && counter <= 1) && y * az + x == z * x + a) && a * z == az) || ((a * z == 0 && y == 0) && a == x)) || !(\old(counter) <= 0)) || ((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))) || (((y == 1 && counter <= 0) && y * az + x == z * x + a) && a * z == az) - ProcedureContractResult [Line: 22]: 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-04-06 22:58:20,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...