/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench/prod4br-ll.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 07:24:02,624 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 07:24:02,659 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 07:24:02,688 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 07:24:02,688 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 07:24:02,689 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 07:24:02,690 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 07:24:02,692 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 07:24:02,694 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 07:24:02,694 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 07:24:02,695 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 07:24:02,696 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 07:24:02,696 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 07:24:02,697 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 07:24:02,698 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 07:24:02,699 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 07:24:02,699 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 07:24:02,700 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 07:24:02,702 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 07:24:02,703 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 07:24:02,704 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 07:24:02,705 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 07:24:02,706 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 07:24:02,707 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 07:24:02,708 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 07:24:02,710 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 07:24:02,710 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 07:24:02,710 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 07:24:02,711 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 07:24:02,711 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 07:24:02,712 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 07:24:02,712 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 07:24:02,713 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 07:24:02,713 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 07:24:02,714 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 07:24:02,715 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 07:24:02,720 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 07:24:02,722 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 07:24:02,722 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 07:24:02,722 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 07:24:02,723 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 07:24:02,725 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 07:24:02,726 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 07:24:02,739 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 07:24:02,740 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 07:24:02,741 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 07:24:02,741 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 07:24:02,741 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 07:24:02,741 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 07:24:02,741 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 07:24:02,741 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 07:24:02,741 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 07:24:02,741 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 07:24:02,742 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 07:24:02,742 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 07:24:02,742 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 07:24:02,742 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 07:24:02,742 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 07:24:02,742 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 07:24:02,742 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 07:24:02,742 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 07:24:02,743 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 07:24:02,743 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 07:24:02,743 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 07:24:02,743 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 07:24:02,743 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 07:24:02,743 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 07:24:02,743 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 07:24:02,744 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-15 07:24:02,947 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 07:24:02,969 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 07:24:02,971 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 07:24:02,972 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 07:24:02,973 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 07:24:02,973 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/prod4br-ll.c [2022-04-15 07:24:03,035 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d664e2996/2ba898956be947c0a53d5a2819c2cb67/FLAG1998d9078 [2022-04-15 07:24:03,396 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 07:24:03,396 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/prod4br-ll.c [2022-04-15 07:24:03,401 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d664e2996/2ba898956be947c0a53d5a2819c2cb67/FLAG1998d9078 [2022-04-15 07:24:03,410 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d664e2996/2ba898956be947c0a53d5a2819c2cb67 [2022-04-15 07:24:03,412 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 07:24:03,413 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 07:24:03,417 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 07:24:03,417 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 07:24:03,420 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 07:24:03,421 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 07:24:03" (1/1) ... [2022-04-15 07:24:03,421 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72be743b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:24:03, skipping insertion in model container [2022-04-15 07:24:03,422 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 07:24:03" (1/1) ... [2022-04-15 07:24:03,426 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 07:24:03,437 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 07:24:03,564 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/prod4br-ll.c[524,537] [2022-04-15 07:24:03,585 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 07:24:03,595 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 07:24:03,612 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/prod4br-ll.c[524,537] [2022-04-15 07:24:03,641 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 07:24:03,655 INFO L208 MainTranslator]: Completed translation [2022-04-15 07:24:03,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:24:03 WrapperNode [2022-04-15 07:24:03,656 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 07:24:03,657 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 07:24:03,657 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 07:24:03,657 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 07:24:03,664 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:24:03" (1/1) ... [2022-04-15 07:24:03,664 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:24:03" (1/1) ... [2022-04-15 07:24:03,670 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:24:03" (1/1) ... [2022-04-15 07:24:03,670 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:24:03" (1/1) ... [2022-04-15 07:24:03,676 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:24:03" (1/1) ... [2022-04-15 07:24:03,679 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:24:03" (1/1) ... [2022-04-15 07:24:03,680 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:24:03" (1/1) ... [2022-04-15 07:24:03,681 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 07:24:03,682 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 07:24:03,682 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 07:24:03,682 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 07:24:03,683 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:24:03" (1/1) ... [2022-04-15 07:24:03,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 07:24:03,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:24:03,716 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-15 07:24:03,718 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-15 07:24:03,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 07:24:03,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 07:24:03,745 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 07:24:03,745 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 07:24:03,745 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 07:24:03,745 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 07:24:03,746 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 07:24:03,746 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 07:24:03,747 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 07:24:03,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 07:24:03,747 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 07:24:03,748 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 07:24:03,748 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 07:24:03,748 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 07:24:03,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 07:24:03,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 07:24:03,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 07:24:03,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 07:24:03,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 07:24:03,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 07:24:03,793 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 07:24:03,794 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 07:24:03,955 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 07:24:03,961 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 07:24:03,961 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 07:24:03,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 07:24:03 BoogieIcfgContainer [2022-04-15 07:24:03,962 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 07:24:03,964 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 07:24:03,964 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 07:24:03,975 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 07:24:03,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 07:24:03" (1/3) ... [2022-04-15 07:24:03,976 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dca72f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 07:24:03, skipping insertion in model container [2022-04-15 07:24:03,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:24:03" (2/3) ... [2022-04-15 07:24:03,976 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dca72f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 07:24:03, skipping insertion in model container [2022-04-15 07:24:03,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 07:24:03" (3/3) ... [2022-04-15 07:24:03,977 INFO L111 eAbstractionObserver]: Analyzing ICFG prod4br-ll.c [2022-04-15 07:24:03,981 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 07:24:03,981 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 07:24:04,035 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 07:24:04,041 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-15 07:24:04,041 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 07:24:04,056 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 20 states have internal predecessors, (28), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 07:24:04,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 07:24:04,063 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:24:04,063 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:24:04,064 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:24:04,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:24:04,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1051010973, now seen corresponding path program 1 times [2022-04-15 07:24:04,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:24:04,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1447637360] [2022-04-15 07:24:04,085 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:24:04,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1051010973, now seen corresponding path program 2 times [2022-04-15 07:24:04,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:24:04,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104167553] [2022-04-15 07:24:04,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:24:04,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:24:04,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:24:04,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:24:04,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:24:04,273 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {34#true} is VALID [2022-04-15 07:24:04,273 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-15 07:24:04,273 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} #76#return; {34#true} is VALID [2022-04-15 07:24:04,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 07:24:04,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:24:04,300 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID [2022-04-15 07:24:04,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID [2022-04-15 07:24:04,302 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#false} assume true; {35#false} is VALID [2022-04-15 07:24:04,302 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#false} {34#true} #68#return; {35#false} is VALID [2022-04-15 07:24:04,304 INFO L272 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {43#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:24:04,305 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {34#true} is VALID [2022-04-15 07:24:04,305 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-15 07:24:04,305 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #76#return; {34#true} is VALID [2022-04-15 07:24:04,305 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret6 := main(); {34#true} is VALID [2022-04-15 07:24:04,306 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {34#true} is VALID [2022-04-15 07:24:04,306 INFO L272 TraceCheckUtils]: 6: Hoare triple {34#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {34#true} is VALID [2022-04-15 07:24:04,306 INFO L290 TraceCheckUtils]: 7: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID [2022-04-15 07:24:04,307 INFO L290 TraceCheckUtils]: 8: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID [2022-04-15 07:24:04,307 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} assume true; {35#false} is VALID [2022-04-15 07:24:04,308 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {35#false} {34#true} #68#return; {35#false} is VALID [2022-04-15 07:24:04,308 INFO L290 TraceCheckUtils]: 11: Hoare triple {35#false} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {35#false} is VALID [2022-04-15 07:24:04,308 INFO L290 TraceCheckUtils]: 12: Hoare triple {35#false} assume false; {35#false} is VALID [2022-04-15 07:24:04,308 INFO L272 TraceCheckUtils]: 13: Hoare triple {35#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {35#false} is VALID [2022-04-15 07:24:04,308 INFO L290 TraceCheckUtils]: 14: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2022-04-15 07:24:04,309 INFO L290 TraceCheckUtils]: 15: Hoare triple {35#false} assume 0 == ~cond; {35#false} is VALID [2022-04-15 07:24:04,309 INFO L290 TraceCheckUtils]: 16: Hoare triple {35#false} assume !false; {35#false} is VALID [2022-04-15 07:24:04,309 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-15 07:24:04,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:24:04,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104167553] [2022-04-15 07:24:04,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104167553] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:24:04,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:24:04,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 07:24:04,313 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:24:04,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1447637360] [2022-04-15 07:24:04,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1447637360] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:24:04,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:24:04,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 07:24:04,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373340502] [2022-04-15 07:24:04,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:24:04,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-15 07:24:04,323 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:24:04,326 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:24:04,354 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:24:04,354 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 07:24:04,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:24:04,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 07:24:04,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 07:24:04,384 INFO L87 Difference]: Start difference. First operand has 31 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 20 states have internal predecessors, (28), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:24:04,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:24:04,549 INFO L93 Difference]: Finished difference Result 53 states and 73 transitions. [2022-04-15 07:24:04,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 07:24:04,549 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-15 07:24:04,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:24:04,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:24:04,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2022-04-15 07:24:04,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:24:04,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2022-04-15 07:24:04,568 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 73 transitions. [2022-04-15 07:24:04,668 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:24:04,678 INFO L225 Difference]: With dead ends: 53 [2022-04-15 07:24:04,678 INFO L226 Difference]: Without dead ends: 26 [2022-04-15 07:24:04,681 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 07:24:04,685 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 21 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:24:04,687 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 35 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 07:24:04,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-15 07:24:04,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-15 07:24:04,713 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:24:04,714 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 07:24:04,714 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 07:24:04,715 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 07:24:04,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:24:04,720 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-04-15 07:24:04,720 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-15 07:24:04,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:24:04,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:24:04,722 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-15 07:24:04,723 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-15 07:24:04,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:24:04,727 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-04-15 07:24:04,729 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-15 07:24:04,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:24:04,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:24:04,735 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:24:04,735 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:24:04,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 07:24:04,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2022-04-15 07:24:04,740 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 17 [2022-04-15 07:24:04,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:24:04,741 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2022-04-15 07:24:04,742 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:24:04,742 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 31 transitions. [2022-04-15 07:24:04,781 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:24:04,781 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-15 07:24:04,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 07:24:04,782 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:24:04,782 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:24:04,782 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 07:24:04,783 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:24:04,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:24:04,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1732856803, now seen corresponding path program 1 times [2022-04-15 07:24:04,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:24:04,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [347585720] [2022-04-15 07:24:04,790 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:24:04,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1732856803, now seen corresponding path program 2 times [2022-04-15 07:24:04,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:24:04,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048906547] [2022-04-15 07:24:04,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:24:04,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:24:04,827 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:24:04,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1434363306] [2022-04-15 07:24:04,827 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:24:04,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:24:04,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:24:04,829 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-15 07:24:04,841 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-15 07:24:04,877 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 07:24:04,878 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:24:04,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-15 07:24:04,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:24:04,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:24:05,031 INFO L272 TraceCheckUtils]: 0: Hoare triple {256#true} call ULTIMATE.init(); {256#true} is VALID [2022-04-15 07:24:05,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {256#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {256#true} is VALID [2022-04-15 07:24:05,032 INFO L290 TraceCheckUtils]: 2: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-15 07:24:05,032 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {256#true} {256#true} #76#return; {256#true} is VALID [2022-04-15 07:24:05,032 INFO L272 TraceCheckUtils]: 4: Hoare triple {256#true} call #t~ret6 := main(); {256#true} is VALID [2022-04-15 07:24:05,033 INFO L290 TraceCheckUtils]: 5: Hoare triple {256#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {256#true} is VALID [2022-04-15 07:24:05,033 INFO L272 TraceCheckUtils]: 6: Hoare triple {256#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {256#true} is VALID [2022-04-15 07:24:05,033 INFO L290 TraceCheckUtils]: 7: Hoare triple {256#true} ~cond := #in~cond; {256#true} is VALID [2022-04-15 07:24:05,033 INFO L290 TraceCheckUtils]: 8: Hoare triple {256#true} assume !(0 == ~cond); {256#true} is VALID [2022-04-15 07:24:05,033 INFO L290 TraceCheckUtils]: 9: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-15 07:24:05,034 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {256#true} {256#true} #68#return; {256#true} is VALID [2022-04-15 07:24:05,034 INFO L290 TraceCheckUtils]: 11: Hoare triple {256#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {294#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 07:24:05,035 INFO L290 TraceCheckUtils]: 12: Hoare triple {294#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {294#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 07:24:05,036 INFO L272 TraceCheckUtils]: 13: Hoare triple {294#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {301#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:24:05,036 INFO L290 TraceCheckUtils]: 14: Hoare triple {301#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {305#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:24:05,037 INFO L290 TraceCheckUtils]: 15: Hoare triple {305#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {257#false} is VALID [2022-04-15 07:24:05,037 INFO L290 TraceCheckUtils]: 16: Hoare triple {257#false} assume !false; {257#false} is VALID [2022-04-15 07:24:05,037 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-15 07:24:05,038 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 07:24:05,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:24:05,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048906547] [2022-04-15 07:24:05,038 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:24:05,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434363306] [2022-04-15 07:24:05,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434363306] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:24:05,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:24:05,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 07:24:05,040 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:24:05,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [347585720] [2022-04-15 07:24:05,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [347585720] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:24:05,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:24:05,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 07:24:05,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134997877] [2022-04-15 07:24:05,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:24:05,041 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-15 07:24:05,041 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:24:05,041 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:24:05,055 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:24:05,055 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 07:24:05,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:24:05,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 07:24:05,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 07:24:05,057 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:24:05,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:24:05,258 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-15 07:24:05,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 07:24:05,258 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-15 07:24:05,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:24:05,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:24:05,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-15 07:24:05,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:24:05,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-15 07:24:05,267 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 50 transitions. [2022-04-15 07:24:05,317 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:24:05,321 INFO L225 Difference]: With dead ends: 40 [2022-04-15 07:24:05,321 INFO L226 Difference]: Without dead ends: 38 [2022-04-15 07:24:05,322 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 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-15 07:24:05,325 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 9 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:24:05,328 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 75 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 07:24:05,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-15 07:24:05,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2022-04-15 07:24:05,343 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:24:05,343 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 32 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 07:24:05,344 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 32 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 07:24:05,345 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 32 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 07:24:05,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:24:05,349 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-15 07:24:05,349 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-15 07:24:05,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:24:05,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:24:05,352 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 38 states. [2022-04-15 07:24:05,352 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 38 states. [2022-04-15 07:24:05,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:24:05,359 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-15 07:24:05,359 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-15 07:24:05,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:24:05,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:24:05,361 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:24:05,361 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:24:05,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 07:24:05,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2022-04-15 07:24:05,363 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 17 [2022-04-15 07:24:05,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:24:05,364 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2022-04-15 07:24:05,364 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:24:05,364 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 37 transitions. [2022-04-15 07:24:05,410 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:24:05,410 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-04-15 07:24:05,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 07:24:05,411 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:24:05,411 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:24:05,447 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-15 07:24:05,624 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:24:05,624 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:24:05,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:24:05,625 INFO L85 PathProgramCache]: Analyzing trace with hash -253409975, now seen corresponding path program 1 times [2022-04-15 07:24:05,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:24:05,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1658367968] [2022-04-15 07:24:05,626 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:24:05,626 INFO L85 PathProgramCache]: Analyzing trace with hash -253409975, now seen corresponding path program 2 times [2022-04-15 07:24:05,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:24:05,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240585453] [2022-04-15 07:24:05,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:24:05,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:24:05,640 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:24:05,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1180210268] [2022-04-15 07:24:05,641 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:24:05,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:24:05,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:24:05,643 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-15 07:24:05,645 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-15 07:24:05,681 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:24:05,681 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:24:05,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-15 07:24:05,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:24:05,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:24:14,399 INFO L272 TraceCheckUtils]: 0: Hoare triple {533#true} call ULTIMATE.init(); {533#true} is VALID [2022-04-15 07:24:14,400 INFO L290 TraceCheckUtils]: 1: Hoare triple {533#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {533#true} is VALID [2022-04-15 07:24:14,400 INFO L290 TraceCheckUtils]: 2: Hoare triple {533#true} assume true; {533#true} is VALID [2022-04-15 07:24:14,400 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {533#true} {533#true} #76#return; {533#true} is VALID [2022-04-15 07:24:14,400 INFO L272 TraceCheckUtils]: 4: Hoare triple {533#true} call #t~ret6 := main(); {533#true} is VALID [2022-04-15 07:24:14,400 INFO L290 TraceCheckUtils]: 5: Hoare triple {533#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {533#true} is VALID [2022-04-15 07:24:14,401 INFO L272 TraceCheckUtils]: 6: Hoare triple {533#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {533#true} is VALID [2022-04-15 07:24:14,401 INFO L290 TraceCheckUtils]: 7: Hoare triple {533#true} ~cond := #in~cond; {559#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 07:24:14,402 INFO L290 TraceCheckUtils]: 8: Hoare triple {559#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {563#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:24:14,402 INFO L290 TraceCheckUtils]: 9: Hoare triple {563#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {563#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:24:14,403 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {563#(not (= |assume_abort_if_not_#in~cond| 0))} {533#true} #68#return; {570#(<= 1 main_~y~0)} is VALID [2022-04-15 07:24:14,403 INFO L290 TraceCheckUtils]: 11: Hoare triple {570#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {574#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-15 07:24:14,404 INFO L290 TraceCheckUtils]: 12: Hoare triple {574#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} assume !false; {574#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-15 07:24:14,404 INFO L272 TraceCheckUtils]: 13: Hoare triple {574#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {533#true} is VALID [2022-04-15 07:24:14,404 INFO L290 TraceCheckUtils]: 14: Hoare triple {533#true} ~cond := #in~cond; {584#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:24:14,405 INFO L290 TraceCheckUtils]: 15: Hoare triple {584#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {588#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:24:14,405 INFO L290 TraceCheckUtils]: 16: Hoare triple {588#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {588#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:24:16,417 WARN L284 TraceCheckUtils]: 17: Hoare quadruple {588#(not (= |__VERIFIER_assert_#in~cond| 0))} {574#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} #70#return; {595#(and (or (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~a~0 0))) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0)) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is UNKNOWN [2022-04-15 07:24:16,427 INFO L290 TraceCheckUtils]: 18: Hoare triple {595#(and (or (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~a~0 0))) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0)) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} assume !(0 != ~a~0 && 0 != ~b~0); {599#(and (= main_~q~0 (* main_~y~0 main_~x~0)) (<= 1 main_~y~0))} is VALID [2022-04-15 07:24:16,428 INFO L272 TraceCheckUtils]: 19: Hoare triple {599#(and (= main_~q~0 (* main_~y~0 main_~x~0)) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {603#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:24:16,429 INFO L290 TraceCheckUtils]: 20: Hoare triple {603#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {607#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:24:16,429 INFO L290 TraceCheckUtils]: 21: Hoare triple {607#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {534#false} is VALID [2022-04-15 07:24:16,429 INFO L290 TraceCheckUtils]: 22: Hoare triple {534#false} assume !false; {534#false} is VALID [2022-04-15 07:24:16,429 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 07:24:16,430 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:24:57,325 INFO L290 TraceCheckUtils]: 22: Hoare triple {534#false} assume !false; {534#false} is VALID [2022-04-15 07:24:57,326 INFO L290 TraceCheckUtils]: 21: Hoare triple {607#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {534#false} is VALID [2022-04-15 07:24:57,326 INFO L290 TraceCheckUtils]: 20: Hoare triple {603#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {607#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:24:57,327 INFO L272 TraceCheckUtils]: 19: Hoare triple {623#(= main_~q~0 (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {603#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:24:57,328 INFO L290 TraceCheckUtils]: 18: Hoare triple {627#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} assume !(0 != ~a~0 && 0 != ~b~0); {623#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-15 07:24:57,329 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {588#(not (= |__VERIFIER_assert_#in~cond| 0))} {533#true} #70#return; {627#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} is VALID [2022-04-15 07:24:57,329 INFO L290 TraceCheckUtils]: 16: Hoare triple {588#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {588#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:24:57,329 INFO L290 TraceCheckUtils]: 15: Hoare triple {640#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {588#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:24:57,330 INFO L290 TraceCheckUtils]: 14: Hoare triple {533#true} ~cond := #in~cond; {640#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:24:57,330 INFO L272 TraceCheckUtils]: 13: Hoare triple {533#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {533#true} is VALID [2022-04-15 07:24:57,330 INFO L290 TraceCheckUtils]: 12: Hoare triple {533#true} assume !false; {533#true} is VALID [2022-04-15 07:24:57,330 INFO L290 TraceCheckUtils]: 11: Hoare triple {533#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {533#true} is VALID [2022-04-15 07:24:57,330 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {533#true} {533#true} #68#return; {533#true} is VALID [2022-04-15 07:24:57,331 INFO L290 TraceCheckUtils]: 9: Hoare triple {533#true} assume true; {533#true} is VALID [2022-04-15 07:24:57,331 INFO L290 TraceCheckUtils]: 8: Hoare triple {533#true} assume !(0 == ~cond); {533#true} is VALID [2022-04-15 07:24:57,331 INFO L290 TraceCheckUtils]: 7: Hoare triple {533#true} ~cond := #in~cond; {533#true} is VALID [2022-04-15 07:24:57,331 INFO L272 TraceCheckUtils]: 6: Hoare triple {533#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {533#true} is VALID [2022-04-15 07:24:57,331 INFO L290 TraceCheckUtils]: 5: Hoare triple {533#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {533#true} is VALID [2022-04-15 07:24:57,331 INFO L272 TraceCheckUtils]: 4: Hoare triple {533#true} call #t~ret6 := main(); {533#true} is VALID [2022-04-15 07:24:57,331 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {533#true} {533#true} #76#return; {533#true} is VALID [2022-04-15 07:24:57,332 INFO L290 TraceCheckUtils]: 2: Hoare triple {533#true} assume true; {533#true} is VALID [2022-04-15 07:24:57,332 INFO L290 TraceCheckUtils]: 1: Hoare triple {533#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {533#true} is VALID [2022-04-15 07:24:57,332 INFO L272 TraceCheckUtils]: 0: Hoare triple {533#true} call ULTIMATE.init(); {533#true} is VALID [2022-04-15 07:24:57,332 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 07:24:57,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:24:57,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240585453] [2022-04-15 07:24:57,333 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:24:57,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180210268] [2022-04-15 07:24:57,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1180210268] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:24:57,333 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:24:57,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 15 [2022-04-15 07:24:57,333 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:24:57,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1658367968] [2022-04-15 07:24:57,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1658367968] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:24:57,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:24:57,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 07:24:57,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473311365] [2022-04-15 07:24:57,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:24:57,335 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 9 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-15 07:24:57,335 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:24:57,335 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 9 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 07:24:59,355 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 22 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 07:24:59,355 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 07:24:59,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:24:59,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 07:24:59,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-15 07:24:59,356 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 9 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 07:25:04,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:25:04,484 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2022-04-15 07:25:04,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 07:25:04,484 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 9 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-15 07:25:04,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:25:04,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 9 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 07:25:04,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 53 transitions. [2022-04-15 07:25:04,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 9 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 07:25:04,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 53 transitions. [2022-04-15 07:25:04,488 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 53 transitions. [2022-04-15 07:25:06,562 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 52 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 07:25:06,564 INFO L225 Difference]: With dead ends: 46 [2022-04-15 07:25:06,564 INFO L226 Difference]: Without dead ends: 44 [2022-04-15 07:25:06,564 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2022-04-15 07:25:06,565 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 36 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-15 07:25:06,565 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 88 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-04-15 07:25:06,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-15 07:25:06,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2022-04-15 07:25:06,619 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:25:06,620 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 42 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 07:25:06,620 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 42 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 07:25:06,621 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 42 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 07:25:06,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:25:06,627 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2022-04-15 07:25:06,627 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2022-04-15 07:25:06,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:25:06,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:25:06,627 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) Second operand 44 states. [2022-04-15 07:25:06,628 INFO L87 Difference]: Start difference. First operand has 42 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) Second operand 44 states. [2022-04-15 07:25:06,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:25:06,634 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2022-04-15 07:25:06,634 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2022-04-15 07:25:06,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:25:06,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:25:06,636 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:25:06,636 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:25:06,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 07:25:06,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2022-04-15 07:25:06,639 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 23 [2022-04-15 07:25:06,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:25:06,639 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2022-04-15 07:25:06,639 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 9 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 07:25:06,639 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 51 transitions. [2022-04-15 07:25:08,733 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 50 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 07:25:08,734 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2022-04-15 07:25:08,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 07:25:08,734 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:25:08,734 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:25:08,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-15 07:25:08,935 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,SelfDestructingSolverStorable2 [2022-04-15 07:25:08,936 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:25:08,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:25:08,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1855333828, now seen corresponding path program 1 times [2022-04-15 07:25:08,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:25:08,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1287055905] [2022-04-15 07:25:15,029 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:25:15,029 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 07:25:15,029 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 07:25:15,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1855333828, now seen corresponding path program 2 times [2022-04-15 07:25:15,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:25:15,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642304348] [2022-04-15 07:25:15,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:25:15,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:25:15,042 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:25:15,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [185134473] [2022-04-15 07:25:15,043 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:25:15,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:25:15,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:25:15,048 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-15 07:25:15,056 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-15 07:25:15,110 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:25:15,110 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:25:15,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-15 07:25:15,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:25:15,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:25:15,479 INFO L272 TraceCheckUtils]: 0: Hoare triple {957#true} call ULTIMATE.init(); {957#true} is VALID [2022-04-15 07:25:15,479 INFO L290 TraceCheckUtils]: 1: Hoare triple {957#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {957#true} is VALID [2022-04-15 07:25:15,479 INFO L290 TraceCheckUtils]: 2: Hoare triple {957#true} assume true; {957#true} is VALID [2022-04-15 07:25:15,479 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {957#true} {957#true} #76#return; {957#true} is VALID [2022-04-15 07:25:15,480 INFO L272 TraceCheckUtils]: 4: Hoare triple {957#true} call #t~ret6 := main(); {957#true} is VALID [2022-04-15 07:25:15,480 INFO L290 TraceCheckUtils]: 5: Hoare triple {957#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {957#true} is VALID [2022-04-15 07:25:15,480 INFO L272 TraceCheckUtils]: 6: Hoare triple {957#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {957#true} is VALID [2022-04-15 07:25:15,480 INFO L290 TraceCheckUtils]: 7: Hoare triple {957#true} ~cond := #in~cond; {957#true} is VALID [2022-04-15 07:25:15,480 INFO L290 TraceCheckUtils]: 8: Hoare triple {957#true} assume !(0 == ~cond); {957#true} is VALID [2022-04-15 07:25:15,480 INFO L290 TraceCheckUtils]: 9: Hoare triple {957#true} assume true; {957#true} is VALID [2022-04-15 07:25:15,480 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {957#true} {957#true} #68#return; {957#true} is VALID [2022-04-15 07:25:15,481 INFO L290 TraceCheckUtils]: 11: Hoare triple {957#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {995#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 07:25:15,481 INFO L290 TraceCheckUtils]: 12: Hoare triple {995#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {995#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 07:25:15,481 INFO L272 TraceCheckUtils]: 13: Hoare triple {995#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {957#true} is VALID [2022-04-15 07:25:15,481 INFO L290 TraceCheckUtils]: 14: Hoare triple {957#true} ~cond := #in~cond; {957#true} is VALID [2022-04-15 07:25:15,482 INFO L290 TraceCheckUtils]: 15: Hoare triple {957#true} assume !(0 == ~cond); {957#true} is VALID [2022-04-15 07:25:15,482 INFO L290 TraceCheckUtils]: 16: Hoare triple {957#true} assume true; {957#true} is VALID [2022-04-15 07:25:15,489 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {957#true} {995#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #70#return; {995#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 07:25:15,490 INFO L290 TraceCheckUtils]: 18: Hoare triple {995#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~a~0 && 0 != ~b~0); {995#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 07:25:15,491 INFO L290 TraceCheckUtils]: 19: Hoare triple {995#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {1020#(and (= (div main_~y~0 2) main_~b~0) (= (mod main_~y~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (= (div main_~x~0 2) main_~a~0) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 07:25:15,491 INFO L290 TraceCheckUtils]: 20: Hoare triple {1020#(and (= (div main_~y~0 2) main_~b~0) (= (mod main_~y~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (= (div main_~x~0 2) main_~a~0) (= (mod main_~x~0 2) 0))} assume !false; {1020#(and (= (div main_~y~0 2) main_~b~0) (= (mod main_~y~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (= (div main_~x~0 2) main_~a~0) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 07:25:15,494 INFO L272 TraceCheckUtils]: 21: Hoare triple {1020#(and (= (div main_~y~0 2) main_~b~0) (= (mod main_~y~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (= (div main_~x~0 2) main_~a~0) (= (mod main_~x~0 2) 0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1027#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:25:15,495 INFO L290 TraceCheckUtils]: 22: Hoare triple {1027#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1031#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:25:15,495 INFO L290 TraceCheckUtils]: 23: Hoare triple {1031#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {958#false} is VALID [2022-04-15 07:25:15,495 INFO L290 TraceCheckUtils]: 24: Hoare triple {958#false} assume !false; {958#false} is VALID [2022-04-15 07:25:15,496 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-15 07:25:15,496 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:25:31,811 INFO L290 TraceCheckUtils]: 24: Hoare triple {958#false} assume !false; {958#false} is VALID [2022-04-15 07:25:31,812 INFO L290 TraceCheckUtils]: 23: Hoare triple {1031#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {958#false} is VALID [2022-04-15 07:25:31,814 INFO L290 TraceCheckUtils]: 22: Hoare triple {1027#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1031#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:25:31,815 INFO L272 TraceCheckUtils]: 21: Hoare triple {1047#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1027#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:25:31,823 INFO L290 TraceCheckUtils]: 20: Hoare triple {1047#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !false; {1047#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-15 07:25:31,833 INFO L290 TraceCheckUtils]: 19: Hoare triple {1054#(or (not (= (mod main_~b~0 2) 0)) (= (+ (* (div main_~b~0 2) (* main_~p~0 4) (div main_~a~0 2)) main_~q~0) (* main_~y~0 main_~x~0)) (not (= (mod main_~a~0 2) 0)))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {1047#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-15 07:25:31,837 INFO L290 TraceCheckUtils]: 18: Hoare triple {1054#(or (not (= (mod main_~b~0 2) 0)) (= (+ (* (div main_~b~0 2) (* main_~p~0 4) (div main_~a~0 2)) main_~q~0) (* main_~y~0 main_~x~0)) (not (= (mod main_~a~0 2) 0)))} assume !!(0 != ~a~0 && 0 != ~b~0); {1054#(or (not (= (mod main_~b~0 2) 0)) (= (+ (* (div main_~b~0 2) (* main_~p~0 4) (div main_~a~0 2)) main_~q~0) (* main_~y~0 main_~x~0)) (not (= (mod main_~a~0 2) 0)))} is VALID [2022-04-15 07:25:31,837 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {957#true} {1054#(or (not (= (mod main_~b~0 2) 0)) (= (+ (* (div main_~b~0 2) (* main_~p~0 4) (div main_~a~0 2)) main_~q~0) (* main_~y~0 main_~x~0)) (not (= (mod main_~a~0 2) 0)))} #70#return; {1054#(or (not (= (mod main_~b~0 2) 0)) (= (+ (* (div main_~b~0 2) (* main_~p~0 4) (div main_~a~0 2)) main_~q~0) (* main_~y~0 main_~x~0)) (not (= (mod main_~a~0 2) 0)))} is VALID [2022-04-15 07:25:31,838 INFO L290 TraceCheckUtils]: 16: Hoare triple {957#true} assume true; {957#true} is VALID [2022-04-15 07:25:31,838 INFO L290 TraceCheckUtils]: 15: Hoare triple {957#true} assume !(0 == ~cond); {957#true} is VALID [2022-04-15 07:25:31,838 INFO L290 TraceCheckUtils]: 14: Hoare triple {957#true} ~cond := #in~cond; {957#true} is VALID [2022-04-15 07:25:31,838 INFO L272 TraceCheckUtils]: 13: Hoare triple {1054#(or (not (= (mod main_~b~0 2) 0)) (= (+ (* (div main_~b~0 2) (* main_~p~0 4) (div main_~a~0 2)) main_~q~0) (* main_~y~0 main_~x~0)) (not (= (mod main_~a~0 2) 0)))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {957#true} is VALID [2022-04-15 07:25:31,840 INFO L290 TraceCheckUtils]: 12: Hoare triple {1054#(or (not (= (mod main_~b~0 2) 0)) (= (+ (* (div main_~b~0 2) (* main_~p~0 4) (div main_~a~0 2)) main_~q~0) (* main_~y~0 main_~x~0)) (not (= (mod main_~a~0 2) 0)))} assume !false; {1054#(or (not (= (mod main_~b~0 2) 0)) (= (+ (* (div main_~b~0 2) (* main_~p~0 4) (div main_~a~0 2)) main_~q~0) (* main_~y~0 main_~x~0)) (not (= (mod main_~a~0 2) 0)))} is VALID [2022-04-15 07:25:31,842 INFO L290 TraceCheckUtils]: 11: Hoare triple {957#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {1054#(or (not (= (mod main_~b~0 2) 0)) (= (+ (* (div main_~b~0 2) (* main_~p~0 4) (div main_~a~0 2)) main_~q~0) (* main_~y~0 main_~x~0)) (not (= (mod main_~a~0 2) 0)))} is VALID [2022-04-15 07:25:31,842 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {957#true} {957#true} #68#return; {957#true} is VALID [2022-04-15 07:25:31,842 INFO L290 TraceCheckUtils]: 9: Hoare triple {957#true} assume true; {957#true} is VALID [2022-04-15 07:25:31,842 INFO L290 TraceCheckUtils]: 8: Hoare triple {957#true} assume !(0 == ~cond); {957#true} is VALID [2022-04-15 07:25:31,842 INFO L290 TraceCheckUtils]: 7: Hoare triple {957#true} ~cond := #in~cond; {957#true} is VALID [2022-04-15 07:25:31,843 INFO L272 TraceCheckUtils]: 6: Hoare triple {957#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {957#true} is VALID [2022-04-15 07:25:31,843 INFO L290 TraceCheckUtils]: 5: Hoare triple {957#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {957#true} is VALID [2022-04-15 07:25:31,843 INFO L272 TraceCheckUtils]: 4: Hoare triple {957#true} call #t~ret6 := main(); {957#true} is VALID [2022-04-15 07:25:31,843 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {957#true} {957#true} #76#return; {957#true} is VALID [2022-04-15 07:25:31,843 INFO L290 TraceCheckUtils]: 2: Hoare triple {957#true} assume true; {957#true} is VALID [2022-04-15 07:25:31,843 INFO L290 TraceCheckUtils]: 1: Hoare triple {957#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {957#true} is VALID [2022-04-15 07:25:31,843 INFO L272 TraceCheckUtils]: 0: Hoare triple {957#true} call ULTIMATE.init(); {957#true} is VALID [2022-04-15 07:25:31,844 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 07:25:31,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:25:31,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642304348] [2022-04-15 07:25:31,844 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:25:31,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185134473] [2022-04-15 07:25:31,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185134473] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 07:25:31,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 07:25:31,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2022-04-15 07:25:31,845 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:25:31,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1287055905] [2022-04-15 07:25:31,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1287055905] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:25:31,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:25:31,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 07:25:31,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103143001] [2022-04-15 07:25:31,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:25:31,846 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-04-15 07:25:31,846 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:25:31,846 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 07:25:31,876 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:25:31,877 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 07:25:31,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:25:31,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 07:25:31,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-04-15 07:25:31,878 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 07:25:32,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:25:32,273 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2022-04-15 07:25:32,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 07:25:32,273 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-04-15 07:25:32,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:25:32,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 07:25:32,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-15 07:25:32,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 07:25:32,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-15 07:25:32,276 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 36 transitions. [2022-04-15 07:25:32,351 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:25:32,353 INFO L225 Difference]: With dead ends: 48 [2022-04-15 07:25:32,353 INFO L226 Difference]: Without dead ends: 46 [2022-04-15 07:25:32,353 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-04-15 07:25:32,354 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 9 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 07:25:32,354 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 78 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 07:25:32,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-15 07:25:32,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-04-15 07:25:32,386 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:25:32,386 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 46 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 33 states have internal predecessors, (38), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 07:25:32,387 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 46 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 33 states have internal predecessors, (38), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 07:25:32,387 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 46 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 33 states have internal predecessors, (38), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 07:25:32,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:25:32,389 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2022-04-15 07:25:32,389 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2022-04-15 07:25:32,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:25:32,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:25:32,390 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 33 states have internal predecessors, (38), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) Second operand 46 states. [2022-04-15 07:25:32,390 INFO L87 Difference]: Start difference. First operand has 46 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 33 states have internal predecessors, (38), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) Second operand 46 states. [2022-04-15 07:25:32,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:25:32,392 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2022-04-15 07:25:32,392 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2022-04-15 07:25:32,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:25:32,393 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:25:32,393 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:25:32,393 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:25:32,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 33 states have internal predecessors, (38), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 07:25:32,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2022-04-15 07:25:32,395 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 25 [2022-04-15 07:25:32,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:25:32,395 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2022-04-15 07:25:32,396 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 07:25:32,396 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 54 transitions. [2022-04-15 07:25:34,591 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 53 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 07:25:34,592 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2022-04-15 07:25:34,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 07:25:34,592 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:25:34,592 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:25:34,608 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-15 07:25:34,793 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:25:34,793 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:25:34,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:25:34,794 INFO L85 PathProgramCache]: Analyzing trace with hash 642754736, now seen corresponding path program 1 times [2022-04-15 07:25:34,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:25:34,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [520343852] [2022-04-15 07:25:34,794 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:25:34,794 INFO L85 PathProgramCache]: Analyzing trace with hash 642754736, now seen corresponding path program 2 times [2022-04-15 07:25:34,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:25:34,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249819687] [2022-04-15 07:25:34,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:25:34,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:25:34,804 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:25:34,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1605271043] [2022-04-15 07:25:34,804 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:25:34,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:25:34,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:25:34,805 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-15 07:25:34,806 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-15 07:25:34,856 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:25:34,856 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:25:34,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 07:25:34,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:25:34,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:25:35,040 INFO L272 TraceCheckUtils]: 0: Hoare triple {1396#true} call ULTIMATE.init(); {1396#true} is VALID [2022-04-15 07:25:35,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {1396#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1396#true} is VALID [2022-04-15 07:25:35,041 INFO L290 TraceCheckUtils]: 2: Hoare triple {1396#true} assume true; {1396#true} is VALID [2022-04-15 07:25:35,041 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1396#true} {1396#true} #76#return; {1396#true} is VALID [2022-04-15 07:25:35,041 INFO L272 TraceCheckUtils]: 4: Hoare triple {1396#true} call #t~ret6 := main(); {1396#true} is VALID [2022-04-15 07:25:35,041 INFO L290 TraceCheckUtils]: 5: Hoare triple {1396#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1396#true} is VALID [2022-04-15 07:25:35,041 INFO L272 TraceCheckUtils]: 6: Hoare triple {1396#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1396#true} is VALID [2022-04-15 07:25:35,042 INFO L290 TraceCheckUtils]: 7: Hoare triple {1396#true} ~cond := #in~cond; {1422#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 07:25:35,042 INFO L290 TraceCheckUtils]: 8: Hoare triple {1422#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1426#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:25:35,043 INFO L290 TraceCheckUtils]: 9: Hoare triple {1426#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1426#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:25:35,043 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1426#(not (= |assume_abort_if_not_#in~cond| 0))} {1396#true} #68#return; {1433#(<= 1 main_~y~0)} is VALID [2022-04-15 07:25:35,044 INFO L290 TraceCheckUtils]: 11: Hoare triple {1433#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {1437#(<= 1 main_~b~0)} is VALID [2022-04-15 07:25:35,044 INFO L290 TraceCheckUtils]: 12: Hoare triple {1437#(<= 1 main_~b~0)} assume !false; {1437#(<= 1 main_~b~0)} is VALID [2022-04-15 07:25:35,045 INFO L272 TraceCheckUtils]: 13: Hoare triple {1437#(<= 1 main_~b~0)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1396#true} is VALID [2022-04-15 07:25:35,045 INFO L290 TraceCheckUtils]: 14: Hoare triple {1396#true} ~cond := #in~cond; {1396#true} is VALID [2022-04-15 07:25:35,045 INFO L290 TraceCheckUtils]: 15: Hoare triple {1396#true} assume !(0 == ~cond); {1396#true} is VALID [2022-04-15 07:25:35,045 INFO L290 TraceCheckUtils]: 16: Hoare triple {1396#true} assume true; {1396#true} is VALID [2022-04-15 07:25:35,046 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1396#true} {1437#(<= 1 main_~b~0)} #70#return; {1437#(<= 1 main_~b~0)} is VALID [2022-04-15 07:25:35,046 INFO L290 TraceCheckUtils]: 18: Hoare triple {1437#(<= 1 main_~b~0)} assume !(0 != ~a~0 && 0 != ~b~0); {1459#(and (= main_~a~0 0) (<= 1 main_~b~0))} is VALID [2022-04-15 07:25:35,047 INFO L272 TraceCheckUtils]: 19: Hoare triple {1459#(and (= main_~a~0 0) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {1396#true} is VALID [2022-04-15 07:25:35,047 INFO L290 TraceCheckUtils]: 20: Hoare triple {1396#true} ~cond := #in~cond; {1396#true} is VALID [2022-04-15 07:25:35,047 INFO L290 TraceCheckUtils]: 21: Hoare triple {1396#true} assume !(0 == ~cond); {1396#true} is VALID [2022-04-15 07:25:35,047 INFO L290 TraceCheckUtils]: 22: Hoare triple {1396#true} assume true; {1396#true} is VALID [2022-04-15 07:25:35,048 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1396#true} {1459#(and (= main_~a~0 0) (<= 1 main_~b~0))} #72#return; {1459#(and (= main_~a~0 0) (<= 1 main_~b~0))} is VALID [2022-04-15 07:25:35,048 INFO L272 TraceCheckUtils]: 24: Hoare triple {1459#(and (= main_~a~0 0) (<= 1 main_~b~0))} call __VERIFIER_assert((if 0 == ~a~0 * ~b~0 then 1 else 0)); {1478#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:25:35,049 INFO L290 TraceCheckUtils]: 25: Hoare triple {1478#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1482#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:25:35,049 INFO L290 TraceCheckUtils]: 26: Hoare triple {1482#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1397#false} is VALID [2022-04-15 07:25:35,049 INFO L290 TraceCheckUtils]: 27: Hoare triple {1397#false} assume !false; {1397#false} is VALID [2022-04-15 07:25:35,050 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 07:25:35,050 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 07:25:35,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:25:35,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249819687] [2022-04-15 07:25:35,050 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:25:35,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605271043] [2022-04-15 07:25:35,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1605271043] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:25:35,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:25:35,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 07:25:35,051 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:25:35,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [520343852] [2022-04-15 07:25:35,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [520343852] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:25:35,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:25:35,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 07:25:35,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444782730] [2022-04-15 07:25:35,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:25:35,052 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2022-04-15 07:25:35,052 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:25:35,052 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 07:25:35,073 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:25:35,073 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 07:25:35,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:25:35,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 07:25:35,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-04-15 07:25:35,074 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 07:25:35,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:25:35,429 INFO L93 Difference]: Finished difference Result 60 states and 73 transitions. [2022-04-15 07:25:35,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 07:25:35,429 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2022-04-15 07:25:35,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:25:35,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 07:25:35,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-15 07:25:35,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 07:25:35,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-15 07:25:35,432 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 50 transitions. [2022-04-15 07:25:35,472 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:25:35,473 INFO L225 Difference]: With dead ends: 60 [2022-04-15 07:25:35,473 INFO L226 Difference]: Without dead ends: 48 [2022-04-15 07:25:35,474 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-04-15 07:25:35,474 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 28 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:25:35,475 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 138 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 07:25:35,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-15 07:25:35,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2022-04-15 07:25:35,507 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:25:35,507 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 47 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 34 states have internal predecessors, (41), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 07:25:35,508 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 47 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 34 states have internal predecessors, (41), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 07:25:35,508 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 47 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 34 states have internal predecessors, (41), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 07:25:35,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:25:35,510 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2022-04-15 07:25:35,510 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2022-04-15 07:25:35,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:25:35,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:25:35,511 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 34 states have internal predecessors, (41), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 48 states. [2022-04-15 07:25:35,511 INFO L87 Difference]: Start difference. First operand has 47 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 34 states have internal predecessors, (41), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 48 states. [2022-04-15 07:25:35,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:25:35,513 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2022-04-15 07:25:35,513 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2022-04-15 07:25:35,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:25:35,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:25:35,513 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:25:35,514 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:25:35,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 34 states have internal predecessors, (41), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 07:25:35,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2022-04-15 07:25:35,516 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 28 [2022-04-15 07:25:35,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:25:35,516 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2022-04-15 07:25:35,516 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 07:25:35,516 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 58 transitions. [2022-04-15 07:25:37,726 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 57 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 07:25:37,726 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2022-04-15 07:25:37,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 07:25:37,727 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:25:37,727 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:25:37,743 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-15 07:25:37,927 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:25:37,928 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:25:37,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:25:37,928 INFO L85 PathProgramCache]: Analyzing trace with hash -171609494, now seen corresponding path program 1 times [2022-04-15 07:25:37,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:25:37,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1342427526] [2022-04-15 07:25:44,017 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:25:44,017 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 07:25:44,017 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 07:25:44,017 INFO L85 PathProgramCache]: Analyzing trace with hash -171609494, now seen corresponding path program 2 times [2022-04-15 07:25:44,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:25:44,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806349123] [2022-04-15 07:25:44,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:25:44,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:25:44,033 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:25:44,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2012974572] [2022-04-15 07:25:44,033 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:25:44,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:25:44,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:25:44,040 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-15 07:25:44,055 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-15 07:25:44,090 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:25:44,090 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:25:44,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-15 07:25:44,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:25:44,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:25:44,583 INFO L272 TraceCheckUtils]: 0: Hoare triple {1806#true} call ULTIMATE.init(); {1806#true} is VALID [2022-04-15 07:25:44,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {1806#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1806#true} is VALID [2022-04-15 07:25:44,584 INFO L290 TraceCheckUtils]: 2: Hoare triple {1806#true} assume true; {1806#true} is VALID [2022-04-15 07:25:44,584 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1806#true} {1806#true} #76#return; {1806#true} is VALID [2022-04-15 07:25:44,584 INFO L272 TraceCheckUtils]: 4: Hoare triple {1806#true} call #t~ret6 := main(); {1806#true} is VALID [2022-04-15 07:25:44,584 INFO L290 TraceCheckUtils]: 5: Hoare triple {1806#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1806#true} is VALID [2022-04-15 07:25:44,584 INFO L272 TraceCheckUtils]: 6: Hoare triple {1806#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1806#true} is VALID [2022-04-15 07:25:44,585 INFO L290 TraceCheckUtils]: 7: Hoare triple {1806#true} ~cond := #in~cond; {1832#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 07:25:44,585 INFO L290 TraceCheckUtils]: 8: Hoare triple {1832#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1836#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:25:44,586 INFO L290 TraceCheckUtils]: 9: Hoare triple {1836#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1836#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:25:44,586 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1836#(not (= |assume_abort_if_not_#in~cond| 0))} {1806#true} #68#return; {1843#(<= 1 main_~y~0)} is VALID [2022-04-15 07:25:44,587 INFO L290 TraceCheckUtils]: 11: Hoare triple {1843#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {1847#(<= 1 main_~b~0)} is VALID [2022-04-15 07:25:44,587 INFO L290 TraceCheckUtils]: 12: Hoare triple {1847#(<= 1 main_~b~0)} assume !false; {1847#(<= 1 main_~b~0)} is VALID [2022-04-15 07:25:44,587 INFO L272 TraceCheckUtils]: 13: Hoare triple {1847#(<= 1 main_~b~0)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1806#true} is VALID [2022-04-15 07:25:44,588 INFO L290 TraceCheckUtils]: 14: Hoare triple {1806#true} ~cond := #in~cond; {1806#true} is VALID [2022-04-15 07:25:44,588 INFO L290 TraceCheckUtils]: 15: Hoare triple {1806#true} assume !(0 == ~cond); {1806#true} is VALID [2022-04-15 07:25:44,588 INFO L290 TraceCheckUtils]: 16: Hoare triple {1806#true} assume true; {1806#true} is VALID [2022-04-15 07:25:44,589 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1806#true} {1847#(<= 1 main_~b~0)} #70#return; {1847#(<= 1 main_~b~0)} is VALID [2022-04-15 07:25:44,589 INFO L290 TraceCheckUtils]: 18: Hoare triple {1847#(<= 1 main_~b~0)} assume !!(0 != ~a~0 && 0 != ~b~0); {1869#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} is VALID [2022-04-15 07:25:44,590 INFO L290 TraceCheckUtils]: 19: Hoare triple {1869#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {1869#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} is VALID [2022-04-15 07:25:44,591 INFO L290 TraceCheckUtils]: 20: Hoare triple {1869#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} assume !false; {1869#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} is VALID [2022-04-15 07:25:44,591 INFO L272 TraceCheckUtils]: 21: Hoare triple {1869#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1806#true} is VALID [2022-04-15 07:25:44,591 INFO L290 TraceCheckUtils]: 22: Hoare triple {1806#true} ~cond := #in~cond; {1806#true} is VALID [2022-04-15 07:25:44,591 INFO L290 TraceCheckUtils]: 23: Hoare triple {1806#true} assume !(0 == ~cond); {1806#true} is VALID [2022-04-15 07:25:44,591 INFO L290 TraceCheckUtils]: 24: Hoare triple {1806#true} assume true; {1806#true} is VALID [2022-04-15 07:25:44,592 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {1806#true} {1869#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} #70#return; {1869#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} is VALID [2022-04-15 07:25:44,592 INFO L290 TraceCheckUtils]: 26: Hoare triple {1869#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} assume !(0 != ~a~0 && 0 != ~b~0); {1807#false} is VALID [2022-04-15 07:25:44,593 INFO L272 TraceCheckUtils]: 27: Hoare triple {1807#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {1807#false} is VALID [2022-04-15 07:25:44,593 INFO L290 TraceCheckUtils]: 28: Hoare triple {1807#false} ~cond := #in~cond; {1807#false} is VALID [2022-04-15 07:25:44,593 INFO L290 TraceCheckUtils]: 29: Hoare triple {1807#false} assume 0 == ~cond; {1807#false} is VALID [2022-04-15 07:25:44,593 INFO L290 TraceCheckUtils]: 30: Hoare triple {1807#false} assume !false; {1807#false} is VALID [2022-04-15 07:25:44,593 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 07:25:44,593 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 07:25:44,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:25:44,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806349123] [2022-04-15 07:25:44,594 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:25:44,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012974572] [2022-04-15 07:25:44,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2012974572] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:25:44,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:25:44,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 07:25:44,594 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:25:44,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1342427526] [2022-04-15 07:25:44,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1342427526] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:25:44,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:25:44,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 07:25:44,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604797362] [2022-04-15 07:25:44,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:25:44,595 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 31 [2022-04-15 07:25:44,596 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:25:44,596 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 07:25:44,618 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:25:44,618 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 07:25:44,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:25:44,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 07:25:44,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-15 07:25:44,619 INFO L87 Difference]: Start difference. First operand 47 states and 58 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 07:25:44,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:25:44,915 INFO L93 Difference]: Finished difference Result 58 states and 71 transitions. [2022-04-15 07:25:44,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 07:25:44,915 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 31 [2022-04-15 07:25:44,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:25:44,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 07:25:44,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 54 transitions. [2022-04-15 07:25:44,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 07:25:44,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 54 transitions. [2022-04-15 07:25:44,920 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 54 transitions. [2022-04-15 07:25:44,983 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:25:44,985 INFO L225 Difference]: With dead ends: 58 [2022-04-15 07:25:44,985 INFO L226 Difference]: Without dead ends: 51 [2022-04-15 07:25:44,985 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-04-15 07:25:44,987 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 20 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:25:44,987 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 109 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 07:25:44,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-15 07:25:45,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-04-15 07:25:45,034 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:25:45,034 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 50 states, 33 states have (on average 1.303030303030303) internal successors, (43), 36 states have internal predecessors, (43), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 07:25:45,034 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 50 states, 33 states have (on average 1.303030303030303) internal successors, (43), 36 states have internal predecessors, (43), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 07:25:45,035 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 50 states, 33 states have (on average 1.303030303030303) internal successors, (43), 36 states have internal predecessors, (43), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 07:25:45,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:25:45,037 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2022-04-15 07:25:45,037 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2022-04-15 07:25:45,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:25:45,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:25:45,037 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 33 states have (on average 1.303030303030303) internal successors, (43), 36 states have internal predecessors, (43), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 51 states. [2022-04-15 07:25:45,037 INFO L87 Difference]: Start difference. First operand has 50 states, 33 states have (on average 1.303030303030303) internal successors, (43), 36 states have internal predecessors, (43), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 51 states. [2022-04-15 07:25:45,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:25:45,039 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2022-04-15 07:25:45,039 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2022-04-15 07:25:45,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:25:45,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:25:45,040 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:25:45,040 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:25:45,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 33 states have (on average 1.303030303030303) internal successors, (43), 36 states have internal predecessors, (43), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 07:25:45,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2022-04-15 07:25:45,045 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 31 [2022-04-15 07:25:45,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:25:45,045 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2022-04-15 07:25:45,045 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 07:25:45,045 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 62 transitions. [2022-04-15 07:25:47,220 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 61 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 07:25:47,220 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-15 07:25:47,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 07:25:47,221 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:25:47,221 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:25:47,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-15 07:25:47,442 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:25:47,442 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:25:47,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:25:47,443 INFO L85 PathProgramCache]: Analyzing trace with hash 212948645, now seen corresponding path program 1 times [2022-04-15 07:25:47,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:25:47,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1616753105] [2022-04-15 07:25:53,569 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={2=2}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:25:53,610 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={2=2}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:25:55,452 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={2=2}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:25:55,504 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={2=2}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:25:55,553 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={2=2}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:25:57,162 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={2=2}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:25:57,164 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:25:57,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1189314404, now seen corresponding path program 1 times [2022-04-15 07:25:57,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:25:57,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407374464] [2022-04-15 07:25:57,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:25:57,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:25:57,179 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:25:57,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1096489695] [2022-04-15 07:25:57,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:25:57,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:25:57,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:25:57,187 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-15 07:25:57,191 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-15 07:25:57,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:25:57,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-15 07:25:57,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:25:57,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:26:09,095 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:26:09,957 INFO L272 TraceCheckUtils]: 0: Hoare triple {2229#true} call ULTIMATE.init(); {2229#true} is VALID [2022-04-15 07:26:09,957 INFO L290 TraceCheckUtils]: 1: Hoare triple {2229#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2229#true} is VALID [2022-04-15 07:26:09,957 INFO L290 TraceCheckUtils]: 2: Hoare triple {2229#true} assume true; {2229#true} is VALID [2022-04-15 07:26:09,958 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2229#true} {2229#true} #76#return; {2229#true} is VALID [2022-04-15 07:26:09,958 INFO L272 TraceCheckUtils]: 4: Hoare triple {2229#true} call #t~ret6 := main(); {2229#true} is VALID [2022-04-15 07:26:09,958 INFO L290 TraceCheckUtils]: 5: Hoare triple {2229#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2229#true} is VALID [2022-04-15 07:26:09,958 INFO L272 TraceCheckUtils]: 6: Hoare triple {2229#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2229#true} is VALID [2022-04-15 07:26:09,958 INFO L290 TraceCheckUtils]: 7: Hoare triple {2229#true} ~cond := #in~cond; {2255#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 07:26:09,959 INFO L290 TraceCheckUtils]: 8: Hoare triple {2255#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2259#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:26:09,959 INFO L290 TraceCheckUtils]: 9: Hoare triple {2259#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2259#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:26:09,960 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2259#(not (= |assume_abort_if_not_#in~cond| 0))} {2229#true} #68#return; {2266#(<= 1 main_~y~0)} is VALID [2022-04-15 07:26:09,960 INFO L290 TraceCheckUtils]: 11: Hoare triple {2266#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {2270#(and (<= 1 main_~p~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-15 07:26:09,961 INFO L290 TraceCheckUtils]: 12: Hoare triple {2270#(and (<= 1 main_~p~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} [80] L45-2-->L33_primed: Formula: (and (= v_main_~b~0_35 v_main_~b~0_34) (= v_main_~q~0_25 v_main_~q~0_24)) InVars {main_~b~0=v_main_~b~0_35, main_~q~0=v_main_~q~0_25} OutVars{main_~b~0=v_main_~b~0_34, main_~q~0=v_main_~q~0_24} AuxVars[] AssignedVars[main_~q~0, main_~b~0] {2270#(and (<= 1 main_~p~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-15 07:26:09,962 INFO L290 TraceCheckUtils]: 13: Hoare triple {2270#(and (<= 1 main_~p~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} [81] L33_primed-->L45-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2270#(and (<= 1 main_~p~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-15 07:26:09,962 INFO L290 TraceCheckUtils]: 14: Hoare triple {2270#(and (<= 1 main_~p~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} [82] L45-2-->L33_primed: Formula: (and (= v_main_~b~0_35 v_main_~b~0_34) (= v_main_~q~0_25 v_main_~q~0_24)) InVars {main_~b~0=v_main_~b~0_35, main_~q~0=v_main_~q~0_25} OutVars{main_~b~0=v_main_~b~0_34, main_~q~0=v_main_~q~0_24} AuxVars[] AssignedVars[main_~q~0, main_~b~0] {2270#(and (<= 1 main_~p~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-15 07:26:09,963 INFO L290 TraceCheckUtils]: 15: Hoare triple {2270#(and (<= 1 main_~p~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} [83] L33_primed-->L45-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2270#(and (<= 1 main_~p~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-15 07:26:09,965 INFO L290 TraceCheckUtils]: 16: Hoare triple {2270#(and (<= 1 main_~p~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} [84] L45-2-->L33_primed: Formula: (let ((.cse7 (+ v_main_~q~0_25 (* v_main_~p~0_25 v_main_~a~0_34 v_main_~b~0_35)))) (let ((.cse0 (= v_main_~b~0_35 v_main_~b~0_34)) (.cse1 (= v_main_~q~0_25 v_main_~q~0_24)) (.cse2 (= 0 v_main_~a~0_34)) (.cse3 (= (mod v_main_~a~0_34 2) 0)) (.cse6 (= (mod v_main_~b~0_35 2) 1)) (.cse5 (= (* v_main_~x~0_19 v_main_~y~0_23) .cse7)) (.cse4 (<= 0 v_main_~b~0_35))) (or (and (= v_main_~x~0_19 v_main_~x~0_19) .cse0 (= v_main_~p~0_25 v_main_~p~0_25) (= v_main_~y~0_23 v_main_~y~0_23) (= v_main_~a~0_34 v_main_~a~0_34) .cse1) (and .cse0 (or .cse2 (not .cse3) (not .cse4) (not .cse5) (not .cse6)) .cse1) (and (< v_main_~b~0_34 v_main_~b~0_35) (not .cse2) (= (+ v_main_~q~0_24 (* v_main_~p~0_25 v_main_~a~0_34 v_main_~b~0_34)) .cse7) .cse3 .cse6 .cse5 .cse4 (<= (+ (div v_main_~b~0_34 (- 2)) v_main_~b~0_35) (+ (div v_main_~b~0_35 2) 1)))))) InVars {main_~q~0=v_main_~q~0_25, main_~x~0=v_main_~x~0_19, main_~y~0=v_main_~y~0_23, main_~b~0=v_main_~b~0_35, main_~p~0=v_main_~p~0_25, main_~a~0=v_main_~a~0_34} OutVars{main_~q~0=v_main_~q~0_24, main_~x~0=v_main_~x~0_19, main_~y~0=v_main_~y~0_23, main_~b~0=v_main_~b~0_34, main_~p~0=v_main_~p~0_25, main_~a~0=v_main_~a~0_34} AuxVars[] AssignedVars[main_~q~0, main_~b~0] {2286#(and (<= 1 main_~p~0) (or (and (= (mod main_~a~0 2) 0) (exists ((aux_div_v_main_~b~0_56_22 Int)) (and (<= main_~y~0 (+ 1 (* 2 aux_div_v_main_~b~0_56_22))) (<= (+ (div main_~b~0 (- 2)) (* 2 aux_div_v_main_~b~0_56_22)) (div (+ 1 (* 2 aux_div_v_main_~b~0_56_22)) 2)))) (not (= main_~a~0 0))) (<= main_~y~0 main_~b~0)) (<= 1 main_~y~0))} is VALID [2022-04-15 07:26:09,966 INFO L290 TraceCheckUtils]: 17: Hoare triple {2286#(and (<= 1 main_~p~0) (or (and (= (mod main_~a~0 2) 0) (exists ((aux_div_v_main_~b~0_56_22 Int)) (and (<= main_~y~0 (+ 1 (* 2 aux_div_v_main_~b~0_56_22))) (<= (+ (div main_~b~0 (- 2)) (* 2 aux_div_v_main_~b~0_56_22)) (div (+ 1 (* 2 aux_div_v_main_~b~0_56_22)) 2)))) (not (= main_~a~0 0))) (<= main_~y~0 main_~b~0)) (<= 1 main_~y~0))} [85] L33_primed-->L45-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2286#(and (<= 1 main_~p~0) (or (and (= (mod main_~a~0 2) 0) (exists ((aux_div_v_main_~b~0_56_22 Int)) (and (<= main_~y~0 (+ 1 (* 2 aux_div_v_main_~b~0_56_22))) (<= (+ (div main_~b~0 (- 2)) (* 2 aux_div_v_main_~b~0_56_22)) (div (+ 1 (* 2 aux_div_v_main_~b~0_56_22)) 2)))) (not (= main_~a~0 0))) (<= main_~y~0 main_~b~0)) (<= 1 main_~y~0))} is VALID [2022-04-15 07:26:09,967 INFO L290 TraceCheckUtils]: 18: Hoare triple {2286#(and (<= 1 main_~p~0) (or (and (= (mod main_~a~0 2) 0) (exists ((aux_div_v_main_~b~0_56_22 Int)) (and (<= main_~y~0 (+ 1 (* 2 aux_div_v_main_~b~0_56_22))) (<= (+ (div main_~b~0 (- 2)) (* 2 aux_div_v_main_~b~0_56_22)) (div (+ 1 (* 2 aux_div_v_main_~b~0_56_22)) 2)))) (not (= main_~a~0 0))) (<= main_~y~0 main_~b~0)) (<= 1 main_~y~0))} [86] L45-2-->L33_primed: Formula: (and (= v_main_~b~0_35 v_main_~b~0_34) (= v_main_~q~0_25 v_main_~q~0_24)) InVars {main_~b~0=v_main_~b~0_35, main_~q~0=v_main_~q~0_25} OutVars{main_~b~0=v_main_~b~0_34, main_~q~0=v_main_~q~0_24} AuxVars[] AssignedVars[main_~q~0, main_~b~0] {2286#(and (<= 1 main_~p~0) (or (and (= (mod main_~a~0 2) 0) (exists ((aux_div_v_main_~b~0_56_22 Int)) (and (<= main_~y~0 (+ 1 (* 2 aux_div_v_main_~b~0_56_22))) (<= (+ (div main_~b~0 (- 2)) (* 2 aux_div_v_main_~b~0_56_22)) (div (+ 1 (* 2 aux_div_v_main_~b~0_56_22)) 2)))) (not (= main_~a~0 0))) (<= main_~y~0 main_~b~0)) (<= 1 main_~y~0))} is VALID [2022-04-15 07:26:09,968 INFO L290 TraceCheckUtils]: 19: Hoare triple {2286#(and (<= 1 main_~p~0) (or (and (= (mod main_~a~0 2) 0) (exists ((aux_div_v_main_~b~0_56_22 Int)) (and (<= main_~y~0 (+ 1 (* 2 aux_div_v_main_~b~0_56_22))) (<= (+ (div main_~b~0 (- 2)) (* 2 aux_div_v_main_~b~0_56_22)) (div (+ 1 (* 2 aux_div_v_main_~b~0_56_22)) 2)))) (not (= main_~a~0 0))) (<= main_~y~0 main_~b~0)) (<= 1 main_~y~0))} [87] L33_primed-->L45-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2286#(and (<= 1 main_~p~0) (or (and (= (mod main_~a~0 2) 0) (exists ((aux_div_v_main_~b~0_56_22 Int)) (and (<= main_~y~0 (+ 1 (* 2 aux_div_v_main_~b~0_56_22))) (<= (+ (div main_~b~0 (- 2)) (* 2 aux_div_v_main_~b~0_56_22)) (div (+ 1 (* 2 aux_div_v_main_~b~0_56_22)) 2)))) (not (= main_~a~0 0))) (<= main_~y~0 main_~b~0)) (<= 1 main_~y~0))} is VALID [2022-04-15 07:26:09,970 INFO L290 TraceCheckUtils]: 20: Hoare triple {2286#(and (<= 1 main_~p~0) (or (and (= (mod main_~a~0 2) 0) (exists ((aux_div_v_main_~b~0_56_22 Int)) (and (<= main_~y~0 (+ 1 (* 2 aux_div_v_main_~b~0_56_22))) (<= (+ (div main_~b~0 (- 2)) (* 2 aux_div_v_main_~b~0_56_22)) (div (+ 1 (* 2 aux_div_v_main_~b~0_56_22)) 2)))) (not (= main_~a~0 0))) (<= main_~y~0 main_~b~0)) (<= 1 main_~y~0))} [88] L45-2-->L33_primed: Formula: (and (= v_main_~b~0_35 v_main_~b~0_34) (= v_main_~q~0_25 v_main_~q~0_24)) InVars {main_~b~0=v_main_~b~0_35, main_~q~0=v_main_~q~0_25} OutVars{main_~b~0=v_main_~b~0_34, main_~q~0=v_main_~q~0_24} AuxVars[] AssignedVars[main_~q~0, main_~b~0] {2286#(and (<= 1 main_~p~0) (or (and (= (mod main_~a~0 2) 0) (exists ((aux_div_v_main_~b~0_56_22 Int)) (and (<= main_~y~0 (+ 1 (* 2 aux_div_v_main_~b~0_56_22))) (<= (+ (div main_~b~0 (- 2)) (* 2 aux_div_v_main_~b~0_56_22)) (div (+ 1 (* 2 aux_div_v_main_~b~0_56_22)) 2)))) (not (= main_~a~0 0))) (<= main_~y~0 main_~b~0)) (<= 1 main_~y~0))} is VALID [2022-04-15 07:26:09,971 INFO L290 TraceCheckUtils]: 21: Hoare triple {2286#(and (<= 1 main_~p~0) (or (and (= (mod main_~a~0 2) 0) (exists ((aux_div_v_main_~b~0_56_22 Int)) (and (<= main_~y~0 (+ 1 (* 2 aux_div_v_main_~b~0_56_22))) (<= (+ (div main_~b~0 (- 2)) (* 2 aux_div_v_main_~b~0_56_22)) (div (+ 1 (* 2 aux_div_v_main_~b~0_56_22)) 2)))) (not (= main_~a~0 0))) (<= main_~y~0 main_~b~0)) (<= 1 main_~y~0))} [89] L33_primed-->L45-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2286#(and (<= 1 main_~p~0) (or (and (= (mod main_~a~0 2) 0) (exists ((aux_div_v_main_~b~0_56_22 Int)) (and (<= main_~y~0 (+ 1 (* 2 aux_div_v_main_~b~0_56_22))) (<= (+ (div main_~b~0 (- 2)) (* 2 aux_div_v_main_~b~0_56_22)) (div (+ 1 (* 2 aux_div_v_main_~b~0_56_22)) 2)))) (not (= main_~a~0 0))) (<= main_~y~0 main_~b~0)) (<= 1 main_~y~0))} is VALID [2022-04-15 07:26:09,974 INFO L290 TraceCheckUtils]: 22: Hoare triple {2286#(and (<= 1 main_~p~0) (or (and (= (mod main_~a~0 2) 0) (exists ((aux_div_v_main_~b~0_56_22 Int)) (and (<= main_~y~0 (+ 1 (* 2 aux_div_v_main_~b~0_56_22))) (<= (+ (div main_~b~0 (- 2)) (* 2 aux_div_v_main_~b~0_56_22)) (div (+ 1 (* 2 aux_div_v_main_~b~0_56_22)) 2)))) (not (= main_~a~0 0))) (<= main_~y~0 main_~b~0)) (<= 1 main_~y~0))} [90] L45-2-->L33_primed: Formula: (let ((.cse7 (+ v_main_~q~0_25 (* v_main_~p~0_25 v_main_~a~0_34 v_main_~b~0_35)))) (let ((.cse0 (= v_main_~b~0_35 v_main_~b~0_34)) (.cse1 (= v_main_~q~0_25 v_main_~q~0_24)) (.cse2 (= 0 v_main_~a~0_34)) (.cse3 (= (mod v_main_~a~0_34 2) 0)) (.cse6 (= (mod v_main_~b~0_35 2) 1)) (.cse5 (= (* v_main_~x~0_19 v_main_~y~0_23) .cse7)) (.cse4 (<= 0 v_main_~b~0_35))) (or (and (= v_main_~x~0_19 v_main_~x~0_19) .cse0 (= v_main_~p~0_25 v_main_~p~0_25) (= v_main_~y~0_23 v_main_~y~0_23) (= v_main_~a~0_34 v_main_~a~0_34) .cse1) (and .cse0 (or .cse2 (not .cse3) (not .cse4) (not .cse5) (not .cse6)) .cse1) (and (< v_main_~b~0_34 v_main_~b~0_35) (not .cse2) (= (+ v_main_~q~0_24 (* v_main_~p~0_25 v_main_~a~0_34 v_main_~b~0_34)) .cse7) .cse3 .cse6 .cse5 .cse4 (<= (+ (div v_main_~b~0_34 (- 2)) v_main_~b~0_35) (+ (div v_main_~b~0_35 2) 1)))))) InVars {main_~q~0=v_main_~q~0_25, main_~x~0=v_main_~x~0_19, main_~y~0=v_main_~y~0_23, main_~b~0=v_main_~b~0_35, main_~p~0=v_main_~p~0_25, main_~a~0=v_main_~a~0_34} OutVars{main_~q~0=v_main_~q~0_24, main_~x~0=v_main_~x~0_19, main_~y~0=v_main_~y~0_23, main_~b~0=v_main_~b~0_34, main_~p~0=v_main_~p~0_25, main_~a~0=v_main_~a~0_34} AuxVars[] AssignedVars[main_~q~0, main_~b~0] {2286#(and (<= 1 main_~p~0) (or (and (= (mod main_~a~0 2) 0) (exists ((aux_div_v_main_~b~0_56_22 Int)) (and (<= main_~y~0 (+ 1 (* 2 aux_div_v_main_~b~0_56_22))) (<= (+ (div main_~b~0 (- 2)) (* 2 aux_div_v_main_~b~0_56_22)) (div (+ 1 (* 2 aux_div_v_main_~b~0_56_22)) 2)))) (not (= main_~a~0 0))) (<= main_~y~0 main_~b~0)) (<= 1 main_~y~0))} is VALID [2022-04-15 07:26:09,975 INFO L290 TraceCheckUtils]: 23: Hoare triple {2286#(and (<= 1 main_~p~0) (or (and (= (mod main_~a~0 2) 0) (exists ((aux_div_v_main_~b~0_56_22 Int)) (and (<= main_~y~0 (+ 1 (* 2 aux_div_v_main_~b~0_56_22))) (<= (+ (div main_~b~0 (- 2)) (* 2 aux_div_v_main_~b~0_56_22)) (div (+ 1 (* 2 aux_div_v_main_~b~0_56_22)) 2)))) (not (= main_~a~0 0))) (<= main_~y~0 main_~b~0)) (<= 1 main_~y~0))} [79] L33_primed-->L33: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2286#(and (<= 1 main_~p~0) (or (and (= (mod main_~a~0 2) 0) (exists ((aux_div_v_main_~b~0_56_22 Int)) (and (<= main_~y~0 (+ 1 (* 2 aux_div_v_main_~b~0_56_22))) (<= (+ (div main_~b~0 (- 2)) (* 2 aux_div_v_main_~b~0_56_22)) (div (+ 1 (* 2 aux_div_v_main_~b~0_56_22)) 2)))) (not (= main_~a~0 0))) (<= main_~y~0 main_~b~0)) (<= 1 main_~y~0))} is VALID [2022-04-15 07:26:09,975 INFO L272 TraceCheckUtils]: 24: Hoare triple {2286#(and (<= 1 main_~p~0) (or (and (= (mod main_~a~0 2) 0) (exists ((aux_div_v_main_~b~0_56_22 Int)) (and (<= main_~y~0 (+ 1 (* 2 aux_div_v_main_~b~0_56_22))) (<= (+ (div main_~b~0 (- 2)) (* 2 aux_div_v_main_~b~0_56_22)) (div (+ 1 (* 2 aux_div_v_main_~b~0_56_22)) 2)))) (not (= main_~a~0 0))) (<= main_~y~0 main_~b~0)) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {2229#true} is VALID [2022-04-15 07:26:09,976 INFO L290 TraceCheckUtils]: 25: Hoare triple {2229#true} ~cond := #in~cond; {2314#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:26:09,976 INFO L290 TraceCheckUtils]: 26: Hoare triple {2314#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2318#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:26:09,976 INFO L290 TraceCheckUtils]: 27: Hoare triple {2318#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2318#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:26:11,979 WARN L284 TraceCheckUtils]: 28: Hoare quadruple {2318#(not (= |__VERIFIER_assert_#in~cond| 0))} {2286#(and (<= 1 main_~p~0) (or (and (= (mod main_~a~0 2) 0) (exists ((aux_div_v_main_~b~0_56_22 Int)) (and (<= main_~y~0 (+ 1 (* 2 aux_div_v_main_~b~0_56_22))) (<= (+ (div main_~b~0 (- 2)) (* 2 aux_div_v_main_~b~0_56_22)) (div (+ 1 (* 2 aux_div_v_main_~b~0_56_22)) 2)))) (not (= main_~a~0 0))) (<= main_~y~0 main_~b~0)) (<= 1 main_~y~0))} #70#return; {2325#(and (or (and (= (mod main_~a~0 2) 0) (exists ((aux_div_v_main_~b~0_56_22 Int)) (and (<= main_~y~0 (+ 1 (* 2 aux_div_v_main_~b~0_56_22))) (<= (+ (div main_~b~0 (- 2)) (* 2 aux_div_v_main_~b~0_56_22)) (div (+ 1 (* 2 aux_div_v_main_~b~0_56_22)) 2)))) (not (= main_~a~0 0))) (<= main_~y~0 main_~b~0)) (or (and (= main_~a~0 0) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0)) (and (= main_~b~0 0) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0)) (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (<= 1 (div (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0))) (not (= main_~b~0 0)) (not (= main_~a~0 0)))) (<= 1 main_~y~0))} is UNKNOWN [2022-04-15 07:26:11,981 INFO L290 TraceCheckUtils]: 29: Hoare triple {2325#(and (or (and (= (mod main_~a~0 2) 0) (exists ((aux_div_v_main_~b~0_56_22 Int)) (and (<= main_~y~0 (+ 1 (* 2 aux_div_v_main_~b~0_56_22))) (<= (+ (div main_~b~0 (- 2)) (* 2 aux_div_v_main_~b~0_56_22)) (div (+ 1 (* 2 aux_div_v_main_~b~0_56_22)) 2)))) (not (= main_~a~0 0))) (<= main_~y~0 main_~b~0)) (or (and (= main_~a~0 0) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0)) (and (= main_~b~0 0) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0)) (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (<= 1 (div (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0))) (not (= main_~b~0 0)) (not (= main_~a~0 0)))) (<= 1 main_~y~0))} assume !(0 != ~a~0 && 0 != ~b~0); {2329#(and (= main_~q~0 (* main_~y~0 main_~x~0)) (<= 1 main_~y~0))} is VALID [2022-04-15 07:26:11,981 INFO L272 TraceCheckUtils]: 30: Hoare triple {2329#(and (= main_~q~0 (* main_~y~0 main_~x~0)) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {2333#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:26:11,982 INFO L290 TraceCheckUtils]: 31: Hoare triple {2333#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2337#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:26:11,982 INFO L290 TraceCheckUtils]: 32: Hoare triple {2337#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2230#false} is VALID [2022-04-15 07:26:11,982 INFO L290 TraceCheckUtils]: 33: Hoare triple {2230#false} assume !false; {2230#false} is VALID [2022-04-15 07:26:11,982 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-15 07:26:11,983 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:26:57,204 INFO L290 TraceCheckUtils]: 33: Hoare triple {2230#false} assume !false; {2230#false} is VALID [2022-04-15 07:26:57,205 INFO L290 TraceCheckUtils]: 32: Hoare triple {2337#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2230#false} is VALID [2022-04-15 07:26:57,205 INFO L290 TraceCheckUtils]: 31: Hoare triple {2333#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2337#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:26:57,206 INFO L272 TraceCheckUtils]: 30: Hoare triple {2353#(= main_~q~0 (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {2333#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:26:57,206 INFO L290 TraceCheckUtils]: 29: Hoare triple {2357#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} assume !(0 != ~a~0 && 0 != ~b~0); {2353#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-15 07:26:57,208 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2318#(not (= |__VERIFIER_assert_#in~cond| 0))} {2229#true} #70#return; {2357#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} is VALID [2022-04-15 07:26:57,208 INFO L290 TraceCheckUtils]: 27: Hoare triple {2318#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2318#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:26:57,209 INFO L290 TraceCheckUtils]: 26: Hoare triple {2370#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2318#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:26:57,209 INFO L290 TraceCheckUtils]: 25: Hoare triple {2229#true} ~cond := #in~cond; {2370#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:26:57,209 INFO L272 TraceCheckUtils]: 24: Hoare triple {2229#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {2229#true} is VALID [2022-04-15 07:26:57,209 INFO L290 TraceCheckUtils]: 23: Hoare triple {2229#true} [79] L33_primed-->L33: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2229#true} is VALID [2022-04-15 07:26:57,210 INFO L290 TraceCheckUtils]: 22: Hoare triple {2229#true} [90] L45-2-->L33_primed: Formula: (let ((.cse7 (+ v_main_~q~0_25 (* v_main_~p~0_25 v_main_~a~0_34 v_main_~b~0_35)))) (let ((.cse0 (= v_main_~b~0_35 v_main_~b~0_34)) (.cse1 (= v_main_~q~0_25 v_main_~q~0_24)) (.cse2 (= 0 v_main_~a~0_34)) (.cse3 (= (mod v_main_~a~0_34 2) 0)) (.cse6 (= (mod v_main_~b~0_35 2) 1)) (.cse5 (= (* v_main_~x~0_19 v_main_~y~0_23) .cse7)) (.cse4 (<= 0 v_main_~b~0_35))) (or (and (= v_main_~x~0_19 v_main_~x~0_19) .cse0 (= v_main_~p~0_25 v_main_~p~0_25) (= v_main_~y~0_23 v_main_~y~0_23) (= v_main_~a~0_34 v_main_~a~0_34) .cse1) (and .cse0 (or .cse2 (not .cse3) (not .cse4) (not .cse5) (not .cse6)) .cse1) (and (< v_main_~b~0_34 v_main_~b~0_35) (not .cse2) (= (+ v_main_~q~0_24 (* v_main_~p~0_25 v_main_~a~0_34 v_main_~b~0_34)) .cse7) .cse3 .cse6 .cse5 .cse4 (<= (+ (div v_main_~b~0_34 (- 2)) v_main_~b~0_35) (+ (div v_main_~b~0_35 2) 1)))))) InVars {main_~q~0=v_main_~q~0_25, main_~x~0=v_main_~x~0_19, main_~y~0=v_main_~y~0_23, main_~b~0=v_main_~b~0_35, main_~p~0=v_main_~p~0_25, main_~a~0=v_main_~a~0_34} OutVars{main_~q~0=v_main_~q~0_24, main_~x~0=v_main_~x~0_19, main_~y~0=v_main_~y~0_23, main_~b~0=v_main_~b~0_34, main_~p~0=v_main_~p~0_25, main_~a~0=v_main_~a~0_34} AuxVars[] AssignedVars[main_~q~0, main_~b~0] {2229#true} is VALID [2022-04-15 07:26:57,210 INFO L290 TraceCheckUtils]: 21: Hoare triple {2229#true} [89] L33_primed-->L45-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2229#true} is VALID [2022-04-15 07:26:57,210 INFO L290 TraceCheckUtils]: 20: Hoare triple {2229#true} [88] L45-2-->L33_primed: Formula: (and (= v_main_~b~0_35 v_main_~b~0_34) (= v_main_~q~0_25 v_main_~q~0_24)) InVars {main_~b~0=v_main_~b~0_35, main_~q~0=v_main_~q~0_25} OutVars{main_~b~0=v_main_~b~0_34, main_~q~0=v_main_~q~0_24} AuxVars[] AssignedVars[main_~q~0, main_~b~0] {2229#true} is VALID [2022-04-15 07:26:57,210 INFO L290 TraceCheckUtils]: 19: Hoare triple {2229#true} [87] L33_primed-->L45-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2229#true} is VALID [2022-04-15 07:26:57,210 INFO L290 TraceCheckUtils]: 18: Hoare triple {2229#true} [86] L45-2-->L33_primed: Formula: (and (= v_main_~b~0_35 v_main_~b~0_34) (= v_main_~q~0_25 v_main_~q~0_24)) InVars {main_~b~0=v_main_~b~0_35, main_~q~0=v_main_~q~0_25} OutVars{main_~b~0=v_main_~b~0_34, main_~q~0=v_main_~q~0_24} AuxVars[] AssignedVars[main_~q~0, main_~b~0] {2229#true} is VALID [2022-04-15 07:26:57,210 INFO L290 TraceCheckUtils]: 17: Hoare triple {2229#true} [85] L33_primed-->L45-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2229#true} is VALID [2022-04-15 07:26:57,211 INFO L290 TraceCheckUtils]: 16: Hoare triple {2229#true} [84] L45-2-->L33_primed: Formula: (let ((.cse7 (+ v_main_~q~0_25 (* v_main_~p~0_25 v_main_~a~0_34 v_main_~b~0_35)))) (let ((.cse0 (= v_main_~b~0_35 v_main_~b~0_34)) (.cse1 (= v_main_~q~0_25 v_main_~q~0_24)) (.cse2 (= 0 v_main_~a~0_34)) (.cse3 (= (mod v_main_~a~0_34 2) 0)) (.cse6 (= (mod v_main_~b~0_35 2) 1)) (.cse5 (= (* v_main_~x~0_19 v_main_~y~0_23) .cse7)) (.cse4 (<= 0 v_main_~b~0_35))) (or (and (= v_main_~x~0_19 v_main_~x~0_19) .cse0 (= v_main_~p~0_25 v_main_~p~0_25) (= v_main_~y~0_23 v_main_~y~0_23) (= v_main_~a~0_34 v_main_~a~0_34) .cse1) (and .cse0 (or .cse2 (not .cse3) (not .cse4) (not .cse5) (not .cse6)) .cse1) (and (< v_main_~b~0_34 v_main_~b~0_35) (not .cse2) (= (+ v_main_~q~0_24 (* v_main_~p~0_25 v_main_~a~0_34 v_main_~b~0_34)) .cse7) .cse3 .cse6 .cse5 .cse4 (<= (+ (div v_main_~b~0_34 (- 2)) v_main_~b~0_35) (+ (div v_main_~b~0_35 2) 1)))))) InVars {main_~q~0=v_main_~q~0_25, main_~x~0=v_main_~x~0_19, main_~y~0=v_main_~y~0_23, main_~b~0=v_main_~b~0_35, main_~p~0=v_main_~p~0_25, main_~a~0=v_main_~a~0_34} OutVars{main_~q~0=v_main_~q~0_24, main_~x~0=v_main_~x~0_19, main_~y~0=v_main_~y~0_23, main_~b~0=v_main_~b~0_34, main_~p~0=v_main_~p~0_25, main_~a~0=v_main_~a~0_34} AuxVars[] AssignedVars[main_~q~0, main_~b~0] {2229#true} is VALID [2022-04-15 07:26:57,211 INFO L290 TraceCheckUtils]: 15: Hoare triple {2229#true} [83] L33_primed-->L45-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2229#true} is VALID [2022-04-15 07:26:57,211 INFO L290 TraceCheckUtils]: 14: Hoare triple {2229#true} [82] L45-2-->L33_primed: Formula: (and (= v_main_~b~0_35 v_main_~b~0_34) (= v_main_~q~0_25 v_main_~q~0_24)) InVars {main_~b~0=v_main_~b~0_35, main_~q~0=v_main_~q~0_25} OutVars{main_~b~0=v_main_~b~0_34, main_~q~0=v_main_~q~0_24} AuxVars[] AssignedVars[main_~q~0, main_~b~0] {2229#true} is VALID [2022-04-15 07:26:57,211 INFO L290 TraceCheckUtils]: 13: Hoare triple {2229#true} [81] L33_primed-->L45-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2229#true} is VALID [2022-04-15 07:26:57,211 INFO L290 TraceCheckUtils]: 12: Hoare triple {2229#true} [80] L45-2-->L33_primed: Formula: (and (= v_main_~b~0_35 v_main_~b~0_34) (= v_main_~q~0_25 v_main_~q~0_24)) InVars {main_~b~0=v_main_~b~0_35, main_~q~0=v_main_~q~0_25} OutVars{main_~b~0=v_main_~b~0_34, main_~q~0=v_main_~q~0_24} AuxVars[] AssignedVars[main_~q~0, main_~b~0] {2229#true} is VALID [2022-04-15 07:26:57,211 INFO L290 TraceCheckUtils]: 11: Hoare triple {2229#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {2229#true} is VALID [2022-04-15 07:26:57,211 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2229#true} {2229#true} #68#return; {2229#true} is VALID [2022-04-15 07:26:57,212 INFO L290 TraceCheckUtils]: 9: Hoare triple {2229#true} assume true; {2229#true} is VALID [2022-04-15 07:26:57,212 INFO L290 TraceCheckUtils]: 8: Hoare triple {2229#true} assume !(0 == ~cond); {2229#true} is VALID [2022-04-15 07:26:57,212 INFO L290 TraceCheckUtils]: 7: Hoare triple {2229#true} ~cond := #in~cond; {2229#true} is VALID [2022-04-15 07:26:57,212 INFO L272 TraceCheckUtils]: 6: Hoare triple {2229#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2229#true} is VALID [2022-04-15 07:26:57,212 INFO L290 TraceCheckUtils]: 5: Hoare triple {2229#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2229#true} is VALID [2022-04-15 07:26:57,212 INFO L272 TraceCheckUtils]: 4: Hoare triple {2229#true} call #t~ret6 := main(); {2229#true} is VALID [2022-04-15 07:26:57,212 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2229#true} {2229#true} #76#return; {2229#true} is VALID [2022-04-15 07:26:57,212 INFO L290 TraceCheckUtils]: 2: Hoare triple {2229#true} assume true; {2229#true} is VALID [2022-04-15 07:26:57,213 INFO L290 TraceCheckUtils]: 1: Hoare triple {2229#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2229#true} is VALID [2022-04-15 07:26:57,213 INFO L272 TraceCheckUtils]: 0: Hoare triple {2229#true} call ULTIMATE.init(); {2229#true} is VALID [2022-04-15 07:26:57,213 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-15 07:26:57,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:26:57,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407374464] [2022-04-15 07:26:57,213 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:26:57,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096489695] [2022-04-15 07:26:57,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1096489695] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:26:57,214 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:26:57,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 16 [2022-04-15 07:26:59,776 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:26:59,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1616753105] [2022-04-15 07:26:59,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1616753105] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:26:59,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:26:59,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-15 07:26:59,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962083596] [2022-04-15 07:26:59,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:26:59,777 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 16 states have internal predecessors, (23), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 33 [2022-04-15 07:26:59,778 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:26:59,778 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 16 states have internal predecessors, (23), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 07:26:59,796 WARN L143 InductivityCheck]: Transition 2453#(and (= (mod (+ main_~b~0 1) 2) 1) (= (mod main_~a~0 2) 0) (<= 0 (+ main_~b~0 1)) (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0)) (not (= main_~a~0 0))) ( _ , assume !false; , 2286#(and (<= 1 main_~p~0) (or (and (= (mod main_~a~0 2) 0) (exists ((aux_div_v_main_~b~0_56_22 Int)) (and (<= main_~y~0 (+ 1 (* 2 aux_div_v_main_~b~0_56_22))) (<= (+ (div main_~b~0 (- 2)) (* 2 aux_div_v_main_~b~0_56_22)) (div (+ 1 (* 2 aux_div_v_main_~b~0_56_22)) 2)))) (not (= main_~a~0 0))) (<= main_~y~0 main_~b~0)) (<= 1 main_~y~0)) ) not inductive [2022-04-15 07:26:59,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-15 07:26:59,996 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:26:59,997 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: inductivity failed at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.checkInductivity(InductivityCheck.java:103) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.(InductivityCheck.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.constructInterpolantAutomaton(BasicCegarLoop.java:682) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.constructRefinementAutomaton(AbstractCegarLoop.java:547) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:261) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-15 07:27:00,000 INFO L158 Benchmark]: Toolchain (without parser) took 176586.53ms. Allocated memory was 178.3MB in the beginning and 246.4MB in the end (delta: 68.2MB). Free memory was 123.1MB in the beginning and 182.0MB in the end (delta: -59.0MB). Peak memory consumption was 9.9MB. Max. memory is 8.0GB. [2022-04-15 07:27:00,000 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 178.3MB. Free memory is still 139.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 07:27:00,001 INFO L158 Benchmark]: CACSL2BoogieTranslator took 239.15ms. Allocated memory was 178.3MB in the beginning and 246.4MB in the end (delta: 68.2MB). Free memory was 122.9MB in the beginning and 220.6MB in the end (delta: -97.7MB). Peak memory consumption was 14.0MB. Max. memory is 8.0GB. [2022-04-15 07:27:00,001 INFO L158 Benchmark]: Boogie Preprocessor took 24.69ms. Allocated memory is still 246.4MB. Free memory was 220.6MB in the beginning and 219.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 07:27:00,001 INFO L158 Benchmark]: RCFGBuilder took 280.23ms. Allocated memory is still 246.4MB. Free memory was 219.0MB in the beginning and 205.4MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-15 07:27:00,001 INFO L158 Benchmark]: TraceAbstraction took 176035.46ms. Allocated memory is still 246.4MB. Free memory was 204.9MB in the beginning and 182.0MB in the end (delta: 22.8MB). Peak memory consumption was 24.7MB. Max. memory is 8.0GB. [2022-04-15 07:27:00,002 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 178.3MB. Free memory is still 139.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 239.15ms. Allocated memory was 178.3MB in the beginning and 246.4MB in the end (delta: 68.2MB). Free memory was 122.9MB in the beginning and 220.6MB in the end (delta: -97.7MB). Peak memory consumption was 14.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.69ms. Allocated memory is still 246.4MB. Free memory was 220.6MB in the beginning and 219.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 280.23ms. Allocated memory is still 246.4MB. Free memory was 219.0MB in the beginning and 205.4MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 176035.46ms. Allocated memory is still 246.4MB. Free memory was 204.9MB in the beginning and 182.0MB in the end (delta: 22.8MB). Peak memory consumption was 24.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inductivity failed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inductivity failed: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-15 07:27:00,031 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...