/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-fb4f59a-m [2022-04-28 04:23:00,693 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 04:23:00,695 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 04:23:00,721 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 04:23:00,721 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 04:23:00,722 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 04:23:00,723 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 04:23:00,725 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 04:23:00,726 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 04:23:00,727 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 04:23:00,728 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 04:23:00,729 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 04:23:00,729 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 04:23:00,730 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 04:23:00,731 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 04:23:00,732 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 04:23:00,732 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 04:23:00,733 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 04:23:00,735 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 04:23:00,736 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 04:23:00,738 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 04:23:00,740 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 04:23:00,741 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 04:23:00,742 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 04:23:00,742 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 04:23:00,745 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 04:23:00,745 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 04:23:00,745 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 04:23:00,746 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 04:23:00,746 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 04:23:00,747 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 04:23:00,747 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 04:23:00,748 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 04:23:00,748 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 04:23:00,749 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 04:23:00,749 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 04:23:00,750 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 04:23:00,750 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 04:23:00,750 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 04:23:00,751 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 04:23:00,751 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 04:23:00,758 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 04:23:00,758 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 04:23:00,766 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 04:23:00,766 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 04:23:00,767 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 04:23:00,767 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 04:23:00,767 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 04:23:00,767 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 04:23:00,767 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 04:23:00,767 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 04:23:00,767 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 04:23:00,768 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 04:23:00,768 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 04:23:00,768 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 04:23:00,768 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 04:23:00,768 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 04:23:00,768 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 04:23:00,768 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 04:23:00,769 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 04:23:00,769 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 04:23:00,769 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 04:23:00,769 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 04:23:00,769 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 04:23:00,769 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 04:23:00,769 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 04:23:00,770 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 04:23:00,770 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 04:23:00,770 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-28 04:23:00,979 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 04:23:01,008 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 04:23:01,010 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 04:23:01,011 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 04:23:01,011 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 04:23:01,012 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-28 04:23:01,079 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c64e2a531/5ce48b281e6345e496d1090b76a8ea75/FLAG9454c8135 [2022-04-28 04:23:01,468 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 04:23:01,469 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/prod4br-ll.c [2022-04-28 04:23:01,477 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c64e2a531/5ce48b281e6345e496d1090b76a8ea75/FLAG9454c8135 [2022-04-28 04:23:01,867 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c64e2a531/5ce48b281e6345e496d1090b76a8ea75 [2022-04-28 04:23:01,869 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 04:23:01,871 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 04:23:01,875 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 04:23:01,875 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 04:23:01,879 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 04:23:01,880 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 04:23:01" (1/1) ... [2022-04-28 04:23:01,881 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@754d9c9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:23:01, skipping insertion in model container [2022-04-28 04:23:01,882 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 04:23:01" (1/1) ... [2022-04-28 04:23:01,887 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 04:23:01,897 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 04:23:02,048 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-28 04:23:02,066 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 04:23:02,073 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 04:23:02,083 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-28 04:23:02,091 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 04:23:02,102 INFO L208 MainTranslator]: Completed translation [2022-04-28 04:23:02,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:23:02 WrapperNode [2022-04-28 04:23:02,103 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 04:23:02,103 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 04:23:02,104 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 04:23:02,104 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 04:23:02,113 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:23:02" (1/1) ... [2022-04-28 04:23:02,113 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:23:02" (1/1) ... [2022-04-28 04:23:02,118 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:23:02" (1/1) ... [2022-04-28 04:23:02,118 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:23:02" (1/1) ... [2022-04-28 04:23:02,124 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:23:02" (1/1) ... [2022-04-28 04:23:02,127 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:23:02" (1/1) ... [2022-04-28 04:23:02,128 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:23:02" (1/1) ... [2022-04-28 04:23:02,130 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 04:23:02,130 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 04:23:02,130 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 04:23:02,131 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 04:23:02,131 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:23:02" (1/1) ... [2022-04-28 04:23:02,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 04:23:02,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:23:02,156 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-28 04:23:02,182 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-28 04:23:02,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 04:23:02,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 04:23:02,196 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 04:23:02,196 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 04:23:02,196 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 04:23:02,196 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 04:23:02,197 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 04:23:02,197 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 04:23:02,197 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 04:23:02,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 04:23:02,197 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 04:23:02,198 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 04:23:02,199 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 04:23:02,199 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 04:23:02,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 04:23:02,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 04:23:02,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 04:23:02,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 04:23:02,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 04:23:02,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 04:23:02,256 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 04:23:02,258 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 04:23:02,456 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 04:23:02,469 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 04:23:02,469 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 04:23:02,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 04:23:02 BoogieIcfgContainer [2022-04-28 04:23:02,471 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 04:23:02,472 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 04:23:02,472 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 04:23:02,488 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 04:23:02,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 04:23:01" (1/3) ... [2022-04-28 04:23:02,489 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13f6073c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 04:23:02, skipping insertion in model container [2022-04-28 04:23:02,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:23:02" (2/3) ... [2022-04-28 04:23:02,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13f6073c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 04:23:02, skipping insertion in model container [2022-04-28 04:23:02,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 04:23:02" (3/3) ... [2022-04-28 04:23:02,491 INFO L111 eAbstractionObserver]: Analyzing ICFG prod4br-ll.c [2022-04-28 04:23:02,502 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 04:23:02,503 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 04:23:02,583 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 04:23:02,592 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@166ae9fe, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1b0063f8 [2022-04-28 04:23:02,592 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 04:23:02,607 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-28 04:23:02,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 04:23:02,613 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:23:02,614 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:23:02,615 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:23:02,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:23:02,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1051010973, now seen corresponding path program 1 times [2022-04-28 04:23:02,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:23:02,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [416417915] [2022-04-28 04:23:02,639 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:23:02,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1051010973, now seen corresponding path program 2 times [2022-04-28 04:23:02,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:23:02,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829271558] [2022-04-28 04:23:02,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:23:02,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:23:02,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:23:02,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:23:02,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:23:02,846 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-28 04:23:02,846 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-28 04:23:02,846 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} #76#return; {34#true} is VALID [2022-04-28 04:23:02,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 04:23:02,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:23:02,871 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID [2022-04-28 04:23:02,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID [2022-04-28 04:23:02,872 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#false} assume true; {35#false} is VALID [2022-04-28 04:23:02,872 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#false} {34#true} #68#return; {35#false} is VALID [2022-04-28 04:23:02,874 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-28 04:23:02,875 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-28 04:23:02,875 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-28 04:23:02,875 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #76#return; {34#true} is VALID [2022-04-28 04:23:02,876 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret6 := main(); {34#true} is VALID [2022-04-28 04:23:02,876 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-28 04:23:02,876 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-28 04:23:02,876 INFO L290 TraceCheckUtils]: 7: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID [2022-04-28 04:23:02,877 INFO L290 TraceCheckUtils]: 8: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID [2022-04-28 04:23:02,878 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} assume true; {35#false} is VALID [2022-04-28 04:23:02,878 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {35#false} {34#true} #68#return; {35#false} is VALID [2022-04-28 04:23:02,878 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-28 04:23:02,879 INFO L290 TraceCheckUtils]: 12: Hoare triple {35#false} assume false; {35#false} is VALID [2022-04-28 04:23:02,879 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-28 04:23:02,879 INFO L290 TraceCheckUtils]: 14: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2022-04-28 04:23:02,881 INFO L290 TraceCheckUtils]: 15: Hoare triple {35#false} assume 0 == ~cond; {35#false} is VALID [2022-04-28 04:23:02,881 INFO L290 TraceCheckUtils]: 16: Hoare triple {35#false} assume !false; {35#false} is VALID [2022-04-28 04:23:02,882 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-28 04:23:02,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:23:02,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829271558] [2022-04-28 04:23:02,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829271558] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:23:02,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:23:02,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 04:23:02,886 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:23:02,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [416417915] [2022-04-28 04:23:02,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [416417915] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:23:02,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:23:02,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 04:23:02,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294297237] [2022-04-28 04:23:02,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:23:02,892 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-28 04:23:02,893 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:23:02,896 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-28 04:23:02,928 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-28 04:23:02,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 04:23:02,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:23:02,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 04:23:02,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 04:23:02,953 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-28 04:23:03,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:23:03,073 INFO L93 Difference]: Finished difference Result 53 states and 73 transitions. [2022-04-28 04:23:03,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 04:23:03,073 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-28 04:23:03,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:23:03,074 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-28 04:23:03,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2022-04-28 04:23:03,087 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-28 04:23:03,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2022-04-28 04:23:03,094 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 73 transitions. [2022-04-28 04:23:03,225 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-28 04:23:03,232 INFO L225 Difference]: With dead ends: 53 [2022-04-28 04:23:03,232 INFO L226 Difference]: Without dead ends: 26 [2022-04-28 04:23:03,235 INFO L412 NwaCegarLoop]: 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-28 04:23:03,237 INFO L413 NwaCegarLoop]: 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-28 04:23:03,241 INFO L414 NwaCegarLoop]: 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-28 04:23:03,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-28 04:23:03,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-28 04:23:03,278 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:23:03,279 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-28 04:23:03,280 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-28 04:23:03,281 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-28 04:23:03,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:23:03,291 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-04-28 04:23:03,291 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-28 04:23:03,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:23:03,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:23:03,292 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-28 04:23:03,293 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-28 04:23:03,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:23:03,296 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-04-28 04:23:03,296 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-28 04:23:03,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:23:03,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:23:03,296 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:23:03,297 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:23:03,298 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-28 04:23:03,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2022-04-28 04:23:03,302 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 17 [2022-04-28 04:23:03,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:23:03,302 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2022-04-28 04:23:03,303 INFO L496 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-28 04:23:03,303 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 31 transitions. [2022-04-28 04:23:03,341 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-28 04:23:03,341 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-28 04:23:03,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 04:23:03,342 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:23:03,342 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:23:03,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 04:23:03,343 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:23:03,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:23:03,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1732856803, now seen corresponding path program 1 times [2022-04-28 04:23:03,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:23:03,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [44692559] [2022-04-28 04:23:03,346 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:23:03,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1732856803, now seen corresponding path program 2 times [2022-04-28 04:23:03,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:23:03,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623164647] [2022-04-28 04:23:03,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:23:03,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:23:03,382 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:23:03,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1795306512] [2022-04-28 04:23:03,383 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:23:03,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:23:03,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:23:03,387 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-28 04:23:03,392 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-28 04:23:03,431 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 04:23:03,432 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:23:03,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 04:23:03,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:23:03,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:23:03,660 INFO L272 TraceCheckUtils]: 0: Hoare triple {256#true} call ULTIMATE.init(); {256#true} is VALID [2022-04-28 04:23:03,660 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-28 04:23:03,660 INFO L290 TraceCheckUtils]: 2: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-28 04:23:03,660 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {256#true} {256#true} #76#return; {256#true} is VALID [2022-04-28 04:23:03,660 INFO L272 TraceCheckUtils]: 4: Hoare triple {256#true} call #t~ret6 := main(); {256#true} is VALID [2022-04-28 04:23:03,661 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-28 04:23:03,661 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-28 04:23:03,661 INFO L290 TraceCheckUtils]: 7: Hoare triple {256#true} ~cond := #in~cond; {256#true} is VALID [2022-04-28 04:23:03,661 INFO L290 TraceCheckUtils]: 8: Hoare triple {256#true} assume !(0 == ~cond); {256#true} is VALID [2022-04-28 04:23:03,661 INFO L290 TraceCheckUtils]: 9: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-28 04:23:03,662 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {256#true} {256#true} #68#return; {256#true} is VALID [2022-04-28 04:23:03,662 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-28 04:23:03,663 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-28 04:23:03,664 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-28 04:23:03,664 INFO L290 TraceCheckUtils]: 14: Hoare triple {301#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {305#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:23:03,665 INFO L290 TraceCheckUtils]: 15: Hoare triple {305#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {257#false} is VALID [2022-04-28 04:23:03,665 INFO L290 TraceCheckUtils]: 16: Hoare triple {257#false} assume !false; {257#false} is VALID [2022-04-28 04:23:03,665 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-28 04:23:03,665 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 04:23:03,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:23:03,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623164647] [2022-04-28 04:23:03,666 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:23:03,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795306512] [2022-04-28 04:23:03,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1795306512] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:23:03,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:23:03,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:23:03,667 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:23:03,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [44692559] [2022-04-28 04:23:03,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [44692559] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:23:03,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:23:03,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:23:03,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264647093] [2022-04-28 04:23:03,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:23:03,668 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-28 04:23:03,669 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:23:03,669 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-28 04:23:03,684 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-28 04:23:03,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 04:23:03,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:23:03,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 04:23:03,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 04:23:03,686 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-28 04:23:03,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:23:03,910 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-28 04:23:03,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 04:23:03,911 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-28 04:23:03,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:23:03,911 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-28 04:23:03,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-28 04:23:03,914 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-28 04:23:03,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-28 04:23:03,916 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 50 transitions. [2022-04-28 04:23:03,968 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-28 04:23:03,973 INFO L225 Difference]: With dead ends: 40 [2022-04-28 04:23:03,973 INFO L226 Difference]: Without dead ends: 38 [2022-04-28 04:23:03,974 INFO L412 NwaCegarLoop]: 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-28 04:23:03,976 INFO L413 NwaCegarLoop]: 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-28 04:23:03,981 INFO L414 NwaCegarLoop]: 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-28 04:23:03,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-28 04:23:04,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2022-04-28 04:23:04,005 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:23:04,005 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-28 04:23:04,006 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-28 04:23:04,007 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-28 04:23:04,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:23:04,013 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-28 04:23:04,014 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-28 04:23:04,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:23:04,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:23:04,018 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-28 04:23:04,018 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-28 04:23:04,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:23:04,021 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-28 04:23:04,021 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-28 04:23:04,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:23:04,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:23:04,022 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:23:04,022 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:23:04,022 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-28 04:23:04,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2022-04-28 04:23:04,024 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 17 [2022-04-28 04:23:04,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:23:04,024 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2022-04-28 04:23:04,024 INFO L496 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-28 04:23:04,024 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 37 transitions. [2022-04-28 04:23:04,077 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-28 04:23:04,077 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-04-28 04:23:04,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 04:23:04,078 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:23:04,078 INFO L195 NwaCegarLoop]: 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-28 04:23:04,102 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-28 04:23:04,293 WARN L477 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-28 04:23:04,294 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:23:04,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:23:04,294 INFO L85 PathProgramCache]: Analyzing trace with hash -253409975, now seen corresponding path program 1 times [2022-04-28 04:23:04,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:23:04,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1427656095] [2022-04-28 04:23:04,295 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:23:04,295 INFO L85 PathProgramCache]: Analyzing trace with hash -253409975, now seen corresponding path program 2 times [2022-04-28 04:23:04,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:23:04,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282555179] [2022-04-28 04:23:04,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:23:04,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:23:04,311 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:23:04,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1413324458] [2022-04-28 04:23:04,312 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:23:04,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:23:04,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:23:04,314 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-28 04:23:04,342 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-28 04:23:04,366 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:23:04,367 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:23:04,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 04:23:04,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:23:04,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:23:13,080 INFO L272 TraceCheckUtils]: 0: Hoare triple {533#true} call ULTIMATE.init(); {533#true} is VALID [2022-04-28 04:23:13,080 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-28 04:23:13,081 INFO L290 TraceCheckUtils]: 2: Hoare triple {533#true} assume true; {533#true} is VALID [2022-04-28 04:23:13,081 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {533#true} {533#true} #76#return; {533#true} is VALID [2022-04-28 04:23:13,081 INFO L272 TraceCheckUtils]: 4: Hoare triple {533#true} call #t~ret6 := main(); {533#true} is VALID [2022-04-28 04:23:13,081 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-28 04:23:13,081 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-28 04:23:13,083 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-28 04:23:13,083 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-28 04:23:13,087 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-28 04:23:13,088 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-28 04:23:13,088 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-28 04:23:13,089 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-28 04:23:13,089 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-28 04:23:13,089 INFO L290 TraceCheckUtils]: 14: Hoare triple {533#true} ~cond := #in~cond; {584#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:23:13,090 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-28 04:23:13,090 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-28 04:23:15,093 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-28 04:23:15,095 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-28 04:23:15,096 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-28 04:23:15,096 INFO L290 TraceCheckUtils]: 20: Hoare triple {603#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {607#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:23:15,097 INFO L290 TraceCheckUtils]: 21: Hoare triple {607#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {534#false} is VALID [2022-04-28 04:23:15,097 INFO L290 TraceCheckUtils]: 22: Hoare triple {534#false} assume !false; {534#false} is VALID [2022-04-28 04:23:15,097 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-28 04:23:15,097 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:23:53,966 INFO L290 TraceCheckUtils]: 22: Hoare triple {534#false} assume !false; {534#false} is VALID [2022-04-28 04:23:53,967 INFO L290 TraceCheckUtils]: 21: Hoare triple {607#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {534#false} is VALID [2022-04-28 04:23:53,967 INFO L290 TraceCheckUtils]: 20: Hoare triple {603#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {607#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:23:53,968 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-28 04:23:53,969 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-28 04:23:53,971 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-28 04:23:53,971 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-28 04:23:53,972 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-28 04:23:53,972 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-28 04:23:53,973 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-28 04:23:53,973 INFO L290 TraceCheckUtils]: 12: Hoare triple {533#true} assume !false; {533#true} is VALID [2022-04-28 04:23:53,973 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-28 04:23:53,973 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {533#true} {533#true} #68#return; {533#true} is VALID [2022-04-28 04:23:53,973 INFO L290 TraceCheckUtils]: 9: Hoare triple {533#true} assume true; {533#true} is VALID [2022-04-28 04:23:53,974 INFO L290 TraceCheckUtils]: 8: Hoare triple {533#true} assume !(0 == ~cond); {533#true} is VALID [2022-04-28 04:23:53,974 INFO L290 TraceCheckUtils]: 7: Hoare triple {533#true} ~cond := #in~cond; {533#true} is VALID [2022-04-28 04:23:53,974 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-28 04:23:53,974 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-28 04:23:53,974 INFO L272 TraceCheckUtils]: 4: Hoare triple {533#true} call #t~ret6 := main(); {533#true} is VALID [2022-04-28 04:23:53,975 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {533#true} {533#true} #76#return; {533#true} is VALID [2022-04-28 04:23:53,975 INFO L290 TraceCheckUtils]: 2: Hoare triple {533#true} assume true; {533#true} is VALID [2022-04-28 04:23:53,975 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-28 04:23:53,975 INFO L272 TraceCheckUtils]: 0: Hoare triple {533#true} call ULTIMATE.init(); {533#true} is VALID [2022-04-28 04:23:53,975 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-28 04:23:53,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:23:53,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282555179] [2022-04-28 04:23:53,976 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:23:53,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413324458] [2022-04-28 04:23:53,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413324458] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:23:53,976 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 04:23:53,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 15 [2022-04-28 04:23:53,977 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:23:53,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1427656095] [2022-04-28 04:23:53,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1427656095] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:23:53,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:23:53,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 04:23:53,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169489289] [2022-04-28 04:23:53,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:23:53,978 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-28 04:23:53,978 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:23:53,978 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-28 04:23:55,998 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-28 04:23:55,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 04:23:55,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:23:55,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 04:23:55,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-28 04:23:55,999 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-28 04:23:58,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:23:58,671 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2022-04-28 04:23:58,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 04:23:58,672 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-28 04:23:58,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:23:58,672 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-28 04:23:58,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 53 transitions. [2022-04-28 04:23:58,675 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-28 04:23:58,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 53 transitions. [2022-04-28 04:23:58,677 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 53 transitions. [2022-04-28 04:24:00,729 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-28 04:24:00,730 INFO L225 Difference]: With dead ends: 46 [2022-04-28 04:24:00,730 INFO L226 Difference]: Without dead ends: 44 [2022-04-28 04:24:00,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2022-04-28 04:24:00,732 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 36 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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, 1.2s IncrementalHoareTripleChecker+Time [2022-04-28 04:24:00,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 88 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-28 04:24:00,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-28 04:24:00,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2022-04-28 04:24:00,764 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:24:00,764 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-28 04:24:00,764 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-28 04:24:00,765 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-28 04:24:00,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:24:00,767 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2022-04-28 04:24:00,767 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2022-04-28 04:24:00,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:24:00,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:24:00,769 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-28 04:24:00,769 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-28 04:24:00,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:24:00,771 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2022-04-28 04:24:00,772 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2022-04-28 04:24:00,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:24:00,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:24:00,772 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:24:00,772 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:24:00,773 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-28 04:24:00,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2022-04-28 04:24:00,775 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 23 [2022-04-28 04:24:00,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:24:00,775 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2022-04-28 04:24:00,775 INFO L496 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-28 04:24:00,776 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 51 transitions. [2022-04-28 04:24:02,842 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-28 04:24:02,842 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2022-04-28 04:24:02,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 04:24:02,843 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:24:02,843 INFO L195 NwaCegarLoop]: 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-28 04:24:02,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 04:24:03,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-28 04:24:03,048 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:24:03,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:24:03,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1855333828, now seen corresponding path program 1 times [2022-04-28 04:24:03,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:24:03,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [535201388] [2022-04-28 04:24:09,154 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:24:09,155 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 04:24:09,155 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:24:09,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1855333828, now seen corresponding path program 2 times [2022-04-28 04:24:09,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:24:09,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33986905] [2022-04-28 04:24:09,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:24:09,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:24:09,167 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:24:09,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [622000818] [2022-04-28 04:24:09,168 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:24:09,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:24:09,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:24:09,169 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-28 04:24:09,181 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-28 04:24:09,241 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:24:09,241 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:24:09,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 04:24:09,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:24:09,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:24:09,591 INFO L272 TraceCheckUtils]: 0: Hoare triple {957#true} call ULTIMATE.init(); {957#true} is VALID [2022-04-28 04:24:09,592 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-28 04:24:09,592 INFO L290 TraceCheckUtils]: 2: Hoare triple {957#true} assume true; {957#true} is VALID [2022-04-28 04:24:09,592 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {957#true} {957#true} #76#return; {957#true} is VALID [2022-04-28 04:24:09,592 INFO L272 TraceCheckUtils]: 4: Hoare triple {957#true} call #t~ret6 := main(); {957#true} is VALID [2022-04-28 04:24:09,592 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-28 04:24:09,592 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-28 04:24:09,593 INFO L290 TraceCheckUtils]: 7: Hoare triple {957#true} ~cond := #in~cond; {957#true} is VALID [2022-04-28 04:24:09,593 INFO L290 TraceCheckUtils]: 8: Hoare triple {957#true} assume !(0 == ~cond); {957#true} is VALID [2022-04-28 04:24:09,593 INFO L290 TraceCheckUtils]: 9: Hoare triple {957#true} assume true; {957#true} is VALID [2022-04-28 04:24:09,593 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {957#true} {957#true} #68#return; {957#true} is VALID [2022-04-28 04:24:09,594 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-28 04:24:09,594 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-28 04:24:09,594 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-28 04:24:09,595 INFO L290 TraceCheckUtils]: 14: Hoare triple {957#true} ~cond := #in~cond; {957#true} is VALID [2022-04-28 04:24:09,597 INFO L290 TraceCheckUtils]: 15: Hoare triple {957#true} assume !(0 == ~cond); {957#true} is VALID [2022-04-28 04:24:09,598 INFO L290 TraceCheckUtils]: 16: Hoare triple {957#true} assume true; {957#true} is VALID [2022-04-28 04:24:09,598 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-28 04:24:09,599 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-28 04:24:09,600 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-28 04:24:09,601 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-28 04:24:09,605 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-28 04:24:09,606 INFO L290 TraceCheckUtils]: 22: Hoare triple {1027#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1031#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:24:09,606 INFO L290 TraceCheckUtils]: 23: Hoare triple {1031#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {958#false} is VALID [2022-04-28 04:24:09,606 INFO L290 TraceCheckUtils]: 24: Hoare triple {958#false} assume !false; {958#false} is VALID [2022-04-28 04:24:09,607 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-28 04:24:09,607 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:24:25,332 INFO L290 TraceCheckUtils]: 24: Hoare triple {958#false} assume !false; {958#false} is VALID [2022-04-28 04:24:25,335 INFO L290 TraceCheckUtils]: 23: Hoare triple {1031#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {958#false} is VALID [2022-04-28 04:24:25,335 INFO L290 TraceCheckUtils]: 22: Hoare triple {1027#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1031#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:24:25,337 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-28 04:24:25,337 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-28 04:24:25,343 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-28 04:24:25,344 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-28 04:24:25,345 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-28 04:24:25,347 INFO L290 TraceCheckUtils]: 16: Hoare triple {957#true} assume true; {957#true} is VALID [2022-04-28 04:24:25,347 INFO L290 TraceCheckUtils]: 15: Hoare triple {957#true} assume !(0 == ~cond); {957#true} is VALID [2022-04-28 04:24:25,356 INFO L290 TraceCheckUtils]: 14: Hoare triple {957#true} ~cond := #in~cond; {957#true} is VALID [2022-04-28 04:24:25,356 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-28 04:24:25,361 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-28 04:24:25,365 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-28 04:24:25,365 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {957#true} {957#true} #68#return; {957#true} is VALID [2022-04-28 04:24:25,365 INFO L290 TraceCheckUtils]: 9: Hoare triple {957#true} assume true; {957#true} is VALID [2022-04-28 04:24:25,365 INFO L290 TraceCheckUtils]: 8: Hoare triple {957#true} assume !(0 == ~cond); {957#true} is VALID [2022-04-28 04:24:25,365 INFO L290 TraceCheckUtils]: 7: Hoare triple {957#true} ~cond := #in~cond; {957#true} is VALID [2022-04-28 04:24:25,365 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-28 04:24:25,366 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-28 04:24:25,366 INFO L272 TraceCheckUtils]: 4: Hoare triple {957#true} call #t~ret6 := main(); {957#true} is VALID [2022-04-28 04:24:25,366 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {957#true} {957#true} #76#return; {957#true} is VALID [2022-04-28 04:24:25,366 INFO L290 TraceCheckUtils]: 2: Hoare triple {957#true} assume true; {957#true} is VALID [2022-04-28 04:24:25,366 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-28 04:24:25,366 INFO L272 TraceCheckUtils]: 0: Hoare triple {957#true} call ULTIMATE.init(); {957#true} is VALID [2022-04-28 04:24:25,367 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-28 04:24:25,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:24:25,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33986905] [2022-04-28 04:24:25,367 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:24:25,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622000818] [2022-04-28 04:24:25,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622000818] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 04:24:25,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 04:24:25,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2022-04-28 04:24:25,368 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:24:25,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [535201388] [2022-04-28 04:24:25,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [535201388] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:24:25,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:24:25,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 04:24:25,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854162053] [2022-04-28 04:24:25,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:24:25,369 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-28 04:24:25,369 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:24:25,370 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-28 04:24:25,399 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-28 04:24:25,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 04:24:25,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:24:25,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 04:24:25,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-04-28 04:24:25,400 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-28 04:24:25,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:24:25,750 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2022-04-28 04:24:25,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 04:24:25,751 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-28 04:24:25,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:24:25,751 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-28 04:24:25,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-28 04:24:25,753 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-28 04:24:25,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-28 04:24:25,754 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 36 transitions. [2022-04-28 04:24:25,831 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-28 04:24:25,833 INFO L225 Difference]: With dead ends: 48 [2022-04-28 04:24:25,833 INFO L226 Difference]: Without dead ends: 46 [2022-04-28 04:24:25,834 INFO L412 NwaCegarLoop]: 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-28 04:24:25,834 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 9 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-28 04:24:25,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 78 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 04:24:25,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-28 04:24:25,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-04-28 04:24:25,869 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:24:25,870 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-28 04:24:25,870 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-28 04:24:25,870 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-28 04:24:25,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:24:25,873 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2022-04-28 04:24:25,873 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2022-04-28 04:24:25,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:24:25,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:24:25,874 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-28 04:24:25,874 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-28 04:24:25,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:24:25,876 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2022-04-28 04:24:25,876 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2022-04-28 04:24:25,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:24:25,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:24:25,877 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:24:25,877 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:24:25,877 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-28 04:24:25,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2022-04-28 04:24:25,879 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 25 [2022-04-28 04:24:25,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:24:25,879 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2022-04-28 04:24:25,879 INFO L496 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-28 04:24:25,880 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 54 transitions. [2022-04-28 04:24:28,105 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-28 04:24:28,106 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2022-04-28 04:24:28,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 04:24:28,106 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:24:28,107 INFO L195 NwaCegarLoop]: 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-28 04:24:28,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-28 04:24:28,307 WARN L477 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-28 04:24:28,307 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:24:28,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:24:28,308 INFO L85 PathProgramCache]: Analyzing trace with hash 642754736, now seen corresponding path program 1 times [2022-04-28 04:24:28,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:24:28,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1142602107] [2022-04-28 04:24:28,308 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:24:28,309 INFO L85 PathProgramCache]: Analyzing trace with hash 642754736, now seen corresponding path program 2 times [2022-04-28 04:24:28,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:24:28,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310194228] [2022-04-28 04:24:28,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:24:28,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:24:28,322 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:24:28,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [147344502] [2022-04-28 04:24:28,323 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:24:28,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:24:28,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:24:28,325 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-28 04:24:28,327 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-28 04:24:28,362 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:24:28,362 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:24:28,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 04:24:28,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:24:28,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:24:28,518 INFO L272 TraceCheckUtils]: 0: Hoare triple {1396#true} call ULTIMATE.init(); {1396#true} is VALID [2022-04-28 04:24:28,518 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-28 04:24:28,518 INFO L290 TraceCheckUtils]: 2: Hoare triple {1396#true} assume true; {1396#true} is VALID [2022-04-28 04:24:28,518 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1396#true} {1396#true} #76#return; {1396#true} is VALID [2022-04-28 04:24:28,519 INFO L272 TraceCheckUtils]: 4: Hoare triple {1396#true} call #t~ret6 := main(); {1396#true} is VALID [2022-04-28 04:24:28,519 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-28 04:24:28,519 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-28 04:24:28,519 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-28 04:24:28,520 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-28 04:24:28,520 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-28 04:24:28,521 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-28 04:24:28,522 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-28 04:24:28,522 INFO L290 TraceCheckUtils]: 12: Hoare triple {1437#(<= 1 main_~b~0)} assume !false; {1437#(<= 1 main_~b~0)} is VALID [2022-04-28 04:24:28,522 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-28 04:24:28,522 INFO L290 TraceCheckUtils]: 14: Hoare triple {1396#true} ~cond := #in~cond; {1396#true} is VALID [2022-04-28 04:24:28,523 INFO L290 TraceCheckUtils]: 15: Hoare triple {1396#true} assume !(0 == ~cond); {1396#true} is VALID [2022-04-28 04:24:28,523 INFO L290 TraceCheckUtils]: 16: Hoare triple {1396#true} assume true; {1396#true} is VALID [2022-04-28 04:24:28,524 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1396#true} {1437#(<= 1 main_~b~0)} #70#return; {1437#(<= 1 main_~b~0)} is VALID [2022-04-28 04:24:28,524 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-28 04:24:28,525 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-28 04:24:28,525 INFO L290 TraceCheckUtils]: 20: Hoare triple {1396#true} ~cond := #in~cond; {1396#true} is VALID [2022-04-28 04:24:28,525 INFO L290 TraceCheckUtils]: 21: Hoare triple {1396#true} assume !(0 == ~cond); {1396#true} is VALID [2022-04-28 04:24:28,525 INFO L290 TraceCheckUtils]: 22: Hoare triple {1396#true} assume true; {1396#true} is VALID [2022-04-28 04:24:28,526 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-28 04:24:28,527 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-28 04:24:28,528 INFO L290 TraceCheckUtils]: 25: Hoare triple {1478#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1482#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:24:28,528 INFO L290 TraceCheckUtils]: 26: Hoare triple {1482#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1397#false} is VALID [2022-04-28 04:24:28,528 INFO L290 TraceCheckUtils]: 27: Hoare triple {1397#false} assume !false; {1397#false} is VALID [2022-04-28 04:24:28,529 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-28 04:24:28,529 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 04:24:28,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:24:28,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310194228] [2022-04-28 04:24:28,529 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:24:28,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147344502] [2022-04-28 04:24:28,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147344502] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:24:28,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:24:28,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 04:24:28,530 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:24:28,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1142602107] [2022-04-28 04:24:28,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1142602107] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:24:28,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:24:28,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 04:24:28,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591877765] [2022-04-28 04:24:28,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:24:28,532 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-28 04:24:28,532 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:24:28,532 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-28 04:24:28,575 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-28 04:24:28,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 04:24:28,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:24:28,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 04:24:28,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-04-28 04:24:28,576 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-28 04:24:28,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:24:28,945 INFO L93 Difference]: Finished difference Result 60 states and 73 transitions. [2022-04-28 04:24:28,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 04:24:28,946 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-28 04:24:28,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:24:28,946 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-28 04:24:28,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-28 04:24:28,948 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-28 04:24:28,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-28 04:24:28,949 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 50 transitions. [2022-04-28 04:24:28,996 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-28 04:24:28,997 INFO L225 Difference]: With dead ends: 60 [2022-04-28 04:24:28,998 INFO L226 Difference]: Without dead ends: 48 [2022-04-28 04:24:28,998 INFO L412 NwaCegarLoop]: 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-28 04:24:28,999 INFO L413 NwaCegarLoop]: 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-28 04:24:28,999 INFO L414 NwaCegarLoop]: 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-28 04:24:29,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-28 04:24:29,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2022-04-28 04:24:29,038 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:24:29,038 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-28 04:24:29,038 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-28 04:24:29,038 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-28 04:24:29,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:24:29,041 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2022-04-28 04:24:29,041 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2022-04-28 04:24:29,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:24:29,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:24:29,042 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-28 04:24:29,042 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-28 04:24:29,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:24:29,044 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2022-04-28 04:24:29,044 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2022-04-28 04:24:29,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:24:29,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:24:29,044 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:24:29,044 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:24:29,045 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-28 04:24:29,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2022-04-28 04:24:29,047 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 28 [2022-04-28 04:24:29,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:24:29,047 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2022-04-28 04:24:29,047 INFO L496 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-28 04:24:29,047 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 58 transitions. [2022-04-28 04:24:31,316 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-28 04:24:31,316 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2022-04-28 04:24:31,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 04:24:31,316 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:24:31,317 INFO L195 NwaCegarLoop]: 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-28 04:24:31,333 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-28 04:24:31,519 WARN L477 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-28 04:24:31,520 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:24:31,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:24:31,520 INFO L85 PathProgramCache]: Analyzing trace with hash -171609494, now seen corresponding path program 1 times [2022-04-28 04:24:31,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:24:31,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [603377630] [2022-04-28 04:24:37,608 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:24:37,608 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 04:24:37,608 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:24:37,609 INFO L85 PathProgramCache]: Analyzing trace with hash -171609494, now seen corresponding path program 2 times [2022-04-28 04:24:37,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:24:37,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425637661] [2022-04-28 04:24:37,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:24:37,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:24:37,625 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:24:37,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1597957292] [2022-04-28 04:24:37,626 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:24:37,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:24:37,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:24:37,631 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-28 04:24:37,639 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-28 04:24:37,687 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:24:37,687 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:24:37,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 04:24:37,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:24:37,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:24:38,231 INFO L272 TraceCheckUtils]: 0: Hoare triple {1806#true} call ULTIMATE.init(); {1806#true} is VALID [2022-04-28 04:24:38,232 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-28 04:24:38,232 INFO L290 TraceCheckUtils]: 2: Hoare triple {1806#true} assume true; {1806#true} is VALID [2022-04-28 04:24:38,232 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1806#true} {1806#true} #76#return; {1806#true} is VALID [2022-04-28 04:24:38,232 INFO L272 TraceCheckUtils]: 4: Hoare triple {1806#true} call #t~ret6 := main(); {1806#true} is VALID [2022-04-28 04:24:38,232 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-28 04:24:38,232 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-28 04:24:38,233 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-28 04:24:38,235 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-28 04:24:38,235 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-28 04:24:38,237 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-28 04:24:38,237 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-28 04:24:38,238 INFO L290 TraceCheckUtils]: 12: Hoare triple {1847#(<= 1 main_~b~0)} assume !false; {1847#(<= 1 main_~b~0)} is VALID [2022-04-28 04:24:38,238 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-28 04:24:38,238 INFO L290 TraceCheckUtils]: 14: Hoare triple {1806#true} ~cond := #in~cond; {1806#true} is VALID [2022-04-28 04:24:38,238 INFO L290 TraceCheckUtils]: 15: Hoare triple {1806#true} assume !(0 == ~cond); {1806#true} is VALID [2022-04-28 04:24:38,238 INFO L290 TraceCheckUtils]: 16: Hoare triple {1806#true} assume true; {1806#true} is VALID [2022-04-28 04:24:38,239 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1806#true} {1847#(<= 1 main_~b~0)} #70#return; {1847#(<= 1 main_~b~0)} is VALID [2022-04-28 04:24:38,239 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-28 04:24:38,241 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-28 04:24:38,241 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-28 04:24:38,241 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-28 04:24:38,245 INFO L290 TraceCheckUtils]: 22: Hoare triple {1806#true} ~cond := #in~cond; {1806#true} is VALID [2022-04-28 04:24:38,245 INFO L290 TraceCheckUtils]: 23: Hoare triple {1806#true} assume !(0 == ~cond); {1806#true} is VALID [2022-04-28 04:24:38,245 INFO L290 TraceCheckUtils]: 24: Hoare triple {1806#true} assume true; {1806#true} is VALID [2022-04-28 04:24:38,246 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-28 04:24:38,247 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-28 04:24:38,247 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-28 04:24:38,247 INFO L290 TraceCheckUtils]: 28: Hoare triple {1807#false} ~cond := #in~cond; {1807#false} is VALID [2022-04-28 04:24:38,247 INFO L290 TraceCheckUtils]: 29: Hoare triple {1807#false} assume 0 == ~cond; {1807#false} is VALID [2022-04-28 04:24:38,247 INFO L290 TraceCheckUtils]: 30: Hoare triple {1807#false} assume !false; {1807#false} is VALID [2022-04-28 04:24:38,248 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-28 04:24:38,248 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 04:24:38,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:24:38,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425637661] [2022-04-28 04:24:38,249 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:24:38,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597957292] [2022-04-28 04:24:38,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1597957292] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:24:38,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:24:38,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 04:24:38,249 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:24:38,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [603377630] [2022-04-28 04:24:38,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [603377630] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:24:38,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:24:38,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 04:24:38,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062428121] [2022-04-28 04:24:38,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:24:38,251 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-28 04:24:38,251 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:24:38,252 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-28 04:24:38,276 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-28 04:24:38,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 04:24:38,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:24:38,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 04:24:38,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-28 04:24:38,278 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-28 04:24:38,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:24:38,579 INFO L93 Difference]: Finished difference Result 58 states and 71 transitions. [2022-04-28 04:24:38,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 04:24:38,579 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-28 04:24:38,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:24:38,580 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-28 04:24:38,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 54 transitions. [2022-04-28 04:24:38,581 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-28 04:24:38,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 54 transitions. [2022-04-28 04:24:38,583 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 54 transitions. [2022-04-28 04:24:38,632 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-28 04:24:38,634 INFO L225 Difference]: With dead ends: 58 [2022-04-28 04:24:38,634 INFO L226 Difference]: Without dead ends: 51 [2022-04-28 04:24:38,634 INFO L412 NwaCegarLoop]: 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-28 04:24:38,635 INFO L413 NwaCegarLoop]: 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-28 04:24:38,635 INFO L414 NwaCegarLoop]: 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-28 04:24:38,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-28 04:24:38,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-04-28 04:24:38,674 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:24:38,675 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-28 04:24:38,675 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-28 04:24:38,675 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-28 04:24:38,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:24:38,677 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2022-04-28 04:24:38,677 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2022-04-28 04:24:38,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:24:38,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:24:38,678 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-28 04:24:38,678 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-28 04:24:38,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:24:38,681 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2022-04-28 04:24:38,681 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2022-04-28 04:24:38,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:24:38,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:24:38,681 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:24:38,681 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:24:38,681 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-28 04:24:38,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2022-04-28 04:24:38,683 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 31 [2022-04-28 04:24:38,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:24:38,684 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2022-04-28 04:24:38,684 INFO L496 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-28 04:24:38,684 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 62 transitions. [2022-04-28 04:24:40,964 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-28 04:24:40,964 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-28 04:24:40,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 04:24:40,965 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:24:40,965 INFO L195 NwaCegarLoop]: 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-28 04:24:40,991 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-28 04:24:41,165 WARN L477 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-28 04:24:41,166 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:24:41,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:24:41,166 INFO L85 PathProgramCache]: Analyzing trace with hash 212948645, now seen corresponding path program 1 times [2022-04-28 04:24:41,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:24:41,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1983116570] [2022-04-28 04:24:47,288 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-28 04:24:47,331 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-28 04:24:49,063 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-28 04:24:49,105 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-28 04:24:49,159 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-28 04:24:50,623 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-28 04:24:50,624 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:24:50,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1189314404, now seen corresponding path program 1 times [2022-04-28 04:24:50,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:24:50,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633316356] [2022-04-28 04:24:50,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:24:50,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:24:50,642 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:24:50,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1174349784] [2022-04-28 04:24:50,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:24:50,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:24:50,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:24:50,647 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-28 04:24:50,660 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-28 04:24:50,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:24:50,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-28 04:24:50,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:24:50,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:25:03,322 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 04:25:03,911 INFO L272 TraceCheckUtils]: 0: Hoare triple {2229#true} call ULTIMATE.init(); {2229#true} is VALID [2022-04-28 04:25:03,912 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-28 04:25:03,912 INFO L290 TraceCheckUtils]: 2: Hoare triple {2229#true} assume true; {2229#true} is VALID [2022-04-28 04:25:03,912 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2229#true} {2229#true} #76#return; {2229#true} is VALID [2022-04-28 04:25:03,912 INFO L272 TraceCheckUtils]: 4: Hoare triple {2229#true} call #t~ret6 := main(); {2229#true} is VALID [2022-04-28 04:25:03,912 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-28 04:25:03,912 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-28 04:25:03,917 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-28 04:25:03,917 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-28 04:25:03,918 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-28 04:25:03,918 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-28 04:25:03,919 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-28 04:25:03,919 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-28 04:25:03,920 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-28 04:25:03,920 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-28 04:25:03,921 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-28 04:25:03,924 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-28 04:25:03,925 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-28 04:25:03,926 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-28 04:25:03,928 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-28 04:25:03,929 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-28 04:25:03,930 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-28 04:25:03,933 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-28 04:25:03,934 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-28 04:25:03,934 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-28 04:25:03,935 INFO L290 TraceCheckUtils]: 25: Hoare triple {2229#true} ~cond := #in~cond; {2314#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:25:03,935 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-28 04:25:03,936 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-28 04:25:05,938 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-28 04:25:05,940 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-28 04:25:05,940 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-28 04:25:05,941 INFO L290 TraceCheckUtils]: 31: Hoare triple {2333#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2337#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:25:05,941 INFO L290 TraceCheckUtils]: 32: Hoare triple {2337#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2230#false} is VALID [2022-04-28 04:25:05,941 INFO L290 TraceCheckUtils]: 33: Hoare triple {2230#false} assume !false; {2230#false} is VALID [2022-04-28 04:25:05,942 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-28 04:25:05,942 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:25:28,547 INFO L290 TraceCheckUtils]: 33: Hoare triple {2230#false} assume !false; {2230#false} is VALID [2022-04-28 04:25:28,547 INFO L290 TraceCheckUtils]: 32: Hoare triple {2337#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2230#false} is VALID [2022-04-28 04:25:28,548 INFO L290 TraceCheckUtils]: 31: Hoare triple {2333#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2337#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:25:28,548 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-28 04:25:28,549 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-28 04:25:28,550 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-28 04:25:28,551 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-28 04:25:28,551 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-28 04:25:28,551 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-28 04:25:28,552 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-28 04:25:28,552 INFO L290 TraceCheckUtils]: 23: Hoare triple {2229#true} [79] L33_primed-->L33: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2229#true} is VALID [2022-04-28 04:25:28,552 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-28 04:25:28,552 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-28 04:25:28,552 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-28 04:25:28,552 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-28 04:25:28,552 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-28 04:25:28,552 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-28 04:25:28,553 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-28 04:25:28,553 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-28 04:25:28,553 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-28 04:25:28,553 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-28 04:25:28,553 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-28 04:25:28,553 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-28 04:25:28,554 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2229#true} {2229#true} #68#return; {2229#true} is VALID [2022-04-28 04:25:28,554 INFO L290 TraceCheckUtils]: 9: Hoare triple {2229#true} assume true; {2229#true} is VALID [2022-04-28 04:25:28,554 INFO L290 TraceCheckUtils]: 8: Hoare triple {2229#true} assume !(0 == ~cond); {2229#true} is VALID [2022-04-28 04:25:28,554 INFO L290 TraceCheckUtils]: 7: Hoare triple {2229#true} ~cond := #in~cond; {2229#true} is VALID [2022-04-28 04:25:28,554 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-28 04:25:28,554 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-28 04:25:28,554 INFO L272 TraceCheckUtils]: 4: Hoare triple {2229#true} call #t~ret6 := main(); {2229#true} is VALID [2022-04-28 04:25:28,555 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2229#true} {2229#true} #76#return; {2229#true} is VALID [2022-04-28 04:25:28,555 INFO L290 TraceCheckUtils]: 2: Hoare triple {2229#true} assume true; {2229#true} is VALID [2022-04-28 04:25:28,555 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-28 04:25:28,555 INFO L272 TraceCheckUtils]: 0: Hoare triple {2229#true} call ULTIMATE.init(); {2229#true} is VALID [2022-04-28 04:25:28,555 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-28 04:25:28,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:25:28,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633316356] [2022-04-28 04:25:28,556 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:25:28,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174349784] [2022-04-28 04:25:28,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1174349784] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:25:28,556 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 04:25:28,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 16 [2022-04-28 04:25:33,053 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:25:33,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1983116570] [2022-04-28 04:25:33,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1983116570] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:25:33,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:25:33,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 04:25:33,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555195434] [2022-04-28 04:25:33,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:25:33,074 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-28 04:25:33,074 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:25:33,075 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-28 04:25:33,102 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-28 04:25:33,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-28 04:25:33,302 WARN L477 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-28 04:25:33,303 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:335) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.constructRefinementAutomaton(AbstractCegarLoop.java:564) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:437) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) 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-28 04:25:33,306 INFO L158 Benchmark]: Toolchain (without parser) took 151435.63ms. Allocated memory was 183.5MB in the beginning and 223.3MB in the end (delta: 39.8MB). Free memory was 133.2MB in the beginning and 197.4MB in the end (delta: -64.3MB). Peak memory consumption was 98.2MB. Max. memory is 8.0GB. [2022-04-28 04:25:33,307 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 183.5MB. Free memory was 149.6MB in the beginning and 149.5MB in the end (delta: 78.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 04:25:33,307 INFO L158 Benchmark]: CACSL2BoogieTranslator took 227.56ms. Allocated memory was 183.5MB in the beginning and 223.3MB in the end (delta: 39.8MB). Free memory was 133.0MB in the beginning and 200.4MB in the end (delta: -67.4MB). Peak memory consumption was 13.8MB. Max. memory is 8.0GB. [2022-04-28 04:25:33,307 INFO L158 Benchmark]: Boogie Preprocessor took 26.29ms. Allocated memory is still 223.3MB. Free memory was 200.4MB in the beginning and 198.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 04:25:33,308 INFO L158 Benchmark]: RCFGBuilder took 340.43ms. Allocated memory is still 223.3MB. Free memory was 198.8MB in the beginning and 186.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-28 04:25:33,308 INFO L158 Benchmark]: TraceAbstraction took 150833.39ms. Allocated memory is still 223.3MB. Free memory was 185.8MB in the beginning and 197.4MB in the end (delta: -11.7MB). Peak memory consumption was 110.6MB. Max. memory is 8.0GB. [2022-04-28 04:25:33,309 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.11ms. Allocated memory is still 183.5MB. Free memory was 149.6MB in the beginning and 149.5MB in the end (delta: 78.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 227.56ms. Allocated memory was 183.5MB in the beginning and 223.3MB in the end (delta: 39.8MB). Free memory was 133.0MB in the beginning and 200.4MB in the end (delta: -67.4MB). Peak memory consumption was 13.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.29ms. Allocated memory is still 223.3MB. Free memory was 200.4MB in the beginning and 198.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 340.43ms. Allocated memory is still 223.3MB. Free memory was 198.8MB in the beginning and 186.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 150833.39ms. Allocated memory is still 223.3MB. Free memory was 185.8MB in the beginning and 197.4MB in the end (delta: -11.7MB). Peak memory consumption was 110.6MB. 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-28 04:25:33,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...