/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/egcd-ll_valuebound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 08:28:19,557 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 08:28:19,559 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 08:28:19,609 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 08:28:19,609 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 08:28:19,610 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 08:28:19,611 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 08:28:19,612 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 08:28:19,613 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 08:28:19,613 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 08:28:19,614 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 08:28:19,615 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 08:28:19,615 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 08:28:19,620 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 08:28:19,620 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 08:28:19,621 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 08:28:19,621 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 08:28:19,622 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 08:28:19,623 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 08:28:19,624 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 08:28:19,625 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 08:28:19,628 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 08:28:19,631 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 08:28:19,632 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 08:28:19,632 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 08:28:19,634 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 08:28:19,634 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 08:28:19,634 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 08:28:19,634 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 08:28:19,635 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 08:28:19,635 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 08:28:19,635 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 08:28:19,636 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 08:28:19,636 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 08:28:19,636 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 08:28:19,637 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 08:28:19,637 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 08:28:19,637 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 08:28:19,638 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 08:28:19,638 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 08:28:19,638 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 08:28:19,645 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 08:28:19,646 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 08:28:19,655 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 08:28:19,656 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 08:28:19,656 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 08:28:19,656 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 08:28:19,656 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 08:28:19,657 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 08:28:19,657 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 08:28:19,657 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 08:28:19,657 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 08:28:19,657 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 08:28:19,657 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 08:28:19,657 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 08:28:19,658 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 08:28:19,658 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 08:28:19,658 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 08:28:19,658 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 08:28:19,658 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 08:28:19,658 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 08:28:19,658 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 08:28:19,658 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 08:28:19,658 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 08:28:19,658 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 08:28:19,658 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 08:28:19,658 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 08:28:19,659 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 08:28:19,659 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 08:28:19,853 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 08:28:19,874 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 08:28:19,875 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 08:28:19,876 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 08:28:19,876 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 08:28:19,877 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/egcd-ll_valuebound1.c [2022-04-15 08:28:19,926 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bb26d002/257cfbf6c8e347a79c4fb7af40197af8/FLAG9ef2fc446 [2022-04-15 08:28:20,265 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 08:28:20,265 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd-ll_valuebound1.c [2022-04-15 08:28:20,270 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bb26d002/257cfbf6c8e347a79c4fb7af40197af8/FLAG9ef2fc446 [2022-04-15 08:28:20,280 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bb26d002/257cfbf6c8e347a79c4fb7af40197af8 [2022-04-15 08:28:20,282 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 08:28:20,283 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 08:28:20,284 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 08:28:20,284 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 08:28:20,286 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 08:28:20,287 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 08:28:20" (1/1) ... [2022-04-15 08:28:20,288 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c1d6689 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:28:20, skipping insertion in model container [2022-04-15 08:28:20,288 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 08:28:20" (1/1) ... [2022-04-15 08:28:20,293 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 08:28:20,302 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 08:28:20,437 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/egcd-ll_valuebound1.c[489,502] [2022-04-15 08:28:20,458 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 08:28:20,464 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 08:28:20,474 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/egcd-ll_valuebound1.c[489,502] [2022-04-15 08:28:20,496 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 08:28:20,504 INFO L208 MainTranslator]: Completed translation [2022-04-15 08:28:20,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:28:20 WrapperNode [2022-04-15 08:28:20,505 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 08:28:20,506 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 08:28:20,506 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 08:28:20,506 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 08:28:20,513 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:28:20" (1/1) ... [2022-04-15 08:28:20,513 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:28:20" (1/1) ... [2022-04-15 08:28:20,518 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:28:20" (1/1) ... [2022-04-15 08:28:20,518 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:28:20" (1/1) ... [2022-04-15 08:28:20,530 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:28:20" (1/1) ... [2022-04-15 08:28:20,534 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:28:20" (1/1) ... [2022-04-15 08:28:20,540 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:28:20" (1/1) ... [2022-04-15 08:28:20,542 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 08:28:20,542 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 08:28:20,542 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 08:28:20,543 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 08:28:20,543 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:28:20" (1/1) ... [2022-04-15 08:28:20,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 08:28:20,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:28:20,567 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 08:28:20,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 08:28:20,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 08:28:20,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 08:28:20,597 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 08:28:20,597 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 08:28:20,597 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 08:28:20,597 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 08:28:20,597 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 08:28:20,597 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 08:28:20,598 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 08:28:20,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 08:28:20,598 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 08:28:20,599 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 08:28:20,600 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 08:28:20,600 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 08:28:20,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 08:28:20,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 08:28:20,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 08:28:20,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 08:28:20,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 08:28:20,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 08:28:20,648 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 08:28:20,649 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 08:28:20,834 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 08:28:20,841 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 08:28:20,841 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 08:28:20,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 08:28:20 BoogieIcfgContainer [2022-04-15 08:28:20,843 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 08:28:20,844 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 08:28:20,844 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 08:28:20,847 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 08:28:20,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 08:28:20" (1/3) ... [2022-04-15 08:28:20,847 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@721d96ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 08:28:20, skipping insertion in model container [2022-04-15 08:28:20,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:28:20" (2/3) ... [2022-04-15 08:28:20,848 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@721d96ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 08:28:20, skipping insertion in model container [2022-04-15 08:28:20,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 08:28:20" (3/3) ... [2022-04-15 08:28:20,849 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd-ll_valuebound1.c [2022-04-15 08:28:20,853 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 08:28:20,853 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 08:28:20,885 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 08:28:20,892 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 08:28:20,893 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 08:28:20,906 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 08:28:20,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 08:28:20,913 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:28:20,913 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 08:28:20,914 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:28:20,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:28:20,918 INFO L85 PathProgramCache]: Analyzing trace with hash 870870740, now seen corresponding path program 1 times [2022-04-15 08:28:20,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:28:20,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [197637704] [2022-04-15 08:28:20,934 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:28:20,934 INFO L85 PathProgramCache]: Analyzing trace with hash 870870740, now seen corresponding path program 2 times [2022-04-15 08:28:20,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:28:20,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489169399] [2022-04-15 08:28:20,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:28:20,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:28:21,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:28:21,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 08:28:21,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:28:21,101 INFO L290 TraceCheckUtils]: 0: Hoare triple {61#(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(10, 2);call #Ultimate.allocInit(12, 3); {40#true} is VALID [2022-04-15 08:28:21,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-15 08:28:21,101 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40#true} {40#true} #88#return; {40#true} is VALID [2022-04-15 08:28:21,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 08:28:21,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:28:21,126 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-15 08:28:21,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-15 08:28:21,127 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-15 08:28:21,127 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {40#true} #66#return; {41#false} is VALID [2022-04-15 08:28:21,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 08:28:21,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:28:21,134 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-15 08:28:21,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-15 08:28:21,134 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-15 08:28:21,134 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {41#false} #68#return; {41#false} is VALID [2022-04-15 08:28:21,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-15 08:28:21,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:28:21,142 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-15 08:28:21,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-15 08:28:21,143 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-15 08:28:21,143 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {41#false} #70#return; {41#false} is VALID [2022-04-15 08:28:21,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-15 08:28:21,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:28:21,154 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-15 08:28:21,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-15 08:28:21,155 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-15 08:28:21,155 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {41#false} #72#return; {41#false} is VALID [2022-04-15 08:28:21,156 INFO L272 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {61#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 08:28:21,156 INFO L290 TraceCheckUtils]: 1: Hoare triple {61#(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(10, 2);call #Ultimate.allocInit(12, 3); {40#true} is VALID [2022-04-15 08:28:21,156 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-15 08:28:21,156 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #88#return; {40#true} is VALID [2022-04-15 08:28:21,157 INFO L272 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret6 := main(); {40#true} is VALID [2022-04-15 08:28:21,157 INFO L290 TraceCheckUtils]: 5: Hoare triple {40#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {40#true} is VALID [2022-04-15 08:28:21,157 INFO L272 TraceCheckUtils]: 6: Hoare triple {40#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 1 then 1 else 0)); {40#true} is VALID [2022-04-15 08:28:21,157 INFO L290 TraceCheckUtils]: 7: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-15 08:28:21,158 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-15 08:28:21,158 INFO L290 TraceCheckUtils]: 9: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-15 08:28:21,158 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {41#false} {40#true} #66#return; {41#false} is VALID [2022-04-15 08:28:21,158 INFO L290 TraceCheckUtils]: 11: Hoare triple {41#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {41#false} is VALID [2022-04-15 08:28:21,158 INFO L272 TraceCheckUtils]: 12: Hoare triple {41#false} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 1 then 1 else 0)); {40#true} is VALID [2022-04-15 08:28:21,158 INFO L290 TraceCheckUtils]: 13: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-15 08:28:21,162 INFO L290 TraceCheckUtils]: 14: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-15 08:28:21,162 INFO L290 TraceCheckUtils]: 15: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-15 08:28:21,162 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {41#false} {41#false} #68#return; {41#false} is VALID [2022-04-15 08:28:21,163 INFO L272 TraceCheckUtils]: 17: Hoare triple {41#false} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {40#true} is VALID [2022-04-15 08:28:21,163 INFO L290 TraceCheckUtils]: 18: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-15 08:28:21,163 INFO L290 TraceCheckUtils]: 19: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-15 08:28:21,163 INFO L290 TraceCheckUtils]: 20: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-15 08:28:21,164 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {41#false} {41#false} #70#return; {41#false} is VALID [2022-04-15 08:28:21,164 INFO L272 TraceCheckUtils]: 22: Hoare triple {41#false} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {40#true} is VALID [2022-04-15 08:28:21,164 INFO L290 TraceCheckUtils]: 23: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-15 08:28:21,164 INFO L290 TraceCheckUtils]: 24: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-15 08:28:21,164 INFO L290 TraceCheckUtils]: 25: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-15 08:28:21,165 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {41#false} {41#false} #72#return; {41#false} is VALID [2022-04-15 08:28:21,165 INFO L290 TraceCheckUtils]: 27: Hoare triple {41#false} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {41#false} is VALID [2022-04-15 08:28:21,165 INFO L290 TraceCheckUtils]: 28: Hoare triple {41#false} assume false; {41#false} is VALID [2022-04-15 08:28:21,165 INFO L272 TraceCheckUtils]: 29: Hoare triple {41#false} call __VERIFIER_assert((if 0 == ~a~0 - ~b~0 then 1 else 0)); {41#false} is VALID [2022-04-15 08:28:21,165 INFO L290 TraceCheckUtils]: 30: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2022-04-15 08:28:21,165 INFO L290 TraceCheckUtils]: 31: Hoare triple {41#false} assume 0 == ~cond; {41#false} is VALID [2022-04-15 08:28:21,165 INFO L290 TraceCheckUtils]: 32: Hoare triple {41#false} assume !false; {41#false} is VALID [2022-04-15 08:28:21,166 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-15 08:28:21,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:28:21,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489169399] [2022-04-15 08:28:21,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489169399] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:28:21,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:28:21,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 08:28:21,169 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:28:21,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [197637704] [2022-04-15 08:28:21,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [197637704] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:28:21,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:28:21,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 08:28:21,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018066555] [2022-04-15 08:28:21,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:28:21,174 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, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-15 08:28:21,175 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:28:21,177 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, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 08:28:21,208 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:28:21,209 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 08:28:21,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:28:21,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 08:28:21,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 08:28:21,226 INFO L87 Difference]: Start difference. First operand has 37 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) 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, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 08:28:21,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:28:21,496 INFO L93 Difference]: Finished difference Result 67 states and 105 transitions. [2022-04-15 08:28:21,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 08:28:21,497 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, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-15 08:28:21,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:28:21,498 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, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 08:28:21,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2022-04-15 08:28:21,515 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, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 08:28:21,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2022-04-15 08:28:21,527 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 105 transitions. [2022-04-15 08:28:21,653 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:28:21,663 INFO L225 Difference]: With dead ends: 67 [2022-04-15 08:28:21,663 INFO L226 Difference]: Without dead ends: 32 [2022-04-15 08:28:21,667 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 08:28:21,671 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 18 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 08:28:21,672 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 39 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 08:28:21,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-15 08:28:21,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-15 08:28:21,709 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:28:21,710 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 08:28:21,711 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 08:28:21,711 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 08:28:21,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:28:21,715 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-15 08:28:21,715 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-15 08:28:21,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:28:21,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:28:21,716 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 32 states. [2022-04-15 08:28:21,716 INFO L87 Difference]: Start difference. First operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 32 states. [2022-04-15 08:28:21,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:28:21,735 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-15 08:28:21,735 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-15 08:28:21,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:28:21,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:28:21,736 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:28:21,736 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:28:21,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 08:28:21,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-15 08:28:21,739 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 33 [2022-04-15 08:28:21,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:28:21,739 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-15 08:28:21,740 INFO L479 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, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 08:28:21,740 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 42 transitions. [2022-04-15 08:28:21,789 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-15 08:28:21,789 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-15 08:28:21,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 08:28:21,791 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:28:21,792 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 08:28:21,792 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 08:28:21,792 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:28:21,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:28:21,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1006914976, now seen corresponding path program 1 times [2022-04-15 08:28:21,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:28:21,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [428134231] [2022-04-15 08:28:21,795 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:28:21,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1006914976, now seen corresponding path program 2 times [2022-04-15 08:28:21,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:28:21,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022664638] [2022-04-15 08:28:21,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:28:21,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:28:21,843 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:28:21,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [905133987] [2022-04-15 08:28:21,843 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:28:21,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:28:21,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:28:21,846 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 08:28:21,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 08:28:21,893 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 08:28:21,893 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:28:21,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 08:28:21,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:28:21,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:28:22,099 INFO L272 TraceCheckUtils]: 0: Hoare triple {326#true} call ULTIMATE.init(); {326#true} is VALID [2022-04-15 08:28:22,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {326#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(10, 2);call #Ultimate.allocInit(12, 3); {326#true} is VALID [2022-04-15 08:28:22,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {326#true} assume true; {326#true} is VALID [2022-04-15 08:28:22,100 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {326#true} {326#true} #88#return; {326#true} is VALID [2022-04-15 08:28:22,100 INFO L272 TraceCheckUtils]: 4: Hoare triple {326#true} call #t~ret6 := main(); {326#true} is VALID [2022-04-15 08:28:22,100 INFO L290 TraceCheckUtils]: 5: Hoare triple {326#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {326#true} is VALID [2022-04-15 08:28:22,100 INFO L272 TraceCheckUtils]: 6: Hoare triple {326#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 1 then 1 else 0)); {326#true} is VALID [2022-04-15 08:28:22,100 INFO L290 TraceCheckUtils]: 7: Hoare triple {326#true} ~cond := #in~cond; {326#true} is VALID [2022-04-15 08:28:22,100 INFO L290 TraceCheckUtils]: 8: Hoare triple {326#true} assume !(0 == ~cond); {326#true} is VALID [2022-04-15 08:28:22,101 INFO L290 TraceCheckUtils]: 9: Hoare triple {326#true} assume true; {326#true} is VALID [2022-04-15 08:28:22,101 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {326#true} {326#true} #66#return; {326#true} is VALID [2022-04-15 08:28:22,101 INFO L290 TraceCheckUtils]: 11: Hoare triple {326#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {326#true} is VALID [2022-04-15 08:28:22,101 INFO L272 TraceCheckUtils]: 12: Hoare triple {326#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 1 then 1 else 0)); {326#true} is VALID [2022-04-15 08:28:22,101 INFO L290 TraceCheckUtils]: 13: Hoare triple {326#true} ~cond := #in~cond; {326#true} is VALID [2022-04-15 08:28:22,101 INFO L290 TraceCheckUtils]: 14: Hoare triple {326#true} assume !(0 == ~cond); {326#true} is VALID [2022-04-15 08:28:22,102 INFO L290 TraceCheckUtils]: 15: Hoare triple {326#true} assume true; {326#true} is VALID [2022-04-15 08:28:22,102 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {326#true} {326#true} #68#return; {326#true} is VALID [2022-04-15 08:28:22,102 INFO L272 TraceCheckUtils]: 17: Hoare triple {326#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {326#true} is VALID [2022-04-15 08:28:22,102 INFO L290 TraceCheckUtils]: 18: Hoare triple {326#true} ~cond := #in~cond; {326#true} is VALID [2022-04-15 08:28:22,102 INFO L290 TraceCheckUtils]: 19: Hoare triple {326#true} assume !(0 == ~cond); {326#true} is VALID [2022-04-15 08:28:22,102 INFO L290 TraceCheckUtils]: 20: Hoare triple {326#true} assume true; {326#true} is VALID [2022-04-15 08:28:22,103 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {326#true} {326#true} #70#return; {326#true} is VALID [2022-04-15 08:28:22,103 INFO L272 TraceCheckUtils]: 22: Hoare triple {326#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {326#true} is VALID [2022-04-15 08:28:22,103 INFO L290 TraceCheckUtils]: 23: Hoare triple {326#true} ~cond := #in~cond; {326#true} is VALID [2022-04-15 08:28:22,103 INFO L290 TraceCheckUtils]: 24: Hoare triple {326#true} assume !(0 == ~cond); {326#true} is VALID [2022-04-15 08:28:22,103 INFO L290 TraceCheckUtils]: 25: Hoare triple {326#true} assume true; {326#true} is VALID [2022-04-15 08:28:22,103 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {326#true} {326#true} #72#return; {326#true} is VALID [2022-04-15 08:28:22,104 INFO L290 TraceCheckUtils]: 27: Hoare triple {326#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {412#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} is VALID [2022-04-15 08:28:22,124 INFO L290 TraceCheckUtils]: 28: Hoare triple {412#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} assume !false; {412#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} is VALID [2022-04-15 08:28:22,125 INFO L272 TraceCheckUtils]: 29: Hoare triple {412#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {419#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 08:28:22,125 INFO L290 TraceCheckUtils]: 30: Hoare triple {419#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {423#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 08:28:22,126 INFO L290 TraceCheckUtils]: 31: Hoare triple {423#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {327#false} is VALID [2022-04-15 08:28:22,126 INFO L290 TraceCheckUtils]: 32: Hoare triple {327#false} assume !false; {327#false} is VALID [2022-04-15 08:28:22,126 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-15 08:28:22,127 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 08:28:22,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:28:22,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022664638] [2022-04-15 08:28:22,127 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:28:22,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905133987] [2022-04-15 08:28:22,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [905133987] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:28:22,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:28:22,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 08:28:22,129 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:28:22,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [428134231] [2022-04-15 08:28:22,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [428134231] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:28:22,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:28:22,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 08:28:22,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143290340] [2022-04-15 08:28:22,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:28:22,130 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 33 [2022-04-15 08:28:22,130 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:28:22,130 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-15 08:28:22,157 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:28:22,157 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 08:28:22,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:28:22,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 08:28:22,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 08:28:22,158 INFO L87 Difference]: Start difference. First operand 32 states and 42 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-15 08:28:22,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:28:22,387 INFO L93 Difference]: Finished difference Result 48 states and 65 transitions. [2022-04-15 08:28:22,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 08:28:22,387 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 33 [2022-04-15 08:28:22,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:28:22,388 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-15 08:28:22,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-15 08:28:22,390 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-15 08:28:22,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-15 08:28:22,391 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-15 08:28:22,474 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:28:22,476 INFO L225 Difference]: With dead ends: 48 [2022-04-15 08:28:22,476 INFO L226 Difference]: Without dead ends: 46 [2022-04-15 08:28:22,476 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 08:28:22,477 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 7 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 08:28:22,477 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 143 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 08:28:22,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-15 08:28:22,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2022-04-15 08:28:22,490 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:28:22,491 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 45 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 08:28:22,492 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 45 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 08:28:22,493 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 45 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 08:28:22,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:28:22,503 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2022-04-15 08:28:22,504 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2022-04-15 08:28:22,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:28:22,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:28:22,505 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 46 states. [2022-04-15 08:28:22,505 INFO L87 Difference]: Start difference. First operand has 45 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 46 states. [2022-04-15 08:28:22,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:28:22,508 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2022-04-15 08:28:22,508 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2022-04-15 08:28:22,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:28:22,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:28:22,509 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:28:22,509 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:28:22,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 08:28:22,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 62 transitions. [2022-04-15 08:28:22,512 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 62 transitions. Word has length 33 [2022-04-15 08:28:22,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:28:22,512 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 62 transitions. [2022-04-15 08:28:22,512 INFO L479 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-15 08:28:22,512 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 62 transitions. [2022-04-15 08:28:22,567 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:28:22,567 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2022-04-15 08:28:22,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-15 08:28:22,568 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:28:22,568 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 1, 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-15 08:28:22,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 08:28:22,785 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:28:22,785 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:28:22,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:28:22,786 INFO L85 PathProgramCache]: Analyzing trace with hash -124657161, now seen corresponding path program 1 times [2022-04-15 08:28:22,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:28:22,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [186477880] [2022-04-15 08:28:22,786 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:28:22,786 INFO L85 PathProgramCache]: Analyzing trace with hash -124657161, now seen corresponding path program 2 times [2022-04-15 08:28:22,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:28:22,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256471342] [2022-04-15 08:28:22,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:28:22,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:28:22,801 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:28:22,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [623716956] [2022-04-15 08:28:22,802 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:28:22,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:28:22,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:28:22,803 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 08:28:22,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 08:28:22,838 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 08:28:22,838 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:28:22,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-15 08:28:22,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:28:22,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:28:23,173 INFO L272 TraceCheckUtils]: 0: Hoare triple {709#true} call ULTIMATE.init(); {709#true} is VALID [2022-04-15 08:28:23,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {709#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(10, 2);call #Ultimate.allocInit(12, 3); {709#true} is VALID [2022-04-15 08:28:23,173 INFO L290 TraceCheckUtils]: 2: Hoare triple {709#true} assume true; {709#true} is VALID [2022-04-15 08:28:23,173 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {709#true} {709#true} #88#return; {709#true} is VALID [2022-04-15 08:28:23,173 INFO L272 TraceCheckUtils]: 4: Hoare triple {709#true} call #t~ret6 := main(); {709#true} is VALID [2022-04-15 08:28:23,174 INFO L290 TraceCheckUtils]: 5: Hoare triple {709#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {709#true} is VALID [2022-04-15 08:28:23,174 INFO L272 TraceCheckUtils]: 6: Hoare triple {709#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 1 then 1 else 0)); {709#true} is VALID [2022-04-15 08:28:23,174 INFO L290 TraceCheckUtils]: 7: Hoare triple {709#true} ~cond := #in~cond; {735#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 08:28:23,174 INFO L290 TraceCheckUtils]: 8: Hoare triple {735#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {739#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 08:28:23,175 INFO L290 TraceCheckUtils]: 9: Hoare triple {739#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {739#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 08:28:23,176 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {739#(not (= |assume_abort_if_not_#in~cond| 0))} {709#true} #66#return; {746#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 08:28:23,176 INFO L290 TraceCheckUtils]: 11: Hoare triple {746#(and (<= 0 main_~x~0) (<= main_~x~0 1))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {746#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 08:28:23,176 INFO L272 TraceCheckUtils]: 12: Hoare triple {746#(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)); {709#true} is VALID [2022-04-15 08:28:23,176 INFO L290 TraceCheckUtils]: 13: Hoare triple {709#true} ~cond := #in~cond; {709#true} is VALID [2022-04-15 08:28:23,177 INFO L290 TraceCheckUtils]: 14: Hoare triple {709#true} assume !(0 == ~cond); {709#true} is VALID [2022-04-15 08:28:23,177 INFO L290 TraceCheckUtils]: 15: Hoare triple {709#true} assume true; {709#true} is VALID [2022-04-15 08:28:23,181 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {709#true} {746#(and (<= 0 main_~x~0) (<= main_~x~0 1))} #68#return; {746#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 08:28:23,182 INFO L272 TraceCheckUtils]: 17: Hoare triple {746#(and (<= 0 main_~x~0) (<= main_~x~0 1))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {709#true} is VALID [2022-04-15 08:28:23,182 INFO L290 TraceCheckUtils]: 18: Hoare triple {709#true} ~cond := #in~cond; {735#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 08:28:23,183 INFO L290 TraceCheckUtils]: 19: Hoare triple {735#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {739#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 08:28:23,183 INFO L290 TraceCheckUtils]: 20: Hoare triple {739#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {739#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 08:28:23,183 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {739#(not (= |assume_abort_if_not_#in~cond| 0))} {746#(and (<= 0 main_~x~0) (<= main_~x~0 1))} #70#return; {780#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 08:28:23,184 INFO L272 TraceCheckUtils]: 22: Hoare triple {780#(and (<= 1 main_~x~0) (<= main_~x~0 1))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {709#true} is VALID [2022-04-15 08:28:23,184 INFO L290 TraceCheckUtils]: 23: Hoare triple {709#true} ~cond := #in~cond; {709#true} is VALID [2022-04-15 08:28:23,184 INFO L290 TraceCheckUtils]: 24: Hoare triple {709#true} assume !(0 == ~cond); {709#true} is VALID [2022-04-15 08:28:23,184 INFO L290 TraceCheckUtils]: 25: Hoare triple {709#true} assume true; {709#true} is VALID [2022-04-15 08:28:23,184 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {709#true} {780#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #72#return; {780#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 08:28:23,185 INFO L290 TraceCheckUtils]: 27: Hoare triple {780#(and (<= 1 main_~x~0) (<= main_~x~0 1))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {799#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~x~0 1) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 08:28:23,185 INFO L290 TraceCheckUtils]: 28: Hoare triple {799#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~x~0 1) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {799#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~x~0 1) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 08:28:23,185 INFO L272 TraceCheckUtils]: 29: Hoare triple {799#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~x~0 1) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {709#true} is VALID [2022-04-15 08:28:23,186 INFO L290 TraceCheckUtils]: 30: Hoare triple {709#true} ~cond := #in~cond; {709#true} is VALID [2022-04-15 08:28:23,186 INFO L290 TraceCheckUtils]: 31: Hoare triple {709#true} assume !(0 == ~cond); {709#true} is VALID [2022-04-15 08:28:23,186 INFO L290 TraceCheckUtils]: 32: Hoare triple {709#true} assume true; {709#true} is VALID [2022-04-15 08:28:23,186 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {709#true} {799#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~x~0 1) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #74#return; {799#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~x~0 1) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 08:28:23,187 INFO L272 TraceCheckUtils]: 34: Hoare triple {799#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~x~0 1) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {821#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 08:28:23,188 INFO L290 TraceCheckUtils]: 35: Hoare triple {821#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {825#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 08:28:23,188 INFO L290 TraceCheckUtils]: 36: Hoare triple {825#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {710#false} is VALID [2022-04-15 08:28:23,188 INFO L290 TraceCheckUtils]: 37: Hoare triple {710#false} assume !false; {710#false} is VALID [2022-04-15 08:28:23,189 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 08:28:23,189 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 08:29:06,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:29:06,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256471342] [2022-04-15 08:29:06,045 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:29:06,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623716956] [2022-04-15 08:29:06,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623716956] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 08:29:06,046 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 08:29:06,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-15 08:29:06,046 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:29:06,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [186477880] [2022-04-15 08:29:06,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [186477880] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:29:06,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:29:06,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 08:29:06,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655252454] [2022-04-15 08:29:06,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:29:06,047 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 38 [2022-04-15 08:29:06,047 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:29:06,048 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 08:29:06,081 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-15 08:29:06,081 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 08:29:06,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:29:06,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 08:29:06,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-15 08:29:06,082 INFO L87 Difference]: Start difference. First operand 45 states and 62 transitions. Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 08:29:06,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:29:06,506 INFO L93 Difference]: Finished difference Result 52 states and 68 transitions. [2022-04-15 08:29:06,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 08:29:06,507 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 38 [2022-04-15 08:29:06,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:29:06,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 08:29:06,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 65 transitions. [2022-04-15 08:29:06,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 08:29:06,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 65 transitions. [2022-04-15 08:29:06,520 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 65 transitions. [2022-04-15 08:29:06,594 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:29:06,597 INFO L225 Difference]: With dead ends: 52 [2022-04-15 08:29:06,597 INFO L226 Difference]: Without dead ends: 50 [2022-04-15 08:29:06,599 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-04-15 08:29:06,609 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 20 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 08:29:06,610 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 174 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 08:29:06,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-15 08:29:06,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2022-04-15 08:29:06,649 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:29:06,650 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 49 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 08:29:06,652 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 49 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 08:29:06,653 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 49 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 08:29:06,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:29:06,658 INFO L93 Difference]: Finished difference Result 50 states and 66 transitions. [2022-04-15 08:29:06,658 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2022-04-15 08:29:06,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:29:06,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:29:06,662 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 50 states. [2022-04-15 08:29:06,663 INFO L87 Difference]: Start difference. First operand has 49 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 50 states. [2022-04-15 08:29:06,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:29:06,669 INFO L93 Difference]: Finished difference Result 50 states and 66 transitions. [2022-04-15 08:29:06,669 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2022-04-15 08:29:06,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:29:06,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:29:06,670 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:29:06,670 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:29:06,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 08:29:06,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 65 transitions. [2022-04-15 08:29:06,675 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 65 transitions. Word has length 38 [2022-04-15 08:29:06,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:29:06,675 INFO L478 AbstractCegarLoop]: Abstraction has 49 states and 65 transitions. [2022-04-15 08:29:06,675 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 08:29:06,676 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 65 transitions. [2022-04-15 08:29:06,748 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:29:06,748 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 65 transitions. [2022-04-15 08:29:06,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-15 08:29:06,749 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:29:06,749 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 1] [2022-04-15 08:29:06,768 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-15 08:29:06,950 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-15 08:29:06,950 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:29:06,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:29:06,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1732898944, now seen corresponding path program 1 times [2022-04-15 08:29:06,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:29:06,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1060492368] [2022-04-15 08:29:06,951 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:29:06,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1732898944, now seen corresponding path program 2 times [2022-04-15 08:29:06,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:29:06,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658057240] [2022-04-15 08:29:06,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:29:06,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:29:06,971 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:29:06,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [733075730] [2022-04-15 08:29:06,971 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:29:06,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:29:06,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:29:06,996 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 08:29:06,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 08:29:07,043 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 08:29:07,043 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:29:07,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-15 08:29:07,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:29:07,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:29:07,549 INFO L272 TraceCheckUtils]: 0: Hoare triple {1153#true} call ULTIMATE.init(); {1153#true} is VALID [2022-04-15 08:29:07,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {1153#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(10, 2);call #Ultimate.allocInit(12, 3); {1153#true} is VALID [2022-04-15 08:29:07,550 INFO L290 TraceCheckUtils]: 2: Hoare triple {1153#true} assume true; {1153#true} is VALID [2022-04-15 08:29:07,550 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1153#true} {1153#true} #88#return; {1153#true} is VALID [2022-04-15 08:29:07,550 INFO L272 TraceCheckUtils]: 4: Hoare triple {1153#true} call #t~ret6 := main(); {1153#true} is VALID [2022-04-15 08:29:07,550 INFO L290 TraceCheckUtils]: 5: Hoare triple {1153#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {1153#true} is VALID [2022-04-15 08:29:07,550 INFO L272 TraceCheckUtils]: 6: Hoare triple {1153#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 1 then 1 else 0)); {1153#true} is VALID [2022-04-15 08:29:07,551 INFO L290 TraceCheckUtils]: 7: Hoare triple {1153#true} ~cond := #in~cond; {1179#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 08:29:07,551 INFO L290 TraceCheckUtils]: 8: Hoare triple {1179#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1183#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 08:29:07,553 INFO L290 TraceCheckUtils]: 9: Hoare triple {1183#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1183#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 08:29:07,554 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1183#(not (= |assume_abort_if_not_#in~cond| 0))} {1153#true} #66#return; {1190#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 08:29:07,554 INFO L290 TraceCheckUtils]: 11: Hoare triple {1190#(and (<= 0 main_~x~0) (<= main_~x~0 1))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1190#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 08:29:07,554 INFO L272 TraceCheckUtils]: 12: Hoare triple {1190#(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)); {1153#true} is VALID [2022-04-15 08:29:07,555 INFO L290 TraceCheckUtils]: 13: Hoare triple {1153#true} ~cond := #in~cond; {1179#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 08:29:07,555 INFO L290 TraceCheckUtils]: 14: Hoare triple {1179#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1183#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 08:29:07,555 INFO L290 TraceCheckUtils]: 15: Hoare triple {1183#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1183#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 08:29:07,556 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1183#(not (= |assume_abort_if_not_#in~cond| 0))} {1190#(and (<= 0 main_~x~0) (<= main_~x~0 1))} #68#return; {1209#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 1) (<= main_~y~0 1))} is VALID [2022-04-15 08:29:07,556 INFO L272 TraceCheckUtils]: 17: Hoare triple {1209#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 1) (<= main_~y~0 1))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1153#true} is VALID [2022-04-15 08:29:07,557 INFO L290 TraceCheckUtils]: 18: Hoare triple {1153#true} ~cond := #in~cond; {1179#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 08:29:07,557 INFO L290 TraceCheckUtils]: 19: Hoare triple {1179#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1183#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 08:29:07,558 INFO L290 TraceCheckUtils]: 20: Hoare triple {1183#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1183#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 08:29:07,559 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1183#(not (= |assume_abort_if_not_#in~cond| 0))} {1209#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 1) (<= main_~y~0 1))} #70#return; {1225#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~x~0 1) (<= main_~y~0 1))} is VALID [2022-04-15 08:29:07,559 INFO L272 TraceCheckUtils]: 22: Hoare triple {1225#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~x~0 1) (<= main_~y~0 1))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1153#true} is VALID [2022-04-15 08:29:07,559 INFO L290 TraceCheckUtils]: 23: Hoare triple {1153#true} ~cond := #in~cond; {1179#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 08:29:07,560 INFO L290 TraceCheckUtils]: 24: Hoare triple {1179#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1183#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 08:29:07,560 INFO L290 TraceCheckUtils]: 25: Hoare triple {1183#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1183#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 08:29:07,560 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1183#(not (= |assume_abort_if_not_#in~cond| 0))} {1225#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~x~0 1) (<= main_~y~0 1))} #72#return; {1241#(and (<= 1 main_~x~0) (<= main_~x~0 1) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-15 08:29:07,561 INFO L290 TraceCheckUtils]: 27: Hoare triple {1241#(and (<= 1 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;~r~0 := 0;~s~0 := 1; {1245#(and (<= 1 main_~x~0) (= main_~s~0 1) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-15 08:29:07,561 INFO L290 TraceCheckUtils]: 28: Hoare triple {1245#(and (<= 1 main_~x~0) (= main_~s~0 1) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (<= main_~y~0 1))} assume !false; {1245#(and (<= 1 main_~x~0) (= main_~s~0 1) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-15 08:29:07,562 INFO L272 TraceCheckUtils]: 29: Hoare triple {1245#(and (<= 1 main_~x~0) (= main_~s~0 1) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (<= main_~y~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {1153#true} is VALID [2022-04-15 08:29:07,562 INFO L290 TraceCheckUtils]: 30: Hoare triple {1153#true} ~cond := #in~cond; {1153#true} is VALID [2022-04-15 08:29:07,562 INFO L290 TraceCheckUtils]: 31: Hoare triple {1153#true} assume !(0 == ~cond); {1153#true} is VALID [2022-04-15 08:29:07,562 INFO L290 TraceCheckUtils]: 32: Hoare triple {1153#true} assume true; {1153#true} is VALID [2022-04-15 08:29:07,563 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1153#true} {1245#(and (<= 1 main_~x~0) (= main_~s~0 1) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (<= main_~y~0 1))} #74#return; {1245#(and (<= 1 main_~x~0) (= main_~s~0 1) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-15 08:29:07,563 INFO L272 TraceCheckUtils]: 34: Hoare triple {1245#(and (<= 1 main_~x~0) (= main_~s~0 1) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (<= main_~y~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {1153#true} is VALID [2022-04-15 08:29:07,563 INFO L290 TraceCheckUtils]: 35: Hoare triple {1153#true} ~cond := #in~cond; {1153#true} is VALID [2022-04-15 08:29:07,563 INFO L290 TraceCheckUtils]: 36: Hoare triple {1153#true} assume !(0 == ~cond); {1153#true} is VALID [2022-04-15 08:29:07,563 INFO L290 TraceCheckUtils]: 37: Hoare triple {1153#true} assume true; {1153#true} is VALID [2022-04-15 08:29:07,564 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1153#true} {1245#(and (<= 1 main_~x~0) (= main_~s~0 1) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (<= main_~y~0 1))} #76#return; {1245#(and (<= 1 main_~x~0) (= main_~s~0 1) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-15 08:29:07,564 INFO L272 TraceCheckUtils]: 39: Hoare triple {1245#(and (<= 1 main_~x~0) (= main_~s~0 1) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (<= main_~y~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {1282#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 08:29:07,565 INFO L290 TraceCheckUtils]: 40: Hoare triple {1282#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1286#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 08:29:07,565 INFO L290 TraceCheckUtils]: 41: Hoare triple {1286#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1154#false} is VALID [2022-04-15 08:29:07,565 INFO L290 TraceCheckUtils]: 42: Hoare triple {1154#false} assume !false; {1154#false} is VALID [2022-04-15 08:29:07,566 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-15 08:29:07,566 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 08:29:07,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:29:07,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658057240] [2022-04-15 08:29:07,566 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:29:07,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733075730] [2022-04-15 08:29:07,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [733075730] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:29:07,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:29:07,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 08:29:07,567 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:29:07,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1060492368] [2022-04-15 08:29:07,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1060492368] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:29:07,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:29:07,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 08:29:07,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330125625] [2022-04-15 08:29:07,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:29:07,568 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) Word has length 43 [2022-04-15 08:29:07,568 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:29:07,568 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 08:29:07,592 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:29:07,592 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 08:29:07,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:29:07,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 08:29:07,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-04-15 08:29:07,593 INFO L87 Difference]: Start difference. First operand 49 states and 65 transitions. Second operand has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 08:29:08,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:29:08,163 INFO L93 Difference]: Finished difference Result 74 states and 105 transitions. [2022-04-15 08:29:08,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 08:29:08,163 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) Word has length 43 [2022-04-15 08:29:08,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:29:08,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 08:29:08,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 65 transitions. [2022-04-15 08:29:08,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 08:29:08,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 65 transitions. [2022-04-15 08:29:08,166 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 65 transitions. [2022-04-15 08:29:08,219 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:29:08,222 INFO L225 Difference]: With dead ends: 74 [2022-04-15 08:29:08,223 INFO L226 Difference]: Without dead ends: 70 [2022-04-15 08:29:08,223 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-15 08:29:08,224 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 30 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 08:29:08,225 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 168 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 08:29:08,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-15 08:29:08,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-04-15 08:29:08,320 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:29:08,322 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 70 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 37 states have internal predecessors, (42), 30 states have call successors, (30), 7 states have call predecessors, (30), 6 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-15 08:29:08,322 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 70 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 37 states have internal predecessors, (42), 30 states have call successors, (30), 7 states have call predecessors, (30), 6 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-15 08:29:08,324 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 70 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 37 states have internal predecessors, (42), 30 states have call successors, (30), 7 states have call predecessors, (30), 6 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-15 08:29:08,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:29:08,328 INFO L93 Difference]: Finished difference Result 70 states and 98 transitions. [2022-04-15 08:29:08,329 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 98 transitions. [2022-04-15 08:29:08,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:29:08,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:29:08,330 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 37 states have internal predecessors, (42), 30 states have call successors, (30), 7 states have call predecessors, (30), 6 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) Second operand 70 states. [2022-04-15 08:29:08,331 INFO L87 Difference]: Start difference. First operand has 70 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 37 states have internal predecessors, (42), 30 states have call successors, (30), 7 states have call predecessors, (30), 6 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) Second operand 70 states. [2022-04-15 08:29:08,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:29:08,335 INFO L93 Difference]: Finished difference Result 70 states and 98 transitions. [2022-04-15 08:29:08,335 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 98 transitions. [2022-04-15 08:29:08,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:29:08,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:29:08,337 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:29:08,337 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:29:08,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 37 states have internal predecessors, (42), 30 states have call successors, (30), 7 states have call predecessors, (30), 6 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-15 08:29:08,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 98 transitions. [2022-04-15 08:29:08,340 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 98 transitions. Word has length 43 [2022-04-15 08:29:08,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:29:08,340 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 98 transitions. [2022-04-15 08:29:08,340 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 08:29:08,340 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 98 transitions. [2022-04-15 08:29:08,442 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:29:08,442 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 98 transitions. [2022-04-15 08:29:08,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-15 08:29:08,442 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:29:08,443 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 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-15 08:29:08,459 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-15 08:29:08,655 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:29:08,656 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:29:08,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:29:08,656 INFO L85 PathProgramCache]: Analyzing trace with hash -301191846, now seen corresponding path program 1 times [2022-04-15 08:29:08,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:29:08,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [909751070] [2022-04-15 08:29:08,656 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:29:08,656 INFO L85 PathProgramCache]: Analyzing trace with hash -301191846, now seen corresponding path program 2 times [2022-04-15 08:29:08,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:29:08,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837818542] [2022-04-15 08:29:08,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:29:08,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:29:08,677 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:29:08,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [936830938] [2022-04-15 08:29:08,677 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:29:08,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:29:08,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:29:08,697 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 08:29:08,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-15 08:29:08,731 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 08:29:08,731 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:29:08,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 08:29:08,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:29:08,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:29:08,837 INFO L272 TraceCheckUtils]: 0: Hoare triple {1724#true} call ULTIMATE.init(); {1724#true} is VALID [2022-04-15 08:29:08,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {1724#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(10, 2);call #Ultimate.allocInit(12, 3); {1724#true} is VALID [2022-04-15 08:29:08,837 INFO L290 TraceCheckUtils]: 2: Hoare triple {1724#true} assume true; {1724#true} is VALID [2022-04-15 08:29:08,838 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1724#true} {1724#true} #88#return; {1724#true} is VALID [2022-04-15 08:29:08,838 INFO L272 TraceCheckUtils]: 4: Hoare triple {1724#true} call #t~ret6 := main(); {1724#true} is VALID [2022-04-15 08:29:08,838 INFO L290 TraceCheckUtils]: 5: Hoare triple {1724#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {1724#true} is VALID [2022-04-15 08:29:08,838 INFO L272 TraceCheckUtils]: 6: Hoare triple {1724#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 1 then 1 else 0)); {1724#true} is VALID [2022-04-15 08:29:08,838 INFO L290 TraceCheckUtils]: 7: Hoare triple {1724#true} ~cond := #in~cond; {1724#true} is VALID [2022-04-15 08:29:08,838 INFO L290 TraceCheckUtils]: 8: Hoare triple {1724#true} assume !(0 == ~cond); {1724#true} is VALID [2022-04-15 08:29:08,838 INFO L290 TraceCheckUtils]: 9: Hoare triple {1724#true} assume true; {1724#true} is VALID [2022-04-15 08:29:08,838 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1724#true} {1724#true} #66#return; {1724#true} is VALID [2022-04-15 08:29:08,838 INFO L290 TraceCheckUtils]: 11: Hoare triple {1724#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1724#true} is VALID [2022-04-15 08:29:08,839 INFO L272 TraceCheckUtils]: 12: Hoare triple {1724#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 1 then 1 else 0)); {1724#true} is VALID [2022-04-15 08:29:08,839 INFO L290 TraceCheckUtils]: 13: Hoare triple {1724#true} ~cond := #in~cond; {1724#true} is VALID [2022-04-15 08:29:08,839 INFO L290 TraceCheckUtils]: 14: Hoare triple {1724#true} assume !(0 == ~cond); {1724#true} is VALID [2022-04-15 08:29:08,839 INFO L290 TraceCheckUtils]: 15: Hoare triple {1724#true} assume true; {1724#true} is VALID [2022-04-15 08:29:08,839 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1724#true} {1724#true} #68#return; {1724#true} is VALID [2022-04-15 08:29:08,839 INFO L272 TraceCheckUtils]: 17: Hoare triple {1724#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1724#true} is VALID [2022-04-15 08:29:08,839 INFO L290 TraceCheckUtils]: 18: Hoare triple {1724#true} ~cond := #in~cond; {1724#true} is VALID [2022-04-15 08:29:08,839 INFO L290 TraceCheckUtils]: 19: Hoare triple {1724#true} assume !(0 == ~cond); {1724#true} is VALID [2022-04-15 08:29:08,839 INFO L290 TraceCheckUtils]: 20: Hoare triple {1724#true} assume true; {1724#true} is VALID [2022-04-15 08:29:08,839 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1724#true} {1724#true} #70#return; {1724#true} is VALID [2022-04-15 08:29:08,840 INFO L272 TraceCheckUtils]: 22: Hoare triple {1724#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1724#true} is VALID [2022-04-15 08:29:08,840 INFO L290 TraceCheckUtils]: 23: Hoare triple {1724#true} ~cond := #in~cond; {1724#true} is VALID [2022-04-15 08:29:08,840 INFO L290 TraceCheckUtils]: 24: Hoare triple {1724#true} assume !(0 == ~cond); {1724#true} is VALID [2022-04-15 08:29:08,840 INFO L290 TraceCheckUtils]: 25: Hoare triple {1724#true} assume true; {1724#true} is VALID [2022-04-15 08:29:08,840 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1724#true} {1724#true} #72#return; {1724#true} is VALID [2022-04-15 08:29:08,840 INFO L290 TraceCheckUtils]: 27: Hoare triple {1724#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {1724#true} is VALID [2022-04-15 08:29:08,840 INFO L290 TraceCheckUtils]: 28: Hoare triple {1724#true} assume !false; {1724#true} is VALID [2022-04-15 08:29:08,840 INFO L272 TraceCheckUtils]: 29: Hoare triple {1724#true} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {1724#true} is VALID [2022-04-15 08:29:08,840 INFO L290 TraceCheckUtils]: 30: Hoare triple {1724#true} ~cond := #in~cond; {1724#true} is VALID [2022-04-15 08:29:08,841 INFO L290 TraceCheckUtils]: 31: Hoare triple {1724#true} assume !(0 == ~cond); {1724#true} is VALID [2022-04-15 08:29:08,841 INFO L290 TraceCheckUtils]: 32: Hoare triple {1724#true} assume true; {1724#true} is VALID [2022-04-15 08:29:08,841 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1724#true} {1724#true} #74#return; {1724#true} is VALID [2022-04-15 08:29:08,841 INFO L272 TraceCheckUtils]: 34: Hoare triple {1724#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {1724#true} is VALID [2022-04-15 08:29:08,841 INFO L290 TraceCheckUtils]: 35: Hoare triple {1724#true} ~cond := #in~cond; {1724#true} is VALID [2022-04-15 08:29:08,841 INFO L290 TraceCheckUtils]: 36: Hoare triple {1724#true} assume !(0 == ~cond); {1724#true} is VALID [2022-04-15 08:29:08,841 INFO L290 TraceCheckUtils]: 37: Hoare triple {1724#true} assume true; {1724#true} is VALID [2022-04-15 08:29:08,841 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1724#true} {1724#true} #76#return; {1724#true} is VALID [2022-04-15 08:29:08,841 INFO L272 TraceCheckUtils]: 39: Hoare triple {1724#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {1724#true} is VALID [2022-04-15 08:29:08,841 INFO L290 TraceCheckUtils]: 40: Hoare triple {1724#true} ~cond := #in~cond; {1724#true} is VALID [2022-04-15 08:29:08,842 INFO L290 TraceCheckUtils]: 41: Hoare triple {1724#true} assume !(0 == ~cond); {1724#true} is VALID [2022-04-15 08:29:08,842 INFO L290 TraceCheckUtils]: 42: Hoare triple {1724#true} assume true; {1724#true} is VALID [2022-04-15 08:29:08,842 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {1724#true} {1724#true} #78#return; {1724#true} is VALID [2022-04-15 08:29:08,847 INFO L290 TraceCheckUtils]: 44: Hoare triple {1724#true} assume !(~a~0 != ~b~0); {1861#(= main_~b~0 main_~a~0)} is VALID [2022-04-15 08:29:08,848 INFO L272 TraceCheckUtils]: 45: Hoare triple {1861#(= main_~b~0 main_~a~0)} call __VERIFIER_assert((if 0 == ~a~0 - ~b~0 then 1 else 0)); {1865#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 08:29:08,849 INFO L290 TraceCheckUtils]: 46: Hoare triple {1865#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1869#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 08:29:08,849 INFO L290 TraceCheckUtils]: 47: Hoare triple {1869#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1725#false} is VALID [2022-04-15 08:29:08,849 INFO L290 TraceCheckUtils]: 48: Hoare triple {1725#false} assume !false; {1725#false} is VALID [2022-04-15 08:29:08,849 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-15 08:29:08,849 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 08:29:08,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:29:08,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837818542] [2022-04-15 08:29:08,850 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:29:08,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936830938] [2022-04-15 08:29:08,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [936830938] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:29:08,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:29:08,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 08:29:08,850 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:29:08,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [909751070] [2022-04-15 08:29:08,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [909751070] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:29:08,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:29:08,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 08:29:08,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337580304] [2022-04-15 08:29:08,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:29:08,851 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 49 [2022-04-15 08:29:08,851 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:29:08,851 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-04-15 08:29:08,869 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:29:08,870 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 08:29:08,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:29:08,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 08:29:08,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 08:29:08,870 INFO L87 Difference]: Start difference. First operand 70 states and 98 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-04-15 08:29:09,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:29:09,078 INFO L93 Difference]: Finished difference Result 76 states and 103 transitions. [2022-04-15 08:29:09,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 08:29:09,079 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 49 [2022-04-15 08:29:09,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:29:09,079 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-04-15 08:29:09,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-15 08:29:09,080 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-04-15 08:29:09,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-15 08:29:09,081 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2022-04-15 08:29:09,118 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:29:09,120 INFO L225 Difference]: With dead ends: 76 [2022-04-15 08:29:09,120 INFO L226 Difference]: Without dead ends: 74 [2022-04-15 08:29:09,120 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 08:29:09,121 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 5 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 08:29:09,121 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 139 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 08:29:09,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-15 08:29:09,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-04-15 08:29:09,227 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:29:09,228 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 74 states, 36 states have (on average 1.25) internal successors, (45), 40 states have internal predecessors, (45), 30 states have call successors, (30), 8 states have call predecessors, (30), 7 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-15 08:29:09,228 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 74 states, 36 states have (on average 1.25) internal successors, (45), 40 states have internal predecessors, (45), 30 states have call successors, (30), 8 states have call predecessors, (30), 7 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-15 08:29:09,228 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 74 states, 36 states have (on average 1.25) internal successors, (45), 40 states have internal predecessors, (45), 30 states have call successors, (30), 8 states have call predecessors, (30), 7 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-15 08:29:09,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:29:09,233 INFO L93 Difference]: Finished difference Result 74 states and 101 transitions. [2022-04-15 08:29:09,233 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 101 transitions. [2022-04-15 08:29:09,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:29:09,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:29:09,234 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 36 states have (on average 1.25) internal successors, (45), 40 states have internal predecessors, (45), 30 states have call successors, (30), 8 states have call predecessors, (30), 7 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) Second operand 74 states. [2022-04-15 08:29:09,234 INFO L87 Difference]: Start difference. First operand has 74 states, 36 states have (on average 1.25) internal successors, (45), 40 states have internal predecessors, (45), 30 states have call successors, (30), 8 states have call predecessors, (30), 7 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) Second operand 74 states. [2022-04-15 08:29:09,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:29:09,237 INFO L93 Difference]: Finished difference Result 74 states and 101 transitions. [2022-04-15 08:29:09,237 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 101 transitions. [2022-04-15 08:29:09,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:29:09,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:29:09,238 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:29:09,238 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:29:09,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 36 states have (on average 1.25) internal successors, (45), 40 states have internal predecessors, (45), 30 states have call successors, (30), 8 states have call predecessors, (30), 7 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-15 08:29:09,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 101 transitions. [2022-04-15 08:29:09,241 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 101 transitions. Word has length 49 [2022-04-15 08:29:09,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:29:09,242 INFO L478 AbstractCegarLoop]: Abstraction has 74 states and 101 transitions. [2022-04-15 08:29:09,242 INFO L479 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-04-15 08:29:09,242 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 74 states and 101 transitions. [2022-04-15 08:29:09,347 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:29:09,347 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 101 transitions. [2022-04-15 08:29:09,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-15 08:29:09,347 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:29:09,347 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1] [2022-04-15 08:29:09,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-15 08:29:09,548 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:29:09,548 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:29:09,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:29:09,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1164909737, now seen corresponding path program 1 times [2022-04-15 08:29:09,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:29:09,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2008765514] [2022-04-15 08:29:09,549 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:29:09,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1164909737, now seen corresponding path program 2 times [2022-04-15 08:29:09,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:29:09,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406866767] [2022-04-15 08:29:09,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:29:09,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:29:09,581 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:29:09,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [86099413] [2022-04-15 08:29:09,581 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:29:09,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:29:09,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:29:09,584 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 08:29:09,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-15 08:29:09,630 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 08:29:09,630 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:29:09,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 08:29:09,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:29:09,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:29:09,883 INFO L272 TraceCheckUtils]: 0: Hoare triple {2325#true} call ULTIMATE.init(); {2325#true} is VALID [2022-04-15 08:29:09,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {2325#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(10, 2);call #Ultimate.allocInit(12, 3); {2325#true} is VALID [2022-04-15 08:29:09,883 INFO L290 TraceCheckUtils]: 2: Hoare triple {2325#true} assume true; {2325#true} is VALID [2022-04-15 08:29:09,883 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2325#true} {2325#true} #88#return; {2325#true} is VALID [2022-04-15 08:29:09,883 INFO L272 TraceCheckUtils]: 4: Hoare triple {2325#true} call #t~ret6 := main(); {2325#true} is VALID [2022-04-15 08:29:09,884 INFO L290 TraceCheckUtils]: 5: Hoare triple {2325#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {2325#true} is VALID [2022-04-15 08:29:09,884 INFO L272 TraceCheckUtils]: 6: Hoare triple {2325#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 1 then 1 else 0)); {2325#true} is VALID [2022-04-15 08:29:09,884 INFO L290 TraceCheckUtils]: 7: Hoare triple {2325#true} ~cond := #in~cond; {2351#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 08:29:09,884 INFO L290 TraceCheckUtils]: 8: Hoare triple {2351#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2355#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 08:29:09,885 INFO L290 TraceCheckUtils]: 9: Hoare triple {2355#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2355#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 08:29:09,885 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2355#(not (= |assume_abort_if_not_#in~cond| 0))} {2325#true} #66#return; {2362#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 08:29:09,886 INFO L290 TraceCheckUtils]: 11: Hoare triple {2362#(and (<= 0 main_~x~0) (<= main_~x~0 1))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2362#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 08:29:09,886 INFO L272 TraceCheckUtils]: 12: Hoare triple {2362#(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)); {2325#true} is VALID [2022-04-15 08:29:09,886 INFO L290 TraceCheckUtils]: 13: Hoare triple {2325#true} ~cond := #in~cond; {2325#true} is VALID [2022-04-15 08:29:09,886 INFO L290 TraceCheckUtils]: 14: Hoare triple {2325#true} assume !(0 == ~cond); {2325#true} is VALID [2022-04-15 08:29:09,886 INFO L290 TraceCheckUtils]: 15: Hoare triple {2325#true} assume true; {2325#true} is VALID [2022-04-15 08:29:09,887 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2325#true} {2362#(and (<= 0 main_~x~0) (<= main_~x~0 1))} #68#return; {2362#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 08:29:09,888 INFO L272 TraceCheckUtils]: 17: Hoare triple {2362#(and (<= 0 main_~x~0) (<= main_~x~0 1))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2325#true} is VALID [2022-04-15 08:29:09,888 INFO L290 TraceCheckUtils]: 18: Hoare triple {2325#true} ~cond := #in~cond; {2325#true} is VALID [2022-04-15 08:29:09,888 INFO L290 TraceCheckUtils]: 19: Hoare triple {2325#true} assume !(0 == ~cond); {2325#true} is VALID [2022-04-15 08:29:09,888 INFO L290 TraceCheckUtils]: 20: Hoare triple {2325#true} assume true; {2325#true} is VALID [2022-04-15 08:29:09,888 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2325#true} {2362#(and (<= 0 main_~x~0) (<= main_~x~0 1))} #70#return; {2362#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 08:29:09,888 INFO L272 TraceCheckUtils]: 22: Hoare triple {2362#(and (<= 0 main_~x~0) (<= main_~x~0 1))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2325#true} is VALID [2022-04-15 08:29:09,889 INFO L290 TraceCheckUtils]: 23: Hoare triple {2325#true} ~cond := #in~cond; {2351#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 08:29:09,889 INFO L290 TraceCheckUtils]: 24: Hoare triple {2351#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2355#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 08:29:09,894 INFO L290 TraceCheckUtils]: 25: Hoare triple {2355#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2355#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 08:29:09,895 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2355#(not (= |assume_abort_if_not_#in~cond| 0))} {2362#(and (<= 0 main_~x~0) (<= main_~x~0 1))} #72#return; {2411#(and (<= 0 main_~x~0) (<= main_~x~0 1) (<= 1 main_~y~0))} is VALID [2022-04-15 08:29:09,895 INFO L290 TraceCheckUtils]: 27: Hoare triple {2411#(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;~r~0 := 0;~s~0 := 1; {2415#(and (<= main_~a~0 1) (<= 1 main_~b~0))} is VALID [2022-04-15 08:29:09,895 INFO L290 TraceCheckUtils]: 28: Hoare triple {2415#(and (<= main_~a~0 1) (<= 1 main_~b~0))} assume !false; {2415#(and (<= main_~a~0 1) (<= 1 main_~b~0))} is VALID [2022-04-15 08:29:09,896 INFO L272 TraceCheckUtils]: 29: Hoare triple {2415#(and (<= main_~a~0 1) (<= 1 main_~b~0))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {2325#true} is VALID [2022-04-15 08:29:09,896 INFO L290 TraceCheckUtils]: 30: Hoare triple {2325#true} ~cond := #in~cond; {2325#true} is VALID [2022-04-15 08:29:09,896 INFO L290 TraceCheckUtils]: 31: Hoare triple {2325#true} assume !(0 == ~cond); {2325#true} is VALID [2022-04-15 08:29:09,896 INFO L290 TraceCheckUtils]: 32: Hoare triple {2325#true} assume true; {2325#true} is VALID [2022-04-15 08:29:09,896 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2325#true} {2415#(and (<= main_~a~0 1) (<= 1 main_~b~0))} #74#return; {2415#(and (<= main_~a~0 1) (<= 1 main_~b~0))} is VALID [2022-04-15 08:29:09,897 INFO L272 TraceCheckUtils]: 34: Hoare triple {2415#(and (<= main_~a~0 1) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {2325#true} is VALID [2022-04-15 08:29:09,897 INFO L290 TraceCheckUtils]: 35: Hoare triple {2325#true} ~cond := #in~cond; {2325#true} is VALID [2022-04-15 08:29:09,897 INFO L290 TraceCheckUtils]: 36: Hoare triple {2325#true} assume !(0 == ~cond); {2325#true} is VALID [2022-04-15 08:29:09,897 INFO L290 TraceCheckUtils]: 37: Hoare triple {2325#true} assume true; {2325#true} is VALID [2022-04-15 08:29:09,897 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2325#true} {2415#(and (<= main_~a~0 1) (<= 1 main_~b~0))} #76#return; {2415#(and (<= main_~a~0 1) (<= 1 main_~b~0))} is VALID [2022-04-15 08:29:09,898 INFO L272 TraceCheckUtils]: 39: Hoare triple {2415#(and (<= main_~a~0 1) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {2325#true} is VALID [2022-04-15 08:29:09,898 INFO L290 TraceCheckUtils]: 40: Hoare triple {2325#true} ~cond := #in~cond; {2325#true} is VALID [2022-04-15 08:29:09,898 INFO L290 TraceCheckUtils]: 41: Hoare triple {2325#true} assume !(0 == ~cond); {2325#true} is VALID [2022-04-15 08:29:09,898 INFO L290 TraceCheckUtils]: 42: Hoare triple {2325#true} assume true; {2325#true} is VALID [2022-04-15 08:29:09,898 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2325#true} {2415#(and (<= main_~a~0 1) (<= 1 main_~b~0))} #78#return; {2415#(and (<= main_~a~0 1) (<= 1 main_~b~0))} is VALID [2022-04-15 08:29:09,899 INFO L290 TraceCheckUtils]: 44: Hoare triple {2415#(and (<= main_~a~0 1) (<= 1 main_~b~0))} assume !!(~a~0 != ~b~0); {2415#(and (<= main_~a~0 1) (<= 1 main_~b~0))} is VALID [2022-04-15 08:29:09,899 INFO L290 TraceCheckUtils]: 45: Hoare triple {2415#(and (<= main_~a~0 1) (<= 1 main_~b~0))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {2326#false} is VALID [2022-04-15 08:29:09,899 INFO L290 TraceCheckUtils]: 46: Hoare triple {2326#false} assume !false; {2326#false} is VALID [2022-04-15 08:29:09,899 INFO L272 TraceCheckUtils]: 47: Hoare triple {2326#false} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {2326#false} is VALID [2022-04-15 08:29:09,900 INFO L290 TraceCheckUtils]: 48: Hoare triple {2326#false} ~cond := #in~cond; {2326#false} is VALID [2022-04-15 08:29:09,900 INFO L290 TraceCheckUtils]: 49: Hoare triple {2326#false} assume 0 == ~cond; {2326#false} is VALID [2022-04-15 08:29:09,900 INFO L290 TraceCheckUtils]: 50: Hoare triple {2326#false} assume !false; {2326#false} is VALID [2022-04-15 08:29:09,900 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-15 08:29:09,900 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 08:29:10,276 INFO L290 TraceCheckUtils]: 50: Hoare triple {2326#false} assume !false; {2326#false} is VALID [2022-04-15 08:29:10,276 INFO L290 TraceCheckUtils]: 49: Hoare triple {2326#false} assume 0 == ~cond; {2326#false} is VALID [2022-04-15 08:29:10,276 INFO L290 TraceCheckUtils]: 48: Hoare triple {2326#false} ~cond := #in~cond; {2326#false} is VALID [2022-04-15 08:29:10,276 INFO L272 TraceCheckUtils]: 47: Hoare triple {2326#false} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {2326#false} is VALID [2022-04-15 08:29:10,276 INFO L290 TraceCheckUtils]: 46: Hoare triple {2326#false} assume !false; {2326#false} is VALID [2022-04-15 08:29:10,277 INFO L290 TraceCheckUtils]: 45: Hoare triple {2500#(not (< main_~b~0 main_~a~0))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {2326#false} is VALID [2022-04-15 08:29:10,278 INFO L290 TraceCheckUtils]: 44: Hoare triple {2500#(not (< main_~b~0 main_~a~0))} assume !!(~a~0 != ~b~0); {2500#(not (< main_~b~0 main_~a~0))} is VALID [2022-04-15 08:29:10,278 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2325#true} {2500#(not (< main_~b~0 main_~a~0))} #78#return; {2500#(not (< main_~b~0 main_~a~0))} is VALID [2022-04-15 08:29:10,278 INFO L290 TraceCheckUtils]: 42: Hoare triple {2325#true} assume true; {2325#true} is VALID [2022-04-15 08:29:10,279 INFO L290 TraceCheckUtils]: 41: Hoare triple {2325#true} assume !(0 == ~cond); {2325#true} is VALID [2022-04-15 08:29:10,279 INFO L290 TraceCheckUtils]: 40: Hoare triple {2325#true} ~cond := #in~cond; {2325#true} is VALID [2022-04-15 08:29:10,279 INFO L272 TraceCheckUtils]: 39: Hoare triple {2500#(not (< main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {2325#true} is VALID [2022-04-15 08:29:10,287 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2325#true} {2500#(not (< main_~b~0 main_~a~0))} #76#return; {2500#(not (< main_~b~0 main_~a~0))} is VALID [2022-04-15 08:29:10,287 INFO L290 TraceCheckUtils]: 37: Hoare triple {2325#true} assume true; {2325#true} is VALID [2022-04-15 08:29:10,287 INFO L290 TraceCheckUtils]: 36: Hoare triple {2325#true} assume !(0 == ~cond); {2325#true} is VALID [2022-04-15 08:29:10,287 INFO L290 TraceCheckUtils]: 35: Hoare triple {2325#true} ~cond := #in~cond; {2325#true} is VALID [2022-04-15 08:29:10,287 INFO L272 TraceCheckUtils]: 34: Hoare triple {2500#(not (< main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {2325#true} is VALID [2022-04-15 08:29:10,288 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2325#true} {2500#(not (< main_~b~0 main_~a~0))} #74#return; {2500#(not (< main_~b~0 main_~a~0))} is VALID [2022-04-15 08:29:10,288 INFO L290 TraceCheckUtils]: 32: Hoare triple {2325#true} assume true; {2325#true} is VALID [2022-04-15 08:29:10,288 INFO L290 TraceCheckUtils]: 31: Hoare triple {2325#true} assume !(0 == ~cond); {2325#true} is VALID [2022-04-15 08:29:10,288 INFO L290 TraceCheckUtils]: 30: Hoare triple {2325#true} ~cond := #in~cond; {2325#true} is VALID [2022-04-15 08:29:10,288 INFO L272 TraceCheckUtils]: 29: Hoare triple {2500#(not (< main_~b~0 main_~a~0))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {2325#true} is VALID [2022-04-15 08:29:10,289 INFO L290 TraceCheckUtils]: 28: Hoare triple {2500#(not (< main_~b~0 main_~a~0))} assume !false; {2500#(not (< main_~b~0 main_~a~0))} is VALID [2022-04-15 08:29:10,289 INFO L290 TraceCheckUtils]: 27: Hoare triple {2555#(<= main_~x~0 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {2500#(not (< main_~b~0 main_~a~0))} is VALID [2022-04-15 08:29:10,290 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2355#(not (= |assume_abort_if_not_#in~cond| 0))} {2559#(<= main_~x~0 1)} #72#return; {2555#(<= main_~x~0 main_~y~0)} is VALID [2022-04-15 08:29:10,290 INFO L290 TraceCheckUtils]: 25: Hoare triple {2355#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2355#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 08:29:10,290 INFO L290 TraceCheckUtils]: 24: Hoare triple {2569#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {2355#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 08:29:10,291 INFO L290 TraceCheckUtils]: 23: Hoare triple {2325#true} ~cond := #in~cond; {2569#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-15 08:29:10,291 INFO L272 TraceCheckUtils]: 22: Hoare triple {2559#(<= main_~x~0 1)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2325#true} is VALID [2022-04-15 08:29:10,291 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2325#true} {2559#(<= main_~x~0 1)} #70#return; {2559#(<= main_~x~0 1)} is VALID [2022-04-15 08:29:10,291 INFO L290 TraceCheckUtils]: 20: Hoare triple {2325#true} assume true; {2325#true} is VALID [2022-04-15 08:29:10,292 INFO L290 TraceCheckUtils]: 19: Hoare triple {2325#true} assume !(0 == ~cond); {2325#true} is VALID [2022-04-15 08:29:10,292 INFO L290 TraceCheckUtils]: 18: Hoare triple {2325#true} ~cond := #in~cond; {2325#true} is VALID [2022-04-15 08:29:10,292 INFO L272 TraceCheckUtils]: 17: Hoare triple {2559#(<= main_~x~0 1)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2325#true} is VALID [2022-04-15 08:29:10,292 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2325#true} {2559#(<= main_~x~0 1)} #68#return; {2559#(<= main_~x~0 1)} is VALID [2022-04-15 08:29:10,292 INFO L290 TraceCheckUtils]: 15: Hoare triple {2325#true} assume true; {2325#true} is VALID [2022-04-15 08:29:10,292 INFO L290 TraceCheckUtils]: 14: Hoare triple {2325#true} assume !(0 == ~cond); {2325#true} is VALID [2022-04-15 08:29:10,292 INFO L290 TraceCheckUtils]: 13: Hoare triple {2325#true} ~cond := #in~cond; {2325#true} is VALID [2022-04-15 08:29:10,292 INFO L272 TraceCheckUtils]: 12: Hoare triple {2559#(<= main_~x~0 1)} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 1 then 1 else 0)); {2325#true} is VALID [2022-04-15 08:29:10,293 INFO L290 TraceCheckUtils]: 11: Hoare triple {2559#(<= main_~x~0 1)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2559#(<= main_~x~0 1)} is VALID [2022-04-15 08:29:10,293 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2355#(not (= |assume_abort_if_not_#in~cond| 0))} {2325#true} #66#return; {2559#(<= main_~x~0 1)} is VALID [2022-04-15 08:29:10,293 INFO L290 TraceCheckUtils]: 9: Hoare triple {2355#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2355#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 08:29:10,294 INFO L290 TraceCheckUtils]: 8: Hoare triple {2569#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {2355#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 08:29:10,294 INFO L290 TraceCheckUtils]: 7: Hoare triple {2325#true} ~cond := #in~cond; {2569#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-15 08:29:10,294 INFO L272 TraceCheckUtils]: 6: Hoare triple {2325#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 1 then 1 else 0)); {2325#true} is VALID [2022-04-15 08:29:10,294 INFO L290 TraceCheckUtils]: 5: Hoare triple {2325#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {2325#true} is VALID [2022-04-15 08:29:10,294 INFO L272 TraceCheckUtils]: 4: Hoare triple {2325#true} call #t~ret6 := main(); {2325#true} is VALID [2022-04-15 08:29:10,294 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2325#true} {2325#true} #88#return; {2325#true} is VALID [2022-04-15 08:29:10,295 INFO L290 TraceCheckUtils]: 2: Hoare triple {2325#true} assume true; {2325#true} is VALID [2022-04-15 08:29:10,295 INFO L290 TraceCheckUtils]: 1: Hoare triple {2325#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(10, 2);call #Ultimate.allocInit(12, 3); {2325#true} is VALID [2022-04-15 08:29:10,295 INFO L272 TraceCheckUtils]: 0: Hoare triple {2325#true} call ULTIMATE.init(); {2325#true} is VALID [2022-04-15 08:29:10,295 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-15 08:29:10,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:29:10,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406866767] [2022-04-15 08:29:10,295 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:29:10,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86099413] [2022-04-15 08:29:10,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86099413] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 08:29:10,296 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 08:29:10,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2022-04-15 08:29:10,296 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:29:10,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2008765514] [2022-04-15 08:29:10,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2008765514] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:29:10,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:29:10,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 08:29:10,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432972209] [2022-04-15 08:29:10,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:29:10,297 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 51 [2022-04-15 08:29:10,297 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:29:10,297 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 08:29:10,321 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:29:10,321 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 08:29:10,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:29:10,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 08:29:10,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-15 08:29:10,322 INFO L87 Difference]: Start difference. First operand 74 states and 101 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 08:29:10,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:29:10,665 INFO L93 Difference]: Finished difference Result 98 states and 130 transitions. [2022-04-15 08:29:10,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 08:29:10,665 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 51 [2022-04-15 08:29:10,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:29:10,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 08:29:10,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2022-04-15 08:29:10,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 08:29:10,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2022-04-15 08:29:10,668 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 79 transitions. [2022-04-15 08:29:10,727 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:29:10,729 INFO L225 Difference]: With dead ends: 98 [2022-04-15 08:29:10,729 INFO L226 Difference]: Without dead ends: 65 [2022-04-15 08:29:10,729 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-04-15 08:29:10,730 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 12 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 08:29:10,730 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 144 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 08:29:10,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-15 08:29:10,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-04-15 08:29:10,823 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:29:10,823 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 65 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 36 states have internal predecessors, (39), 24 states have call successors, (24), 8 states have call predecessors, (24), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 08:29:10,823 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 65 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 36 states have internal predecessors, (39), 24 states have call successors, (24), 8 states have call predecessors, (24), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 08:29:10,823 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 65 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 36 states have internal predecessors, (39), 24 states have call successors, (24), 8 states have call predecessors, (24), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 08:29:10,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:29:10,826 INFO L93 Difference]: Finished difference Result 65 states and 84 transitions. [2022-04-15 08:29:10,826 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 84 transitions. [2022-04-15 08:29:10,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:29:10,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:29:10,827 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 36 states have internal predecessors, (39), 24 states have call successors, (24), 8 states have call predecessors, (24), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 65 states. [2022-04-15 08:29:10,827 INFO L87 Difference]: Start difference. First operand has 65 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 36 states have internal predecessors, (39), 24 states have call successors, (24), 8 states have call predecessors, (24), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 65 states. [2022-04-15 08:29:10,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:29:10,829 INFO L93 Difference]: Finished difference Result 65 states and 84 transitions. [2022-04-15 08:29:10,829 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 84 transitions. [2022-04-15 08:29:10,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:29:10,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:29:10,829 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:29:10,829 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:29:10,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 36 states have internal predecessors, (39), 24 states have call successors, (24), 8 states have call predecessors, (24), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 08:29:10,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 84 transitions. [2022-04-15 08:29:10,831 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 84 transitions. Word has length 51 [2022-04-15 08:29:10,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:29:10,831 INFO L478 AbstractCegarLoop]: Abstraction has 65 states and 84 transitions. [2022-04-15 08:29:10,831 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 08:29:10,832 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 84 transitions. [2022-04-15 08:29:10,940 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:29:10,940 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 84 transitions. [2022-04-15 08:29:10,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-15 08:29:10,940 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:29:10,941 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 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-15 08:29:10,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-15 08:29:11,153 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:29:11,154 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:29:11,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:29:11,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1924168317, now seen corresponding path program 1 times [2022-04-15 08:29:11,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:29:11,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2047211797] [2022-04-15 08:29:11,154 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:29:11,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1924168317, now seen corresponding path program 2 times [2022-04-15 08:29:11,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:29:11,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211366675] [2022-04-15 08:29:11,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:29:11,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:29:11,180 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:29:11,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [125822036] [2022-04-15 08:29:11,180 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:29:11,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:29:11,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:29:11,184 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 08:29:11,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-15 08:29:11,220 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 08:29:11,221 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:29:11,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 08:29:11,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:29:11,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:29:11,373 INFO L272 TraceCheckUtils]: 0: Hoare triple {3101#true} call ULTIMATE.init(); {3101#true} is VALID [2022-04-15 08:29:11,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {3101#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(10, 2);call #Ultimate.allocInit(12, 3); {3101#true} is VALID [2022-04-15 08:29:11,374 INFO L290 TraceCheckUtils]: 2: Hoare triple {3101#true} assume true; {3101#true} is VALID [2022-04-15 08:29:11,374 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3101#true} {3101#true} #88#return; {3101#true} is VALID [2022-04-15 08:29:11,374 INFO L272 TraceCheckUtils]: 4: Hoare triple {3101#true} call #t~ret6 := main(); {3101#true} is VALID [2022-04-15 08:29:11,374 INFO L290 TraceCheckUtils]: 5: Hoare triple {3101#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {3101#true} is VALID [2022-04-15 08:29:11,374 INFO L272 TraceCheckUtils]: 6: Hoare triple {3101#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 1 then 1 else 0)); {3101#true} is VALID [2022-04-15 08:29:11,374 INFO L290 TraceCheckUtils]: 7: Hoare triple {3101#true} ~cond := #in~cond; {3101#true} is VALID [2022-04-15 08:29:11,374 INFO L290 TraceCheckUtils]: 8: Hoare triple {3101#true} assume !(0 == ~cond); {3101#true} is VALID [2022-04-15 08:29:11,374 INFO L290 TraceCheckUtils]: 9: Hoare triple {3101#true} assume true; {3101#true} is VALID [2022-04-15 08:29:11,374 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3101#true} {3101#true} #66#return; {3101#true} is VALID [2022-04-15 08:29:11,374 INFO L290 TraceCheckUtils]: 11: Hoare triple {3101#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3101#true} is VALID [2022-04-15 08:29:11,374 INFO L272 TraceCheckUtils]: 12: Hoare triple {3101#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 1 then 1 else 0)); {3101#true} is VALID [2022-04-15 08:29:11,374 INFO L290 TraceCheckUtils]: 13: Hoare triple {3101#true} ~cond := #in~cond; {3101#true} is VALID [2022-04-15 08:29:11,375 INFO L290 TraceCheckUtils]: 14: Hoare triple {3101#true} assume !(0 == ~cond); {3101#true} is VALID [2022-04-15 08:29:11,375 INFO L290 TraceCheckUtils]: 15: Hoare triple {3101#true} assume true; {3101#true} is VALID [2022-04-15 08:29:11,375 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3101#true} {3101#true} #68#return; {3101#true} is VALID [2022-04-15 08:29:11,375 INFO L272 TraceCheckUtils]: 17: Hoare triple {3101#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3101#true} is VALID [2022-04-15 08:29:11,375 INFO L290 TraceCheckUtils]: 18: Hoare triple {3101#true} ~cond := #in~cond; {3101#true} is VALID [2022-04-15 08:29:11,375 INFO L290 TraceCheckUtils]: 19: Hoare triple {3101#true} assume !(0 == ~cond); {3101#true} is VALID [2022-04-15 08:29:11,375 INFO L290 TraceCheckUtils]: 20: Hoare triple {3101#true} assume true; {3101#true} is VALID [2022-04-15 08:29:11,375 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3101#true} {3101#true} #70#return; {3101#true} is VALID [2022-04-15 08:29:11,375 INFO L272 TraceCheckUtils]: 22: Hoare triple {3101#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3101#true} is VALID [2022-04-15 08:29:11,375 INFO L290 TraceCheckUtils]: 23: Hoare triple {3101#true} ~cond := #in~cond; {3101#true} is VALID [2022-04-15 08:29:11,375 INFO L290 TraceCheckUtils]: 24: Hoare triple {3101#true} assume !(0 == ~cond); {3101#true} is VALID [2022-04-15 08:29:11,375 INFO L290 TraceCheckUtils]: 25: Hoare triple {3101#true} assume true; {3101#true} is VALID [2022-04-15 08:29:11,376 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3101#true} {3101#true} #72#return; {3101#true} is VALID [2022-04-15 08:29:11,376 INFO L290 TraceCheckUtils]: 27: Hoare triple {3101#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {3101#true} is VALID [2022-04-15 08:29:11,376 INFO L290 TraceCheckUtils]: 28: Hoare triple {3101#true} assume !false; {3101#true} is VALID [2022-04-15 08:29:11,376 INFO L272 TraceCheckUtils]: 29: Hoare triple {3101#true} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {3101#true} is VALID [2022-04-15 08:29:11,376 INFO L290 TraceCheckUtils]: 30: Hoare triple {3101#true} ~cond := #in~cond; {3101#true} is VALID [2022-04-15 08:29:11,376 INFO L290 TraceCheckUtils]: 31: Hoare triple {3101#true} assume !(0 == ~cond); {3101#true} is VALID [2022-04-15 08:29:11,376 INFO L290 TraceCheckUtils]: 32: Hoare triple {3101#true} assume true; {3101#true} is VALID [2022-04-15 08:29:11,376 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {3101#true} {3101#true} #74#return; {3101#true} is VALID [2022-04-15 08:29:11,376 INFO L272 TraceCheckUtils]: 34: Hoare triple {3101#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3101#true} is VALID [2022-04-15 08:29:11,385 INFO L290 TraceCheckUtils]: 35: Hoare triple {3101#true} ~cond := #in~cond; {3211#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 08:29:11,385 INFO L290 TraceCheckUtils]: 36: Hoare triple {3211#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3215#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 08:29:11,385 INFO L290 TraceCheckUtils]: 37: Hoare triple {3215#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3215#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 08:29:11,386 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3215#(not (= |__VERIFIER_assert_#in~cond| 0))} {3101#true} #76#return; {3222#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 08:29:11,386 INFO L272 TraceCheckUtils]: 39: Hoare triple {3222#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {3101#true} is VALID [2022-04-15 08:29:11,386 INFO L290 TraceCheckUtils]: 40: Hoare triple {3101#true} ~cond := #in~cond; {3101#true} is VALID [2022-04-15 08:29:11,386 INFO L290 TraceCheckUtils]: 41: Hoare triple {3101#true} assume !(0 == ~cond); {3101#true} is VALID [2022-04-15 08:29:11,386 INFO L290 TraceCheckUtils]: 42: Hoare triple {3101#true} assume true; {3101#true} is VALID [2022-04-15 08:29:11,387 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3101#true} {3222#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #78#return; {3222#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 08:29:11,388 INFO L290 TraceCheckUtils]: 44: Hoare triple {3222#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !(~a~0 != ~b~0); {3241#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 08:29:11,388 INFO L272 TraceCheckUtils]: 45: Hoare triple {3241#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~a~0 - ~b~0 then 1 else 0)); {3101#true} is VALID [2022-04-15 08:29:11,388 INFO L290 TraceCheckUtils]: 46: Hoare triple {3101#true} ~cond := #in~cond; {3101#true} is VALID [2022-04-15 08:29:11,388 INFO L290 TraceCheckUtils]: 47: Hoare triple {3101#true} assume !(0 == ~cond); {3101#true} is VALID [2022-04-15 08:29:11,388 INFO L290 TraceCheckUtils]: 48: Hoare triple {3101#true} assume true; {3101#true} is VALID [2022-04-15 08:29:11,389 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {3101#true} {3241#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #80#return; {3241#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 08:29:11,389 INFO L272 TraceCheckUtils]: 50: Hoare triple {3241#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~p~0 * ~x~0 + ~r~0 * ~y~0 - ~b~0 then 1 else 0)); {3260#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 08:29:11,390 INFO L290 TraceCheckUtils]: 51: Hoare triple {3260#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3264#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 08:29:11,390 INFO L290 TraceCheckUtils]: 52: Hoare triple {3264#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3102#false} is VALID [2022-04-15 08:29:11,390 INFO L290 TraceCheckUtils]: 53: Hoare triple {3102#false} assume !false; {3102#false} is VALID [2022-04-15 08:29:11,391 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-15 08:29:11,391 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 08:29:27,262 INFO L290 TraceCheckUtils]: 53: Hoare triple {3102#false} assume !false; {3102#false} is VALID [2022-04-15 08:29:27,263 INFO L290 TraceCheckUtils]: 52: Hoare triple {3264#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3102#false} is VALID [2022-04-15 08:29:27,263 INFO L290 TraceCheckUtils]: 51: Hoare triple {3260#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3264#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 08:29:27,264 INFO L272 TraceCheckUtils]: 50: Hoare triple {3241#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~p~0 * ~x~0 + ~r~0 * ~y~0 - ~b~0 then 1 else 0)); {3260#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 08:29:27,264 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {3101#true} {3241#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #80#return; {3241#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 08:29:27,264 INFO L290 TraceCheckUtils]: 48: Hoare triple {3101#true} assume true; {3101#true} is VALID [2022-04-15 08:29:27,264 INFO L290 TraceCheckUtils]: 47: Hoare triple {3101#true} assume !(0 == ~cond); {3101#true} is VALID [2022-04-15 08:29:27,265 INFO L290 TraceCheckUtils]: 46: Hoare triple {3101#true} ~cond := #in~cond; {3101#true} is VALID [2022-04-15 08:29:27,265 INFO L272 TraceCheckUtils]: 45: Hoare triple {3241#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~a~0 - ~b~0 then 1 else 0)); {3101#true} is VALID [2022-04-15 08:29:27,265 INFO L290 TraceCheckUtils]: 44: Hoare triple {3222#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !(~a~0 != ~b~0); {3241#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 08:29:27,266 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3101#true} {3222#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #78#return; {3222#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 08:29:27,266 INFO L290 TraceCheckUtils]: 42: Hoare triple {3101#true} assume true; {3101#true} is VALID [2022-04-15 08:29:27,266 INFO L290 TraceCheckUtils]: 41: Hoare triple {3101#true} assume !(0 == ~cond); {3101#true} is VALID [2022-04-15 08:29:27,266 INFO L290 TraceCheckUtils]: 40: Hoare triple {3101#true} ~cond := #in~cond; {3101#true} is VALID [2022-04-15 08:29:27,266 INFO L272 TraceCheckUtils]: 39: Hoare triple {3222#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {3101#true} is VALID [2022-04-15 08:29:27,267 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3215#(not (= |__VERIFIER_assert_#in~cond| 0))} {3101#true} #76#return; {3222#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 08:29:27,267 INFO L290 TraceCheckUtils]: 37: Hoare triple {3215#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3215#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 08:29:27,267 INFO L290 TraceCheckUtils]: 36: Hoare triple {3325#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3215#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 08:29:27,268 INFO L290 TraceCheckUtils]: 35: Hoare triple {3101#true} ~cond := #in~cond; {3325#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 08:29:27,268 INFO L272 TraceCheckUtils]: 34: Hoare triple {3101#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3101#true} is VALID [2022-04-15 08:29:27,268 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {3101#true} {3101#true} #74#return; {3101#true} is VALID [2022-04-15 08:29:27,268 INFO L290 TraceCheckUtils]: 32: Hoare triple {3101#true} assume true; {3101#true} is VALID [2022-04-15 08:29:27,268 INFO L290 TraceCheckUtils]: 31: Hoare triple {3101#true} assume !(0 == ~cond); {3101#true} is VALID [2022-04-15 08:29:27,268 INFO L290 TraceCheckUtils]: 30: Hoare triple {3101#true} ~cond := #in~cond; {3101#true} is VALID [2022-04-15 08:29:27,268 INFO L272 TraceCheckUtils]: 29: Hoare triple {3101#true} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {3101#true} is VALID [2022-04-15 08:29:27,268 INFO L290 TraceCheckUtils]: 28: Hoare triple {3101#true} assume !false; {3101#true} is VALID [2022-04-15 08:29:27,269 INFO L290 TraceCheckUtils]: 27: Hoare triple {3101#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {3101#true} is VALID [2022-04-15 08:29:27,269 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3101#true} {3101#true} #72#return; {3101#true} is VALID [2022-04-15 08:29:27,269 INFO L290 TraceCheckUtils]: 25: Hoare triple {3101#true} assume true; {3101#true} is VALID [2022-04-15 08:29:27,269 INFO L290 TraceCheckUtils]: 24: Hoare triple {3101#true} assume !(0 == ~cond); {3101#true} is VALID [2022-04-15 08:29:27,269 INFO L290 TraceCheckUtils]: 23: Hoare triple {3101#true} ~cond := #in~cond; {3101#true} is VALID [2022-04-15 08:29:27,269 INFO L272 TraceCheckUtils]: 22: Hoare triple {3101#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3101#true} is VALID [2022-04-15 08:29:27,269 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3101#true} {3101#true} #70#return; {3101#true} is VALID [2022-04-15 08:29:27,269 INFO L290 TraceCheckUtils]: 20: Hoare triple {3101#true} assume true; {3101#true} is VALID [2022-04-15 08:29:27,269 INFO L290 TraceCheckUtils]: 19: Hoare triple {3101#true} assume !(0 == ~cond); {3101#true} is VALID [2022-04-15 08:29:27,269 INFO L290 TraceCheckUtils]: 18: Hoare triple {3101#true} ~cond := #in~cond; {3101#true} is VALID [2022-04-15 08:29:27,269 INFO L272 TraceCheckUtils]: 17: Hoare triple {3101#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3101#true} is VALID [2022-04-15 08:29:27,269 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3101#true} {3101#true} #68#return; {3101#true} is VALID [2022-04-15 08:29:27,270 INFO L290 TraceCheckUtils]: 15: Hoare triple {3101#true} assume true; {3101#true} is VALID [2022-04-15 08:29:27,270 INFO L290 TraceCheckUtils]: 14: Hoare triple {3101#true} assume !(0 == ~cond); {3101#true} is VALID [2022-04-15 08:29:27,270 INFO L290 TraceCheckUtils]: 13: Hoare triple {3101#true} ~cond := #in~cond; {3101#true} is VALID [2022-04-15 08:29:27,270 INFO L272 TraceCheckUtils]: 12: Hoare triple {3101#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 1 then 1 else 0)); {3101#true} is VALID [2022-04-15 08:29:27,270 INFO L290 TraceCheckUtils]: 11: Hoare triple {3101#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3101#true} is VALID [2022-04-15 08:29:27,270 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3101#true} {3101#true} #66#return; {3101#true} is VALID [2022-04-15 08:29:27,270 INFO L290 TraceCheckUtils]: 9: Hoare triple {3101#true} assume true; {3101#true} is VALID [2022-04-15 08:29:27,270 INFO L290 TraceCheckUtils]: 8: Hoare triple {3101#true} assume !(0 == ~cond); {3101#true} is VALID [2022-04-15 08:29:27,270 INFO L290 TraceCheckUtils]: 7: Hoare triple {3101#true} ~cond := #in~cond; {3101#true} is VALID [2022-04-15 08:29:27,270 INFO L272 TraceCheckUtils]: 6: Hoare triple {3101#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 1 then 1 else 0)); {3101#true} is VALID [2022-04-15 08:29:27,270 INFO L290 TraceCheckUtils]: 5: Hoare triple {3101#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {3101#true} is VALID [2022-04-15 08:29:27,270 INFO L272 TraceCheckUtils]: 4: Hoare triple {3101#true} call #t~ret6 := main(); {3101#true} is VALID [2022-04-15 08:29:27,271 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3101#true} {3101#true} #88#return; {3101#true} is VALID [2022-04-15 08:29:27,271 INFO L290 TraceCheckUtils]: 2: Hoare triple {3101#true} assume true; {3101#true} is VALID [2022-04-15 08:29:27,271 INFO L290 TraceCheckUtils]: 1: Hoare triple {3101#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(10, 2);call #Ultimate.allocInit(12, 3); {3101#true} is VALID [2022-04-15 08:29:27,271 INFO L272 TraceCheckUtils]: 0: Hoare triple {3101#true} call ULTIMATE.init(); {3101#true} is VALID [2022-04-15 08:29:27,271 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-15 08:29:27,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:29:27,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211366675] [2022-04-15 08:29:27,271 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:29:27,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125822036] [2022-04-15 08:29:27,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125822036] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 08:29:27,272 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 08:29:27,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-04-15 08:29:27,272 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:29:27,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2047211797] [2022-04-15 08:29:27,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2047211797] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:29:27,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:29:27,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 08:29:27,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749055252] [2022-04-15 08:29:27,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:29:27,273 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 54 [2022-04-15 08:29:27,274 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:29:27,274 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-15 08:29:27,306 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:29:27,306 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 08:29:27,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:29:27,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 08:29:27,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-04-15 08:29:27,307 INFO L87 Difference]: Start difference. First operand 65 states and 84 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-15 08:29:28,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:29:28,004 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2022-04-15 08:29:28,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 08:29:28,004 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 54 [2022-04-15 08:29:28,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:29:28,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-15 08:29:28,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 52 transitions. [2022-04-15 08:29:28,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-15 08:29:28,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 52 transitions. [2022-04-15 08:29:28,010 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 52 transitions. [2022-04-15 08:29:28,047 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:29:28,048 INFO L225 Difference]: With dead ends: 74 [2022-04-15 08:29:28,048 INFO L226 Difference]: Without dead ends: 70 [2022-04-15 08:29:28,049 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-15 08:29:28,049 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 13 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 08:29:28,049 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 150 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 08:29:28,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-15 08:29:28,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-04-15 08:29:28,155 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:29:28,155 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 70 states, 37 states have (on average 1.135135135135135) internal successors, (42), 40 states have internal predecessors, (42), 24 states have call successors, (24), 9 states have call predecessors, (24), 8 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-15 08:29:28,155 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 70 states, 37 states have (on average 1.135135135135135) internal successors, (42), 40 states have internal predecessors, (42), 24 states have call successors, (24), 9 states have call predecessors, (24), 8 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-15 08:29:28,156 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 70 states, 37 states have (on average 1.135135135135135) internal successors, (42), 40 states have internal predecessors, (42), 24 states have call successors, (24), 9 states have call predecessors, (24), 8 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-15 08:29:28,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:29:28,158 INFO L93 Difference]: Finished difference Result 70 states and 88 transitions. [2022-04-15 08:29:28,158 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 88 transitions. [2022-04-15 08:29:28,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:29:28,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:29:28,158 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 37 states have (on average 1.135135135135135) internal successors, (42), 40 states have internal predecessors, (42), 24 states have call successors, (24), 9 states have call predecessors, (24), 8 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) Second operand 70 states. [2022-04-15 08:29:28,158 INFO L87 Difference]: Start difference. First operand has 70 states, 37 states have (on average 1.135135135135135) internal successors, (42), 40 states have internal predecessors, (42), 24 states have call successors, (24), 9 states have call predecessors, (24), 8 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) Second operand 70 states. [2022-04-15 08:29:28,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:29:28,160 INFO L93 Difference]: Finished difference Result 70 states and 88 transitions. [2022-04-15 08:29:28,160 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 88 transitions. [2022-04-15 08:29:28,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:29:28,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:29:28,161 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:29:28,161 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:29:28,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 37 states have (on average 1.135135135135135) internal successors, (42), 40 states have internal predecessors, (42), 24 states have call successors, (24), 9 states have call predecessors, (24), 8 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-15 08:29:28,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 88 transitions. [2022-04-15 08:29:28,163 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 88 transitions. Word has length 54 [2022-04-15 08:29:28,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:29:28,163 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 88 transitions. [2022-04-15 08:29:28,163 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-15 08:29:28,163 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 88 transitions. [2022-04-15 08:29:28,255 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-15 08:29:28,255 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 88 transitions. [2022-04-15 08:29:28,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-15 08:29:28,255 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:29:28,256 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 08:29:28,288 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-15 08:29:28,472 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:29:28,472 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:29:28,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:29:28,473 INFO L85 PathProgramCache]: Analyzing trace with hash 888099957, now seen corresponding path program 1 times [2022-04-15 08:29:28,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:29:28,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1877627838] [2022-04-15 08:29:28,473 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:29:28,473 INFO L85 PathProgramCache]: Analyzing trace with hash 888099957, now seen corresponding path program 2 times [2022-04-15 08:29:28,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:29:28,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542121285] [2022-04-15 08:29:28,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:29:28,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:29:28,498 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:29:28,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1509547405] [2022-04-15 08:29:28,499 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:29:28,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:29:28,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:29:28,503 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 08:29:28,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-15 08:29:28,540 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 08:29:28,540 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:29:28,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-15 08:29:28,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:29:28,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:29:28,912 INFO L272 TraceCheckUtils]: 0: Hoare triple {3867#true} call ULTIMATE.init(); {3867#true} is VALID [2022-04-15 08:29:28,912 INFO L290 TraceCheckUtils]: 1: Hoare triple {3867#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(10, 2);call #Ultimate.allocInit(12, 3); {3867#true} is VALID [2022-04-15 08:29:28,912 INFO L290 TraceCheckUtils]: 2: Hoare triple {3867#true} assume true; {3867#true} is VALID [2022-04-15 08:29:28,912 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3867#true} {3867#true} #88#return; {3867#true} is VALID [2022-04-15 08:29:28,912 INFO L272 TraceCheckUtils]: 4: Hoare triple {3867#true} call #t~ret6 := main(); {3867#true} is VALID [2022-04-15 08:29:28,912 INFO L290 TraceCheckUtils]: 5: Hoare triple {3867#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {3867#true} is VALID [2022-04-15 08:29:28,913 INFO L272 TraceCheckUtils]: 6: Hoare triple {3867#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 1 then 1 else 0)); {3867#true} is VALID [2022-04-15 08:29:28,913 INFO L290 TraceCheckUtils]: 7: Hoare triple {3867#true} ~cond := #in~cond; {3867#true} is VALID [2022-04-15 08:29:28,913 INFO L290 TraceCheckUtils]: 8: Hoare triple {3867#true} assume !(0 == ~cond); {3867#true} is VALID [2022-04-15 08:29:28,913 INFO L290 TraceCheckUtils]: 9: Hoare triple {3867#true} assume true; {3867#true} is VALID [2022-04-15 08:29:28,913 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3867#true} {3867#true} #66#return; {3867#true} is VALID [2022-04-15 08:29:28,913 INFO L290 TraceCheckUtils]: 11: Hoare triple {3867#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3867#true} is VALID [2022-04-15 08:29:28,913 INFO L272 TraceCheckUtils]: 12: Hoare triple {3867#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 1 then 1 else 0)); {3867#true} is VALID [2022-04-15 08:29:28,913 INFO L290 TraceCheckUtils]: 13: Hoare triple {3867#true} ~cond := #in~cond; {3911#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 08:29:28,914 INFO L290 TraceCheckUtils]: 14: Hoare triple {3911#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {3915#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 08:29:28,914 INFO L290 TraceCheckUtils]: 15: Hoare triple {3915#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3915#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 08:29:28,915 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3915#(not (= |assume_abort_if_not_#in~cond| 0))} {3867#true} #68#return; {3922#(and (<= 0 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-15 08:29:28,915 INFO L272 TraceCheckUtils]: 17: Hoare triple {3922#(and (<= 0 main_~y~0) (<= main_~y~0 1))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3867#true} is VALID [2022-04-15 08:29:28,915 INFO L290 TraceCheckUtils]: 18: Hoare triple {3867#true} ~cond := #in~cond; {3911#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 08:29:28,915 INFO L290 TraceCheckUtils]: 19: Hoare triple {3911#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {3915#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 08:29:28,916 INFO L290 TraceCheckUtils]: 20: Hoare triple {3915#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3915#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 08:29:28,916 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3915#(not (= |assume_abort_if_not_#in~cond| 0))} {3922#(and (<= 0 main_~y~0) (<= main_~y~0 1))} #70#return; {3938#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 1))} is VALID [2022-04-15 08:29:28,916 INFO L272 TraceCheckUtils]: 22: Hoare triple {3938#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 1))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3867#true} is VALID [2022-04-15 08:29:28,916 INFO L290 TraceCheckUtils]: 23: Hoare triple {3867#true} ~cond := #in~cond; {3867#true} is VALID [2022-04-15 08:29:28,916 INFO L290 TraceCheckUtils]: 24: Hoare triple {3867#true} assume !(0 == ~cond); {3867#true} is VALID [2022-04-15 08:29:28,916 INFO L290 TraceCheckUtils]: 25: Hoare triple {3867#true} assume true; {3867#true} is VALID [2022-04-15 08:29:28,917 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3867#true} {3938#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 1))} #72#return; {3938#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 1))} is VALID [2022-04-15 08:29:28,917 INFO L290 TraceCheckUtils]: 27: Hoare triple {3938#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 1))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {3957#(and (<= main_~b~0 1) (<= 1 main_~a~0))} is VALID [2022-04-15 08:29:28,918 INFO L290 TraceCheckUtils]: 28: Hoare triple {3957#(and (<= main_~b~0 1) (<= 1 main_~a~0))} assume !false; {3957#(and (<= main_~b~0 1) (<= 1 main_~a~0))} is VALID [2022-04-15 08:29:28,918 INFO L272 TraceCheckUtils]: 29: Hoare triple {3957#(and (<= main_~b~0 1) (<= 1 main_~a~0))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {3867#true} is VALID [2022-04-15 08:29:28,918 INFO L290 TraceCheckUtils]: 30: Hoare triple {3867#true} ~cond := #in~cond; {3867#true} is VALID [2022-04-15 08:29:28,918 INFO L290 TraceCheckUtils]: 31: Hoare triple {3867#true} assume !(0 == ~cond); {3867#true} is VALID [2022-04-15 08:29:28,918 INFO L290 TraceCheckUtils]: 32: Hoare triple {3867#true} assume true; {3867#true} is VALID [2022-04-15 08:29:28,919 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {3867#true} {3957#(and (<= main_~b~0 1) (<= 1 main_~a~0))} #74#return; {3957#(and (<= main_~b~0 1) (<= 1 main_~a~0))} is VALID [2022-04-15 08:29:28,919 INFO L272 TraceCheckUtils]: 34: Hoare triple {3957#(and (<= main_~b~0 1) (<= 1 main_~a~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3867#true} is VALID [2022-04-15 08:29:28,919 INFO L290 TraceCheckUtils]: 35: Hoare triple {3867#true} ~cond := #in~cond; {3867#true} is VALID [2022-04-15 08:29:28,919 INFO L290 TraceCheckUtils]: 36: Hoare triple {3867#true} assume !(0 == ~cond); {3867#true} is VALID [2022-04-15 08:29:28,919 INFO L290 TraceCheckUtils]: 37: Hoare triple {3867#true} assume true; {3867#true} is VALID [2022-04-15 08:29:28,920 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3867#true} {3957#(and (<= main_~b~0 1) (<= 1 main_~a~0))} #76#return; {3957#(and (<= main_~b~0 1) (<= 1 main_~a~0))} is VALID [2022-04-15 08:29:28,920 INFO L272 TraceCheckUtils]: 39: Hoare triple {3957#(and (<= main_~b~0 1) (<= 1 main_~a~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {3867#true} is VALID [2022-04-15 08:29:28,920 INFO L290 TraceCheckUtils]: 40: Hoare triple {3867#true} ~cond := #in~cond; {3867#true} is VALID [2022-04-15 08:29:28,920 INFO L290 TraceCheckUtils]: 41: Hoare triple {3867#true} assume !(0 == ~cond); {3867#true} is VALID [2022-04-15 08:29:28,920 INFO L290 TraceCheckUtils]: 42: Hoare triple {3867#true} assume true; {3867#true} is VALID [2022-04-15 08:29:28,921 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3867#true} {3957#(and (<= main_~b~0 1) (<= 1 main_~a~0))} #78#return; {3957#(and (<= main_~b~0 1) (<= 1 main_~a~0))} is VALID [2022-04-15 08:29:28,921 INFO L290 TraceCheckUtils]: 44: Hoare triple {3957#(and (<= main_~b~0 1) (<= 1 main_~a~0))} assume !!(~a~0 != ~b~0); {4009#(and (<= main_~b~0 1) (<= 1 main_~a~0) (not (= main_~b~0 main_~a~0)))} is VALID [2022-04-15 08:29:28,922 INFO L290 TraceCheckUtils]: 45: Hoare triple {4009#(and (<= main_~b~0 1) (<= 1 main_~a~0) (not (= main_~b~0 main_~a~0)))} assume !(~a~0 > ~b~0);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {3868#false} is VALID [2022-04-15 08:29:28,922 INFO L290 TraceCheckUtils]: 46: Hoare triple {3868#false} assume !false; {3868#false} is VALID [2022-04-15 08:29:28,922 INFO L272 TraceCheckUtils]: 47: Hoare triple {3868#false} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {3868#false} is VALID [2022-04-15 08:29:28,922 INFO L290 TraceCheckUtils]: 48: Hoare triple {3868#false} ~cond := #in~cond; {3868#false} is VALID [2022-04-15 08:29:28,922 INFO L290 TraceCheckUtils]: 49: Hoare triple {3868#false} assume !(0 == ~cond); {3868#false} is VALID [2022-04-15 08:29:28,923 INFO L290 TraceCheckUtils]: 50: Hoare triple {3868#false} assume true; {3868#false} is VALID [2022-04-15 08:29:28,923 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {3868#false} {3868#false} #74#return; {3868#false} is VALID [2022-04-15 08:29:28,923 INFO L272 TraceCheckUtils]: 52: Hoare triple {3868#false} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3868#false} is VALID [2022-04-15 08:29:28,923 INFO L290 TraceCheckUtils]: 53: Hoare triple {3868#false} ~cond := #in~cond; {3868#false} is VALID [2022-04-15 08:29:28,923 INFO L290 TraceCheckUtils]: 54: Hoare triple {3868#false} assume !(0 == ~cond); {3868#false} is VALID [2022-04-15 08:29:28,923 INFO L290 TraceCheckUtils]: 55: Hoare triple {3868#false} assume true; {3868#false} is VALID [2022-04-15 08:29:28,923 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {3868#false} {3868#false} #76#return; {3868#false} is VALID [2022-04-15 08:29:28,923 INFO L272 TraceCheckUtils]: 57: Hoare triple {3868#false} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {3868#false} is VALID [2022-04-15 08:29:28,923 INFO L290 TraceCheckUtils]: 58: Hoare triple {3868#false} ~cond := #in~cond; {3868#false} is VALID [2022-04-15 08:29:28,923 INFO L290 TraceCheckUtils]: 59: Hoare triple {3868#false} assume 0 == ~cond; {3868#false} is VALID [2022-04-15 08:29:28,923 INFO L290 TraceCheckUtils]: 60: Hoare triple {3868#false} assume !false; {3868#false} is VALID [2022-04-15 08:29:28,924 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 40 proven. 6 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-04-15 08:29:28,924 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 08:29:29,433 INFO L290 TraceCheckUtils]: 60: Hoare triple {3868#false} assume !false; {3868#false} is VALID [2022-04-15 08:29:29,433 INFO L290 TraceCheckUtils]: 59: Hoare triple {3868#false} assume 0 == ~cond; {3868#false} is VALID [2022-04-15 08:29:29,433 INFO L290 TraceCheckUtils]: 58: Hoare triple {3868#false} ~cond := #in~cond; {3868#false} is VALID [2022-04-15 08:29:29,433 INFO L272 TraceCheckUtils]: 57: Hoare triple {3868#false} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {3868#false} is VALID [2022-04-15 08:29:29,434 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {3867#true} {3868#false} #76#return; {3868#false} is VALID [2022-04-15 08:29:29,434 INFO L290 TraceCheckUtils]: 55: Hoare triple {3867#true} assume true; {3867#true} is VALID [2022-04-15 08:29:29,434 INFO L290 TraceCheckUtils]: 54: Hoare triple {3867#true} assume !(0 == ~cond); {3867#true} is VALID [2022-04-15 08:29:29,434 INFO L290 TraceCheckUtils]: 53: Hoare triple {3867#true} ~cond := #in~cond; {3867#true} is VALID [2022-04-15 08:29:29,434 INFO L272 TraceCheckUtils]: 52: Hoare triple {3868#false} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3867#true} is VALID [2022-04-15 08:29:29,434 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {3867#true} {3868#false} #74#return; {3868#false} is VALID [2022-04-15 08:29:29,434 INFO L290 TraceCheckUtils]: 50: Hoare triple {3867#true} assume true; {3867#true} is VALID [2022-04-15 08:29:29,434 INFO L290 TraceCheckUtils]: 49: Hoare triple {3867#true} assume !(0 == ~cond); {3867#true} is VALID [2022-04-15 08:29:29,434 INFO L290 TraceCheckUtils]: 48: Hoare triple {3867#true} ~cond := #in~cond; {3867#true} is VALID [2022-04-15 08:29:29,434 INFO L272 TraceCheckUtils]: 47: Hoare triple {3868#false} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {3867#true} is VALID [2022-04-15 08:29:29,434 INFO L290 TraceCheckUtils]: 46: Hoare triple {3868#false} assume !false; {3868#false} is VALID [2022-04-15 08:29:29,435 INFO L290 TraceCheckUtils]: 45: Hoare triple {4103#(< main_~b~0 main_~a~0)} assume !(~a~0 > ~b~0);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {3868#false} is VALID [2022-04-15 08:29:29,435 INFO L290 TraceCheckUtils]: 44: Hoare triple {4107#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0))} assume !!(~a~0 != ~b~0); {4103#(< main_~b~0 main_~a~0)} is VALID [2022-04-15 08:29:29,436 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3867#true} {4107#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0))} #78#return; {4107#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0))} is VALID [2022-04-15 08:29:29,436 INFO L290 TraceCheckUtils]: 42: Hoare triple {3867#true} assume true; {3867#true} is VALID [2022-04-15 08:29:29,436 INFO L290 TraceCheckUtils]: 41: Hoare triple {3867#true} assume !(0 == ~cond); {3867#true} is VALID [2022-04-15 08:29:29,436 INFO L290 TraceCheckUtils]: 40: Hoare triple {3867#true} ~cond := #in~cond; {3867#true} is VALID [2022-04-15 08:29:29,436 INFO L272 TraceCheckUtils]: 39: Hoare triple {4107#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {3867#true} is VALID [2022-04-15 08:29:29,438 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3867#true} {4107#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0))} #76#return; {4107#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0))} is VALID [2022-04-15 08:29:29,438 INFO L290 TraceCheckUtils]: 37: Hoare triple {3867#true} assume true; {3867#true} is VALID [2022-04-15 08:29:29,438 INFO L290 TraceCheckUtils]: 36: Hoare triple {3867#true} assume !(0 == ~cond); {3867#true} is VALID [2022-04-15 08:29:29,438 INFO L290 TraceCheckUtils]: 35: Hoare triple {3867#true} ~cond := #in~cond; {3867#true} is VALID [2022-04-15 08:29:29,439 INFO L272 TraceCheckUtils]: 34: Hoare triple {4107#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3867#true} is VALID [2022-04-15 08:29:29,439 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {3867#true} {4107#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0))} #74#return; {4107#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0))} is VALID [2022-04-15 08:29:29,439 INFO L290 TraceCheckUtils]: 32: Hoare triple {3867#true} assume true; {3867#true} is VALID [2022-04-15 08:29:29,439 INFO L290 TraceCheckUtils]: 31: Hoare triple {3867#true} assume !(0 == ~cond); {3867#true} is VALID [2022-04-15 08:29:29,439 INFO L290 TraceCheckUtils]: 30: Hoare triple {3867#true} ~cond := #in~cond; {3867#true} is VALID [2022-04-15 08:29:29,439 INFO L272 TraceCheckUtils]: 29: Hoare triple {4107#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {3867#true} is VALID [2022-04-15 08:29:29,440 INFO L290 TraceCheckUtils]: 28: Hoare triple {4107#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0))} assume !false; {4107#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0))} is VALID [2022-04-15 08:29:29,440 INFO L290 TraceCheckUtils]: 27: Hoare triple {4159#(<= main_~y~0 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {4107#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0))} is VALID [2022-04-15 08:29:29,441 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3867#true} {4159#(<= main_~y~0 main_~x~0)} #72#return; {4159#(<= main_~y~0 main_~x~0)} is VALID [2022-04-15 08:29:29,441 INFO L290 TraceCheckUtils]: 25: Hoare triple {3867#true} assume true; {3867#true} is VALID [2022-04-15 08:29:29,441 INFO L290 TraceCheckUtils]: 24: Hoare triple {3867#true} assume !(0 == ~cond); {3867#true} is VALID [2022-04-15 08:29:29,441 INFO L290 TraceCheckUtils]: 23: Hoare triple {3867#true} ~cond := #in~cond; {3867#true} is VALID [2022-04-15 08:29:29,441 INFO L272 TraceCheckUtils]: 22: Hoare triple {4159#(<= main_~y~0 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3867#true} is VALID [2022-04-15 08:29:29,442 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3915#(not (= |assume_abort_if_not_#in~cond| 0))} {4178#(<= main_~y~0 1)} #70#return; {4159#(<= main_~y~0 main_~x~0)} is VALID [2022-04-15 08:29:29,442 INFO L290 TraceCheckUtils]: 20: Hoare triple {3915#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3915#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 08:29:29,442 INFO L290 TraceCheckUtils]: 19: Hoare triple {4188#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {3915#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 08:29:29,443 INFO L290 TraceCheckUtils]: 18: Hoare triple {3867#true} ~cond := #in~cond; {4188#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-15 08:29:29,443 INFO L272 TraceCheckUtils]: 17: Hoare triple {4178#(<= main_~y~0 1)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3867#true} is VALID [2022-04-15 08:29:29,443 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3915#(not (= |assume_abort_if_not_#in~cond| 0))} {3867#true} #68#return; {4178#(<= main_~y~0 1)} is VALID [2022-04-15 08:29:29,444 INFO L290 TraceCheckUtils]: 15: Hoare triple {3915#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3915#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 08:29:29,444 INFO L290 TraceCheckUtils]: 14: Hoare triple {4188#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {3915#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 08:29:29,444 INFO L290 TraceCheckUtils]: 13: Hoare triple {3867#true} ~cond := #in~cond; {4188#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-15 08:29:29,444 INFO L272 TraceCheckUtils]: 12: Hoare triple {3867#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 1 then 1 else 0)); {3867#true} is VALID [2022-04-15 08:29:29,444 INFO L290 TraceCheckUtils]: 11: Hoare triple {3867#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3867#true} is VALID [2022-04-15 08:29:29,444 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3867#true} {3867#true} #66#return; {3867#true} is VALID [2022-04-15 08:29:29,445 INFO L290 TraceCheckUtils]: 9: Hoare triple {3867#true} assume true; {3867#true} is VALID [2022-04-15 08:29:29,445 INFO L290 TraceCheckUtils]: 8: Hoare triple {3867#true} assume !(0 == ~cond); {3867#true} is VALID [2022-04-15 08:29:29,445 INFO L290 TraceCheckUtils]: 7: Hoare triple {3867#true} ~cond := #in~cond; {3867#true} is VALID [2022-04-15 08:29:29,445 INFO L272 TraceCheckUtils]: 6: Hoare triple {3867#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 1 then 1 else 0)); {3867#true} is VALID [2022-04-15 08:29:29,445 INFO L290 TraceCheckUtils]: 5: Hoare triple {3867#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {3867#true} is VALID [2022-04-15 08:29:29,445 INFO L272 TraceCheckUtils]: 4: Hoare triple {3867#true} call #t~ret6 := main(); {3867#true} is VALID [2022-04-15 08:29:29,445 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3867#true} {3867#true} #88#return; {3867#true} is VALID [2022-04-15 08:29:29,445 INFO L290 TraceCheckUtils]: 2: Hoare triple {3867#true} assume true; {3867#true} is VALID [2022-04-15 08:29:29,445 INFO L290 TraceCheckUtils]: 1: Hoare triple {3867#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(10, 2);call #Ultimate.allocInit(12, 3); {3867#true} is VALID [2022-04-15 08:29:29,445 INFO L272 TraceCheckUtils]: 0: Hoare triple {3867#true} call ULTIMATE.init(); {3867#true} is VALID [2022-04-15 08:29:29,445 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-04-15 08:29:29,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:29:29,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542121285] [2022-04-15 08:29:29,446 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:29:29,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509547405] [2022-04-15 08:29:29,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1509547405] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 08:29:29,446 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 08:29:29,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2022-04-15 08:29:29,446 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:29:29,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1877627838] [2022-04-15 08:29:29,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1877627838] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:29:29,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:29:29,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 08:29:29,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506311803] [2022-04-15 08:29:29,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:29:29,447 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 61 [2022-04-15 08:29:29,447 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:29:29,447 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-15 08:29:29,474 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:29:29,474 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 08:29:29,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:29:29,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 08:29:29,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-04-15 08:29:29,475 INFO L87 Difference]: Start difference. First operand 70 states and 88 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-15 08:29:29,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:29:29,711 INFO L93 Difference]: Finished difference Result 78 states and 94 transitions. [2022-04-15 08:29:29,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 08:29:29,711 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 61 [2022-04-15 08:29:29,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:29:29,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-15 08:29:29,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 54 transitions. [2022-04-15 08:29:29,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-15 08:29:29,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 54 transitions. [2022-04-15 08:29:29,713 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 54 transitions. [2022-04-15 08:29:29,758 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:29:29,758 INFO L225 Difference]: With dead ends: 78 [2022-04-15 08:29:29,758 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 08:29:29,759 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2022-04-15 08:29:29,759 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 9 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 08:29:29,760 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 82 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 08:29:29,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 08:29:29,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 08:29:29,760 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:29:29,760 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-15 08:29:29,760 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-15 08:29:29,760 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-15 08:29:29,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:29:29,760 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 08:29:29,760 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 08:29:29,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:29:29,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:29:29,761 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-15 08:29:29,761 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-15 08:29:29,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:29:29,761 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 08:29:29,761 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 08:29:29,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:29:29,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:29:29,761 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:29:29,761 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:29:29,761 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-15 08:29:29,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 08:29:29,761 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 61 [2022-04-15 08:29:29,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:29:29,761 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 08:29:29,762 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-15 08:29:29,762 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-15 08:29:29,762 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-15 08:29:29,762 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 08:29:29,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:29:29,764 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 08:29:29,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-15 08:29:29,975 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:29:29,977 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 08:29:30,492 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2022-04-15 08:29:30,492 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 4) no Hoare annotation was computed. [2022-04-15 08:29:30,492 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 4) no Hoare annotation was computed. [2022-04-15 08:29:30,492 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 7 9) the Hoare annotation is: true [2022-04-15 08:29:30,492 INFO L878 garLoopResultBuilder]: At program point L8(line 8) the Hoare annotation is: (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|) [2022-04-15 08:29:30,493 INFO L878 garLoopResultBuilder]: At program point L8-2(lines 7 9) 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-15 08:29:30,493 INFO L878 garLoopResultBuilder]: At program point assume_abort_if_notEXIT(lines 7 9) 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-15 08:29:30,493 INFO L878 garLoopResultBuilder]: At program point L35-2(lines 35 52) the Hoare annotation is: (and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~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)) [2022-04-15 08:29:30,493 INFO L878 garLoopResultBuilder]: At program point L25(line 25) the Hoare annotation is: (and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~x~0 1) (<= main_~y~0 1)) [2022-04-15 08:29:30,493 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 18 59) the Hoare annotation is: true [2022-04-15 08:29:30,493 INFO L878 garLoopResultBuilder]: At program point L56(line 56) the Hoare annotation is: (and (<= 1 main_~x~0) (= main_~s~0 1) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (<= main_~y~0 1)) [2022-04-15 08:29:30,493 INFO L878 garLoopResultBuilder]: At program point L54(line 54) the Hoare annotation is: (and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~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)) [2022-04-15 08:29:30,493 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 18 59) the Hoare annotation is: true [2022-04-15 08:29:30,493 INFO L878 garLoopResultBuilder]: At program point L38(lines 35 52) the Hoare annotation is: (and (= main_~s~0 1) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~x~0 1) (<= 1 main_~a~0) (= 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)) [2022-04-15 08:29:30,493 INFO L878 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (and (= main_~s~0 1) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~x~0 1) (<= 1 main_~a~0) (= 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)) [2022-04-15 08:29:30,493 INFO L878 garLoopResultBuilder]: At program point L36-1(line 36) the Hoare annotation is: (and (= main_~s~0 1) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~x~0 1) (<= 1 main_~a~0) (= 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)) [2022-04-15 08:29:30,494 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 18 59) the Hoare annotation is: true [2022-04-15 08:29:30,494 INFO L878 garLoopResultBuilder]: At program point L26(line 26) the Hoare annotation is: (and (<= 1 main_~x~0) (<= main_~x~0 1) (<= 1 main_~y~0) (<= main_~y~0 1)) [2022-04-15 08:29:30,494 INFO L885 garLoopResultBuilder]: At program point L57(line 57) the Hoare annotation is: true [2022-04-15 08:29:30,494 INFO L878 garLoopResultBuilder]: At program point L24(line 24) the Hoare annotation is: (and (<= 0 main_~x~0) (<= main_~x~0 1)) [2022-04-15 08:29:30,494 INFO L878 garLoopResultBuilder]: At program point L24-1(line 24) the Hoare annotation is: (and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 1) (<= main_~y~0 1)) [2022-04-15 08:29:30,494 INFO L878 garLoopResultBuilder]: At program point L55(line 55) the Hoare annotation is: (and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= 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)) [2022-04-15 08:29:30,494 INFO L885 garLoopResultBuilder]: At program point L22(line 22) the Hoare annotation is: true [2022-04-15 08:29:30,494 INFO L878 garLoopResultBuilder]: At program point L22-1(line 22) the Hoare annotation is: (and (<= 0 main_~x~0) (<= main_~x~0 1)) [2022-04-15 08:29:30,494 INFO L878 garLoopResultBuilder]: At program point L43(lines 43 51) the Hoare annotation is: false [2022-04-15 08:29:30,494 INFO L878 garLoopResultBuilder]: At program point L43-2(lines 35 52) the Hoare annotation is: (and (= main_~s~0 1) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~x~0 1) (<= 1 main_~a~0) (= 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)) [2022-04-15 08:29:30,494 INFO L878 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (and (= main_~s~0 1) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~x~0 1) (<= 1 main_~a~0) (= 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)) [2022-04-15 08:29:30,494 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-15 08:29:30,495 INFO L878 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-15 08:29:30,495 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-15 08:29:30,501 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-15 08:29:30,501 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 08:29:30,501 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 08:29:30,501 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-15 08:29:30,501 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 10 16) the Hoare annotation is: true [2022-04-15 08:29:30,501 INFO L878 garLoopResultBuilder]: At program point L12(lines 12 13) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-15 08:29:30,501 INFO L878 garLoopResultBuilder]: At program point L11(lines 11 14) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-15 08:29:30,501 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 10 16) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-15 08:29:30,501 INFO L878 garLoopResultBuilder]: At program point L11-2(lines 10 16) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-15 08:29:30,501 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 13) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-15 08:29:30,504 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2, 2] [2022-04-15 08:29:30,505 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 08:29:30,520 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 08:29:30,523 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-15 08:29:30,539 INFO L163 areAnnotationChecker]: CFG has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 08:29:30,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 08:29:30 BoogieIcfgContainer [2022-04-15 08:29:30,547 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 08:29:30,548 INFO L158 Benchmark]: Toolchain (without parser) took 70264.74ms. Allocated memory was 187.7MB in the beginning and 242.2MB in the end (delta: 54.5MB). Free memory was 138.2MB in the beginning and 163.9MB in the end (delta: -25.7MB). Peak memory consumption was 112.6MB. Max. memory is 8.0GB. [2022-04-15 08:29:30,548 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 187.7MB. Free memory was 154.4MB in the beginning and 154.3MB in the end (delta: 74.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 08:29:30,548 INFO L158 Benchmark]: CACSL2BoogieTranslator took 221.16ms. Allocated memory is still 187.7MB. Free memory was 138.0MB in the beginning and 162.4MB in the end (delta: -24.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 08:29:30,548 INFO L158 Benchmark]: Boogie Preprocessor took 36.14ms. Allocated memory is still 187.7MB. Free memory was 162.4MB in the beginning and 160.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 08:29:30,548 INFO L158 Benchmark]: RCFGBuilder took 300.23ms. Allocated memory is still 187.7MB. Free memory was 160.9MB in the beginning and 149.3MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 08:29:30,548 INFO L158 Benchmark]: TraceAbstraction took 69702.97ms. Allocated memory was 187.7MB in the beginning and 242.2MB in the end (delta: 54.5MB). Free memory was 148.8MB in the beginning and 163.9MB in the end (delta: -15.1MB). Peak memory consumption was 123.8MB. Max. memory is 8.0GB. [2022-04-15 08:29:30,549 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 187.7MB. Free memory was 154.4MB in the beginning and 154.3MB in the end (delta: 74.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 221.16ms. Allocated memory is still 187.7MB. Free memory was 138.0MB in the beginning and 162.4MB in the end (delta: -24.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.14ms. Allocated memory is still 187.7MB. Free memory was 162.4MB in the beginning and 160.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 300.23ms. Allocated memory is still 187.7MB. Free memory was 160.9MB in the beginning and 149.3MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 69702.97ms. Allocated memory was 187.7MB in the beginning and 242.2MB in the end (delta: 54.5MB). Free memory was 148.8MB in the beginning and 163.9MB in the end (delta: -15.1MB). Peak memory consumption was 123.8MB. 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: 13]: 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, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 69.6s, OverallIterations: 8, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 168 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 114 mSDsluCounter, 1039 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 752 mSDsCounter, 66 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 655 IncrementalHoareTripleChecker+Invalid, 721 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 66 mSolverCounterUnsat, 287 mSDtfsCounter, 655 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 523 GetRequests, 456 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74occurred in iteration=5, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 8 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 37 LocationsWithAnnotation, 307 PreInvPairs, 361 NumberOfFragments, 437 HoareAnnotationTreeSize, 307 FomulaSimplifications, 67 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 37 FomulaSimplificationsInter, 268 FormulaSimplificationTreeSizeReductionInter, 0.3s 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: 35]: Loop Invariant Derived loop invariant: ((((((((s == 1 && a == y * r + p * x) && x <= 1) && 1 <= a) && b == y) && q == 0) && 1 <= y) && a == x) && y <= 1) && p == 1 - ProcedureContractResult [Line: 7]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not: !(\old(cond) == 0) && cond == \old(cond) - ProcedureContractResult [Line: 18]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 10]: 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-15 08:29:30,572 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...