/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-scaling/prod4br-ll_valuebound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 07:21:28,400 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 07:21:28,402 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 07:21:28,436 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 07:21:28,437 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 07:21:28,438 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 07:21:28,440 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 07:21:28,442 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 07:21:28,443 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 07:21:28,447 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 07:21:28,447 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 07:21:28,448 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 07:21:28,449 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 07:21:28,450 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 07:21:28,451 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 07:21:28,453 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 07:21:28,453 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 07:21:28,454 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 07:21:28,456 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 07:21:28,460 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 07:21:28,461 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 07:21:28,462 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 07:21:28,462 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 07:21:28,463 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 07:21:28,464 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 07:21:28,469 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 07:21:28,469 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 07:21:28,469 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 07:21:28,470 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 07:21:28,470 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 07:21:28,471 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 07:21:28,471 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 07:21:28,472 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 07:21:28,473 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 07:21:28,473 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 07:21:28,474 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 07:21:28,474 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 07:21:28,474 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 07:21:28,475 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 07:21:28,475 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 07:21:28,475 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 07:21:28,476 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 07:21:28,477 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 07:21:28,486 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 07:21:28,487 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 07:21:28,488 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 07:21:28,488 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 07:21:28,488 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 07:21:28,488 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 07:21:28,488 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 07:21:28,488 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 07:21:28,488 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 07:21:28,489 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 07:21:28,489 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 07:21:28,489 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 07:21:28,489 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 07:21:28,489 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 07:21:28,489 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 07:21:28,489 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 07:21:28,489 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 07:21:28,490 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 07:21:28,490 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 07:21:28,490 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 07:21:28,490 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 07:21:28,490 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 07:21:28,490 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 07:21:28,490 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 07:21:28,490 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 07:21:28,490 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 07:21:28,648 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 07:21:28,662 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 07:21:28,663 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 07:21:28,664 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 07:21:28,673 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 07:21:28,674 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/prod4br-ll_valuebound1.c [2022-04-28 07:21:28,746 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a1a0e0f0/32f5881fb1ac4b83850a3a0830007bc2/FLAG1fa4a72d1 [2022-04-28 07:21:29,093 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 07:21:29,093 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/prod4br-ll_valuebound1.c [2022-04-28 07:21:29,097 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a1a0e0f0/32f5881fb1ac4b83850a3a0830007bc2/FLAG1fa4a72d1 [2022-04-28 07:21:29,520 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a1a0e0f0/32f5881fb1ac4b83850a3a0830007bc2 [2022-04-28 07:21:29,521 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 07:21:29,523 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 07:21:29,524 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 07:21:29,525 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 07:21:29,527 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 07:21:29,528 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 07:21:29" (1/1) ... [2022-04-28 07:21:29,529 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@290e879f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:21:29, skipping insertion in model container [2022-04-28 07:21:29,529 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 07:21:29" (1/1) ... [2022-04-28 07:21:29,533 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 07:21:29,544 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 07:21:29,659 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/prod4br-ll_valuebound1.c[524,537] [2022-04-28 07:21:29,672 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 07:21:29,676 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 07:21:29,684 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/prod4br-ll_valuebound1.c[524,537] [2022-04-28 07:21:29,690 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 07:21:29,698 INFO L208 MainTranslator]: Completed translation [2022-04-28 07:21:29,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:21:29 WrapperNode [2022-04-28 07:21:29,698 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 07:21:29,699 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 07:21:29,699 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 07:21:29,699 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 07:21:29,705 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:21:29" (1/1) ... [2022-04-28 07:21:29,705 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:21:29" (1/1) ... [2022-04-28 07:21:29,709 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:21:29" (1/1) ... [2022-04-28 07:21:29,709 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:21:29" (1/1) ... [2022-04-28 07:21:29,713 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:21:29" (1/1) ... [2022-04-28 07:21:29,716 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:21:29" (1/1) ... [2022-04-28 07:21:29,716 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:21:29" (1/1) ... [2022-04-28 07:21:29,717 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 07:21:29,718 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 07:21:29,718 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 07:21:29,718 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 07:21:29,719 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:21:29" (1/1) ... [2022-04-28 07:21:29,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 07:21:29,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:21:29,749 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 07:21:29,760 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 07:21:29,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 07:21:29,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 07:21:29,776 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 07:21:29,776 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 07:21:29,776 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 07:21:29,776 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 07:21:29,776 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 07:21:29,776 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 07:21:29,776 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 07:21:29,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 07:21:29,776 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 07:21:29,776 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 07:21:29,777 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 07:21:29,777 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 07:21:29,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 07:21:29,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 07:21:29,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 07:21:29,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 07:21:29,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 07:21:29,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 07:21:29,814 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 07:21:29,815 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 07:21:30,002 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 07:21:30,007 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 07:21:30,007 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 07:21:30,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 07:21:30 BoogieIcfgContainer [2022-04-28 07:21:30,008 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 07:21:30,009 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 07:21:30,009 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 07:21:30,027 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 07:21:30,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 07:21:29" (1/3) ... [2022-04-28 07:21:30,028 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@402dc171 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 07:21:30, skipping insertion in model container [2022-04-28 07:21:30,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:21:29" (2/3) ... [2022-04-28 07:21:30,028 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@402dc171 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 07:21:30, skipping insertion in model container [2022-04-28 07:21:30,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 07:21:30" (3/3) ... [2022-04-28 07:21:30,029 INFO L111 eAbstractionObserver]: Analyzing ICFG prod4br-ll_valuebound1.c [2022-04-28 07:21:30,038 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 07:21:30,038 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 07:21:30,080 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 07:21:30,084 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@37a680fc, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1065537f [2022-04-28 07:21:30,085 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 07:21:30,090 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:21:30,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 07:21:30,095 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:21:30,095 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:21:30,095 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:21:30,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:21:30,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1738134960, now seen corresponding path program 1 times [2022-04-28 07:21:30,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:21:30,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [349385552] [2022-04-28 07:21:30,110 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:21:30,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1738134960, now seen corresponding path program 2 times [2022-04-28 07:21:30,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:21:30,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134284279] [2022-04-28 07:21:30,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:21:30,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:21:30,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:21:30,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 07:21:30,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:21:30,272 INFO L290 TraceCheckUtils]: 0: Hoare triple {54#(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); {37#true} is VALID [2022-04-28 07:21:30,272 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume true; {37#true} is VALID [2022-04-28 07:21:30,272 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37#true} {37#true} #83#return; {37#true} is VALID [2022-04-28 07:21:30,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 07:21:30,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:21:30,288 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-28 07:21:30,288 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-28 07:21:30,289 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-28 07:21:30,289 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {37#true} #71#return; {38#false} is VALID [2022-04-28 07:21:30,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 07:21:30,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:21:30,294 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-28 07:21:30,295 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-28 07:21:30,295 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-28 07:21:30,295 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {38#false} #73#return; {38#false} is VALID [2022-04-28 07:21:30,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-28 07:21:30,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:21:30,300 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-28 07:21:30,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-28 07:21:30,301 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-28 07:21:30,301 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {38#false} #75#return; {38#false} is VALID [2022-04-28 07:21:30,302 INFO L272 TraceCheckUtils]: 0: Hoare triple {37#true} call ULTIMATE.init(); {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 07:21:30,302 INFO L290 TraceCheckUtils]: 1: Hoare triple {54#(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); {37#true} is VALID [2022-04-28 07:21:30,302 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#true} assume true; {37#true} is VALID [2022-04-28 07:21:30,302 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} #83#return; {37#true} is VALID [2022-04-28 07:21:30,302 INFO L272 TraceCheckUtils]: 4: Hoare triple {37#true} call #t~ret6 := main(); {37#true} is VALID [2022-04-28 07:21:30,303 INFO L290 TraceCheckUtils]: 5: Hoare triple {37#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; {37#true} is VALID [2022-04-28 07:21:30,303 INFO L272 TraceCheckUtils]: 6: Hoare triple {37#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 1 then 1 else 0)); {37#true} is VALID [2022-04-28 07:21:30,304 INFO L290 TraceCheckUtils]: 7: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-28 07:21:30,305 INFO L290 TraceCheckUtils]: 8: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-28 07:21:30,305 INFO L290 TraceCheckUtils]: 9: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-28 07:21:30,305 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {38#false} {37#true} #71#return; {38#false} is VALID [2022-04-28 07:21:30,306 INFO L290 TraceCheckUtils]: 11: Hoare triple {38#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {38#false} is VALID [2022-04-28 07:21:30,306 INFO L272 TraceCheckUtils]: 12: Hoare triple {38#false} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 1 then 1 else 0)); {37#true} is VALID [2022-04-28 07:21:30,307 INFO L290 TraceCheckUtils]: 13: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-28 07:21:30,307 INFO L290 TraceCheckUtils]: 14: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-28 07:21:30,307 INFO L290 TraceCheckUtils]: 15: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-28 07:21:30,307 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {38#false} {38#false} #73#return; {38#false} is VALID [2022-04-28 07:21:30,308 INFO L272 TraceCheckUtils]: 17: Hoare triple {38#false} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {37#true} is VALID [2022-04-28 07:21:30,308 INFO L290 TraceCheckUtils]: 18: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-28 07:21:30,308 INFO L290 TraceCheckUtils]: 19: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-28 07:21:30,309 INFO L290 TraceCheckUtils]: 20: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-28 07:21:30,309 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {38#false} {38#false} #75#return; {38#false} is VALID [2022-04-28 07:21:30,309 INFO L290 TraceCheckUtils]: 22: Hoare triple {38#false} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {38#false} is VALID [2022-04-28 07:21:30,309 INFO L290 TraceCheckUtils]: 23: Hoare triple {38#false} assume !true; {38#false} is VALID [2022-04-28 07:21:30,310 INFO L272 TraceCheckUtils]: 24: Hoare triple {38#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {38#false} is VALID [2022-04-28 07:21:30,310 INFO L290 TraceCheckUtils]: 25: Hoare triple {38#false} ~cond := #in~cond; {38#false} is VALID [2022-04-28 07:21:30,310 INFO L290 TraceCheckUtils]: 26: Hoare triple {38#false} assume 0 == ~cond; {38#false} is VALID [2022-04-28 07:21:30,310 INFO L290 TraceCheckUtils]: 27: Hoare triple {38#false} assume !false; {38#false} is VALID [2022-04-28 07:21:30,311 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 07:21:30,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:21:30,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134284279] [2022-04-28 07:21:30,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134284279] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:21:30,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:21:30,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 07:21:30,317 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:21:30,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [349385552] [2022-04-28 07:21:30,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [349385552] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:21:30,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:21:30,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 07:21:30,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65705190] [2022-04-28 07:21:30,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:21:30,323 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-28 07:21:30,325 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:21:30,327 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 07:21:30,359 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:21:30,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 07:21:30,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:21:30,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 07:21:30,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 07:21:30,383 INFO L87 Difference]: Start difference. First operand has 34 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 07:21:30,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:21:30,506 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2022-04-28 07:21:30,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 07:21:30,507 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-28 07:21:30,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:21:30,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 07:21:30,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2022-04-28 07:21:30,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 07:21:30,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2022-04-28 07:21:30,528 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 88 transitions. [2022-04-28 07:21:30,616 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:21:30,627 INFO L225 Difference]: With dead ends: 61 [2022-04-28 07:21:30,627 INFO L226 Difference]: Without dead ends: 29 [2022-04-28 07:21:30,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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 07:21:30,634 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 22 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 07:21:30,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 38 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 07:21:30,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-28 07:21:30,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-28 07:21:30,663 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:21:30,664 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:21:30,664 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:21:30,665 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:21:30,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:21:30,672 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2022-04-28 07:21:30,672 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-04-28 07:21:30,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:21:30,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:21:30,673 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 29 states. [2022-04-28 07:21:30,673 INFO L87 Difference]: Start difference. First operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 29 states. [2022-04-28 07:21:30,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:21:30,676 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2022-04-28 07:21:30,676 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-04-28 07:21:30,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:21:30,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:21:30,676 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:21:30,676 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:21:30,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:21:30,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2022-04-28 07:21:30,679 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 28 [2022-04-28 07:21:30,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:21:30,679 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2022-04-28 07:21:30,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 07:21:30,680 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 36 transitions. [2022-04-28 07:21:30,710 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 07:21:30,711 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-04-28 07:21:30,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 07:21:30,711 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:21:30,711 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:21:30,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 07:21:30,712 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:21:30,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:21:30,712 INFO L85 PathProgramCache]: Analyzing trace with hash 567203544, now seen corresponding path program 1 times [2022-04-28 07:21:30,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:21:30,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [238199924] [2022-04-28 07:21:30,713 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:21:30,713 INFO L85 PathProgramCache]: Analyzing trace with hash 567203544, now seen corresponding path program 2 times [2022-04-28 07:21:30,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:21:30,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126351002] [2022-04-28 07:21:30,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:21:30,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:21:30,732 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:21:30,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2124040162] [2022-04-28 07:21:30,732 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:21:30,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:21:30,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:21:30,734 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 07:21:30,751 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 07:21:30,796 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 07:21:30,797 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:21:30,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 07:21:30,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:21:30,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:21:30,988 INFO L272 TraceCheckUtils]: 0: Hoare triple {295#true} call ULTIMATE.init(); {295#true} is VALID [2022-04-28 07:21:30,989 INFO L290 TraceCheckUtils]: 1: Hoare triple {295#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); {295#true} is VALID [2022-04-28 07:21:30,989 INFO L290 TraceCheckUtils]: 2: Hoare triple {295#true} assume true; {295#true} is VALID [2022-04-28 07:21:30,989 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {295#true} {295#true} #83#return; {295#true} is VALID [2022-04-28 07:21:30,990 INFO L272 TraceCheckUtils]: 4: Hoare triple {295#true} call #t~ret6 := main(); {295#true} is VALID [2022-04-28 07:21:30,991 INFO L290 TraceCheckUtils]: 5: Hoare triple {295#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; {295#true} is VALID [2022-04-28 07:21:30,991 INFO L272 TraceCheckUtils]: 6: Hoare triple {295#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 1 then 1 else 0)); {295#true} is VALID [2022-04-28 07:21:30,991 INFO L290 TraceCheckUtils]: 7: Hoare triple {295#true} ~cond := #in~cond; {295#true} is VALID [2022-04-28 07:21:30,991 INFO L290 TraceCheckUtils]: 8: Hoare triple {295#true} assume !(0 == ~cond); {295#true} is VALID [2022-04-28 07:21:30,991 INFO L290 TraceCheckUtils]: 9: Hoare triple {295#true} assume true; {295#true} is VALID [2022-04-28 07:21:31,003 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {295#true} {295#true} #71#return; {295#true} is VALID [2022-04-28 07:21:31,003 INFO L290 TraceCheckUtils]: 11: Hoare triple {295#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {295#true} is VALID [2022-04-28 07:21:31,003 INFO L272 TraceCheckUtils]: 12: Hoare triple {295#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 1 then 1 else 0)); {295#true} is VALID [2022-04-28 07:21:31,003 INFO L290 TraceCheckUtils]: 13: Hoare triple {295#true} ~cond := #in~cond; {295#true} is VALID [2022-04-28 07:21:31,003 INFO L290 TraceCheckUtils]: 14: Hoare triple {295#true} assume !(0 == ~cond); {295#true} is VALID [2022-04-28 07:21:31,003 INFO L290 TraceCheckUtils]: 15: Hoare triple {295#true} assume true; {295#true} is VALID [2022-04-28 07:21:31,004 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {295#true} {295#true} #73#return; {295#true} is VALID [2022-04-28 07:21:31,004 INFO L272 TraceCheckUtils]: 17: Hoare triple {295#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {295#true} is VALID [2022-04-28 07:21:31,004 INFO L290 TraceCheckUtils]: 18: Hoare triple {295#true} ~cond := #in~cond; {295#true} is VALID [2022-04-28 07:21:31,004 INFO L290 TraceCheckUtils]: 19: Hoare triple {295#true} assume !(0 == ~cond); {295#true} is VALID [2022-04-28 07:21:31,004 INFO L290 TraceCheckUtils]: 20: Hoare triple {295#true} assume true; {295#true} is VALID [2022-04-28 07:21:31,004 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {295#true} {295#true} #75#return; {295#true} is VALID [2022-04-28 07:21:31,005 INFO L290 TraceCheckUtils]: 22: Hoare triple {295#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {366#(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 07:21:31,006 INFO L290 TraceCheckUtils]: 23: Hoare triple {366#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {366#(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 07:21:31,006 INFO L272 TraceCheckUtils]: 24: Hoare triple {366#(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)); {373#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:21:31,007 INFO L290 TraceCheckUtils]: 25: Hoare triple {373#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {377#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:21:31,007 INFO L290 TraceCheckUtils]: 26: Hoare triple {377#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {296#false} is VALID [2022-04-28 07:21:31,008 INFO L290 TraceCheckUtils]: 27: Hoare triple {296#false} assume !false; {296#false} is VALID [2022-04-28 07:21:31,008 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 07:21:31,008 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 07:21:31,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:21:31,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126351002] [2022-04-28 07:21:31,009 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:21:31,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124040162] [2022-04-28 07:21:31,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124040162] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:21:31,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:21:31,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 07:21:31,011 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:21:31,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [238199924] [2022-04-28 07:21:31,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [238199924] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:21:31,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:21:31,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 07:21:31,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194679957] [2022-04-28 07:21:31,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:21:31,012 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2022-04-28 07:21:31,013 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:21:31,013 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 07:21:31,030 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:21:31,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 07:21:31,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:21:31,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 07:21:31,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 07:21:31,032 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 07:21:31,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:21:31,210 INFO L93 Difference]: Finished difference Result 43 states and 55 transitions. [2022-04-28 07:21:31,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 07:21:31,210 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2022-04-28 07:21:31,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:21:31,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 07:21:31,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-04-28 07:21:31,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 07:21:31,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-04-28 07:21:31,214 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 55 transitions. [2022-04-28 07:21:31,256 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:21:31,257 INFO L225 Difference]: With dead ends: 43 [2022-04-28 07:21:31,258 INFO L226 Difference]: Without dead ends: 41 [2022-04-28 07:21:31,258 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 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 07:21:31,259 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 9 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 07:21:31,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 92 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 07:21:31,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-28 07:21:31,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 35. [2022-04-28 07:21:31,268 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:21:31,268 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:21:31,269 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:21:31,269 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:21:31,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:21:31,271 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2022-04-28 07:21:31,271 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2022-04-28 07:21:31,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:21:31,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:21:31,272 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 41 states. [2022-04-28 07:21:31,272 INFO L87 Difference]: Start difference. First operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 41 states. [2022-04-28 07:21:31,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:21:31,275 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2022-04-28 07:21:31,275 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2022-04-28 07:21:31,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:21:31,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:21:31,275 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:21:31,275 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:21:31,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:21:31,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2022-04-28 07:21:31,279 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 28 [2022-04-28 07:21:31,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:21:31,280 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2022-04-28 07:21:31,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 07:21:31,280 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 42 transitions. [2022-04-28 07:21:31,317 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:21:31,317 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2022-04-28 07:21:31,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 07:21:31,317 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:21:31,318 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:21:31,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 07:21:31,533 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 07:21:31,533 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:21:31,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:21:31,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1139707498, now seen corresponding path program 1 times [2022-04-28 07:21:31,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:21:31,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1396562402] [2022-04-28 07:21:31,535 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:21:31,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1139707498, now seen corresponding path program 2 times [2022-04-28 07:21:31,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:21:31,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415936885] [2022-04-28 07:21:31,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:21:31,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:21:31,550 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:21:31,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1959305365] [2022-04-28 07:21:31,551 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:21:31,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:21:31,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:21:31,552 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 07:21:31,553 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 07:21:31,590 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:21:31,591 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:21:31,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 07:21:31,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:21:31,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:21:42,189 INFO L272 TraceCheckUtils]: 0: Hoare triple {623#true} call ULTIMATE.init(); {623#true} is VALID [2022-04-28 07:21:42,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {623#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); {623#true} is VALID [2022-04-28 07:21:42,190 INFO L290 TraceCheckUtils]: 2: Hoare triple {623#true} assume true; {623#true} is VALID [2022-04-28 07:21:42,190 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {623#true} {623#true} #83#return; {623#true} is VALID [2022-04-28 07:21:42,192 INFO L272 TraceCheckUtils]: 4: Hoare triple {623#true} call #t~ret6 := main(); {623#true} is VALID [2022-04-28 07:21:42,192 INFO L290 TraceCheckUtils]: 5: Hoare triple {623#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; {623#true} is VALID [2022-04-28 07:21:42,192 INFO L272 TraceCheckUtils]: 6: Hoare triple {623#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 1 then 1 else 0)); {623#true} is VALID [2022-04-28 07:21:42,192 INFO L290 TraceCheckUtils]: 7: Hoare triple {623#true} ~cond := #in~cond; {649#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 07:21:42,193 INFO L290 TraceCheckUtils]: 8: Hoare triple {649#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {653#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 07:21:42,193 INFO L290 TraceCheckUtils]: 9: Hoare triple {653#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {653#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 07:21:42,194 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {653#(not (= |assume_abort_if_not_#in~cond| 0))} {623#true} #71#return; {660#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 07:21:42,194 INFO L290 TraceCheckUtils]: 11: Hoare triple {660#(and (<= 0 main_~x~0) (<= main_~x~0 1))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {660#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 07:21:42,195 INFO L272 TraceCheckUtils]: 12: Hoare triple {660#(and (<= 0 main_~x~0) (<= main_~x~0 1))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 1 then 1 else 0)); {623#true} is VALID [2022-04-28 07:21:42,195 INFO L290 TraceCheckUtils]: 13: Hoare triple {623#true} ~cond := #in~cond; {623#true} is VALID [2022-04-28 07:21:42,195 INFO L290 TraceCheckUtils]: 14: Hoare triple {623#true} assume !(0 == ~cond); {623#true} is VALID [2022-04-28 07:21:42,195 INFO L290 TraceCheckUtils]: 15: Hoare triple {623#true} assume true; {623#true} is VALID [2022-04-28 07:21:42,196 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {623#true} {660#(and (<= 0 main_~x~0) (<= main_~x~0 1))} #73#return; {660#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 07:21:42,196 INFO L272 TraceCheckUtils]: 17: Hoare triple {660#(and (<= 0 main_~x~0) (<= main_~x~0 1))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {623#true} is VALID [2022-04-28 07:21:42,196 INFO L290 TraceCheckUtils]: 18: Hoare triple {623#true} ~cond := #in~cond; {649#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 07:21:42,197 INFO L290 TraceCheckUtils]: 19: Hoare triple {649#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {653#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 07:21:42,197 INFO L290 TraceCheckUtils]: 20: Hoare triple {653#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {653#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 07:21:42,198 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {653#(not (= |assume_abort_if_not_#in~cond| 0))} {660#(and (<= 0 main_~x~0) (<= main_~x~0 1))} #75#return; {694#(and (<= 0 main_~x~0) (<= main_~x~0 1) (<= 1 main_~y~0))} is VALID [2022-04-28 07:21:42,198 INFO L290 TraceCheckUtils]: 22: Hoare triple {694#(and (<= 0 main_~x~0) (<= main_~x~0 1) (<= 1 main_~y~0))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {698#(and (<= 0 main_~x~0) (<= main_~x~0 1) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} is VALID [2022-04-28 07:21:42,199 INFO L290 TraceCheckUtils]: 23: Hoare triple {698#(and (<= 0 main_~x~0) (<= main_~x~0 1) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} assume !false; {698#(and (<= 0 main_~x~0) (<= main_~x~0 1) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} is VALID [2022-04-28 07:21:42,199 INFO L272 TraceCheckUtils]: 24: Hoare triple {698#(and (<= 0 main_~x~0) (<= main_~x~0 1) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~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)); {623#true} is VALID [2022-04-28 07:21:42,199 INFO L290 TraceCheckUtils]: 25: Hoare triple {623#true} ~cond := #in~cond; {708#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:21:42,200 INFO L290 TraceCheckUtils]: 26: Hoare triple {708#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {712#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:21:42,200 INFO L290 TraceCheckUtils]: 27: Hoare triple {712#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {712#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:21:44,203 WARN L284 TraceCheckUtils]: 28: Hoare quadruple {712#(not (= |__VERIFIER_assert_#in~cond| 0))} {698#(and (<= 0 main_~x~0) (<= main_~x~0 1) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} #77#return; {719#(and (<= 0 main_~x~0) (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_~x~0 1) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} is UNKNOWN [2022-04-28 07:21:44,205 INFO L290 TraceCheckUtils]: 29: Hoare triple {719#(and (<= 0 main_~x~0) (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_~x~0 1) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} assume !(0 != ~a~0 && 0 != ~b~0); {723#(and (<= main_~x~0 0) (<= 0 main_~x~0) (= main_~q~0 (* main_~y~0 main_~x~0)) (<= 1 main_~y~0))} is VALID [2022-04-28 07:21:44,207 INFO L272 TraceCheckUtils]: 30: Hoare triple {723#(and (<= main_~x~0 0) (<= 0 main_~x~0) (= 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)); {727#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:21:44,210 INFO L290 TraceCheckUtils]: 31: Hoare triple {727#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {731#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:21:44,210 INFO L290 TraceCheckUtils]: 32: Hoare triple {731#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {624#false} is VALID [2022-04-28 07:21:44,210 INFO L290 TraceCheckUtils]: 33: Hoare triple {624#false} assume !false; {624#false} is VALID [2022-04-28 07:21:44,211 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 07:21:44,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:22:20,680 INFO L290 TraceCheckUtils]: 33: Hoare triple {624#false} assume !false; {624#false} is VALID [2022-04-28 07:22:20,680 INFO L290 TraceCheckUtils]: 32: Hoare triple {731#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {624#false} is VALID [2022-04-28 07:22:20,681 INFO L290 TraceCheckUtils]: 31: Hoare triple {727#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {731#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:22:20,682 INFO L272 TraceCheckUtils]: 30: Hoare triple {747#(= main_~q~0 (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {727#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:22:20,683 INFO L290 TraceCheckUtils]: 29: Hoare triple {751#(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); {747#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-28 07:22:20,685 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {712#(not (= |__VERIFIER_assert_#in~cond| 0))} {623#true} #77#return; {751#(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 07:22:20,686 INFO L290 TraceCheckUtils]: 27: Hoare triple {712#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {712#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:22:20,686 INFO L290 TraceCheckUtils]: 26: Hoare triple {764#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {712#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:22:20,687 INFO L290 TraceCheckUtils]: 25: Hoare triple {623#true} ~cond := #in~cond; {764#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 07:22:20,687 INFO L272 TraceCheckUtils]: 24: Hoare triple {623#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {623#true} is VALID [2022-04-28 07:22:20,687 INFO L290 TraceCheckUtils]: 23: Hoare triple {623#true} assume !false; {623#true} is VALID [2022-04-28 07:22:20,687 INFO L290 TraceCheckUtils]: 22: Hoare triple {623#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {623#true} is VALID [2022-04-28 07:22:20,688 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {623#true} {623#true} #75#return; {623#true} is VALID [2022-04-28 07:22:20,689 INFO L290 TraceCheckUtils]: 20: Hoare triple {623#true} assume true; {623#true} is VALID [2022-04-28 07:22:20,689 INFO L290 TraceCheckUtils]: 19: Hoare triple {623#true} assume !(0 == ~cond); {623#true} is VALID [2022-04-28 07:22:20,691 INFO L290 TraceCheckUtils]: 18: Hoare triple {623#true} ~cond := #in~cond; {623#true} is VALID [2022-04-28 07:22:20,691 INFO L272 TraceCheckUtils]: 17: Hoare triple {623#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {623#true} is VALID [2022-04-28 07:22:20,702 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {623#true} {623#true} #73#return; {623#true} is VALID [2022-04-28 07:22:20,703 INFO L290 TraceCheckUtils]: 15: Hoare triple {623#true} assume true; {623#true} is VALID [2022-04-28 07:22:20,703 INFO L290 TraceCheckUtils]: 14: Hoare triple {623#true} assume !(0 == ~cond); {623#true} is VALID [2022-04-28 07:22:20,703 INFO L290 TraceCheckUtils]: 13: Hoare triple {623#true} ~cond := #in~cond; {623#true} is VALID [2022-04-28 07:22:20,703 INFO L272 TraceCheckUtils]: 12: Hoare triple {623#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 1 then 1 else 0)); {623#true} is VALID [2022-04-28 07:22:20,703 INFO L290 TraceCheckUtils]: 11: Hoare triple {623#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {623#true} is VALID [2022-04-28 07:22:20,704 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {623#true} {623#true} #71#return; {623#true} is VALID [2022-04-28 07:22:20,704 INFO L290 TraceCheckUtils]: 9: Hoare triple {623#true} assume true; {623#true} is VALID [2022-04-28 07:22:20,704 INFO L290 TraceCheckUtils]: 8: Hoare triple {623#true} assume !(0 == ~cond); {623#true} is VALID [2022-04-28 07:22:20,704 INFO L290 TraceCheckUtils]: 7: Hoare triple {623#true} ~cond := #in~cond; {623#true} is VALID [2022-04-28 07:22:20,704 INFO L272 TraceCheckUtils]: 6: Hoare triple {623#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 1 then 1 else 0)); {623#true} is VALID [2022-04-28 07:22:20,704 INFO L290 TraceCheckUtils]: 5: Hoare triple {623#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; {623#true} is VALID [2022-04-28 07:22:20,704 INFO L272 TraceCheckUtils]: 4: Hoare triple {623#true} call #t~ret6 := main(); {623#true} is VALID [2022-04-28 07:22:20,705 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {623#true} {623#true} #83#return; {623#true} is VALID [2022-04-28 07:22:20,705 INFO L290 TraceCheckUtils]: 2: Hoare triple {623#true} assume true; {623#true} is VALID [2022-04-28 07:22:20,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {623#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); {623#true} is VALID [2022-04-28 07:22:20,705 INFO L272 TraceCheckUtils]: 0: Hoare triple {623#true} call ULTIMATE.init(); {623#true} is VALID [2022-04-28 07:22:20,705 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 07:22:20,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:22:20,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415936885] [2022-04-28 07:22:20,706 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:22:20,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959305365] [2022-04-28 07:22:20,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959305365] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:22:20,706 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:22:20,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 16 [2022-04-28 07:22:20,706 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:22:20,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1396562402] [2022-04-28 07:22:20,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1396562402] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:22:20,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:22:20,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 07:22:20,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884958057] [2022-04-28 07:22:20,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:22:20,707 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 34 [2022-04-28 07:22:20,708 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:22:20,708 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 07:22:22,737 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 30 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 07:22:22,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 07:22:22,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:22:22,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 07:22:22,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2022-04-28 07:22:22,738 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 07:22:25,735 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 07:22:29,003 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 07:22:29,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:22:29,150 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2022-04-28 07:22:29,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 07:22:29,150 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 34 [2022-04-28 07:22:29,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:22:29,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 07:22:29,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 55 transitions. [2022-04-28 07:22:29,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 07:22:29,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 55 transitions. [2022-04-28 07:22:29,154 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 55 transitions. [2022-04-28 07:22:29,232 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:22:29,235 INFO L225 Difference]: With dead ends: 47 [2022-04-28 07:22:29,235 INFO L226 Difference]: Without dead ends: 45 [2022-04-28 07:22:29,237 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2022-04-28 07:22:29,241 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 26 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 10 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-04-28 07:22:29,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 137 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 227 Invalid, 2 Unknown, 0 Unchecked, 5.0s Time] [2022-04-28 07:22:29,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-28 07:22:29,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2022-04-28 07:22:29,276 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:22:29,276 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 41 states, 25 states have (on average 1.24) internal successors, (31), 27 states have internal predecessors, (31), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:22:29,277 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 41 states, 25 states have (on average 1.24) internal successors, (31), 27 states have internal predecessors, (31), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:22:29,278 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 41 states, 25 states have (on average 1.24) internal successors, (31), 27 states have internal predecessors, (31), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:22:29,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:22:29,280 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-04-28 07:22:29,280 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2022-04-28 07:22:29,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:22:29,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:22:29,284 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 25 states have (on average 1.24) internal successors, (31), 27 states have internal predecessors, (31), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 45 states. [2022-04-28 07:22:29,286 INFO L87 Difference]: Start difference. First operand has 41 states, 25 states have (on average 1.24) internal successors, (31), 27 states have internal predecessors, (31), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 45 states. [2022-04-28 07:22:29,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:22:29,290 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-04-28 07:22:29,290 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2022-04-28 07:22:29,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:22:29,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:22:29,291 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:22:29,291 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:22:29,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 25 states have (on average 1.24) internal successors, (31), 27 states have internal predecessors, (31), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:22:29,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2022-04-28 07:22:29,299 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 34 [2022-04-28 07:22:29,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:22:29,299 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2022-04-28 07:22:29,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 07:22:29,299 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 49 transitions. [2022-04-28 07:22:29,357 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:22:29,358 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2022-04-28 07:22:29,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 07:22:29,359 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:22:29,359 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 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 07:22:29,379 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 07:22:29,559 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 07:22:29,561 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:22:29,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:22:29,561 INFO L85 PathProgramCache]: Analyzing trace with hash 412541489, now seen corresponding path program 1 times [2022-04-28 07:22:29,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:22:29,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1837459298] [2022-04-28 07:22:29,562 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:22:29,562 INFO L85 PathProgramCache]: Analyzing trace with hash 412541489, now seen corresponding path program 2 times [2022-04-28 07:22:29,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:22:29,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760185179] [2022-04-28 07:22:29,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:22:29,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:22:29,578 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:22:29,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1098827749] [2022-04-28 07:22:29,578 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:22:29,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:22:29,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:22:29,579 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 07:22:29,606 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 07:22:29,668 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:22:29,668 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:22:29,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 07:22:29,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:22:29,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:22:29,970 INFO L272 TraceCheckUtils]: 0: Hoare triple {1116#true} call ULTIMATE.init(); {1116#true} is VALID [2022-04-28 07:22:29,970 INFO L290 TraceCheckUtils]: 1: Hoare triple {1116#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); {1116#true} is VALID [2022-04-28 07:22:29,970 INFO L290 TraceCheckUtils]: 2: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-28 07:22:29,970 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1116#true} {1116#true} #83#return; {1116#true} is VALID [2022-04-28 07:22:29,970 INFO L272 TraceCheckUtils]: 4: Hoare triple {1116#true} call #t~ret6 := main(); {1116#true} is VALID [2022-04-28 07:22:29,970 INFO L290 TraceCheckUtils]: 5: Hoare triple {1116#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; {1116#true} is VALID [2022-04-28 07:22:29,970 INFO L272 TraceCheckUtils]: 6: Hoare triple {1116#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 1 then 1 else 0)); {1116#true} is VALID [2022-04-28 07:22:29,971 INFO L290 TraceCheckUtils]: 7: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-28 07:22:29,971 INFO L290 TraceCheckUtils]: 8: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-28 07:22:29,971 INFO L290 TraceCheckUtils]: 9: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-28 07:22:29,971 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1116#true} {1116#true} #71#return; {1116#true} is VALID [2022-04-28 07:22:29,971 INFO L290 TraceCheckUtils]: 11: Hoare triple {1116#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1116#true} is VALID [2022-04-28 07:22:29,971 INFO L272 TraceCheckUtils]: 12: Hoare triple {1116#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 1 then 1 else 0)); {1116#true} is VALID [2022-04-28 07:22:29,972 INFO L290 TraceCheckUtils]: 13: Hoare triple {1116#true} ~cond := #in~cond; {1160#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 07:22:29,972 INFO L290 TraceCheckUtils]: 14: Hoare triple {1160#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1164#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 07:22:29,972 INFO L290 TraceCheckUtils]: 15: Hoare triple {1164#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1164#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 07:22:29,973 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1164#(not (= |assume_abort_if_not_#in~cond| 0))} {1116#true} #73#return; {1171#(and (<= 0 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 07:22:29,973 INFO L272 TraceCheckUtils]: 17: Hoare triple {1171#(and (<= 0 main_~y~0) (<= main_~y~0 1))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1116#true} is VALID [2022-04-28 07:22:29,973 INFO L290 TraceCheckUtils]: 18: Hoare triple {1116#true} ~cond := #in~cond; {1160#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 07:22:29,974 INFO L290 TraceCheckUtils]: 19: Hoare triple {1160#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1164#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 07:22:29,974 INFO L290 TraceCheckUtils]: 20: Hoare triple {1164#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1164#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 07:22:29,975 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1164#(not (= |assume_abort_if_not_#in~cond| 0))} {1171#(and (<= 0 main_~y~0) (<= main_~y~0 1))} #75#return; {1187#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 07:22:29,975 INFO L290 TraceCheckUtils]: 22: Hoare triple {1187#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {1191#(and (<= main_~b~0 1) (<= 1 main_~b~0))} is VALID [2022-04-28 07:22:29,975 INFO L290 TraceCheckUtils]: 23: Hoare triple {1191#(and (<= main_~b~0 1) (<= 1 main_~b~0))} assume !false; {1191#(and (<= main_~b~0 1) (<= 1 main_~b~0))} is VALID [2022-04-28 07:22:29,976 INFO L272 TraceCheckUtils]: 24: Hoare triple {1191#(and (<= main_~b~0 1) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1116#true} is VALID [2022-04-28 07:22:29,976 INFO L290 TraceCheckUtils]: 25: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-28 07:22:29,976 INFO L290 TraceCheckUtils]: 26: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-28 07:22:29,976 INFO L290 TraceCheckUtils]: 27: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-28 07:22:29,977 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1116#true} {1191#(and (<= main_~b~0 1) (<= 1 main_~b~0))} #77#return; {1191#(and (<= main_~b~0 1) (<= 1 main_~b~0))} is VALID [2022-04-28 07:22:29,977 INFO L290 TraceCheckUtils]: 29: Hoare triple {1191#(and (<= main_~b~0 1) (<= 1 main_~b~0))} assume !!(0 != ~a~0 && 0 != ~b~0); {1191#(and (<= main_~b~0 1) (<= 1 main_~b~0))} is VALID [2022-04-28 07:22:29,978 INFO L290 TraceCheckUtils]: 30: Hoare triple {1191#(and (<= main_~b~0 1) (<= 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; {1117#false} is VALID [2022-04-28 07:22:29,978 INFO L290 TraceCheckUtils]: 31: Hoare triple {1117#false} assume !false; {1117#false} is VALID [2022-04-28 07:22:29,978 INFO L272 TraceCheckUtils]: 32: Hoare triple {1117#false} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1117#false} is VALID [2022-04-28 07:22:29,978 INFO L290 TraceCheckUtils]: 33: Hoare triple {1117#false} ~cond := #in~cond; {1117#false} is VALID [2022-04-28 07:22:29,978 INFO L290 TraceCheckUtils]: 34: Hoare triple {1117#false} assume 0 == ~cond; {1117#false} is VALID [2022-04-28 07:22:29,978 INFO L290 TraceCheckUtils]: 35: Hoare triple {1117#false} assume !false; {1117#false} is VALID [2022-04-28 07:22:29,979 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 07:22:29,979 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 07:22:29,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:22:29,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760185179] [2022-04-28 07:22:29,979 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:22:29,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098827749] [2022-04-28 07:22:29,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1098827749] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:22:29,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:22:29,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 07:22:29,980 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:22:29,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1837459298] [2022-04-28 07:22:29,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1837459298] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:22:29,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:22:29,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 07:22:29,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681963816] [2022-04-28 07:22:29,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:22:29,981 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 36 [2022-04-28 07:22:29,981 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:22:29,981 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 07:22:30,001 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:22:30,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 07:22:30,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:22:30,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 07:22:30,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-28 07:22:30,002 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 07:22:30,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:22:30,259 INFO L93 Difference]: Finished difference Result 59 states and 75 transitions. [2022-04-28 07:22:30,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 07:22:30,259 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 36 [2022-04-28 07:22:30,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:22:30,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 07:22:30,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 69 transitions. [2022-04-28 07:22:30,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 07:22:30,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 69 transitions. [2022-04-28 07:22:30,263 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 69 transitions. [2022-04-28 07:22:30,313 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:22:30,314 INFO L225 Difference]: With dead ends: 59 [2022-04-28 07:22:30,314 INFO L226 Difference]: Without dead ends: 45 [2022-04-28 07:22:30,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-04-28 07:22:30,315 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 35 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 07:22:30,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 96 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 07:22:30,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-28 07:22:30,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2022-04-28 07:22:30,370 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:22:30,370 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 43 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 29 states have internal predecessors, (33), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:22:30,371 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 43 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 29 states have internal predecessors, (33), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:22:30,371 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 43 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 29 states have internal predecessors, (33), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:22:30,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:22:30,372 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2022-04-28 07:22:30,372 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2022-04-28 07:22:30,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:22:30,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:22:30,373 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 29 states have internal predecessors, (33), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 45 states. [2022-04-28 07:22:30,373 INFO L87 Difference]: Start difference. First operand has 43 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 29 states have internal predecessors, (33), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 45 states. [2022-04-28 07:22:30,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:22:30,374 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2022-04-28 07:22:30,374 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2022-04-28 07:22:30,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:22:30,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:22:30,375 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:22:30,375 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:22:30,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 29 states have internal predecessors, (33), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:22:30,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2022-04-28 07:22:30,376 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 36 [2022-04-28 07:22:30,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:22:30,376 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2022-04-28 07:22:30,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 07:22:30,377 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 51 transitions. [2022-04-28 07:22:30,431 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:22:30,431 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2022-04-28 07:22:30,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 07:22:30,432 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:22:30,432 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:22:30,450 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 07:22:30,632 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 07:22:30,633 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:22:30,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:22:30,633 INFO L85 PathProgramCache]: Analyzing trace with hash 262800198, now seen corresponding path program 1 times [2022-04-28 07:22:30,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:22:30,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1179308237] [2022-04-28 07:22:30,634 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:22:30,634 INFO L85 PathProgramCache]: Analyzing trace with hash 262800198, now seen corresponding path program 2 times [2022-04-28 07:22:30,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:22:30,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230191145] [2022-04-28 07:22:30,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:22:30,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:22:30,646 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:22:30,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1073226459] [2022-04-28 07:22:30,646 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:22:30,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:22:30,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:22:30,648 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 07:22:30,651 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 07:22:30,681 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:22:30,681 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:22:30,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 07:22:30,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:22:30,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:22:30,982 INFO L272 TraceCheckUtils]: 0: Hoare triple {1528#true} call ULTIMATE.init(); {1528#true} is VALID [2022-04-28 07:22:30,982 INFO L290 TraceCheckUtils]: 1: Hoare triple {1528#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); {1528#true} is VALID [2022-04-28 07:22:30,982 INFO L290 TraceCheckUtils]: 2: Hoare triple {1528#true} assume true; {1528#true} is VALID [2022-04-28 07:22:30,982 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1528#true} {1528#true} #83#return; {1528#true} is VALID [2022-04-28 07:22:30,983 INFO L272 TraceCheckUtils]: 4: Hoare triple {1528#true} call #t~ret6 := main(); {1528#true} is VALID [2022-04-28 07:22:30,983 INFO L290 TraceCheckUtils]: 5: Hoare triple {1528#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; {1528#true} is VALID [2022-04-28 07:22:30,983 INFO L272 TraceCheckUtils]: 6: Hoare triple {1528#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 1 then 1 else 0)); {1528#true} is VALID [2022-04-28 07:22:30,983 INFO L290 TraceCheckUtils]: 7: Hoare triple {1528#true} ~cond := #in~cond; {1554#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 07:22:30,983 INFO L290 TraceCheckUtils]: 8: Hoare triple {1554#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1558#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 07:22:30,984 INFO L290 TraceCheckUtils]: 9: Hoare triple {1558#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1558#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 07:22:30,984 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1558#(not (= |assume_abort_if_not_#in~cond| 0))} {1528#true} #71#return; {1565#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 07:22:30,985 INFO L290 TraceCheckUtils]: 11: Hoare triple {1565#(and (<= 0 main_~x~0) (<= main_~x~0 1))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1565#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 07:22:30,985 INFO L272 TraceCheckUtils]: 12: Hoare triple {1565#(and (<= 0 main_~x~0) (<= main_~x~0 1))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 1 then 1 else 0)); {1528#true} is VALID [2022-04-28 07:22:30,985 INFO L290 TraceCheckUtils]: 13: Hoare triple {1528#true} ~cond := #in~cond; {1528#true} is VALID [2022-04-28 07:22:30,985 INFO L290 TraceCheckUtils]: 14: Hoare triple {1528#true} assume !(0 == ~cond); {1528#true} is VALID [2022-04-28 07:22:30,985 INFO L290 TraceCheckUtils]: 15: Hoare triple {1528#true} assume true; {1528#true} is VALID [2022-04-28 07:22:30,988 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1528#true} {1565#(and (<= 0 main_~x~0) (<= main_~x~0 1))} #73#return; {1565#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 07:22:30,988 INFO L272 TraceCheckUtils]: 17: Hoare triple {1565#(and (<= 0 main_~x~0) (<= main_~x~0 1))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1528#true} is VALID [2022-04-28 07:22:30,989 INFO L290 TraceCheckUtils]: 18: Hoare triple {1528#true} ~cond := #in~cond; {1554#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 07:22:30,989 INFO L290 TraceCheckUtils]: 19: Hoare triple {1554#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1558#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 07:22:30,989 INFO L290 TraceCheckUtils]: 20: Hoare triple {1558#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1558#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 07:22:30,990 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1558#(not (= |assume_abort_if_not_#in~cond| 0))} {1565#(and (<= 0 main_~x~0) (<= main_~x~0 1))} #75#return; {1599#(and (<= 0 main_~x~0) (<= main_~x~0 1) (<= 1 main_~y~0))} is VALID [2022-04-28 07:22:30,990 INFO L290 TraceCheckUtils]: 22: Hoare triple {1599#(and (<= 0 main_~x~0) (<= main_~x~0 1) (<= 1 main_~y~0))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {1603#(and (<= 0 main_~a~0) (<= 1 main_~b~0))} is VALID [2022-04-28 07:22:30,990 INFO L290 TraceCheckUtils]: 23: Hoare triple {1603#(and (<= 0 main_~a~0) (<= 1 main_~b~0))} assume !false; {1603#(and (<= 0 main_~a~0) (<= 1 main_~b~0))} is VALID [2022-04-28 07:22:30,990 INFO L272 TraceCheckUtils]: 24: Hoare triple {1603#(and (<= 0 main_~a~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)); {1528#true} is VALID [2022-04-28 07:22:30,991 INFO L290 TraceCheckUtils]: 25: Hoare triple {1528#true} ~cond := #in~cond; {1528#true} is VALID [2022-04-28 07:22:30,991 INFO L290 TraceCheckUtils]: 26: Hoare triple {1528#true} assume !(0 == ~cond); {1528#true} is VALID [2022-04-28 07:22:30,991 INFO L290 TraceCheckUtils]: 27: Hoare triple {1528#true} assume true; {1528#true} is VALID [2022-04-28 07:22:30,991 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1528#true} {1603#(and (<= 0 main_~a~0) (<= 1 main_~b~0))} #77#return; {1603#(and (<= 0 main_~a~0) (<= 1 main_~b~0))} is VALID [2022-04-28 07:22:30,992 INFO L290 TraceCheckUtils]: 29: Hoare triple {1603#(and (<= 0 main_~a~0) (<= 1 main_~b~0))} assume !(0 != ~a~0 && 0 != ~b~0); {1625#(and (= main_~a~0 0) (<= 1 main_~b~0))} is VALID [2022-04-28 07:22:30,992 INFO L272 TraceCheckUtils]: 30: Hoare triple {1625#(and (= main_~a~0 0) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {1528#true} is VALID [2022-04-28 07:22:30,992 INFO L290 TraceCheckUtils]: 31: Hoare triple {1528#true} ~cond := #in~cond; {1528#true} is VALID [2022-04-28 07:22:30,992 INFO L290 TraceCheckUtils]: 32: Hoare triple {1528#true} assume !(0 == ~cond); {1528#true} is VALID [2022-04-28 07:22:30,992 INFO L290 TraceCheckUtils]: 33: Hoare triple {1528#true} assume true; {1528#true} is VALID [2022-04-28 07:22:30,992 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1528#true} {1625#(and (= main_~a~0 0) (<= 1 main_~b~0))} #79#return; {1625#(and (= main_~a~0 0) (<= 1 main_~b~0))} is VALID [2022-04-28 07:22:30,993 INFO L272 TraceCheckUtils]: 35: Hoare triple {1625#(and (= main_~a~0 0) (<= 1 main_~b~0))} call __VERIFIER_assert((if 0 == ~a~0 * ~b~0 then 1 else 0)); {1644#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:22:30,993 INFO L290 TraceCheckUtils]: 36: Hoare triple {1644#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1648#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:22:30,994 INFO L290 TraceCheckUtils]: 37: Hoare triple {1648#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1529#false} is VALID [2022-04-28 07:22:30,994 INFO L290 TraceCheckUtils]: 38: Hoare triple {1529#false} assume !false; {1529#false} is VALID [2022-04-28 07:22:30,994 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 07:22:30,994 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:22:31,244 INFO L290 TraceCheckUtils]: 38: Hoare triple {1529#false} assume !false; {1529#false} is VALID [2022-04-28 07:22:31,244 INFO L290 TraceCheckUtils]: 37: Hoare triple {1648#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1529#false} is VALID [2022-04-28 07:22:31,244 INFO L290 TraceCheckUtils]: 36: Hoare triple {1644#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1648#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:22:31,245 INFO L272 TraceCheckUtils]: 35: Hoare triple {1664#(= (* main_~b~0 main_~a~0) 0)} call __VERIFIER_assert((if 0 == ~a~0 * ~b~0 then 1 else 0)); {1644#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:22:31,245 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1528#true} {1664#(= (* main_~b~0 main_~a~0) 0)} #79#return; {1664#(= (* main_~b~0 main_~a~0) 0)} is VALID [2022-04-28 07:22:31,245 INFO L290 TraceCheckUtils]: 33: Hoare triple {1528#true} assume true; {1528#true} is VALID [2022-04-28 07:22:31,246 INFO L290 TraceCheckUtils]: 32: Hoare triple {1528#true} assume !(0 == ~cond); {1528#true} is VALID [2022-04-28 07:22:31,246 INFO L290 TraceCheckUtils]: 31: Hoare triple {1528#true} ~cond := #in~cond; {1528#true} is VALID [2022-04-28 07:22:31,246 INFO L272 TraceCheckUtils]: 30: Hoare triple {1664#(= (* main_~b~0 main_~a~0) 0)} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {1528#true} is VALID [2022-04-28 07:22:31,247 INFO L290 TraceCheckUtils]: 29: Hoare triple {1528#true} assume !(0 != ~a~0 && 0 != ~b~0); {1664#(= (* main_~b~0 main_~a~0) 0)} is VALID [2022-04-28 07:22:31,247 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1528#true} {1528#true} #77#return; {1528#true} is VALID [2022-04-28 07:22:31,247 INFO L290 TraceCheckUtils]: 27: Hoare triple {1528#true} assume true; {1528#true} is VALID [2022-04-28 07:22:31,247 INFO L290 TraceCheckUtils]: 26: Hoare triple {1528#true} assume !(0 == ~cond); {1528#true} is VALID [2022-04-28 07:22:31,247 INFO L290 TraceCheckUtils]: 25: Hoare triple {1528#true} ~cond := #in~cond; {1528#true} is VALID [2022-04-28 07:22:31,247 INFO L272 TraceCheckUtils]: 24: Hoare triple {1528#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1528#true} is VALID [2022-04-28 07:22:31,247 INFO L290 TraceCheckUtils]: 23: Hoare triple {1528#true} assume !false; {1528#true} is VALID [2022-04-28 07:22:31,247 INFO L290 TraceCheckUtils]: 22: Hoare triple {1528#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {1528#true} is VALID [2022-04-28 07:22:31,247 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1528#true} {1528#true} #75#return; {1528#true} is VALID [2022-04-28 07:22:31,248 INFO L290 TraceCheckUtils]: 20: Hoare triple {1528#true} assume true; {1528#true} is VALID [2022-04-28 07:22:31,248 INFO L290 TraceCheckUtils]: 19: Hoare triple {1528#true} assume !(0 == ~cond); {1528#true} is VALID [2022-04-28 07:22:31,248 INFO L290 TraceCheckUtils]: 18: Hoare triple {1528#true} ~cond := #in~cond; {1528#true} is VALID [2022-04-28 07:22:31,248 INFO L272 TraceCheckUtils]: 17: Hoare triple {1528#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1528#true} is VALID [2022-04-28 07:22:31,248 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1528#true} {1528#true} #73#return; {1528#true} is VALID [2022-04-28 07:22:31,248 INFO L290 TraceCheckUtils]: 15: Hoare triple {1528#true} assume true; {1528#true} is VALID [2022-04-28 07:22:31,248 INFO L290 TraceCheckUtils]: 14: Hoare triple {1528#true} assume !(0 == ~cond); {1528#true} is VALID [2022-04-28 07:22:31,248 INFO L290 TraceCheckUtils]: 13: Hoare triple {1528#true} ~cond := #in~cond; {1528#true} is VALID [2022-04-28 07:22:31,248 INFO L272 TraceCheckUtils]: 12: Hoare triple {1528#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 1 then 1 else 0)); {1528#true} is VALID [2022-04-28 07:22:31,248 INFO L290 TraceCheckUtils]: 11: Hoare triple {1528#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1528#true} is VALID [2022-04-28 07:22:31,249 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1528#true} {1528#true} #71#return; {1528#true} is VALID [2022-04-28 07:22:31,249 INFO L290 TraceCheckUtils]: 9: Hoare triple {1528#true} assume true; {1528#true} is VALID [2022-04-28 07:22:31,249 INFO L290 TraceCheckUtils]: 8: Hoare triple {1528#true} assume !(0 == ~cond); {1528#true} is VALID [2022-04-28 07:22:31,249 INFO L290 TraceCheckUtils]: 7: Hoare triple {1528#true} ~cond := #in~cond; {1528#true} is VALID [2022-04-28 07:22:31,249 INFO L272 TraceCheckUtils]: 6: Hoare triple {1528#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 1 then 1 else 0)); {1528#true} is VALID [2022-04-28 07:22:31,249 INFO L290 TraceCheckUtils]: 5: Hoare triple {1528#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; {1528#true} is VALID [2022-04-28 07:22:31,249 INFO L272 TraceCheckUtils]: 4: Hoare triple {1528#true} call #t~ret6 := main(); {1528#true} is VALID [2022-04-28 07:22:31,249 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1528#true} {1528#true} #83#return; {1528#true} is VALID [2022-04-28 07:22:31,249 INFO L290 TraceCheckUtils]: 2: Hoare triple {1528#true} assume true; {1528#true} is VALID [2022-04-28 07:22:31,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {1528#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); {1528#true} is VALID [2022-04-28 07:22:31,250 INFO L272 TraceCheckUtils]: 0: Hoare triple {1528#true} call ULTIMATE.init(); {1528#true} is VALID [2022-04-28 07:22:31,250 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 07:22:31,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:22:31,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230191145] [2022-04-28 07:22:31,250 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:22:31,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073226459] [2022-04-28 07:22:31,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073226459] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 07:22:31,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:22:31,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2022-04-28 07:22:31,250 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:22:31,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1179308237] [2022-04-28 07:22:31,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1179308237] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:22:31,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:22:31,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 07:22:31,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109536155] [2022-04-28 07:22:31,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:22:31,251 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 39 [2022-04-28 07:22:31,251 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:22:31,251 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-28 07:22:31,269 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:22:31,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 07:22:31,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:22:31,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 07:22:31,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-04-28 07:22:31,270 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-28 07:22:31,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:22:31,594 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2022-04-28 07:22:31,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 07:22:31,594 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 39 [2022-04-28 07:22:31,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:22:31,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-28 07:22:31,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-28 07:22:31,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-28 07:22:31,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-28 07:22:31,596 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2022-04-28 07:22:31,621 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:22:31,622 INFO L225 Difference]: With dead ends: 49 [2022-04-28 07:22:31,622 INFO L226 Difference]: Without dead ends: 37 [2022-04-28 07:22:31,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-04-28 07:22:31,623 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 5 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 07:22:31,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 125 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 07:22:31,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-28 07:22:31,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-28 07:22:31,679 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:22:31,680 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:22:31,680 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:22:31,680 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:22:31,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:22:31,682 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-04-28 07:22:31,682 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-04-28 07:22:31,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:22:31,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:22:31,682 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 37 states. [2022-04-28 07:22:31,682 INFO L87 Difference]: Start difference. First operand has 37 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 37 states. [2022-04-28 07:22:31,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:22:31,687 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-04-28 07:22:31,687 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-04-28 07:22:31,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:22:31,687 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:22:31,687 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:22:31,687 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:22:31,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:22:31,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2022-04-28 07:22:31,690 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 39 [2022-04-28 07:22:31,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:22:31,690 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2022-04-28 07:22:31,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-28 07:22:31,690 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 43 transitions. [2022-04-28 07:22:31,757 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:22:31,757 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-04-28 07:22:31,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-28 07:22:31,758 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:22:31,758 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:22:31,774 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 07:22:31,965 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 07:22:31,965 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:22:31,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:22:31,966 INFO L85 PathProgramCache]: Analyzing trace with hash 844519116, now seen corresponding path program 1 times [2022-04-28 07:22:31,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:22:31,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1176515260] [2022-04-28 07:22:31,966 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:22:31,966 INFO L85 PathProgramCache]: Analyzing trace with hash 844519116, now seen corresponding path program 2 times [2022-04-28 07:22:31,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:22:31,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91217539] [2022-04-28 07:22:31,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:22:31,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:22:31,978 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:22:31,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [224320136] [2022-04-28 07:22:31,978 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:22:31,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:22:31,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:22:31,979 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 07:22:31,983 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 07:22:32,016 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:22:32,017 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:22:32,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 07:22:32,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:22:32,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:22:32,359 INFO L272 TraceCheckUtils]: 0: Hoare triple {2020#true} call ULTIMATE.init(); {2020#true} is VALID [2022-04-28 07:22:32,359 INFO L290 TraceCheckUtils]: 1: Hoare triple {2020#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); {2020#true} is VALID [2022-04-28 07:22:32,360 INFO L290 TraceCheckUtils]: 2: Hoare triple {2020#true} assume true; {2020#true} is VALID [2022-04-28 07:22:32,360 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2020#true} {2020#true} #83#return; {2020#true} is VALID [2022-04-28 07:22:32,360 INFO L272 TraceCheckUtils]: 4: Hoare triple {2020#true} call #t~ret6 := main(); {2020#true} is VALID [2022-04-28 07:22:32,360 INFO L290 TraceCheckUtils]: 5: Hoare triple {2020#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; {2020#true} is VALID [2022-04-28 07:22:32,360 INFO L272 TraceCheckUtils]: 6: Hoare triple {2020#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 1 then 1 else 0)); {2020#true} is VALID [2022-04-28 07:22:32,360 INFO L290 TraceCheckUtils]: 7: Hoare triple {2020#true} ~cond := #in~cond; {2046#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 07:22:32,361 INFO L290 TraceCheckUtils]: 8: Hoare triple {2046#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2050#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 07:22:32,361 INFO L290 TraceCheckUtils]: 9: Hoare triple {2050#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2050#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 07:22:32,362 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2050#(not (= |assume_abort_if_not_#in~cond| 0))} {2020#true} #71#return; {2057#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 07:22:32,362 INFO L290 TraceCheckUtils]: 11: Hoare triple {2057#(and (<= 0 main_~x~0) (<= main_~x~0 1))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2057#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 07:22:32,362 INFO L272 TraceCheckUtils]: 12: Hoare triple {2057#(and (<= 0 main_~x~0) (<= main_~x~0 1))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 1 then 1 else 0)); {2020#true} is VALID [2022-04-28 07:22:32,362 INFO L290 TraceCheckUtils]: 13: Hoare triple {2020#true} ~cond := #in~cond; {2020#true} is VALID [2022-04-28 07:22:32,363 INFO L290 TraceCheckUtils]: 14: Hoare triple {2020#true} assume !(0 == ~cond); {2020#true} is VALID [2022-04-28 07:22:32,363 INFO L290 TraceCheckUtils]: 15: Hoare triple {2020#true} assume true; {2020#true} is VALID [2022-04-28 07:22:32,363 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2020#true} {2057#(and (<= 0 main_~x~0) (<= main_~x~0 1))} #73#return; {2057#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 07:22:32,363 INFO L272 TraceCheckUtils]: 17: Hoare triple {2057#(and (<= 0 main_~x~0) (<= main_~x~0 1))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2020#true} is VALID [2022-04-28 07:22:32,363 INFO L290 TraceCheckUtils]: 18: Hoare triple {2020#true} ~cond := #in~cond; {2020#true} is VALID [2022-04-28 07:22:32,364 INFO L290 TraceCheckUtils]: 19: Hoare triple {2020#true} assume !(0 == ~cond); {2020#true} is VALID [2022-04-28 07:22:32,364 INFO L290 TraceCheckUtils]: 20: Hoare triple {2020#true} assume true; {2020#true} is VALID [2022-04-28 07:22:32,364 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2020#true} {2057#(and (<= 0 main_~x~0) (<= main_~x~0 1))} #75#return; {2057#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 07:22:32,365 INFO L290 TraceCheckUtils]: 22: Hoare triple {2057#(and (<= 0 main_~x~0) (<= main_~x~0 1))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {2094#(and (<= main_~a~0 1) (<= 0 main_~a~0))} is VALID [2022-04-28 07:22:32,365 INFO L290 TraceCheckUtils]: 23: Hoare triple {2094#(and (<= main_~a~0 1) (<= 0 main_~a~0))} assume !false; {2094#(and (<= main_~a~0 1) (<= 0 main_~a~0))} is VALID [2022-04-28 07:22:32,365 INFO L272 TraceCheckUtils]: 24: Hoare triple {2094#(and (<= main_~a~0 1) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {2020#true} is VALID [2022-04-28 07:22:32,365 INFO L290 TraceCheckUtils]: 25: Hoare triple {2020#true} ~cond := #in~cond; {2020#true} is VALID [2022-04-28 07:22:32,365 INFO L290 TraceCheckUtils]: 26: Hoare triple {2020#true} assume !(0 == ~cond); {2020#true} is VALID [2022-04-28 07:22:32,365 INFO L290 TraceCheckUtils]: 27: Hoare triple {2020#true} assume true; {2020#true} is VALID [2022-04-28 07:22:32,366 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2020#true} {2094#(and (<= main_~a~0 1) (<= 0 main_~a~0))} #77#return; {2094#(and (<= main_~a~0 1) (<= 0 main_~a~0))} is VALID [2022-04-28 07:22:32,367 INFO L290 TraceCheckUtils]: 29: Hoare triple {2094#(and (<= main_~a~0 1) (<= 0 main_~a~0))} assume !!(0 != ~a~0 && 0 != ~b~0); {2116#(and (<= main_~a~0 1) (<= 0 main_~a~0) (not (= main_~a~0 0)))} is VALID [2022-04-28 07:22:32,367 INFO L290 TraceCheckUtils]: 30: Hoare triple {2116#(and (<= main_~a~0 1) (<= 0 main_~a~0) (not (= main_~a~0 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)); {2116#(and (<= main_~a~0 1) (<= 0 main_~a~0) (not (= main_~a~0 0)))} is VALID [2022-04-28 07:22:32,368 INFO L290 TraceCheckUtils]: 31: Hoare triple {2116#(and (<= main_~a~0 1) (<= 0 main_~a~0) (not (= main_~a~0 0)))} assume !(1 == (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)); {2116#(and (<= main_~a~0 1) (<= 0 main_~a~0) (not (= main_~a~0 0)))} is VALID [2022-04-28 07:22:32,369 INFO L290 TraceCheckUtils]: 32: Hoare triple {2116#(and (<= main_~a~0 1) (<= 0 main_~a~0) (not (= main_~a~0 0)))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~b~0 := ~b~0 - 1;~q~0 := ~q~0 + ~a~0 * ~p~0; {2021#false} is VALID [2022-04-28 07:22:32,369 INFO L290 TraceCheckUtils]: 33: Hoare triple {2021#false} assume !false; {2021#false} is VALID [2022-04-28 07:22:32,369 INFO L272 TraceCheckUtils]: 34: Hoare triple {2021#false} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {2021#false} is VALID [2022-04-28 07:22:32,369 INFO L290 TraceCheckUtils]: 35: Hoare triple {2021#false} ~cond := #in~cond; {2021#false} is VALID [2022-04-28 07:22:32,369 INFO L290 TraceCheckUtils]: 36: Hoare triple {2021#false} assume 0 == ~cond; {2021#false} is VALID [2022-04-28 07:22:32,369 INFO L290 TraceCheckUtils]: 37: Hoare triple {2021#false} assume !false; {2021#false} is VALID [2022-04-28 07:22:32,369 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 07:22:32,369 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:22:32,888 INFO L290 TraceCheckUtils]: 37: Hoare triple {2021#false} assume !false; {2021#false} is VALID [2022-04-28 07:22:32,888 INFO L290 TraceCheckUtils]: 36: Hoare triple {2021#false} assume 0 == ~cond; {2021#false} is VALID [2022-04-28 07:22:32,888 INFO L290 TraceCheckUtils]: 35: Hoare triple {2021#false} ~cond := #in~cond; {2021#false} is VALID [2022-04-28 07:22:32,889 INFO L272 TraceCheckUtils]: 34: Hoare triple {2021#false} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {2021#false} is VALID [2022-04-28 07:22:32,889 INFO L290 TraceCheckUtils]: 33: Hoare triple {2021#false} assume !false; {2021#false} is VALID [2022-04-28 07:22:32,889 INFO L290 TraceCheckUtils]: 32: Hoare triple {2156#(and (not (< main_~a~0 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) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~b~0 := ~b~0 - 1;~q~0 := ~q~0 + ~a~0 * ~p~0; {2021#false} is VALID [2022-04-28 07:22:32,890 INFO L290 TraceCheckUtils]: 31: Hoare triple {2156#(and (not (< main_~a~0 0)) (not (<= (mod main_~a~0 2) 0)))} assume !(1 == (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)); {2156#(and (not (< main_~a~0 0)) (not (<= (mod main_~a~0 2) 0)))} is VALID [2022-04-28 07:22:32,890 INFO L290 TraceCheckUtils]: 30: Hoare triple {2156#(and (not (< main_~a~0 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)); {2156#(and (not (< main_~a~0 0)) (not (<= (mod main_~a~0 2) 0)))} is VALID [2022-04-28 07:22:32,891 INFO L290 TraceCheckUtils]: 29: Hoare triple {2166#(or (= main_~a~0 0) (and (not (< main_~a~0 0)) (not (<= (mod main_~a~0 2) 0))))} assume !!(0 != ~a~0 && 0 != ~b~0); {2156#(and (not (< main_~a~0 0)) (not (<= (mod main_~a~0 2) 0)))} is VALID [2022-04-28 07:22:32,891 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2020#true} {2166#(or (= main_~a~0 0) (and (not (< main_~a~0 0)) (not (<= (mod main_~a~0 2) 0))))} #77#return; {2166#(or (= main_~a~0 0) (and (not (< main_~a~0 0)) (not (<= (mod main_~a~0 2) 0))))} is VALID [2022-04-28 07:22:32,891 INFO L290 TraceCheckUtils]: 27: Hoare triple {2020#true} assume true; {2020#true} is VALID [2022-04-28 07:22:32,892 INFO L290 TraceCheckUtils]: 26: Hoare triple {2020#true} assume !(0 == ~cond); {2020#true} is VALID [2022-04-28 07:22:32,892 INFO L290 TraceCheckUtils]: 25: Hoare triple {2020#true} ~cond := #in~cond; {2020#true} is VALID [2022-04-28 07:22:32,893 INFO L272 TraceCheckUtils]: 24: Hoare triple {2166#(or (= main_~a~0 0) (and (not (< main_~a~0 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)); {2020#true} is VALID [2022-04-28 07:22:32,894 INFO L290 TraceCheckUtils]: 23: Hoare triple {2166#(or (= main_~a~0 0) (and (not (< main_~a~0 0)) (not (<= (mod main_~a~0 2) 0))))} assume !false; {2166#(or (= main_~a~0 0) (and (not (< main_~a~0 0)) (not (<= (mod main_~a~0 2) 0))))} is VALID [2022-04-28 07:22:32,894 INFO L290 TraceCheckUtils]: 22: Hoare triple {2188#(or (= main_~x~0 0) (and (not (< main_~x~0 0)) (not (<= (mod main_~x~0 2) 0))))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {2166#(or (= main_~a~0 0) (and (not (< main_~a~0 0)) (not (<= (mod main_~a~0 2) 0))))} is VALID [2022-04-28 07:22:32,895 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2020#true} {2188#(or (= main_~x~0 0) (and (not (< main_~x~0 0)) (not (<= (mod main_~x~0 2) 0))))} #75#return; {2188#(or (= main_~x~0 0) (and (not (< main_~x~0 0)) (not (<= (mod main_~x~0 2) 0))))} is VALID [2022-04-28 07:22:32,895 INFO L290 TraceCheckUtils]: 20: Hoare triple {2020#true} assume true; {2020#true} is VALID [2022-04-28 07:22:32,895 INFO L290 TraceCheckUtils]: 19: Hoare triple {2020#true} assume !(0 == ~cond); {2020#true} is VALID [2022-04-28 07:22:32,895 INFO L290 TraceCheckUtils]: 18: Hoare triple {2020#true} ~cond := #in~cond; {2020#true} is VALID [2022-04-28 07:22:32,895 INFO L272 TraceCheckUtils]: 17: Hoare triple {2188#(or (= main_~x~0 0) (and (not (< main_~x~0 0)) (not (<= (mod main_~x~0 2) 0))))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2020#true} is VALID [2022-04-28 07:22:32,895 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2020#true} {2188#(or (= main_~x~0 0) (and (not (< main_~x~0 0)) (not (<= (mod main_~x~0 2) 0))))} #73#return; {2188#(or (= main_~x~0 0) (and (not (< main_~x~0 0)) (not (<= (mod main_~x~0 2) 0))))} is VALID [2022-04-28 07:22:32,895 INFO L290 TraceCheckUtils]: 15: Hoare triple {2020#true} assume true; {2020#true} is VALID [2022-04-28 07:22:32,896 INFO L290 TraceCheckUtils]: 14: Hoare triple {2020#true} assume !(0 == ~cond); {2020#true} is VALID [2022-04-28 07:22:32,896 INFO L290 TraceCheckUtils]: 13: Hoare triple {2020#true} ~cond := #in~cond; {2020#true} is VALID [2022-04-28 07:22:32,896 INFO L272 TraceCheckUtils]: 12: Hoare triple {2188#(or (= main_~x~0 0) (and (not (< main_~x~0 0)) (not (<= (mod main_~x~0 2) 0))))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 1 then 1 else 0)); {2020#true} is VALID [2022-04-28 07:22:32,896 INFO L290 TraceCheckUtils]: 11: Hoare triple {2188#(or (= main_~x~0 0) (and (not (< main_~x~0 0)) (not (<= (mod main_~x~0 2) 0))))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2188#(or (= main_~x~0 0) (and (not (< main_~x~0 0)) (not (<= (mod main_~x~0 2) 0))))} is VALID [2022-04-28 07:22:32,897 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2050#(not (= |assume_abort_if_not_#in~cond| 0))} {2020#true} #71#return; {2188#(or (= main_~x~0 0) (and (not (< main_~x~0 0)) (not (<= (mod main_~x~0 2) 0))))} is VALID [2022-04-28 07:22:32,897 INFO L290 TraceCheckUtils]: 9: Hoare triple {2050#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2050#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 07:22:32,897 INFO L290 TraceCheckUtils]: 8: Hoare triple {2234#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {2050#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 07:22:32,898 INFO L290 TraceCheckUtils]: 7: Hoare triple {2020#true} ~cond := #in~cond; {2234#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-28 07:22:32,898 INFO L272 TraceCheckUtils]: 6: Hoare triple {2020#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 1 then 1 else 0)); {2020#true} is VALID [2022-04-28 07:22:32,898 INFO L290 TraceCheckUtils]: 5: Hoare triple {2020#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; {2020#true} is VALID [2022-04-28 07:22:32,898 INFO L272 TraceCheckUtils]: 4: Hoare triple {2020#true} call #t~ret6 := main(); {2020#true} is VALID [2022-04-28 07:22:32,898 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2020#true} {2020#true} #83#return; {2020#true} is VALID [2022-04-28 07:22:32,898 INFO L290 TraceCheckUtils]: 2: Hoare triple {2020#true} assume true; {2020#true} is VALID [2022-04-28 07:22:32,898 INFO L290 TraceCheckUtils]: 1: Hoare triple {2020#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); {2020#true} is VALID [2022-04-28 07:22:32,899 INFO L272 TraceCheckUtils]: 0: Hoare triple {2020#true} call ULTIMATE.init(); {2020#true} is VALID [2022-04-28 07:22:32,899 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 07:22:32,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:22:32,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91217539] [2022-04-28 07:22:32,899 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:22:32,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224320136] [2022-04-28 07:22:32,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [224320136] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:22:32,900 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:22:32,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2022-04-28 07:22:32,900 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:22:32,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1176515260] [2022-04-28 07:22:32,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1176515260] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:22:32,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:22:32,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 07:22:32,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999221010] [2022-04-28 07:22:32,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:22:32,901 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 38 [2022-04-28 07:22:32,901 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:22:32,902 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 07:22:32,921 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:22:32,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 07:22:32,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:22:32,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 07:22:32,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-28 07:22:32,923 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 07:22:33,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:22:33,151 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2022-04-28 07:22:33,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 07:22:33,152 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 38 [2022-04-28 07:22:33,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:22:33,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 07:22:33,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 51 transitions. [2022-04-28 07:22:33,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 07:22:33,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 51 transitions. [2022-04-28 07:22:33,154 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 51 transitions. [2022-04-28 07:22:33,191 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:22:33,192 INFO L225 Difference]: With dead ends: 50 [2022-04-28 07:22:33,193 INFO L226 Difference]: Without dead ends: 37 [2022-04-28 07:22:33,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-04-28 07:22:33,193 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 12 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 07:22:33,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 96 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 07:22:33,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-28 07:22:33,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-28 07:22:33,252 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:22:33,253 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:22:33,253 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:22:33,253 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:22:33,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:22:33,254 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2022-04-28 07:22:33,254 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2022-04-28 07:22:33,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:22:33,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:22:33,254 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 37 states. [2022-04-28 07:22:33,254 INFO L87 Difference]: Start difference. First operand has 37 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 37 states. [2022-04-28 07:22:33,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:22:33,255 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2022-04-28 07:22:33,255 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2022-04-28 07:22:33,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:22:33,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:22:33,256 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:22:33,256 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:22:33,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:22:33,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2022-04-28 07:22:33,257 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 38 [2022-04-28 07:22:33,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:22:33,257 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2022-04-28 07:22:33,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 07:22:33,257 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 41 transitions. [2022-04-28 07:22:33,299 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:22:33,299 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2022-04-28 07:22:33,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-28 07:22:33,299 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:22:33,299 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:22:33,327 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 07:22:33,530 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 07:22:33,530 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:22:33,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:22:33,530 INFO L85 PathProgramCache]: Analyzing trace with hash 901777418, now seen corresponding path program 1 times [2022-04-28 07:22:33,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:22:33,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [942815022] [2022-04-28 07:22:33,531 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:22:33,531 INFO L85 PathProgramCache]: Analyzing trace with hash 901777418, now seen corresponding path program 2 times [2022-04-28 07:22:33,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:22:33,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910893243] [2022-04-28 07:22:33,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:22:33,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:22:33,543 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:22:33,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [25878868] [2022-04-28 07:22:33,544 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:22:33,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:22:33,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:22:33,545 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 07:22:33,545 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 07:22:33,578 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:22:33,578 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:22:33,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 42 conjunts are in the unsatisfiable core [2022-04-28 07:22:33,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:22:33,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:22:34,333 INFO L272 TraceCheckUtils]: 0: Hoare triple {2512#true} call ULTIMATE.init(); {2512#true} is VALID [2022-04-28 07:22:34,334 INFO L290 TraceCheckUtils]: 1: Hoare triple {2512#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); {2512#true} is VALID [2022-04-28 07:22:34,334 INFO L290 TraceCheckUtils]: 2: Hoare triple {2512#true} assume true; {2512#true} is VALID [2022-04-28 07:22:34,334 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2512#true} {2512#true} #83#return; {2512#true} is VALID [2022-04-28 07:22:34,334 INFO L272 TraceCheckUtils]: 4: Hoare triple {2512#true} call #t~ret6 := main(); {2512#true} is VALID [2022-04-28 07:22:34,334 INFO L290 TraceCheckUtils]: 5: Hoare triple {2512#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; {2512#true} is VALID [2022-04-28 07:22:34,334 INFO L272 TraceCheckUtils]: 6: Hoare triple {2512#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 1 then 1 else 0)); {2512#true} is VALID [2022-04-28 07:22:34,334 INFO L290 TraceCheckUtils]: 7: Hoare triple {2512#true} ~cond := #in~cond; {2538#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 07:22:34,335 INFO L290 TraceCheckUtils]: 8: Hoare triple {2538#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2542#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 07:22:34,335 INFO L290 TraceCheckUtils]: 9: Hoare triple {2542#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2542#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 07:22:34,336 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2542#(not (= |assume_abort_if_not_#in~cond| 0))} {2512#true} #71#return; {2549#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 07:22:34,336 INFO L290 TraceCheckUtils]: 11: Hoare triple {2549#(and (<= 0 main_~x~0) (<= main_~x~0 1))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2549#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 07:22:34,336 INFO L272 TraceCheckUtils]: 12: Hoare triple {2549#(and (<= 0 main_~x~0) (<= main_~x~0 1))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 1 then 1 else 0)); {2512#true} is VALID [2022-04-28 07:22:34,336 INFO L290 TraceCheckUtils]: 13: Hoare triple {2512#true} ~cond := #in~cond; {2538#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 07:22:34,337 INFO L290 TraceCheckUtils]: 14: Hoare triple {2538#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2542#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 07:22:34,337 INFO L290 TraceCheckUtils]: 15: Hoare triple {2542#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2542#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 07:22:34,338 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2542#(not (= |assume_abort_if_not_#in~cond| 0))} {2549#(and (<= 0 main_~x~0) (<= main_~x~0 1))} #73#return; {2568#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 1) (<= main_~y~0 1))} is VALID [2022-04-28 07:22:34,338 INFO L272 TraceCheckUtils]: 17: Hoare triple {2568#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 1) (<= main_~y~0 1))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2512#true} is VALID [2022-04-28 07:22:34,338 INFO L290 TraceCheckUtils]: 18: Hoare triple {2512#true} ~cond := #in~cond; {2538#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 07:22:34,338 INFO L290 TraceCheckUtils]: 19: Hoare triple {2538#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2542#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 07:22:34,339 INFO L290 TraceCheckUtils]: 20: Hoare triple {2542#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2542#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 07:22:34,339 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2542#(not (= |assume_abort_if_not_#in~cond| 0))} {2568#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 1) (<= main_~y~0 1))} #75#return; {2584#(and (<= 0 main_~x~0) (<= main_~x~0 1) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 07:22:34,340 INFO L290 TraceCheckUtils]: 22: Hoare triple {2584#(and (<= 0 main_~x~0) (<= main_~x~0 1) (<= 1 main_~y~0) (<= main_~y~0 1))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {2588#(and (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} is VALID [2022-04-28 07:22:34,340 INFO L290 TraceCheckUtils]: 23: Hoare triple {2588#(and (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} assume !false; {2588#(and (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} is VALID [2022-04-28 07:22:34,340 INFO L272 TraceCheckUtils]: 24: Hoare triple {2588#(and (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {2512#true} is VALID [2022-04-28 07:22:34,341 INFO L290 TraceCheckUtils]: 25: Hoare triple {2512#true} ~cond := #in~cond; {2598#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:22:34,341 INFO L290 TraceCheckUtils]: 26: Hoare triple {2598#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2602#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:22:34,341 INFO L290 TraceCheckUtils]: 27: Hoare triple {2602#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2602#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:22:34,342 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2602#(not (= |__VERIFIER_assert_#in~cond| 0))} {2588#(and (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} #77#return; {2588#(and (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} is VALID [2022-04-28 07:22:34,342 INFO L290 TraceCheckUtils]: 29: Hoare triple {2588#(and (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} assume !!(0 != ~a~0 && 0 != ~b~0); {2612#(and (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (not (= main_~a~0 0)) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} is VALID [2022-04-28 07:22:34,343 INFO L290 TraceCheckUtils]: 30: Hoare triple {2612#(and (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (not (= main_~a~0 0)) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~y~0 1) (= 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)); {2612#(and (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (not (= main_~a~0 0)) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} is VALID [2022-04-28 07:22:34,343 INFO L290 TraceCheckUtils]: 31: Hoare triple {2612#(and (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (not (= main_~a~0 0)) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} assume !(1 == (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)); {2612#(and (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (not (= main_~a~0 0)) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} is VALID [2022-04-28 07:22:34,344 INFO L290 TraceCheckUtils]: 32: Hoare triple {2612#(and (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (not (= main_~a~0 0)) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {2622#(and (= main_~b~0 (+ (- 1) main_~y~0)) (= (+ main_~q~0 (* (- 1) main_~a~0 main_~p~0) (* (- 1) main_~b~0 main_~p~0) (* (- 1) main_~p~0)) 0) (<= 0 main_~x~0) (<= main_~x~0 1) (= (+ main_~a~0 1) main_~x~0) (<= 1 main_~y~0) (not (= (+ main_~a~0 1) 0)) (<= main_~y~0 1) (= main_~p~0 1))} is VALID [2022-04-28 07:22:34,345 INFO L290 TraceCheckUtils]: 33: Hoare triple {2622#(and (= main_~b~0 (+ (- 1) main_~y~0)) (= (+ main_~q~0 (* (- 1) main_~a~0 main_~p~0) (* (- 1) main_~b~0 main_~p~0) (* (- 1) main_~p~0)) 0) (<= 0 main_~x~0) (<= main_~x~0 1) (= (+ main_~a~0 1) main_~x~0) (<= 1 main_~y~0) (not (= (+ main_~a~0 1) 0)) (<= main_~y~0 1) (= main_~p~0 1))} assume !false; {2622#(and (= main_~b~0 (+ (- 1) main_~y~0)) (= (+ main_~q~0 (* (- 1) main_~a~0 main_~p~0) (* (- 1) main_~b~0 main_~p~0) (* (- 1) main_~p~0)) 0) (<= 0 main_~x~0) (<= main_~x~0 1) (= (+ main_~a~0 1) main_~x~0) (<= 1 main_~y~0) (not (= (+ main_~a~0 1) 0)) (<= main_~y~0 1) (= main_~p~0 1))} is VALID [2022-04-28 07:22:34,347 INFO L272 TraceCheckUtils]: 34: Hoare triple {2622#(and (= main_~b~0 (+ (- 1) main_~y~0)) (= (+ main_~q~0 (* (- 1) main_~a~0 main_~p~0) (* (- 1) main_~b~0 main_~p~0) (* (- 1) main_~p~0)) 0) (<= 0 main_~x~0) (<= main_~x~0 1) (= (+ main_~a~0 1) main_~x~0) (<= 1 main_~y~0) (not (= (+ main_~a~0 1) 0)) (<= main_~y~0 1) (= main_~p~0 1))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {2629#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:22:34,347 INFO L290 TraceCheckUtils]: 35: Hoare triple {2629#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2633#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:22:34,347 INFO L290 TraceCheckUtils]: 36: Hoare triple {2633#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2513#false} is VALID [2022-04-28 07:22:34,348 INFO L290 TraceCheckUtils]: 37: Hoare triple {2513#false} assume !false; {2513#false} is VALID [2022-04-28 07:22:34,348 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 07:22:34,348 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:22:46,757 INFO L290 TraceCheckUtils]: 37: Hoare triple {2513#false} assume !false; {2513#false} is VALID [2022-04-28 07:22:46,757 INFO L290 TraceCheckUtils]: 36: Hoare triple {2633#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2513#false} is VALID [2022-04-28 07:22:46,758 INFO L290 TraceCheckUtils]: 35: Hoare triple {2629#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2633#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:22:46,758 INFO L272 TraceCheckUtils]: 34: Hoare triple {2649#(= (+ 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)); {2629#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:22:46,759 INFO L290 TraceCheckUtils]: 33: Hoare triple {2649#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !false; {2649#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 07:22:46,762 INFO L290 TraceCheckUtils]: 32: Hoare triple {2649#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {2649#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 07:22:46,763 INFO L290 TraceCheckUtils]: 31: Hoare triple {2649#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !(1 == (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)); {2649#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 07:22:46,763 INFO L290 TraceCheckUtils]: 30: Hoare triple {2649#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~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)); {2649#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 07:22:46,764 INFO L290 TraceCheckUtils]: 29: Hoare triple {2665#(or (= main_~a~0 0) (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0)))} assume !!(0 != ~a~0 && 0 != ~b~0); {2649#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 07:22:46,764 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2602#(not (= |__VERIFIER_assert_#in~cond| 0))} {2512#true} #77#return; {2665#(or (= main_~a~0 0) (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 07:22:46,765 INFO L290 TraceCheckUtils]: 27: Hoare triple {2602#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2602#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:22:46,765 INFO L290 TraceCheckUtils]: 26: Hoare triple {2678#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2602#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:22:46,766 INFO L290 TraceCheckUtils]: 25: Hoare triple {2512#true} ~cond := #in~cond; {2678#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 07:22:46,766 INFO L272 TraceCheckUtils]: 24: Hoare triple {2512#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {2512#true} is VALID [2022-04-28 07:22:46,766 INFO L290 TraceCheckUtils]: 23: Hoare triple {2512#true} assume !false; {2512#true} is VALID [2022-04-28 07:22:46,766 INFO L290 TraceCheckUtils]: 22: Hoare triple {2512#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {2512#true} is VALID [2022-04-28 07:22:46,766 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2512#true} {2512#true} #75#return; {2512#true} is VALID [2022-04-28 07:22:46,766 INFO L290 TraceCheckUtils]: 20: Hoare triple {2512#true} assume true; {2512#true} is VALID [2022-04-28 07:22:46,766 INFO L290 TraceCheckUtils]: 19: Hoare triple {2512#true} assume !(0 == ~cond); {2512#true} is VALID [2022-04-28 07:22:46,766 INFO L290 TraceCheckUtils]: 18: Hoare triple {2512#true} ~cond := #in~cond; {2512#true} is VALID [2022-04-28 07:22:46,766 INFO L272 TraceCheckUtils]: 17: Hoare triple {2512#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2512#true} is VALID [2022-04-28 07:22:46,766 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2512#true} {2512#true} #73#return; {2512#true} is VALID [2022-04-28 07:22:46,766 INFO L290 TraceCheckUtils]: 15: Hoare triple {2512#true} assume true; {2512#true} is VALID [2022-04-28 07:22:46,767 INFO L290 TraceCheckUtils]: 14: Hoare triple {2512#true} assume !(0 == ~cond); {2512#true} is VALID [2022-04-28 07:22:46,767 INFO L290 TraceCheckUtils]: 13: Hoare triple {2512#true} ~cond := #in~cond; {2512#true} is VALID [2022-04-28 07:22:46,767 INFO L272 TraceCheckUtils]: 12: Hoare triple {2512#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 1 then 1 else 0)); {2512#true} is VALID [2022-04-28 07:22:46,767 INFO L290 TraceCheckUtils]: 11: Hoare triple {2512#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2512#true} is VALID [2022-04-28 07:22:46,767 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2512#true} {2512#true} #71#return; {2512#true} is VALID [2022-04-28 07:22:46,767 INFO L290 TraceCheckUtils]: 9: Hoare triple {2512#true} assume true; {2512#true} is VALID [2022-04-28 07:22:46,767 INFO L290 TraceCheckUtils]: 8: Hoare triple {2512#true} assume !(0 == ~cond); {2512#true} is VALID [2022-04-28 07:22:46,767 INFO L290 TraceCheckUtils]: 7: Hoare triple {2512#true} ~cond := #in~cond; {2512#true} is VALID [2022-04-28 07:22:46,767 INFO L272 TraceCheckUtils]: 6: Hoare triple {2512#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 1 then 1 else 0)); {2512#true} is VALID [2022-04-28 07:22:46,767 INFO L290 TraceCheckUtils]: 5: Hoare triple {2512#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; {2512#true} is VALID [2022-04-28 07:22:46,767 INFO L272 TraceCheckUtils]: 4: Hoare triple {2512#true} call #t~ret6 := main(); {2512#true} is VALID [2022-04-28 07:22:46,768 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2512#true} {2512#true} #83#return; {2512#true} is VALID [2022-04-28 07:22:46,768 INFO L290 TraceCheckUtils]: 2: Hoare triple {2512#true} assume true; {2512#true} is VALID [2022-04-28 07:22:46,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {2512#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); {2512#true} is VALID [2022-04-28 07:22:46,768 INFO L272 TraceCheckUtils]: 0: Hoare triple {2512#true} call ULTIMATE.init(); {2512#true} is VALID [2022-04-28 07:22:46,768 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 07:22:46,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:22:46,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910893243] [2022-04-28 07:22:46,768 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:22:46,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25878868] [2022-04-28 07:22:46,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25878868] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:22:46,768 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:22:46,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8] total 17 [2022-04-28 07:22:46,769 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:22:46,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [942815022] [2022-04-28 07:22:46,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [942815022] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:22:46,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:22:46,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 07:22:46,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653264977] [2022-04-28 07:22:46,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:22:46,769 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 11 states have internal predecessors, (20), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 38 [2022-04-28 07:22:46,770 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:22:46,770 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 11 states have internal predecessors, (20), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 07:22:46,789 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:22:46,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 07:22:46,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:22:46,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 07:22:46,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2022-04-28 07:22:46,791 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 11 states have internal predecessors, (20), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 07:22:47,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:22:47,180 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2022-04-28 07:22:47,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 07:22:47,180 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 11 states have internal predecessors, (20), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 38 [2022-04-28 07:22:47,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:22:47,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 11 states have internal predecessors, (20), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 07:22:47,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 49 transitions. [2022-04-28 07:22:47,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 11 states have internal predecessors, (20), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 07:22:47,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 49 transitions. [2022-04-28 07:22:47,183 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 49 transitions. [2022-04-28 07:22:47,222 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:22:47,222 INFO L225 Difference]: With dead ends: 46 [2022-04-28 07:22:47,222 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 07:22:47,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2022-04-28 07:22:47,223 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 20 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 07:22:47,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 111 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 07:22:47,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 07:22:47,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 07:22:47,224 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:22:47,224 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 07:22:47,224 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 07:22:47,224 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 07:22:47,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:22:47,224 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 07:22:47,224 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 07:22:47,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:22:47,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:22:47,224 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 07:22:47,224 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 07:22:47,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:22:47,225 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 07:22:47,225 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 07:22:47,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:22:47,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:22:47,225 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:22:47,225 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:22:47,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 07:22:47,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 07:22:47,225 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2022-04-28 07:22:47,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:22:47,225 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 07:22:47,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 11 states have internal predecessors, (20), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 07:22:47,225 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 07:22:47,226 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:22:47,226 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 07:22:47,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:22:47,227 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 07:22:47,252 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 07:22:47,428 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 07:22:47,430 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 07:22:48,066 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 5) no Hoare annotation was computed. [2022-04-28 07:22:48,066 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 5) no Hoare annotation was computed. [2022-04-28 07:22:48,066 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 5) no Hoare annotation was computed. [2022-04-28 07:22:48,066 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 8 10) the Hoare annotation is: true [2022-04-28 07:22:48,066 INFO L895 garLoopResultBuilder]: At program point L9(line 9) the Hoare annotation is: (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|) [2022-04-28 07:22:48,066 INFO L895 garLoopResultBuilder]: At program point L9-2(lines 8 10) the Hoare annotation is: (and (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)) [2022-04-28 07:22:48,066 INFO L895 garLoopResultBuilder]: At program point assume_abort_if_notEXIT(lines 8 10) the Hoare annotation is: (and (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)) [2022-04-28 07:22:48,066 INFO L895 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: (and (<= 0 main_~x~0) (<= main_~x~0 1) (<= 1 main_~y~0) (<= main_~y~0 1)) [2022-04-28 07:22:48,066 INFO L902 garLoopResultBuilder]: At program point L58(line 58) the Hoare annotation is: true [2022-04-28 07:22:48,067 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 19 60) the Hoare annotation is: true [2022-04-28 07:22:48,067 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 19 60) the Hoare annotation is: true [2022-04-28 07:22:48,067 INFO L895 garLoopResultBuilder]: At program point L44(lines 44 54) the Hoare annotation is: (and (<= main_~x~0 1) (= main_~b~0 main_~y~0) (<= 0 main_~a~0) (= main_~q~0 0) (not (= main_~a~0 0)) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1)) [2022-04-28 07:22:48,067 INFO L895 garLoopResultBuilder]: At program point L40(lines 40 54) the Hoare annotation is: (and (<= main_~x~0 1) (= main_~b~0 main_~y~0) (<= 0 main_~a~0) (= main_~q~0 0) (not (= main_~a~0 0)) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1)) [2022-04-28 07:22:48,067 INFO L895 garLoopResultBuilder]: At program point L34-2(lines 34 55) the Hoare annotation is: (let ((.cse0 (<= 1 main_~y~0)) (.cse1 (<= main_~y~0 1))) (or (and (<= 0 main_~x~0) (<= main_~b~0 1) (= main_~q~0 (* main_~y~0 main_~x~0)) (<= main_~x~0 main_~a~0) (<= 1 main_~b~0) .cse0 (= (* main_~b~0 main_~a~0) 0) .cse1) (and (<= main_~x~0 1) (<= 0 main_~a~0) (= (+ main_~a~0 1) main_~x~0) (= main_~q~0 (+ (* main_~b~0 main_~p~0) (* main_~a~0 main_~p~0) main_~p~0)) .cse0 (= (+ main_~b~0 1) main_~y~0) .cse1 (= main_~p~0 1)))) [2022-04-28 07:22:48,067 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 19 60) the Hoare annotation is: true [2022-04-28 07:22:48,067 INFO L895 garLoopResultBuilder]: At program point L26(line 26) the Hoare annotation is: (and (<= 0 main_~x~0) (<= main_~x~0 1)) [2022-04-28 07:22:48,067 INFO L895 garLoopResultBuilder]: At program point L26-1(line 26) the Hoare annotation is: (and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 1) (<= main_~y~0 1)) [2022-04-28 07:22:48,067 INFO L895 garLoopResultBuilder]: At program point L57(line 57) the Hoare annotation is: (and (<= 0 main_~x~0) (<= main_~x~0 1) (<= 1 main_~y~0) (= (* main_~b~0 main_~a~0) 0) (<= main_~y~0 1)) [2022-04-28 07:22:48,067 INFO L902 garLoopResultBuilder]: At program point L24(line 24) the Hoare annotation is: true [2022-04-28 07:22:48,067 INFO L895 garLoopResultBuilder]: At program point L24-1(line 24) the Hoare annotation is: (and (<= 0 main_~x~0) (<= main_~x~0 1)) [2022-04-28 07:22:48,067 INFO L895 garLoopResultBuilder]: At program point L47(lines 47 54) the Hoare annotation is: (and (<= main_~x~0 1) (= main_~b~0 main_~y~0) (<= 0 main_~a~0) (= main_~q~0 0) (not (= main_~a~0 0)) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1)) [2022-04-28 07:22:48,067 INFO L895 garLoopResultBuilder]: At program point L47-2(lines 34 55) the Hoare annotation is: (let ((.cse0 (<= main_~x~0 1)) (.cse1 (<= 0 main_~a~0)) (.cse2 (<= 1 main_~y~0)) (.cse3 (<= main_~y~0 1)) (.cse4 (= main_~p~0 1))) (or (and .cse0 .cse1 (= (+ main_~a~0 1) main_~x~0) (= main_~q~0 (+ (* main_~b~0 main_~p~0) (* main_~a~0 main_~p~0) main_~p~0)) .cse2 (= (+ main_~b~0 1) main_~y~0) .cse3 .cse4) (and .cse0 (= main_~b~0 main_~y~0) .cse1 (= main_~q~0 0) .cse2 (= main_~a~0 main_~x~0) .cse3 .cse4))) [2022-04-28 07:22:48,067 INFO L895 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (let ((.cse0 (<= main_~x~0 1)) (.cse1 (<= 0 main_~a~0)) (.cse2 (<= 1 main_~y~0)) (.cse3 (<= main_~y~0 1)) (.cse4 (= main_~p~0 1))) (or (and .cse0 .cse1 (= (+ main_~a~0 1) main_~x~0) (= main_~q~0 (+ (* main_~b~0 main_~p~0) (* main_~a~0 main_~p~0) main_~p~0)) .cse2 (= (+ main_~b~0 1) main_~y~0) .cse3 .cse4) (and .cse0 (= main_~b~0 main_~y~0) .cse1 (= main_~q~0 0) .cse2 (= main_~a~0 main_~x~0) .cse3 .cse4))) [2022-04-28 07:22:48,067 INFO L895 garLoopResultBuilder]: At program point L35-1(lines 34 55) the Hoare annotation is: (let ((.cse0 (<= main_~x~0 1)) (.cse1 (<= 0 main_~a~0)) (.cse2 (<= 1 main_~y~0)) (.cse3 (<= main_~y~0 1)) (.cse4 (= main_~p~0 1))) (or (and .cse0 .cse1 (= (+ main_~a~0 1) main_~x~0) (= main_~q~0 (+ (* main_~b~0 main_~p~0) (* main_~a~0 main_~p~0) main_~p~0)) .cse2 (= (+ main_~b~0 1) main_~y~0) .cse3 .cse4) (and .cse0 (= main_~b~0 main_~y~0) .cse1 (= main_~q~0 0) .cse2 (= main_~a~0 main_~x~0) .cse3 .cse4))) [2022-04-28 07:22:48,068 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 07:22:48,068 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 07:22:48,068 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 07:22:48,068 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 07:22:48,068 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 07:22:48,068 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 07:22:48,068 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 07:22:48,068 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 11 17) the Hoare annotation is: true [2022-04-28 07:22:48,068 INFO L895 garLoopResultBuilder]: At program point L13(lines 13 14) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 07:22:48,068 INFO L895 garLoopResultBuilder]: At program point L12(lines 12 15) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-28 07:22:48,068 INFO L895 garLoopResultBuilder]: At program point L12-2(lines 11 17) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-28 07:22:48,068 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 11 17) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-28 07:22:48,068 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 07:22:48,070 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2] [2022-04-28 07:22:48,072 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 07:22:48,073 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 07:22:48,078 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 07:22:48,101 INFO L163 areAnnotationChecker]: CFG has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 07:22:48,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 07:22:48 BoogieIcfgContainer [2022-04-28 07:22:48,119 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 07:22:48,120 INFO L158 Benchmark]: Toolchain (without parser) took 78597.45ms. Allocated memory was 185.6MB in the beginning and 223.3MB in the end (delta: 37.7MB). Free memory was 165.7MB in the beginning and 102.7MB in the end (delta: 63.1MB). Peak memory consumption was 101.0MB. Max. memory is 8.0GB. [2022-04-28 07:22:48,120 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 185.6MB. Free memory is still 153.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 07:22:48,121 INFO L158 Benchmark]: CACSL2BoogieTranslator took 173.94ms. Allocated memory is still 185.6MB. Free memory was 165.5MB in the beginning and 164.5MB in the end (delta: 1.0MB). Peak memory consumption was 10.2MB. Max. memory is 8.0GB. [2022-04-28 07:22:48,121 INFO L158 Benchmark]: Boogie Preprocessor took 18.52ms. Allocated memory is still 185.6MB. Free memory was 164.5MB in the beginning and 162.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 07:22:48,121 INFO L158 Benchmark]: RCFGBuilder took 290.71ms. Allocated memory is still 185.6MB. Free memory was 162.8MB in the beginning and 149.9MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-28 07:22:48,121 INFO L158 Benchmark]: TraceAbstraction took 78109.82ms. Allocated memory was 185.6MB in the beginning and 223.3MB in the end (delta: 37.7MB). Free memory was 149.1MB in the beginning and 102.7MB in the end (delta: 46.5MB). Peak memory consumption was 84.5MB. Max. memory is 8.0GB. [2022-04-28 07:22:48,123 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.10ms. Allocated memory is still 185.6MB. Free memory is still 153.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 173.94ms. Allocated memory is still 185.6MB. Free memory was 165.5MB in the beginning and 164.5MB in the end (delta: 1.0MB). Peak memory consumption was 10.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 18.52ms. Allocated memory is still 185.6MB. Free memory was 164.5MB in the beginning and 162.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 290.71ms. Allocated memory is still 185.6MB. Free memory was 162.8MB in the beginning and 149.9MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 78109.82ms. Allocated memory was 185.6MB in the beginning and 223.3MB in the end (delta: 37.7MB). Free memory was 149.1MB in the beginning and 102.7MB in the end (delta: 46.5MB). Peak memory consumption was 84.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 14]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 78.0s, OverallIterations: 7, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 8.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 146 SdHoareTripleChecker+Valid, 5.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 129 mSDsluCounter, 695 SdHoareTripleChecker+Invalid, 5.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 510 mSDsCounter, 43 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 602 IncrementalHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 43 mSolverCounterUnsat, 185 mSDtfsCounter, 602 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 382 GetRequests, 309 SyntacticMatches, 4 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=4, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 12 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 34 LocationsWithAnnotation, 134 PreInvPairs, 185 NumberOfFragments, 468 HoareAnnotationTreeSize, 134 FomulaSimplifications, 90 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 34 FomulaSimplificationsInter, 627 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: (((((((x <= 1 && 0 <= a) && a + 1 == x) && q == b * p + a * p + p) && 1 <= y) && b + 1 == y) && y <= 1) && p == 1) || (((((((x <= 1 && b == y) && 0 <= a) && q == 0) && 1 <= y) && a == x) && y <= 1) && p == 1) - ProcedureContractResult [Line: 8]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not: !(\old(cond) == 0) && cond == \old(cond) - ProcedureContractResult [Line: 19]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 11]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == cond || !(1 <= \old(cond)) RESULT: Ultimate proved your program to be correct! [2022-04-28 07:22:48,149 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...