/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/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/cohendiv-ll_valuebound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 14:04:08,759 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 14:04:08,761 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 14:04:08,804 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 14:04:08,804 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 14:04:08,805 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 14:04:08,808 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 14:04:08,810 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 14:04:08,812 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 14:04:08,816 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 14:04:08,816 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 14:04:08,817 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 14:04:08,818 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 14:04:08,819 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 14:04:08,820 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 14:04:08,822 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 14:04:08,823 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 14:04:08,823 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 14:04:08,825 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 14:04:08,829 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 14:04:08,831 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 14:04:08,832 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 14:04:08,832 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 14:04:08,833 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 14:04:08,834 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 14:04:08,840 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 14:04:08,840 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 14:04:08,840 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 14:04:08,841 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 14:04:08,841 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 14:04:08,842 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 14:04:08,842 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 14:04:08,844 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 14:04:08,844 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 14:04:08,845 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 14:04:08,845 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 14:04:08,845 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 14:04:08,846 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 14:04:08,846 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 14:04:08,846 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 14:04:08,847 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 14:04:08,848 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 14:04:08,849 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 14:04:08,858 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 14:04:08,858 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 14:04:08,859 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 14:04:08,860 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 14:04:08,860 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 14:04:08,860 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 14:04:08,860 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 14:04:08,860 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 14:04:08,860 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 14:04:08,861 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 14:04:08,861 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 14:04:08,861 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 14:04:08,861 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 14:04:08,861 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 14:04:08,861 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 14:04:08,861 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 14:04:08,862 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 14:04:08,862 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 14:04:08,862 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 14:04:08,862 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 14:04:08,862 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 14:04:08,862 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 14:04:08,862 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 14:04:09,043 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 14:04:09,060 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 14:04:09,062 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 14:04:09,063 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 14:04:09,063 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 14:04:09,064 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/cohendiv-ll_valuebound1.c [2022-04-15 14:04:09,101 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/303a98243/19dfbb1139d74d7bb50fcb5e99beefde/FLAG7e53f7390 [2022-04-15 14:04:09,425 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 14:04:09,426 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohendiv-ll_valuebound1.c [2022-04-15 14:04:09,430 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/303a98243/19dfbb1139d74d7bb50fcb5e99beefde/FLAG7e53f7390 [2022-04-15 14:04:09,874 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/303a98243/19dfbb1139d74d7bb50fcb5e99beefde [2022-04-15 14:04:09,876 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 14:04:09,877 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 14:04:09,880 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 14:04:09,880 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 14:04:09,883 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 14:04:09,883 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 02:04:09" (1/1) ... [2022-04-15 14:04:09,884 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bb672c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:04:09, skipping insertion in model container [2022-04-15 14:04:09,884 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 02:04:09" (1/1) ... [2022-04-15 14:04:09,888 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 14:04:09,900 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 14:04:10,041 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/cohendiv-ll_valuebound1.c[576,589] [2022-04-15 14:04:10,054 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 14:04:10,061 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 14:04:10,069 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/cohendiv-ll_valuebound1.c[576,589] [2022-04-15 14:04:10,076 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 14:04:10,084 INFO L208 MainTranslator]: Completed translation [2022-04-15 14:04:10,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:04:10 WrapperNode [2022-04-15 14:04:10,096 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 14:04:10,097 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 14:04:10,097 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 14:04:10,097 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 14:04:10,103 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:04:10" (1/1) ... [2022-04-15 14:04:10,103 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:04:10" (1/1) ... [2022-04-15 14:04:10,107 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:04:10" (1/1) ... [2022-04-15 14:04:10,107 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:04:10" (1/1) ... [2022-04-15 14:04:10,110 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:04:10" (1/1) ... [2022-04-15 14:04:10,113 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:04:10" (1/1) ... [2022-04-15 14:04:10,113 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:04:10" (1/1) ... [2022-04-15 14:04:10,115 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 14:04:10,115 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 14:04:10,115 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 14:04:10,115 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 14:04:10,116 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:04:10" (1/1) ... [2022-04-15 14:04:10,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 14:04:10,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:04:10,135 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 14:04:10,154 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 14:04:10,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 14:04:10,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 14:04:10,171 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 14:04:10,171 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 14:04:10,171 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 14:04:10,172 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 14:04:10,172 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 14:04:10,172 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 14:04:10,172 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 14:04:10,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 14:04:10,172 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 14:04:10,172 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 14:04:10,172 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 14:04:10,172 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 14:04:10,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 14:04:10,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 14:04:10,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 14:04:10,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 14:04:10,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 14:04:10,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 14:04:10,221 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 14:04:10,222 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 14:04:10,399 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 14:04:10,405 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 14:04:10,405 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 14:04:10,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 02:04:10 BoogieIcfgContainer [2022-04-15 14:04:10,406 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 14:04:10,407 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 14:04:10,407 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 14:04:10,412 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 14:04:10,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 02:04:09" (1/3) ... [2022-04-15 14:04:10,413 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@750e3d73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 02:04:10, skipping insertion in model container [2022-04-15 14:04:10,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:04:10" (2/3) ... [2022-04-15 14:04:10,413 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@750e3d73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 02:04:10, skipping insertion in model container [2022-04-15 14:04:10,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 02:04:10" (3/3) ... [2022-04-15 14:04:10,414 INFO L111 eAbstractionObserver]: Analyzing ICFG cohendiv-ll_valuebound1.c [2022-04-15 14:04:10,417 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 14:04:10,417 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 14:04:10,441 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 14:04:10,445 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 14:04:10,446 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 14:04:10,457 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 22 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 14:04:10,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 14:04:10,462 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:04:10,462 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 14:04:10,462 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:04:10,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:04:10,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1768835633, now seen corresponding path program 1 times [2022-04-15 14:04:10,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:04:10,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [348750695] [2022-04-15 14:04:10,477 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:04:10,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1768835633, now seen corresponding path program 2 times [2022-04-15 14:04:10,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:04:10,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381047416] [2022-04-15 14:04:10,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:04:10,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:04:10,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:04:10,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 14:04:10,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:04:10,643 INFO L290 TraceCheckUtils]: 0: Hoare triple {59#(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(14, 2);call #Ultimate.allocInit(12, 3); {42#true} is VALID [2022-04-15 14:04:10,644 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-15 14:04:10,644 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42#true} {42#true} #98#return; {42#true} is VALID [2022-04-15 14:04:10,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 14:04:10,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:04:10,656 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-15 14:04:10,656 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-15 14:04:10,656 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-15 14:04:10,657 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {42#true} #78#return; {43#false} is VALID [2022-04-15 14:04:10,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 14:04:10,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:04:10,664 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-15 14:04:10,665 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-15 14:04:10,665 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-15 14:04:10,665 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {43#false} #80#return; {43#false} is VALID [2022-04-15 14:04:10,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-15 14:04:10,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:04:10,675 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-15 14:04:10,676 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-15 14:04:10,676 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-15 14:04:10,676 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {43#false} #82#return; {43#false} is VALID [2022-04-15 14:04:10,677 INFO L272 TraceCheckUtils]: 0: Hoare triple {42#true} call ULTIMATE.init(); {59#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 14:04:10,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {59#(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(14, 2);call #Ultimate.allocInit(12, 3); {42#true} is VALID [2022-04-15 14:04:10,677 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-15 14:04:10,677 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} #98#return; {42#true} is VALID [2022-04-15 14:04:10,677 INFO L272 TraceCheckUtils]: 4: Hoare triple {42#true} call #t~ret6 := main(); {42#true} is VALID [2022-04-15 14:04:10,678 INFO L290 TraceCheckUtils]: 5: Hoare triple {42#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {42#true} is VALID [2022-04-15 14:04:10,678 INFO L272 TraceCheckUtils]: 6: Hoare triple {42#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 1 then 1 else 0)); {42#true} is VALID [2022-04-15 14:04:10,679 INFO L290 TraceCheckUtils]: 7: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-15 14:04:10,679 INFO L290 TraceCheckUtils]: 8: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-15 14:04:10,679 INFO L290 TraceCheckUtils]: 9: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-15 14:04:10,680 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {43#false} {42#true} #78#return; {43#false} is VALID [2022-04-15 14:04:10,680 INFO L290 TraceCheckUtils]: 11: Hoare triple {43#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {43#false} is VALID [2022-04-15 14:04:10,680 INFO L272 TraceCheckUtils]: 12: Hoare triple {43#false} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 1 then 1 else 0)); {42#true} is VALID [2022-04-15 14:04:10,680 INFO L290 TraceCheckUtils]: 13: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-15 14:04:10,681 INFO L290 TraceCheckUtils]: 14: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-15 14:04:10,681 INFO L290 TraceCheckUtils]: 15: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-15 14:04:10,681 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {43#false} {43#false} #80#return; {43#false} is VALID [2022-04-15 14:04:10,681 INFO L272 TraceCheckUtils]: 17: Hoare triple {43#false} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {42#true} is VALID [2022-04-15 14:04:10,682 INFO L290 TraceCheckUtils]: 18: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-15 14:04:10,682 INFO L290 TraceCheckUtils]: 19: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-15 14:04:10,682 INFO L290 TraceCheckUtils]: 20: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-15 14:04:10,683 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {43#false} {43#false} #82#return; {43#false} is VALID [2022-04-15 14:04:10,683 INFO L290 TraceCheckUtils]: 22: Hoare triple {43#false} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {43#false} is VALID [2022-04-15 14:04:10,684 INFO L290 TraceCheckUtils]: 23: Hoare triple {43#false} assume false; {43#false} is VALID [2022-04-15 14:04:10,684 INFO L272 TraceCheckUtils]: 24: Hoare triple {43#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {43#false} is VALID [2022-04-15 14:04:10,684 INFO L290 TraceCheckUtils]: 25: Hoare triple {43#false} ~cond := #in~cond; {43#false} is VALID [2022-04-15 14:04:10,684 INFO L290 TraceCheckUtils]: 26: Hoare triple {43#false} assume 0 == ~cond; {43#false} is VALID [2022-04-15 14:04:10,684 INFO L290 TraceCheckUtils]: 27: Hoare triple {43#false} assume !false; {43#false} is VALID [2022-04-15 14:04:10,685 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 14:04:10,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:04:10,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381047416] [2022-04-15 14:04:10,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381047416] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:04:10,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:04:10,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 14:04:10,690 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:04:10,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [348750695] [2022-04-15 14:04:10,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [348750695] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:04:10,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:04:10,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 14:04:10,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180760718] [2022-04-15 14:04:10,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:04:10,695 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-15 14:04:10,696 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:04:10,698 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 14:04:10,725 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:04:10,725 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 14:04:10,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:04:10,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 14:04:10,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 14:04:10,745 INFO L87 Difference]: Start difference. First operand has 39 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 22 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 14:04:10,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:04:10,914 INFO L93 Difference]: Finished difference Result 71 states and 110 transitions. [2022-04-15 14:04:10,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 14:04:10,914 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-15 14:04:10,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:04:10,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 14:04:10,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2022-04-15 14:04:10,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 14:04:10,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2022-04-15 14:04:10,933 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 110 transitions. [2022-04-15 14:04:11,029 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:04:11,037 INFO L225 Difference]: With dead ends: 71 [2022-04-15 14:04:11,037 INFO L226 Difference]: Without dead ends: 34 [2022-04-15 14:04:11,039 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 14:04:11,041 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 21 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 14:04:11,042 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 41 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 14:04:11,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-15 14:04:11,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-15 14:04:11,060 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:04:11,061 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 14:04:11,061 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 14:04:11,062 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 14:04:11,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:04:11,064 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-15 14:04:11,064 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-15 14:04:11,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:04:11,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:04:11,065 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 34 states. [2022-04-15 14:04:11,066 INFO L87 Difference]: Start difference. First operand has 34 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 34 states. [2022-04-15 14:04:11,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:04:11,068 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-15 14:04:11,068 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-15 14:04:11,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:04:11,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:04:11,069 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:04:11,069 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:04:11,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 14:04:11,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2022-04-15 14:04:11,071 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 28 [2022-04-15 14:04:11,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:04:11,071 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-04-15 14:04:11,072 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 14:04:11,072 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 43 transitions. [2022-04-15 14:04:11,126 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:04:11,126 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-15 14:04:11,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 14:04:11,127 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:04:11,127 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 14:04:11,127 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 14:04:11,127 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:04:11,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:04:11,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1378913883, now seen corresponding path program 1 times [2022-04-15 14:04:11,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:04:11,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [714880087] [2022-04-15 14:04:11,129 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:04:11,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1378913883, now seen corresponding path program 2 times [2022-04-15 14:04:11,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:04:11,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150838934] [2022-04-15 14:04:11,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:04:11,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:04:11,144 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:04:11,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1172403835] [2022-04-15 14:04:11,145 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:04:11,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:04:11,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:04:11,187 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 14:04:11,204 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 14:04:11,236 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 14:04:11,236 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:04:11,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 14:04:11,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:04:11,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:04:11,431 INFO L272 TraceCheckUtils]: 0: Hoare triple {340#true} call ULTIMATE.init(); {340#true} is VALID [2022-04-15 14:04:11,431 INFO L290 TraceCheckUtils]: 1: Hoare triple {340#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(14, 2);call #Ultimate.allocInit(12, 3); {340#true} is VALID [2022-04-15 14:04:11,431 INFO L290 TraceCheckUtils]: 2: Hoare triple {340#true} assume true; {340#true} is VALID [2022-04-15 14:04:11,431 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {340#true} {340#true} #98#return; {340#true} is VALID [2022-04-15 14:04:11,431 INFO L272 TraceCheckUtils]: 4: Hoare triple {340#true} call #t~ret6 := main(); {340#true} is VALID [2022-04-15 14:04:11,431 INFO L290 TraceCheckUtils]: 5: Hoare triple {340#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {340#true} is VALID [2022-04-15 14:04:11,432 INFO L272 TraceCheckUtils]: 6: Hoare triple {340#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 1 then 1 else 0)); {340#true} is VALID [2022-04-15 14:04:11,432 INFO L290 TraceCheckUtils]: 7: Hoare triple {340#true} ~cond := #in~cond; {340#true} is VALID [2022-04-15 14:04:11,432 INFO L290 TraceCheckUtils]: 8: Hoare triple {340#true} assume !(0 == ~cond); {340#true} is VALID [2022-04-15 14:04:11,432 INFO L290 TraceCheckUtils]: 9: Hoare triple {340#true} assume true; {340#true} is VALID [2022-04-15 14:04:11,432 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {340#true} {340#true} #78#return; {340#true} is VALID [2022-04-15 14:04:11,432 INFO L290 TraceCheckUtils]: 11: Hoare triple {340#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {340#true} is VALID [2022-04-15 14:04:11,432 INFO L272 TraceCheckUtils]: 12: Hoare triple {340#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 1 then 1 else 0)); {340#true} is VALID [2022-04-15 14:04:11,433 INFO L290 TraceCheckUtils]: 13: Hoare triple {340#true} ~cond := #in~cond; {340#true} is VALID [2022-04-15 14:04:11,433 INFO L290 TraceCheckUtils]: 14: Hoare triple {340#true} assume !(0 == ~cond); {340#true} is VALID [2022-04-15 14:04:11,433 INFO L290 TraceCheckUtils]: 15: Hoare triple {340#true} assume true; {340#true} is VALID [2022-04-15 14:04:11,433 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {340#true} {340#true} #80#return; {340#true} is VALID [2022-04-15 14:04:11,433 INFO L272 TraceCheckUtils]: 17: Hoare triple {340#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {340#true} is VALID [2022-04-15 14:04:11,433 INFO L290 TraceCheckUtils]: 18: Hoare triple {340#true} ~cond := #in~cond; {340#true} is VALID [2022-04-15 14:04:11,433 INFO L290 TraceCheckUtils]: 19: Hoare triple {340#true} assume !(0 == ~cond); {340#true} is VALID [2022-04-15 14:04:11,433 INFO L290 TraceCheckUtils]: 20: Hoare triple {340#true} assume true; {340#true} is VALID [2022-04-15 14:04:11,434 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {340#true} {340#true} #82#return; {340#true} is VALID [2022-04-15 14:04:11,434 INFO L290 TraceCheckUtils]: 22: Hoare triple {340#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {411#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 14:04:11,435 INFO L290 TraceCheckUtils]: 23: Hoare triple {411#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false; {411#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 14:04:11,435 INFO L272 TraceCheckUtils]: 24: Hoare triple {411#(and (= main_~a~0 0) (= main_~b~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {418#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 14:04:11,436 INFO L290 TraceCheckUtils]: 25: Hoare triple {418#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {422#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 14:04:11,436 INFO L290 TraceCheckUtils]: 26: Hoare triple {422#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {341#false} is VALID [2022-04-15 14:04:11,436 INFO L290 TraceCheckUtils]: 27: Hoare triple {341#false} assume !false; {341#false} is VALID [2022-04-15 14:04:11,436 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 14:04:11,436 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 14:04:11,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:04:11,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150838934] [2022-04-15 14:04:11,437 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:04:11,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172403835] [2022-04-15 14:04:11,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1172403835] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:04:11,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:04:11,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 14:04:11,438 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:04:11,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [714880087] [2022-04-15 14:04:11,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [714880087] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:04:11,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:04:11,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 14:04:11,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611302315] [2022-04-15 14:04:11,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:04:11,439 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2022-04-15 14:04:11,439 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:04:11,439 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 14:04:11,453 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:04:11,453 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 14:04:11,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:04:11,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 14:04:11,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 14:04:11,454 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 14:04:11,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:04:11,592 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-04-15 14:04:11,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 14:04:11,592 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2022-04-15 14:04:11,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:04:11,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 14:04:11,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-04-15 14:04:11,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 14:04:11,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-04-15 14:04:11,595 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 56 transitions. [2022-04-15 14:04:11,640 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:04:11,641 INFO L225 Difference]: With dead ends: 45 [2022-04-15 14:04:11,641 INFO L226 Difference]: Without dead ends: 43 [2022-04-15 14:04:11,642 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 14:04:11,643 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 6 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 14:04:11,643 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 149 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 14:04:11,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-15 14:04:11,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2022-04-15 14:04:11,653 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:04:11,653 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 40 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 24 states have internal predecessors, (25), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 14:04:11,653 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 40 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 24 states have internal predecessors, (25), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 14:04:11,653 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 40 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 24 states have internal predecessors, (25), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 14:04:11,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:04:11,655 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2022-04-15 14:04:11,655 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2022-04-15 14:04:11,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:04:11,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:04:11,656 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 24 states have internal predecessors, (25), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 43 states. [2022-04-15 14:04:11,657 INFO L87 Difference]: Start difference. First operand has 40 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 24 states have internal predecessors, (25), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 43 states. [2022-04-15 14:04:11,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:04:11,658 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2022-04-15 14:04:11,659 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2022-04-15 14:04:11,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:04:11,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:04:11,659 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:04:11,659 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:04:11,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 24 states have internal predecessors, (25), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 14:04:11,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2022-04-15 14:04:11,661 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 49 transitions. Word has length 28 [2022-04-15 14:04:11,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:04:11,661 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 49 transitions. [2022-04-15 14:04:11,661 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 14:04:11,661 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 49 transitions. [2022-04-15 14:04:11,702 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:04:11,702 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2022-04-15 14:04:11,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 14:04:11,702 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:04:11,702 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 14:04:11,731 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 14:04:11,918 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 14:04:11,919 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:04:11,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:04:11,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1928335320, now seen corresponding path program 1 times [2022-04-15 14:04:11,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:04:11,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1612931276] [2022-04-15 14:04:11,920 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:04:11,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1928335320, now seen corresponding path program 2 times [2022-04-15 14:04:11,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:04:11,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655994684] [2022-04-15 14:04:11,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:04:11,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:04:11,935 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:04:11,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [694657410] [2022-04-15 14:04:11,936 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:04:11,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:04:11,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:04:11,937 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 14:04:11,947 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 14:04:11,992 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 14:04:11,992 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:04:11,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-15 14:04:12,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:04:12,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:04:12,263 INFO L272 TraceCheckUtils]: 0: Hoare triple {686#true} call ULTIMATE.init(); {686#true} is VALID [2022-04-15 14:04:12,264 INFO L290 TraceCheckUtils]: 1: Hoare triple {686#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(14, 2);call #Ultimate.allocInit(12, 3); {686#true} is VALID [2022-04-15 14:04:12,264 INFO L290 TraceCheckUtils]: 2: Hoare triple {686#true} assume true; {686#true} is VALID [2022-04-15 14:04:12,264 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {686#true} {686#true} #98#return; {686#true} is VALID [2022-04-15 14:04:12,264 INFO L272 TraceCheckUtils]: 4: Hoare triple {686#true} call #t~ret6 := main(); {686#true} is VALID [2022-04-15 14:04:12,264 INFO L290 TraceCheckUtils]: 5: Hoare triple {686#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {686#true} is VALID [2022-04-15 14:04:12,265 INFO L272 TraceCheckUtils]: 6: Hoare triple {686#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 1 then 1 else 0)); {686#true} is VALID [2022-04-15 14:04:12,265 INFO L290 TraceCheckUtils]: 7: Hoare triple {686#true} ~cond := #in~cond; {686#true} is VALID [2022-04-15 14:04:12,265 INFO L290 TraceCheckUtils]: 8: Hoare triple {686#true} assume !(0 == ~cond); {686#true} is VALID [2022-04-15 14:04:12,265 INFO L290 TraceCheckUtils]: 9: Hoare triple {686#true} assume true; {686#true} is VALID [2022-04-15 14:04:12,265 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {686#true} {686#true} #78#return; {686#true} is VALID [2022-04-15 14:04:12,265 INFO L290 TraceCheckUtils]: 11: Hoare triple {686#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {686#true} is VALID [2022-04-15 14:04:12,265 INFO L272 TraceCheckUtils]: 12: Hoare triple {686#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 1 then 1 else 0)); {686#true} is VALID [2022-04-15 14:04:12,267 INFO L290 TraceCheckUtils]: 13: Hoare triple {686#true} ~cond := #in~cond; {730#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 14:04:12,267 INFO L290 TraceCheckUtils]: 14: Hoare triple {730#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {734#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 14:04:12,268 INFO L290 TraceCheckUtils]: 15: Hoare triple {734#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {734#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 14:04:12,268 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {734#(not (= |assume_abort_if_not_#in~cond| 0))} {686#true} #80#return; {741#(and (<= 0 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-15 14:04:12,269 INFO L272 TraceCheckUtils]: 17: Hoare triple {741#(and (<= 0 main_~y~0) (<= main_~y~0 1))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {686#true} is VALID [2022-04-15 14:04:12,269 INFO L290 TraceCheckUtils]: 18: Hoare triple {686#true} ~cond := #in~cond; {730#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 14:04:12,270 INFO L290 TraceCheckUtils]: 19: Hoare triple {730#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {734#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 14:04:12,270 INFO L290 TraceCheckUtils]: 20: Hoare triple {734#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {734#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 14:04:12,271 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {734#(not (= |assume_abort_if_not_#in~cond| 0))} {741#(and (<= 0 main_~y~0) (<= main_~y~0 1))} #82#return; {757#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-15 14:04:12,271 INFO L290 TraceCheckUtils]: 22: Hoare triple {757#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {761#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-15 14:04:12,272 INFO L290 TraceCheckUtils]: 23: Hoare triple {761#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0) (<= main_~y~0 1))} assume !false; {761#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-15 14:04:12,272 INFO L272 TraceCheckUtils]: 24: Hoare triple {761#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0) (<= main_~y~0 1))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {686#true} is VALID [2022-04-15 14:04:12,272 INFO L290 TraceCheckUtils]: 25: Hoare triple {686#true} ~cond := #in~cond; {686#true} is VALID [2022-04-15 14:04:12,272 INFO L290 TraceCheckUtils]: 26: Hoare triple {686#true} assume !(0 == ~cond); {686#true} is VALID [2022-04-15 14:04:12,272 INFO L290 TraceCheckUtils]: 27: Hoare triple {686#true} assume true; {686#true} is VALID [2022-04-15 14:04:12,273 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {686#true} {761#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0) (<= main_~y~0 1))} #84#return; {761#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-15 14:04:12,274 INFO L272 TraceCheckUtils]: 29: Hoare triple {761#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0) (<= main_~y~0 1))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {783#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 14:04:12,274 INFO L290 TraceCheckUtils]: 30: Hoare triple {783#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {787#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 14:04:12,276 INFO L290 TraceCheckUtils]: 31: Hoare triple {787#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {687#false} is VALID [2022-04-15 14:04:12,276 INFO L290 TraceCheckUtils]: 32: Hoare triple {687#false} assume !false; {687#false} is VALID [2022-04-15 14:04:12,277 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 14:04:12,277 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 14:04:12,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:04:12,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655994684] [2022-04-15 14:04:12,277 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:04:12,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694657410] [2022-04-15 14:04:12,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694657410] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:04:12,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:04:12,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 14:04:12,278 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:04:12,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1612931276] [2022-04-15 14:04:12,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1612931276] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:04:12,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:04:12,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 14:04:12,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290073102] [2022-04-15 14:04:12,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:04:12,279 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 33 [2022-04-15 14:04:12,279 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:04:12,279 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 14:04:12,301 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:04:12,302 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 14:04:12,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:04:12,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 14:04:12,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-04-15 14:04:12,302 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 14:04:12,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:04:12,736 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2022-04-15 14:04:12,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 14:04:12,736 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 33 [2022-04-15 14:04:12,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:04:12,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 14:04:12,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 69 transitions. [2022-04-15 14:04:12,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 14:04:12,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 69 transitions. [2022-04-15 14:04:12,740 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 69 transitions. [2022-04-15 14:04:12,800 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:04:12,801 INFO L225 Difference]: With dead ends: 57 [2022-04-15 14:04:12,802 INFO L226 Difference]: Without dead ends: 54 [2022-04-15 14:04:12,802 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-15 14:04:12,803 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 29 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 14:04:12,803 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 180 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 14:04:12,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-15 14:04:12,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2022-04-15 14:04:12,844 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:04:12,844 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 53 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 18 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 14:04:12,845 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 53 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 18 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 14:04:12,845 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 53 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 18 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 14:04:12,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:04:12,847 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2022-04-15 14:04:12,847 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 68 transitions. [2022-04-15 14:04:12,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:04:12,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:04:12,848 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 18 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 54 states. [2022-04-15 14:04:12,848 INFO L87 Difference]: Start difference. First operand has 53 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 18 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 54 states. [2022-04-15 14:04:12,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:04:12,850 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2022-04-15 14:04:12,850 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 68 transitions. [2022-04-15 14:04:12,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:04:12,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:04:12,851 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:04:12,851 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:04:12,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 18 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 14:04:12,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 67 transitions. [2022-04-15 14:04:12,852 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 67 transitions. Word has length 33 [2022-04-15 14:04:12,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:04:12,853 INFO L478 AbstractCegarLoop]: Abstraction has 53 states and 67 transitions. [2022-04-15 14:04:12,853 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 14:04:12,853 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 67 transitions. [2022-04-15 14:04:12,916 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:04:12,917 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 67 transitions. [2022-04-15 14:04:12,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-15 14:04:12,917 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:04:12,917 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 14:04:12,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 14:04:13,150 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 14:04:13,151 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:04:13,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:04:13,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1297647068, now seen corresponding path program 1 times [2022-04-15 14:04:13,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:04:13,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1580370664] [2022-04-15 14:04:13,151 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:04:13,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1297647068, now seen corresponding path program 2 times [2022-04-15 14:04:13,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:04:13,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707400770] [2022-04-15 14:04:13,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:04:13,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:04:13,165 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:04:13,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [398520253] [2022-04-15 14:04:13,166 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:04:13,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:04:13,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:04:13,183 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 14:04:13,184 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 14:04:13,237 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 14:04:13,238 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:04:13,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-15 14:04:13,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:04:13,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:04:13,540 INFO L272 TraceCheckUtils]: 0: Hoare triple {1125#true} call ULTIMATE.init(); {1125#true} is VALID [2022-04-15 14:04:13,540 INFO L290 TraceCheckUtils]: 1: Hoare triple {1125#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(14, 2);call #Ultimate.allocInit(12, 3); {1125#true} is VALID [2022-04-15 14:04:13,540 INFO L290 TraceCheckUtils]: 2: Hoare triple {1125#true} assume true; {1125#true} is VALID [2022-04-15 14:04:13,540 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1125#true} {1125#true} #98#return; {1125#true} is VALID [2022-04-15 14:04:13,541 INFO L272 TraceCheckUtils]: 4: Hoare triple {1125#true} call #t~ret6 := main(); {1125#true} is VALID [2022-04-15 14:04:13,541 INFO L290 TraceCheckUtils]: 5: Hoare triple {1125#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {1125#true} is VALID [2022-04-15 14:04:13,541 INFO L272 TraceCheckUtils]: 6: Hoare triple {1125#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 1 then 1 else 0)); {1125#true} is VALID [2022-04-15 14:04:13,542 INFO L290 TraceCheckUtils]: 7: Hoare triple {1125#true} ~cond := #in~cond; {1151#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 14:04:13,542 INFO L290 TraceCheckUtils]: 8: Hoare triple {1151#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1155#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 14:04:13,542 INFO L290 TraceCheckUtils]: 9: Hoare triple {1155#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1155#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 14:04:13,543 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1155#(not (= |assume_abort_if_not_#in~cond| 0))} {1125#true} #78#return; {1162#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 14:04:13,543 INFO L290 TraceCheckUtils]: 11: Hoare triple {1162#(and (<= 0 main_~x~0) (<= main_~x~0 1))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1162#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 14:04:13,544 INFO L272 TraceCheckUtils]: 12: Hoare triple {1162#(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)); {1125#true} is VALID [2022-04-15 14:04:13,544 INFO L290 TraceCheckUtils]: 13: Hoare triple {1125#true} ~cond := #in~cond; {1125#true} is VALID [2022-04-15 14:04:13,544 INFO L290 TraceCheckUtils]: 14: Hoare triple {1125#true} assume !(0 == ~cond); {1125#true} is VALID [2022-04-15 14:04:13,544 INFO L290 TraceCheckUtils]: 15: Hoare triple {1125#true} assume true; {1125#true} is VALID [2022-04-15 14:04:13,545 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1125#true} {1162#(and (<= 0 main_~x~0) (<= main_~x~0 1))} #80#return; {1162#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 14:04:13,545 INFO L272 TraceCheckUtils]: 17: Hoare triple {1162#(and (<= 0 main_~x~0) (<= main_~x~0 1))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1125#true} is VALID [2022-04-15 14:04:13,547 INFO L290 TraceCheckUtils]: 18: Hoare triple {1125#true} ~cond := #in~cond; {1151#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 14:04:13,555 INFO L290 TraceCheckUtils]: 19: Hoare triple {1151#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1155#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 14:04:13,565 INFO L290 TraceCheckUtils]: 20: Hoare triple {1155#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1155#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 14:04:13,566 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1155#(not (= |assume_abort_if_not_#in~cond| 0))} {1162#(and (<= 0 main_~x~0) (<= main_~x~0 1))} #82#return; {1196#(and (<= 0 main_~x~0) (<= main_~x~0 1) (<= 1 main_~y~0))} is VALID [2022-04-15 14:04:13,567 INFO L290 TraceCheckUtils]: 22: Hoare triple {1196#(and (<= 0 main_~x~0) (<= main_~x~0 1) (<= 1 main_~y~0))} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {1200#(and (<= main_~r~0 1) (<= 1 main_~y~0))} is VALID [2022-04-15 14:04:13,567 INFO L290 TraceCheckUtils]: 23: Hoare triple {1200#(and (<= main_~r~0 1) (<= 1 main_~y~0))} assume !false; {1200#(and (<= main_~r~0 1) (<= 1 main_~y~0))} is VALID [2022-04-15 14:04:13,567 INFO L272 TraceCheckUtils]: 24: Hoare triple {1200#(and (<= main_~r~0 1) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {1125#true} is VALID [2022-04-15 14:04:13,567 INFO L290 TraceCheckUtils]: 25: Hoare triple {1125#true} ~cond := #in~cond; {1125#true} is VALID [2022-04-15 14:04:13,567 INFO L290 TraceCheckUtils]: 26: Hoare triple {1125#true} assume !(0 == ~cond); {1125#true} is VALID [2022-04-15 14:04:13,567 INFO L290 TraceCheckUtils]: 27: Hoare triple {1125#true} assume true; {1125#true} is VALID [2022-04-15 14:04:13,568 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1125#true} {1200#(and (<= main_~r~0 1) (<= 1 main_~y~0))} #84#return; {1200#(and (<= main_~r~0 1) (<= 1 main_~y~0))} is VALID [2022-04-15 14:04:13,568 INFO L272 TraceCheckUtils]: 29: Hoare triple {1200#(and (<= main_~r~0 1) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {1125#true} is VALID [2022-04-15 14:04:13,568 INFO L290 TraceCheckUtils]: 30: Hoare triple {1125#true} ~cond := #in~cond; {1125#true} is VALID [2022-04-15 14:04:13,568 INFO L290 TraceCheckUtils]: 31: Hoare triple {1125#true} assume !(0 == ~cond); {1125#true} is VALID [2022-04-15 14:04:13,568 INFO L290 TraceCheckUtils]: 32: Hoare triple {1125#true} assume true; {1125#true} is VALID [2022-04-15 14:04:13,569 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1125#true} {1200#(and (<= main_~r~0 1) (<= 1 main_~y~0))} #86#return; {1200#(and (<= main_~r~0 1) (<= 1 main_~y~0))} is VALID [2022-04-15 14:04:13,570 INFO L290 TraceCheckUtils]: 34: Hoare triple {1200#(and (<= main_~r~0 1) (<= 1 main_~y~0))} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {1237#(and (= main_~a~0 1) (= main_~b~0 main_~y~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-15 14:04:13,570 INFO L290 TraceCheckUtils]: 35: Hoare triple {1237#(and (= main_~a~0 1) (= main_~b~0 main_~y~0) (<= 1 main_~y~0) (<= main_~y~0 1))} assume !false; {1237#(and (= main_~a~0 1) (= main_~b~0 main_~y~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-15 14:04:13,571 INFO L272 TraceCheckUtils]: 36: Hoare triple {1237#(and (= main_~a~0 1) (= main_~b~0 main_~y~0) (<= 1 main_~y~0) (<= main_~y~0 1))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {1244#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 14:04:13,571 INFO L290 TraceCheckUtils]: 37: Hoare triple {1244#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1248#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 14:04:13,571 INFO L290 TraceCheckUtils]: 38: Hoare triple {1248#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1126#false} is VALID [2022-04-15 14:04:13,572 INFO L290 TraceCheckUtils]: 39: Hoare triple {1126#false} assume !false; {1126#false} is VALID [2022-04-15 14:04:13,572 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 14:04:13,573 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 14:04:13,798 INFO L290 TraceCheckUtils]: 39: Hoare triple {1126#false} assume !false; {1126#false} is VALID [2022-04-15 14:04:13,799 INFO L290 TraceCheckUtils]: 38: Hoare triple {1248#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1126#false} is VALID [2022-04-15 14:04:13,799 INFO L290 TraceCheckUtils]: 37: Hoare triple {1244#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1248#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 14:04:13,800 INFO L272 TraceCheckUtils]: 36: Hoare triple {1264#(= main_~b~0 (* main_~a~0 main_~y~0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {1244#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 14:04:13,800 INFO L290 TraceCheckUtils]: 35: Hoare triple {1264#(= main_~b~0 (* main_~a~0 main_~y~0))} assume !false; {1264#(= main_~b~0 (* main_~a~0 main_~y~0))} is VALID [2022-04-15 14:04:13,800 INFO L290 TraceCheckUtils]: 34: Hoare triple {1125#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {1264#(= main_~b~0 (* main_~a~0 main_~y~0))} is VALID [2022-04-15 14:04:13,800 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1125#true} {1125#true} #86#return; {1125#true} is VALID [2022-04-15 14:04:13,800 INFO L290 TraceCheckUtils]: 32: Hoare triple {1125#true} assume true; {1125#true} is VALID [2022-04-15 14:04:13,801 INFO L290 TraceCheckUtils]: 31: Hoare triple {1125#true} assume !(0 == ~cond); {1125#true} is VALID [2022-04-15 14:04:13,801 INFO L290 TraceCheckUtils]: 30: Hoare triple {1125#true} ~cond := #in~cond; {1125#true} is VALID [2022-04-15 14:04:13,801 INFO L272 TraceCheckUtils]: 29: Hoare triple {1125#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {1125#true} is VALID [2022-04-15 14:04:13,801 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1125#true} {1125#true} #84#return; {1125#true} is VALID [2022-04-15 14:04:13,801 INFO L290 TraceCheckUtils]: 27: Hoare triple {1125#true} assume true; {1125#true} is VALID [2022-04-15 14:04:13,801 INFO L290 TraceCheckUtils]: 26: Hoare triple {1125#true} assume !(0 == ~cond); {1125#true} is VALID [2022-04-15 14:04:13,801 INFO L290 TraceCheckUtils]: 25: Hoare triple {1125#true} ~cond := #in~cond; {1125#true} is VALID [2022-04-15 14:04:13,801 INFO L272 TraceCheckUtils]: 24: Hoare triple {1125#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {1125#true} is VALID [2022-04-15 14:04:13,801 INFO L290 TraceCheckUtils]: 23: Hoare triple {1125#true} assume !false; {1125#true} is VALID [2022-04-15 14:04:13,802 INFO L290 TraceCheckUtils]: 22: Hoare triple {1125#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {1125#true} is VALID [2022-04-15 14:04:13,802 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1125#true} {1125#true} #82#return; {1125#true} is VALID [2022-04-15 14:04:13,802 INFO L290 TraceCheckUtils]: 20: Hoare triple {1125#true} assume true; {1125#true} is VALID [2022-04-15 14:04:13,802 INFO L290 TraceCheckUtils]: 19: Hoare triple {1125#true} assume !(0 == ~cond); {1125#true} is VALID [2022-04-15 14:04:13,802 INFO L290 TraceCheckUtils]: 18: Hoare triple {1125#true} ~cond := #in~cond; {1125#true} is VALID [2022-04-15 14:04:13,802 INFO L272 TraceCheckUtils]: 17: Hoare triple {1125#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1125#true} is VALID [2022-04-15 14:04:13,802 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1125#true} {1125#true} #80#return; {1125#true} is VALID [2022-04-15 14:04:13,802 INFO L290 TraceCheckUtils]: 15: Hoare triple {1125#true} assume true; {1125#true} is VALID [2022-04-15 14:04:13,802 INFO L290 TraceCheckUtils]: 14: Hoare triple {1125#true} assume !(0 == ~cond); {1125#true} is VALID [2022-04-15 14:04:13,803 INFO L290 TraceCheckUtils]: 13: Hoare triple {1125#true} ~cond := #in~cond; {1125#true} is VALID [2022-04-15 14:04:13,803 INFO L272 TraceCheckUtils]: 12: Hoare triple {1125#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 1 then 1 else 0)); {1125#true} is VALID [2022-04-15 14:04:13,803 INFO L290 TraceCheckUtils]: 11: Hoare triple {1125#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1125#true} is VALID [2022-04-15 14:04:13,803 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1125#true} {1125#true} #78#return; {1125#true} is VALID [2022-04-15 14:04:13,803 INFO L290 TraceCheckUtils]: 9: Hoare triple {1125#true} assume true; {1125#true} is VALID [2022-04-15 14:04:13,803 INFO L290 TraceCheckUtils]: 8: Hoare triple {1125#true} assume !(0 == ~cond); {1125#true} is VALID [2022-04-15 14:04:13,803 INFO L290 TraceCheckUtils]: 7: Hoare triple {1125#true} ~cond := #in~cond; {1125#true} is VALID [2022-04-15 14:04:13,803 INFO L272 TraceCheckUtils]: 6: Hoare triple {1125#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 1 then 1 else 0)); {1125#true} is VALID [2022-04-15 14:04:13,803 INFO L290 TraceCheckUtils]: 5: Hoare triple {1125#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {1125#true} is VALID [2022-04-15 14:04:13,804 INFO L272 TraceCheckUtils]: 4: Hoare triple {1125#true} call #t~ret6 := main(); {1125#true} is VALID [2022-04-15 14:04:13,804 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1125#true} {1125#true} #98#return; {1125#true} is VALID [2022-04-15 14:04:13,804 INFO L290 TraceCheckUtils]: 2: Hoare triple {1125#true} assume true; {1125#true} is VALID [2022-04-15 14:04:13,804 INFO L290 TraceCheckUtils]: 1: Hoare triple {1125#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(14, 2);call #Ultimate.allocInit(12, 3); {1125#true} is VALID [2022-04-15 14:04:13,804 INFO L272 TraceCheckUtils]: 0: Hoare triple {1125#true} call ULTIMATE.init(); {1125#true} is VALID [2022-04-15 14:04:13,804 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-15 14:04:13,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:04:13,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707400770] [2022-04-15 14:04:13,805 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:04:13,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398520253] [2022-04-15 14:04:13,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398520253] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 14:04:13,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 14:04:13,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2022-04-15 14:04:13,805 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:04:13,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1580370664] [2022-04-15 14:04:13,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1580370664] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:04:13,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:04:13,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 14:04:13,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561238829] [2022-04-15 14:04:13,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:04:13,806 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 40 [2022-04-15 14:04:13,806 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:04:13,806 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-15 14:04:13,826 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 14:04:13,826 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 14:04:13,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:04:13,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 14:04:13,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-04-15 14:04:13,827 INFO L87 Difference]: Start difference. First operand 53 states and 67 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-15 14:04:14,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:04:14,014 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2022-04-15 14:04:14,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 14:04:14,014 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 40 [2022-04-15 14:04:14,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:04:14,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-15 14:04:14,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-04-15 14:04:14,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-15 14:04:14,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-04-15 14:04:14,017 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 48 transitions. [2022-04-15 14:04:14,054 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:04:14,055 INFO L225 Difference]: With dead ends: 59 [2022-04-15 14:04:14,055 INFO L226 Difference]: Without dead ends: 57 [2022-04-15 14:04:14,055 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-04-15 14:04:14,057 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 10 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 14:04:14,057 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 102 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 14:04:14,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-15 14:04:14,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-04-15 14:04:14,099 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:04:14,099 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 57 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 14:04:14,099 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 57 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 14:04:14,100 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 57 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 14:04:14,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:04:14,102 INFO L93 Difference]: Finished difference Result 57 states and 70 transitions. [2022-04-15 14:04:14,102 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2022-04-15 14:04:14,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:04:14,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:04:14,102 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 57 states. [2022-04-15 14:04:14,103 INFO L87 Difference]: Start difference. First operand has 57 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 57 states. [2022-04-15 14:04:14,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:04:14,105 INFO L93 Difference]: Finished difference Result 57 states and 70 transitions. [2022-04-15 14:04:14,105 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2022-04-15 14:04:14,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:04:14,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:04:14,105 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:04:14,105 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:04:14,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 14:04:14,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 70 transitions. [2022-04-15 14:04:14,107 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 70 transitions. Word has length 40 [2022-04-15 14:04:14,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:04:14,107 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 70 transitions. [2022-04-15 14:04:14,108 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-15 14:04:14,108 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 70 transitions. [2022-04-15 14:04:14,177 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:04:14,177 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2022-04-15 14:04:14,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-15 14:04:14,178 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:04:14,178 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 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, 1] [2022-04-15 14:04:14,194 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 14:04:14,393 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 14:04:14,394 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:04:14,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:04:14,394 INFO L85 PathProgramCache]: Analyzing trace with hash -391974204, now seen corresponding path program 1 times [2022-04-15 14:04:14,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:04:14,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1342979750] [2022-04-15 14:04:14,395 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:04:14,395 INFO L85 PathProgramCache]: Analyzing trace with hash -391974204, now seen corresponding path program 2 times [2022-04-15 14:04:14,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:04:14,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335091848] [2022-04-15 14:04:14,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:04:14,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:04:14,407 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:04:14,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [527185315] [2022-04-15 14:04:14,408 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:04:14,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:04:14,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:04:14,409 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 14:04:14,411 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 14:04:14,446 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 14:04:14,446 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:04:14,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 14:04:14,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:04:14,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:04:14,605 INFO L272 TraceCheckUtils]: 0: Hoare triple {1723#true} call ULTIMATE.init(); {1723#true} is VALID [2022-04-15 14:04:14,606 INFO L290 TraceCheckUtils]: 1: Hoare triple {1723#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(14, 2);call #Ultimate.allocInit(12, 3); {1723#true} is VALID [2022-04-15 14:04:14,606 INFO L290 TraceCheckUtils]: 2: Hoare triple {1723#true} assume true; {1723#true} is VALID [2022-04-15 14:04:14,606 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1723#true} {1723#true} #98#return; {1723#true} is VALID [2022-04-15 14:04:14,606 INFO L272 TraceCheckUtils]: 4: Hoare triple {1723#true} call #t~ret6 := main(); {1723#true} is VALID [2022-04-15 14:04:14,606 INFO L290 TraceCheckUtils]: 5: Hoare triple {1723#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {1723#true} is VALID [2022-04-15 14:04:14,606 INFO L272 TraceCheckUtils]: 6: Hoare triple {1723#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 1 then 1 else 0)); {1723#true} is VALID [2022-04-15 14:04:14,606 INFO L290 TraceCheckUtils]: 7: Hoare triple {1723#true} ~cond := #in~cond; {1723#true} is VALID [2022-04-15 14:04:14,607 INFO L290 TraceCheckUtils]: 8: Hoare triple {1723#true} assume !(0 == ~cond); {1723#true} is VALID [2022-04-15 14:04:14,607 INFO L290 TraceCheckUtils]: 9: Hoare triple {1723#true} assume true; {1723#true} is VALID [2022-04-15 14:04:14,607 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1723#true} {1723#true} #78#return; {1723#true} is VALID [2022-04-15 14:04:14,607 INFO L290 TraceCheckUtils]: 11: Hoare triple {1723#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1723#true} is VALID [2022-04-15 14:04:14,607 INFO L272 TraceCheckUtils]: 12: Hoare triple {1723#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 1 then 1 else 0)); {1723#true} is VALID [2022-04-15 14:04:14,607 INFO L290 TraceCheckUtils]: 13: Hoare triple {1723#true} ~cond := #in~cond; {1723#true} is VALID [2022-04-15 14:04:14,607 INFO L290 TraceCheckUtils]: 14: Hoare triple {1723#true} assume !(0 == ~cond); {1723#true} is VALID [2022-04-15 14:04:14,607 INFO L290 TraceCheckUtils]: 15: Hoare triple {1723#true} assume true; {1723#true} is VALID [2022-04-15 14:04:14,607 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1723#true} {1723#true} #80#return; {1723#true} is VALID [2022-04-15 14:04:14,607 INFO L272 TraceCheckUtils]: 17: Hoare triple {1723#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1723#true} is VALID [2022-04-15 14:04:14,608 INFO L290 TraceCheckUtils]: 18: Hoare triple {1723#true} ~cond := #in~cond; {1782#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 14:04:14,608 INFO L290 TraceCheckUtils]: 19: Hoare triple {1782#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1786#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 14:04:14,608 INFO L290 TraceCheckUtils]: 20: Hoare triple {1786#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1786#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 14:04:14,609 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1786#(not (= |assume_abort_if_not_#in~cond| 0))} {1723#true} #82#return; {1793#(<= 1 main_~y~0)} is VALID [2022-04-15 14:04:14,609 INFO L290 TraceCheckUtils]: 22: Hoare triple {1793#(<= 1 main_~y~0)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {1793#(<= 1 main_~y~0)} is VALID [2022-04-15 14:04:14,610 INFO L290 TraceCheckUtils]: 23: Hoare triple {1793#(<= 1 main_~y~0)} assume !false; {1793#(<= 1 main_~y~0)} is VALID [2022-04-15 14:04:14,610 INFO L272 TraceCheckUtils]: 24: Hoare triple {1793#(<= 1 main_~y~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {1723#true} is VALID [2022-04-15 14:04:14,610 INFO L290 TraceCheckUtils]: 25: Hoare triple {1723#true} ~cond := #in~cond; {1723#true} is VALID [2022-04-15 14:04:14,610 INFO L290 TraceCheckUtils]: 26: Hoare triple {1723#true} assume !(0 == ~cond); {1723#true} is VALID [2022-04-15 14:04:14,610 INFO L290 TraceCheckUtils]: 27: Hoare triple {1723#true} assume true; {1723#true} is VALID [2022-04-15 14:04:14,611 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1723#true} {1793#(<= 1 main_~y~0)} #84#return; {1793#(<= 1 main_~y~0)} is VALID [2022-04-15 14:04:14,611 INFO L272 TraceCheckUtils]: 29: Hoare triple {1793#(<= 1 main_~y~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {1723#true} is VALID [2022-04-15 14:04:14,611 INFO L290 TraceCheckUtils]: 30: Hoare triple {1723#true} ~cond := #in~cond; {1723#true} is VALID [2022-04-15 14:04:14,611 INFO L290 TraceCheckUtils]: 31: Hoare triple {1723#true} assume !(0 == ~cond); {1723#true} is VALID [2022-04-15 14:04:14,611 INFO L290 TraceCheckUtils]: 32: Hoare triple {1723#true} assume true; {1723#true} is VALID [2022-04-15 14:04:14,611 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1723#true} {1793#(<= 1 main_~y~0)} #86#return; {1793#(<= 1 main_~y~0)} is VALID [2022-04-15 14:04:14,612 INFO L290 TraceCheckUtils]: 34: Hoare triple {1793#(<= 1 main_~y~0)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {1833#(<= 1 main_~r~0)} is VALID [2022-04-15 14:04:14,612 INFO L290 TraceCheckUtils]: 35: Hoare triple {1833#(<= 1 main_~r~0)} assume !false; {1833#(<= 1 main_~r~0)} is VALID [2022-04-15 14:04:14,612 INFO L272 TraceCheckUtils]: 36: Hoare triple {1833#(<= 1 main_~r~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {1723#true} is VALID [2022-04-15 14:04:14,612 INFO L290 TraceCheckUtils]: 37: Hoare triple {1723#true} ~cond := #in~cond; {1723#true} is VALID [2022-04-15 14:04:14,612 INFO L290 TraceCheckUtils]: 38: Hoare triple {1723#true} assume !(0 == ~cond); {1723#true} is VALID [2022-04-15 14:04:14,613 INFO L290 TraceCheckUtils]: 39: Hoare triple {1723#true} assume true; {1723#true} is VALID [2022-04-15 14:04:14,613 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1723#true} {1833#(<= 1 main_~r~0)} #88#return; {1833#(<= 1 main_~r~0)} is VALID [2022-04-15 14:04:14,613 INFO L272 TraceCheckUtils]: 41: Hoare triple {1833#(<= 1 main_~r~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {1723#true} is VALID [2022-04-15 14:04:14,613 INFO L290 TraceCheckUtils]: 42: Hoare triple {1723#true} ~cond := #in~cond; {1723#true} is VALID [2022-04-15 14:04:14,613 INFO L290 TraceCheckUtils]: 43: Hoare triple {1723#true} assume !(0 == ~cond); {1723#true} is VALID [2022-04-15 14:04:14,613 INFO L290 TraceCheckUtils]: 44: Hoare triple {1723#true} assume true; {1723#true} is VALID [2022-04-15 14:04:14,614 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {1723#true} {1833#(<= 1 main_~r~0)} #90#return; {1833#(<= 1 main_~r~0)} is VALID [2022-04-15 14:04:14,614 INFO L272 TraceCheckUtils]: 46: Hoare triple {1833#(<= 1 main_~r~0)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {1870#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 14:04:14,615 INFO L290 TraceCheckUtils]: 47: Hoare triple {1870#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1874#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 14:04:14,615 INFO L290 TraceCheckUtils]: 48: Hoare triple {1874#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1724#false} is VALID [2022-04-15 14:04:14,615 INFO L290 TraceCheckUtils]: 49: Hoare triple {1724#false} assume !false; {1724#false} is VALID [2022-04-15 14:04:14,616 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-15 14:04:14,616 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 14:04:14,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:04:14,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335091848] [2022-04-15 14:04:14,616 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:04:14,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527185315] [2022-04-15 14:04:14,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [527185315] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:04:14,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:04:14,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 14:04:14,617 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:04:14,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1342979750] [2022-04-15 14:04:14,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1342979750] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:04:14,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:04:14,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 14:04:14,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335450155] [2022-04-15 14:04:14,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:04:14,617 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 50 [2022-04-15 14:04:14,618 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:04:14,618 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 14:04:14,640 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:04:14,641 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 14:04:14,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:04:14,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 14:04:14,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-15 14:04:14,641 INFO L87 Difference]: Start difference. First operand 57 states and 70 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 14:04:14,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:04:14,945 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2022-04-15 14:04:14,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 14:04:14,946 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 50 [2022-04-15 14:04:14,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:04:14,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 14:04:14,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 48 transitions. [2022-04-15 14:04:14,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 14:04:14,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 48 transitions. [2022-04-15 14:04:14,948 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 48 transitions. [2022-04-15 14:04:14,981 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:04:14,982 INFO L225 Difference]: With dead ends: 63 [2022-04-15 14:04:14,982 INFO L226 Difference]: Without dead ends: 61 [2022-04-15 14:04:14,982 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-15 14:04:14,983 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 16 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 14:04:14,983 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 160 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 14:04:14,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-15 14:04:15,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-04-15 14:04:15,033 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:04:15,033 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 61 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 36 states have internal predecessors, (39), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 14:04:15,033 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 61 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 36 states have internal predecessors, (39), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 14:04:15,033 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 61 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 36 states have internal predecessors, (39), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 14:04:15,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:04:15,035 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2022-04-15 14:04:15,035 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2022-04-15 14:04:15,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:04:15,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:04:15,036 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 36 states have internal predecessors, (39), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 61 states. [2022-04-15 14:04:15,036 INFO L87 Difference]: Start difference. First operand has 61 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 36 states have internal predecessors, (39), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 61 states. [2022-04-15 14:04:15,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:04:15,038 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2022-04-15 14:04:15,038 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2022-04-15 14:04:15,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:04:15,038 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:04:15,039 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:04:15,039 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:04:15,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 36 states have internal predecessors, (39), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 14:04:15,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 73 transitions. [2022-04-15 14:04:15,041 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 73 transitions. Word has length 50 [2022-04-15 14:04:15,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:04:15,041 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 73 transitions. [2022-04-15 14:04:15,041 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 14:04:15,041 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 73 transitions. [2022-04-15 14:04:15,116 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:04:15,116 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2022-04-15 14:04:15,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-15 14:04:15,116 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:04:15,117 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 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, 1, 1, 1, 1] [2022-04-15 14:04:15,133 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 14:04:15,331 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 14:04:15,331 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:04:15,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:04:15,332 INFO L85 PathProgramCache]: Analyzing trace with hash 991781023, now seen corresponding path program 1 times [2022-04-15 14:04:15,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:04:15,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1703733334] [2022-04-15 14:04:15,332 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:04:15,332 INFO L85 PathProgramCache]: Analyzing trace with hash 991781023, now seen corresponding path program 2 times [2022-04-15 14:04:15,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:04:15,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728495006] [2022-04-15 14:04:15,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:04:15,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:04:15,356 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:04:15,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [776649948] [2022-04-15 14:04:15,357 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:04:15,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:04:15,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:04:15,358 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 14:04:15,388 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 14:04:15,428 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 14:04:15,429 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:04:15,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 14:04:15,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:04:15,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:04:15,780 INFO L272 TraceCheckUtils]: 0: Hoare triple {2256#true} call ULTIMATE.init(); {2256#true} is VALID [2022-04-15 14:04:15,780 INFO L290 TraceCheckUtils]: 1: Hoare triple {2256#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(14, 2);call #Ultimate.allocInit(12, 3); {2256#true} is VALID [2022-04-15 14:04:15,780 INFO L290 TraceCheckUtils]: 2: Hoare triple {2256#true} assume true; {2256#true} is VALID [2022-04-15 14:04:15,780 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2256#true} {2256#true} #98#return; {2256#true} is VALID [2022-04-15 14:04:15,780 INFO L272 TraceCheckUtils]: 4: Hoare triple {2256#true} call #t~ret6 := main(); {2256#true} is VALID [2022-04-15 14:04:15,780 INFO L290 TraceCheckUtils]: 5: Hoare triple {2256#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {2256#true} is VALID [2022-04-15 14:04:15,780 INFO L272 TraceCheckUtils]: 6: Hoare triple {2256#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 1 then 1 else 0)); {2256#true} is VALID [2022-04-15 14:04:15,780 INFO L290 TraceCheckUtils]: 7: Hoare triple {2256#true} ~cond := #in~cond; {2256#true} is VALID [2022-04-15 14:04:15,781 INFO L290 TraceCheckUtils]: 8: Hoare triple {2256#true} assume !(0 == ~cond); {2256#true} is VALID [2022-04-15 14:04:15,781 INFO L290 TraceCheckUtils]: 9: Hoare triple {2256#true} assume true; {2256#true} is VALID [2022-04-15 14:04:15,781 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2256#true} {2256#true} #78#return; {2256#true} is VALID [2022-04-15 14:04:15,781 INFO L290 TraceCheckUtils]: 11: Hoare triple {2256#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2256#true} is VALID [2022-04-15 14:04:15,781 INFO L272 TraceCheckUtils]: 12: Hoare triple {2256#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 1 then 1 else 0)); {2256#true} is VALID [2022-04-15 14:04:15,781 INFO L290 TraceCheckUtils]: 13: Hoare triple {2256#true} ~cond := #in~cond; {2256#true} is VALID [2022-04-15 14:04:15,781 INFO L290 TraceCheckUtils]: 14: Hoare triple {2256#true} assume !(0 == ~cond); {2256#true} is VALID [2022-04-15 14:04:15,781 INFO L290 TraceCheckUtils]: 15: Hoare triple {2256#true} assume true; {2256#true} is VALID [2022-04-15 14:04:15,781 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2256#true} {2256#true} #80#return; {2256#true} is VALID [2022-04-15 14:04:15,781 INFO L272 TraceCheckUtils]: 17: Hoare triple {2256#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2256#true} is VALID [2022-04-15 14:04:15,782 INFO L290 TraceCheckUtils]: 18: Hoare triple {2256#true} ~cond := #in~cond; {2256#true} is VALID [2022-04-15 14:04:15,782 INFO L290 TraceCheckUtils]: 19: Hoare triple {2256#true} assume !(0 == ~cond); {2256#true} is VALID [2022-04-15 14:04:15,782 INFO L290 TraceCheckUtils]: 20: Hoare triple {2256#true} assume true; {2256#true} is VALID [2022-04-15 14:04:15,782 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2256#true} {2256#true} #82#return; {2256#true} is VALID [2022-04-15 14:04:15,782 INFO L290 TraceCheckUtils]: 22: Hoare triple {2256#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {2256#true} is VALID [2022-04-15 14:04:15,782 INFO L290 TraceCheckUtils]: 23: Hoare triple {2256#true} assume !false; {2256#true} is VALID [2022-04-15 14:04:15,782 INFO L272 TraceCheckUtils]: 24: Hoare triple {2256#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {2256#true} is VALID [2022-04-15 14:04:15,782 INFO L290 TraceCheckUtils]: 25: Hoare triple {2256#true} ~cond := #in~cond; {2256#true} is VALID [2022-04-15 14:04:15,782 INFO L290 TraceCheckUtils]: 26: Hoare triple {2256#true} assume !(0 == ~cond); {2256#true} is VALID [2022-04-15 14:04:15,782 INFO L290 TraceCheckUtils]: 27: Hoare triple {2256#true} assume true; {2256#true} is VALID [2022-04-15 14:04:15,782 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2256#true} {2256#true} #84#return; {2256#true} is VALID [2022-04-15 14:04:15,783 INFO L272 TraceCheckUtils]: 29: Hoare triple {2256#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {2256#true} is VALID [2022-04-15 14:04:15,783 INFO L290 TraceCheckUtils]: 30: Hoare triple {2256#true} ~cond := #in~cond; {2256#true} is VALID [2022-04-15 14:04:15,783 INFO L290 TraceCheckUtils]: 31: Hoare triple {2256#true} assume !(0 == ~cond); {2256#true} is VALID [2022-04-15 14:04:15,783 INFO L290 TraceCheckUtils]: 32: Hoare triple {2256#true} assume true; {2256#true} is VALID [2022-04-15 14:04:15,783 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2256#true} {2256#true} #86#return; {2256#true} is VALID [2022-04-15 14:04:15,783 INFO L290 TraceCheckUtils]: 34: Hoare triple {2256#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {2256#true} is VALID [2022-04-15 14:04:15,783 INFO L290 TraceCheckUtils]: 35: Hoare triple {2256#true} assume !false; {2256#true} is VALID [2022-04-15 14:04:15,783 INFO L272 TraceCheckUtils]: 36: Hoare triple {2256#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {2256#true} is VALID [2022-04-15 14:04:15,784 INFO L290 TraceCheckUtils]: 37: Hoare triple {2256#true} ~cond := #in~cond; {2372#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 14:04:15,784 INFO L290 TraceCheckUtils]: 38: Hoare triple {2372#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2376#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 14:04:15,784 INFO L290 TraceCheckUtils]: 39: Hoare triple {2376#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2376#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 14:04:15,785 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {2376#(not (= |__VERIFIER_assert_#in~cond| 0))} {2256#true} #88#return; {2383#(= main_~b~0 (* main_~a~0 main_~y~0))} is VALID [2022-04-15 14:04:15,785 INFO L272 TraceCheckUtils]: 41: Hoare triple {2383#(= main_~b~0 (* main_~a~0 main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {2256#true} is VALID [2022-04-15 14:04:15,785 INFO L290 TraceCheckUtils]: 42: Hoare triple {2256#true} ~cond := #in~cond; {2256#true} is VALID [2022-04-15 14:04:15,785 INFO L290 TraceCheckUtils]: 43: Hoare triple {2256#true} assume !(0 == ~cond); {2256#true} is VALID [2022-04-15 14:04:15,785 INFO L290 TraceCheckUtils]: 44: Hoare triple {2256#true} assume true; {2256#true} is VALID [2022-04-15 14:04:15,786 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2256#true} {2383#(= main_~b~0 (* main_~a~0 main_~y~0))} #90#return; {2383#(= main_~b~0 (* main_~a~0 main_~y~0))} is VALID [2022-04-15 14:04:15,786 INFO L272 TraceCheckUtils]: 46: Hoare triple {2383#(= main_~b~0 (* main_~a~0 main_~y~0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {2256#true} is VALID [2022-04-15 14:04:15,786 INFO L290 TraceCheckUtils]: 47: Hoare triple {2256#true} ~cond := #in~cond; {2256#true} is VALID [2022-04-15 14:04:15,786 INFO L290 TraceCheckUtils]: 48: Hoare triple {2256#true} assume !(0 == ~cond); {2256#true} is VALID [2022-04-15 14:04:15,786 INFO L290 TraceCheckUtils]: 49: Hoare triple {2256#true} assume true; {2256#true} is VALID [2022-04-15 14:04:15,786 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2256#true} {2383#(= main_~b~0 (* main_~a~0 main_~y~0))} #92#return; {2383#(= main_~b~0 (* main_~a~0 main_~y~0))} is VALID [2022-04-15 14:04:15,787 INFO L290 TraceCheckUtils]: 51: Hoare triple {2383#(= main_~b~0 (* main_~a~0 main_~y~0))} assume !!(~r~0 >= 2 * ~b~0); {2417#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} is VALID [2022-04-15 14:04:15,787 INFO L272 TraceCheckUtils]: 52: Hoare triple {2417#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {2421#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 14:04:15,788 INFO L290 TraceCheckUtils]: 53: Hoare triple {2421#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2425#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 14:04:15,788 INFO L290 TraceCheckUtils]: 54: Hoare triple {2425#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2257#false} is VALID [2022-04-15 14:04:15,788 INFO L290 TraceCheckUtils]: 55: Hoare triple {2257#false} assume !false; {2257#false} is VALID [2022-04-15 14:04:15,788 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-15 14:04:15,788 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 14:04:18,507 INFO L290 TraceCheckUtils]: 55: Hoare triple {2257#false} assume !false; {2257#false} is VALID [2022-04-15 14:04:18,508 INFO L290 TraceCheckUtils]: 54: Hoare triple {2425#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2257#false} is VALID [2022-04-15 14:04:18,508 INFO L290 TraceCheckUtils]: 53: Hoare triple {2421#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2425#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 14:04:18,509 INFO L272 TraceCheckUtils]: 52: Hoare triple {2417#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {2421#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 14:04:18,509 INFO L290 TraceCheckUtils]: 51: Hoare triple {2444#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} assume !!(~r~0 >= 2 * ~b~0); {2417#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} is VALID [2022-04-15 14:04:18,510 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2256#true} {2444#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} #92#return; {2444#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} is VALID [2022-04-15 14:04:18,510 INFO L290 TraceCheckUtils]: 49: Hoare triple {2256#true} assume true; {2256#true} is VALID [2022-04-15 14:04:18,510 INFO L290 TraceCheckUtils]: 48: Hoare triple {2256#true} assume !(0 == ~cond); {2256#true} is VALID [2022-04-15 14:04:18,510 INFO L290 TraceCheckUtils]: 47: Hoare triple {2256#true} ~cond := #in~cond; {2256#true} is VALID [2022-04-15 14:04:18,510 INFO L272 TraceCheckUtils]: 46: Hoare triple {2444#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {2256#true} is VALID [2022-04-15 14:04:18,511 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2256#true} {2444#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} #90#return; {2444#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} is VALID [2022-04-15 14:04:18,511 INFO L290 TraceCheckUtils]: 44: Hoare triple {2256#true} assume true; {2256#true} is VALID [2022-04-15 14:04:18,511 INFO L290 TraceCheckUtils]: 43: Hoare triple {2256#true} assume !(0 == ~cond); {2256#true} is VALID [2022-04-15 14:04:18,511 INFO L290 TraceCheckUtils]: 42: Hoare triple {2256#true} ~cond := #in~cond; {2256#true} is VALID [2022-04-15 14:04:18,511 INFO L272 TraceCheckUtils]: 41: Hoare triple {2444#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {2256#true} is VALID [2022-04-15 14:04:18,512 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {2376#(not (= |__VERIFIER_assert_#in~cond| 0))} {2256#true} #88#return; {2444#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} is VALID [2022-04-15 14:04:18,512 INFO L290 TraceCheckUtils]: 39: Hoare triple {2376#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2376#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 14:04:18,513 INFO L290 TraceCheckUtils]: 38: Hoare triple {2487#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2376#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 14:04:18,513 INFO L290 TraceCheckUtils]: 37: Hoare triple {2256#true} ~cond := #in~cond; {2487#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 14:04:18,513 INFO L272 TraceCheckUtils]: 36: Hoare triple {2256#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {2256#true} is VALID [2022-04-15 14:04:18,513 INFO L290 TraceCheckUtils]: 35: Hoare triple {2256#true} assume !false; {2256#true} is VALID [2022-04-15 14:04:18,513 INFO L290 TraceCheckUtils]: 34: Hoare triple {2256#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {2256#true} is VALID [2022-04-15 14:04:18,513 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2256#true} {2256#true} #86#return; {2256#true} is VALID [2022-04-15 14:04:18,514 INFO L290 TraceCheckUtils]: 32: Hoare triple {2256#true} assume true; {2256#true} is VALID [2022-04-15 14:04:18,514 INFO L290 TraceCheckUtils]: 31: Hoare triple {2256#true} assume !(0 == ~cond); {2256#true} is VALID [2022-04-15 14:04:18,514 INFO L290 TraceCheckUtils]: 30: Hoare triple {2256#true} ~cond := #in~cond; {2256#true} is VALID [2022-04-15 14:04:18,514 INFO L272 TraceCheckUtils]: 29: Hoare triple {2256#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {2256#true} is VALID [2022-04-15 14:04:18,514 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2256#true} {2256#true} #84#return; {2256#true} is VALID [2022-04-15 14:04:18,514 INFO L290 TraceCheckUtils]: 27: Hoare triple {2256#true} assume true; {2256#true} is VALID [2022-04-15 14:04:18,514 INFO L290 TraceCheckUtils]: 26: Hoare triple {2256#true} assume !(0 == ~cond); {2256#true} is VALID [2022-04-15 14:04:18,514 INFO L290 TraceCheckUtils]: 25: Hoare triple {2256#true} ~cond := #in~cond; {2256#true} is VALID [2022-04-15 14:04:18,514 INFO L272 TraceCheckUtils]: 24: Hoare triple {2256#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {2256#true} is VALID [2022-04-15 14:04:18,514 INFO L290 TraceCheckUtils]: 23: Hoare triple {2256#true} assume !false; {2256#true} is VALID [2022-04-15 14:04:18,514 INFO L290 TraceCheckUtils]: 22: Hoare triple {2256#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {2256#true} is VALID [2022-04-15 14:04:18,515 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2256#true} {2256#true} #82#return; {2256#true} is VALID [2022-04-15 14:04:18,515 INFO L290 TraceCheckUtils]: 20: Hoare triple {2256#true} assume true; {2256#true} is VALID [2022-04-15 14:04:18,515 INFO L290 TraceCheckUtils]: 19: Hoare triple {2256#true} assume !(0 == ~cond); {2256#true} is VALID [2022-04-15 14:04:18,515 INFO L290 TraceCheckUtils]: 18: Hoare triple {2256#true} ~cond := #in~cond; {2256#true} is VALID [2022-04-15 14:04:18,515 INFO L272 TraceCheckUtils]: 17: Hoare triple {2256#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2256#true} is VALID [2022-04-15 14:04:18,515 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2256#true} {2256#true} #80#return; {2256#true} is VALID [2022-04-15 14:04:18,515 INFO L290 TraceCheckUtils]: 15: Hoare triple {2256#true} assume true; {2256#true} is VALID [2022-04-15 14:04:18,515 INFO L290 TraceCheckUtils]: 14: Hoare triple {2256#true} assume !(0 == ~cond); {2256#true} is VALID [2022-04-15 14:04:18,515 INFO L290 TraceCheckUtils]: 13: Hoare triple {2256#true} ~cond := #in~cond; {2256#true} is VALID [2022-04-15 14:04:18,515 INFO L272 TraceCheckUtils]: 12: Hoare triple {2256#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 1 then 1 else 0)); {2256#true} is VALID [2022-04-15 14:04:18,516 INFO L290 TraceCheckUtils]: 11: Hoare triple {2256#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2256#true} is VALID [2022-04-15 14:04:18,516 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2256#true} {2256#true} #78#return; {2256#true} is VALID [2022-04-15 14:04:18,516 INFO L290 TraceCheckUtils]: 9: Hoare triple {2256#true} assume true; {2256#true} is VALID [2022-04-15 14:04:18,516 INFO L290 TraceCheckUtils]: 8: Hoare triple {2256#true} assume !(0 == ~cond); {2256#true} is VALID [2022-04-15 14:04:18,516 INFO L290 TraceCheckUtils]: 7: Hoare triple {2256#true} ~cond := #in~cond; {2256#true} is VALID [2022-04-15 14:04:18,516 INFO L272 TraceCheckUtils]: 6: Hoare triple {2256#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 1 then 1 else 0)); {2256#true} is VALID [2022-04-15 14:04:18,516 INFO L290 TraceCheckUtils]: 5: Hoare triple {2256#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {2256#true} is VALID [2022-04-15 14:04:18,516 INFO L272 TraceCheckUtils]: 4: Hoare triple {2256#true} call #t~ret6 := main(); {2256#true} is VALID [2022-04-15 14:04:18,516 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2256#true} {2256#true} #98#return; {2256#true} is VALID [2022-04-15 14:04:18,516 INFO L290 TraceCheckUtils]: 2: Hoare triple {2256#true} assume true; {2256#true} is VALID [2022-04-15 14:04:18,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {2256#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(14, 2);call #Ultimate.allocInit(12, 3); {2256#true} is VALID [2022-04-15 14:04:18,516 INFO L272 TraceCheckUtils]: 0: Hoare triple {2256#true} call ULTIMATE.init(); {2256#true} is VALID [2022-04-15 14:04:18,517 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-15 14:04:18,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:04:18,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728495006] [2022-04-15 14:04:18,517 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:04:18,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776649948] [2022-04-15 14:04:18,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [776649948] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 14:04:18,517 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 14:04:18,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-15 14:04:18,518 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:04:18,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1703733334] [2022-04-15 14:04:18,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1703733334] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:04:18,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:04:18,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 14:04:18,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924430476] [2022-04-15 14:04:18,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:04:18,518 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 56 [2022-04-15 14:04:18,519 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:04:18,519 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-15 14:04:18,542 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:04:18,543 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 14:04:18,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:04:18,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 14:04:18,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-15 14:04:18,543 INFO L87 Difference]: Start difference. First operand 61 states and 73 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-15 14:04:18,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:04:18,877 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2022-04-15 14:04:18,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 14:04:18,877 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 56 [2022-04-15 14:04:18,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:04:18,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-15 14:04:18,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 48 transitions. [2022-04-15 14:04:18,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-15 14:04:18,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 48 transitions. [2022-04-15 14:04:18,880 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 48 transitions. [2022-04-15 14:04:18,919 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:04:18,920 INFO L225 Difference]: With dead ends: 67 [2022-04-15 14:04:18,920 INFO L226 Difference]: Without dead ends: 65 [2022-04-15 14:04:18,920 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-04-15 14:04:18,921 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 18 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 14:04:18,921 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 121 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 14:04:18,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-15 14:04:18,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-04-15 14:04:18,973 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:04:18,974 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 65 states, 38 states have (on average 1.105263157894737) internal successors, (42), 39 states have internal predecessors, (42), 18 states have call successors, (18), 9 states have call predecessors, (18), 8 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 14:04:18,974 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 65 states, 38 states have (on average 1.105263157894737) internal successors, (42), 39 states have internal predecessors, (42), 18 states have call successors, (18), 9 states have call predecessors, (18), 8 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 14:04:18,974 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 65 states, 38 states have (on average 1.105263157894737) internal successors, (42), 39 states have internal predecessors, (42), 18 states have call successors, (18), 9 states have call predecessors, (18), 8 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 14:04:18,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:04:18,976 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2022-04-15 14:04:18,976 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2022-04-15 14:04:18,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:04:18,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:04:18,976 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 38 states have (on average 1.105263157894737) internal successors, (42), 39 states have internal predecessors, (42), 18 states have call successors, (18), 9 states have call predecessors, (18), 8 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 65 states. [2022-04-15 14:04:18,977 INFO L87 Difference]: Start difference. First operand has 65 states, 38 states have (on average 1.105263157894737) internal successors, (42), 39 states have internal predecessors, (42), 18 states have call successors, (18), 9 states have call predecessors, (18), 8 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 65 states. [2022-04-15 14:04:18,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:04:18,978 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2022-04-15 14:04:18,978 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2022-04-15 14:04:18,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:04:18,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:04:18,979 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:04:18,979 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:04:18,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 38 states have (on average 1.105263157894737) internal successors, (42), 39 states have internal predecessors, (42), 18 states have call successors, (18), 9 states have call predecessors, (18), 8 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 14:04:18,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 76 transitions. [2022-04-15 14:04:18,981 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 76 transitions. Word has length 56 [2022-04-15 14:04:18,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:04:18,981 INFO L478 AbstractCegarLoop]: Abstraction has 65 states and 76 transitions. [2022-04-15 14:04:18,981 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-15 14:04:18,981 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 76 transitions. [2022-04-15 14:04:19,054 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:04:19,054 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2022-04-15 14:04:19,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-15 14:04:19,055 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:04:19,055 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2022-04-15 14:04:19,071 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 14:04:19,271 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 14:04:19,271 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:04:19,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:04:19,272 INFO L85 PathProgramCache]: Analyzing trace with hash -2096667334, now seen corresponding path program 1 times [2022-04-15 14:04:19,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:04:19,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [499289574] [2022-04-15 14:04:19,272 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:04:19,272 INFO L85 PathProgramCache]: Analyzing trace with hash -2096667334, now seen corresponding path program 2 times [2022-04-15 14:04:19,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:04:19,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252256833] [2022-04-15 14:04:19,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:04:19,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:04:19,291 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:04:19,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [647558235] [2022-04-15 14:04:19,291 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:04:19,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:04:19,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:04:19,292 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 14:04:19,293 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 14:04:19,329 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 14:04:19,329 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:04:19,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-15 14:04:19,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:04:19,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:04:19,916 INFO L272 TraceCheckUtils]: 0: Hoare triple {3001#true} call ULTIMATE.init(); {3001#true} is VALID [2022-04-15 14:04:19,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {3001#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(14, 2);call #Ultimate.allocInit(12, 3); {3001#true} is VALID [2022-04-15 14:04:19,917 INFO L290 TraceCheckUtils]: 2: Hoare triple {3001#true} assume true; {3001#true} is VALID [2022-04-15 14:04:19,917 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3001#true} {3001#true} #98#return; {3001#true} is VALID [2022-04-15 14:04:19,917 INFO L272 TraceCheckUtils]: 4: Hoare triple {3001#true} call #t~ret6 := main(); {3001#true} is VALID [2022-04-15 14:04:19,917 INFO L290 TraceCheckUtils]: 5: Hoare triple {3001#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {3001#true} is VALID [2022-04-15 14:04:19,917 INFO L272 TraceCheckUtils]: 6: Hoare triple {3001#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 1 then 1 else 0)); {3001#true} is VALID [2022-04-15 14:04:19,917 INFO L290 TraceCheckUtils]: 7: Hoare triple {3001#true} ~cond := #in~cond; {3027#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 14:04:19,918 INFO L290 TraceCheckUtils]: 8: Hoare triple {3027#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {3031#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 14:04:19,918 INFO L290 TraceCheckUtils]: 9: Hoare triple {3031#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3031#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 14:04:19,918 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3031#(not (= |assume_abort_if_not_#in~cond| 0))} {3001#true} #78#return; {3038#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 14:04:19,919 INFO L290 TraceCheckUtils]: 11: Hoare triple {3038#(and (<= 0 main_~x~0) (<= main_~x~0 1))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3038#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 14:04:19,919 INFO L272 TraceCheckUtils]: 12: Hoare triple {3038#(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)); {3001#true} is VALID [2022-04-15 14:04:19,919 INFO L290 TraceCheckUtils]: 13: Hoare triple {3001#true} ~cond := #in~cond; {3001#true} is VALID [2022-04-15 14:04:19,919 INFO L290 TraceCheckUtils]: 14: Hoare triple {3001#true} assume !(0 == ~cond); {3001#true} is VALID [2022-04-15 14:04:19,919 INFO L290 TraceCheckUtils]: 15: Hoare triple {3001#true} assume true; {3001#true} is VALID [2022-04-15 14:04:19,920 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3001#true} {3038#(and (<= 0 main_~x~0) (<= main_~x~0 1))} #80#return; {3038#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 14:04:19,920 INFO L272 TraceCheckUtils]: 17: Hoare triple {3038#(and (<= 0 main_~x~0) (<= main_~x~0 1))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3001#true} is VALID [2022-04-15 14:04:19,920 INFO L290 TraceCheckUtils]: 18: Hoare triple {3001#true} ~cond := #in~cond; {3001#true} is VALID [2022-04-15 14:04:19,920 INFO L290 TraceCheckUtils]: 19: Hoare triple {3001#true} assume !(0 == ~cond); {3001#true} is VALID [2022-04-15 14:04:19,920 INFO L290 TraceCheckUtils]: 20: Hoare triple {3001#true} assume true; {3001#true} is VALID [2022-04-15 14:04:19,920 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3001#true} {3038#(and (<= 0 main_~x~0) (<= main_~x~0 1))} #82#return; {3038#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 14:04:19,921 INFO L290 TraceCheckUtils]: 22: Hoare triple {3038#(and (<= 0 main_~x~0) (<= main_~x~0 1))} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {3075#(and (= main_~x~0 main_~r~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~q~0 0))} is VALID [2022-04-15 14:04:19,921 INFO L290 TraceCheckUtils]: 23: Hoare triple {3075#(and (= main_~x~0 main_~r~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~q~0 0))} assume !false; {3075#(and (= main_~x~0 main_~r~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~q~0 0))} is VALID [2022-04-15 14:04:19,921 INFO L272 TraceCheckUtils]: 24: Hoare triple {3075#(and (= main_~x~0 main_~r~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {3001#true} is VALID [2022-04-15 14:04:19,921 INFO L290 TraceCheckUtils]: 25: Hoare triple {3001#true} ~cond := #in~cond; {3001#true} is VALID [2022-04-15 14:04:19,921 INFO L290 TraceCheckUtils]: 26: Hoare triple {3001#true} assume !(0 == ~cond); {3001#true} is VALID [2022-04-15 14:04:19,921 INFO L290 TraceCheckUtils]: 27: Hoare triple {3001#true} assume true; {3001#true} is VALID [2022-04-15 14:04:19,922 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3001#true} {3075#(and (= main_~x~0 main_~r~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~q~0 0))} #84#return; {3075#(and (= main_~x~0 main_~r~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~q~0 0))} is VALID [2022-04-15 14:04:19,922 INFO L272 TraceCheckUtils]: 29: Hoare triple {3075#(and (= main_~x~0 main_~r~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~q~0 0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3001#true} is VALID [2022-04-15 14:04:19,922 INFO L290 TraceCheckUtils]: 30: Hoare triple {3001#true} ~cond := #in~cond; {3001#true} is VALID [2022-04-15 14:04:19,922 INFO L290 TraceCheckUtils]: 31: Hoare triple {3001#true} assume !(0 == ~cond); {3001#true} is VALID [2022-04-15 14:04:19,922 INFO L290 TraceCheckUtils]: 32: Hoare triple {3001#true} assume true; {3001#true} is VALID [2022-04-15 14:04:19,926 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {3001#true} {3075#(and (= main_~x~0 main_~r~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~q~0 0))} #86#return; {3075#(and (= main_~x~0 main_~r~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~q~0 0))} is VALID [2022-04-15 14:04:19,931 INFO L290 TraceCheckUtils]: 34: Hoare triple {3075#(and (= main_~x~0 main_~r~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~q~0 0))} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {3112#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-15 14:04:19,931 INFO L290 TraceCheckUtils]: 35: Hoare triple {3112#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !false; {3112#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-15 14:04:19,931 INFO L272 TraceCheckUtils]: 36: Hoare triple {3112#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {3001#true} is VALID [2022-04-15 14:04:19,931 INFO L290 TraceCheckUtils]: 37: Hoare triple {3001#true} ~cond := #in~cond; {3001#true} is VALID [2022-04-15 14:04:19,932 INFO L290 TraceCheckUtils]: 38: Hoare triple {3001#true} assume !(0 == ~cond); {3001#true} is VALID [2022-04-15 14:04:19,932 INFO L290 TraceCheckUtils]: 39: Hoare triple {3001#true} assume true; {3001#true} is VALID [2022-04-15 14:04:19,932 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3001#true} {3112#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #88#return; {3112#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-15 14:04:19,932 INFO L272 TraceCheckUtils]: 41: Hoare triple {3112#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3001#true} is VALID [2022-04-15 14:04:19,932 INFO L290 TraceCheckUtils]: 42: Hoare triple {3001#true} ~cond := #in~cond; {3001#true} is VALID [2022-04-15 14:04:19,932 INFO L290 TraceCheckUtils]: 43: Hoare triple {3001#true} assume !(0 == ~cond); {3001#true} is VALID [2022-04-15 14:04:19,932 INFO L290 TraceCheckUtils]: 44: Hoare triple {3001#true} assume true; {3001#true} is VALID [2022-04-15 14:04:19,933 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3001#true} {3112#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #90#return; {3112#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-15 14:04:19,933 INFO L272 TraceCheckUtils]: 46: Hoare triple {3112#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {3001#true} is VALID [2022-04-15 14:04:19,933 INFO L290 TraceCheckUtils]: 47: Hoare triple {3001#true} ~cond := #in~cond; {3001#true} is VALID [2022-04-15 14:04:19,933 INFO L290 TraceCheckUtils]: 48: Hoare triple {3001#true} assume !(0 == ~cond); {3001#true} is VALID [2022-04-15 14:04:19,933 INFO L290 TraceCheckUtils]: 49: Hoare triple {3001#true} assume true; {3001#true} is VALID [2022-04-15 14:04:19,934 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3001#true} {3112#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #92#return; {3112#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-15 14:04:19,934 INFO L290 TraceCheckUtils]: 51: Hoare triple {3112#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !(~r~0 >= 2 * ~b~0); {3164#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (< main_~r~0 (* main_~b~0 2)) (<= main_~y~0 main_~r~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-15 14:04:19,935 INFO L290 TraceCheckUtils]: 52: Hoare triple {3164#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (< main_~r~0 (* main_~b~0 2)) (<= main_~y~0 main_~r~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {3168#(and (<= main_~x~0 1) (= (+ main_~x~0 (* (- 1) main_~r~0)) main_~y~0) (= main_~q~0 1) (<= main_~y~0 main_~x~0) (< (* main_~r~0 2) main_~x~0))} is VALID [2022-04-15 14:04:19,935 INFO L290 TraceCheckUtils]: 53: Hoare triple {3168#(and (<= main_~x~0 1) (= (+ main_~x~0 (* (- 1) main_~r~0)) main_~y~0) (= main_~q~0 1) (<= main_~y~0 main_~x~0) (< (* main_~r~0 2) main_~x~0))} assume !false; {3168#(and (<= main_~x~0 1) (= (+ main_~x~0 (* (- 1) main_~r~0)) main_~y~0) (= main_~q~0 1) (<= main_~y~0 main_~x~0) (< (* main_~r~0 2) main_~x~0))} is VALID [2022-04-15 14:04:19,936 INFO L272 TraceCheckUtils]: 54: Hoare triple {3168#(and (<= main_~x~0 1) (= (+ main_~x~0 (* (- 1) main_~r~0)) main_~y~0) (= main_~q~0 1) (<= main_~y~0 main_~x~0) (< (* main_~r~0 2) main_~x~0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {3001#true} is VALID [2022-04-15 14:04:19,936 INFO L290 TraceCheckUtils]: 55: Hoare triple {3001#true} ~cond := #in~cond; {3001#true} is VALID [2022-04-15 14:04:19,936 INFO L290 TraceCheckUtils]: 56: Hoare triple {3001#true} assume !(0 == ~cond); {3001#true} is VALID [2022-04-15 14:04:19,936 INFO L290 TraceCheckUtils]: 57: Hoare triple {3001#true} assume true; {3001#true} is VALID [2022-04-15 14:04:19,936 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {3001#true} {3168#(and (<= main_~x~0 1) (= (+ main_~x~0 (* (- 1) main_~r~0)) main_~y~0) (= main_~q~0 1) (<= main_~y~0 main_~x~0) (< (* main_~r~0 2) main_~x~0))} #84#return; {3168#(and (<= main_~x~0 1) (= (+ main_~x~0 (* (- 1) main_~r~0)) main_~y~0) (= main_~q~0 1) (<= main_~y~0 main_~x~0) (< (* main_~r~0 2) main_~x~0))} is VALID [2022-04-15 14:04:19,937 INFO L272 TraceCheckUtils]: 59: Hoare triple {3168#(and (<= main_~x~0 1) (= (+ main_~x~0 (* (- 1) main_~r~0)) main_~y~0) (= main_~q~0 1) (<= main_~y~0 main_~x~0) (< (* main_~r~0 2) main_~x~0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3190#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 14:04:19,937 INFO L290 TraceCheckUtils]: 60: Hoare triple {3190#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3194#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 14:04:19,938 INFO L290 TraceCheckUtils]: 61: Hoare triple {3194#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3002#false} is VALID [2022-04-15 14:04:19,938 INFO L290 TraceCheckUtils]: 62: Hoare triple {3002#false} assume !false; {3002#false} is VALID [2022-04-15 14:04:19,938 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-15 14:04:19,938 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 14:04:43,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:04:43,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252256833] [2022-04-15 14:04:43,532 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:04:43,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647558235] [2022-04-15 14:04:43,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647558235] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 14:04:43,532 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 14:04:43,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-15 14:04:43,532 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:04:43,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [499289574] [2022-04-15 14:04:43,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [499289574] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:04:43,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:04:43,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 14:04:43,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604441972] [2022-04-15 14:04:43,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:04:43,533 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 5 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 63 [2022-04-15 14:04:43,533 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:04:43,533 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 5 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-15 14:04:43,567 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 14:04:43,567 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 14:04:43,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:04:43,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 14:04:43,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-04-15 14:04:43,568 INFO L87 Difference]: Start difference. First operand 65 states and 76 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 5 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-15 14:04:44,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:04:44,362 INFO L93 Difference]: Finished difference Result 122 states and 143 transitions. [2022-04-15 14:04:44,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 14:04:44,362 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 5 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 63 [2022-04-15 14:04:44,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:04:44,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 5 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-15 14:04:44,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 113 transitions. [2022-04-15 14:04:44,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 5 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-15 14:04:44,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 113 transitions. [2022-04-15 14:04:44,367 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 113 transitions. [2022-04-15 14:04:44,459 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:04:44,460 INFO L225 Difference]: With dead ends: 122 [2022-04-15 14:04:44,461 INFO L226 Difference]: Without dead ends: 81 [2022-04-15 14:04:44,461 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2022-04-15 14:04:44,462 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 30 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 14:04:44,462 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 212 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 14:04:44,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-15 14:04:44,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 78. [2022-04-15 14:04:44,559 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:04:44,559 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 78 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 47 states have internal predecessors, (50), 21 states have call successors, (21), 11 states have call predecessors, (21), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-15 14:04:44,560 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 78 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 47 states have internal predecessors, (50), 21 states have call successors, (21), 11 states have call predecessors, (21), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-15 14:04:44,560 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 78 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 47 states have internal predecessors, (50), 21 states have call successors, (21), 11 states have call predecessors, (21), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-15 14:04:44,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:04:44,562 INFO L93 Difference]: Finished difference Result 81 states and 94 transitions. [2022-04-15 14:04:44,562 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 94 transitions. [2022-04-15 14:04:44,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:04:44,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:04:44,563 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 47 states have internal predecessors, (50), 21 states have call successors, (21), 11 states have call predecessors, (21), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 81 states. [2022-04-15 14:04:44,563 INFO L87 Difference]: Start difference. First operand has 78 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 47 states have internal predecessors, (50), 21 states have call successors, (21), 11 states have call predecessors, (21), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 81 states. [2022-04-15 14:04:44,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:04:44,565 INFO L93 Difference]: Finished difference Result 81 states and 94 transitions. [2022-04-15 14:04:44,565 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 94 transitions. [2022-04-15 14:04:44,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:04:44,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:04:44,565 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:04:44,565 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:04:44,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 47 states have internal predecessors, (50), 21 states have call successors, (21), 11 states have call predecessors, (21), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-15 14:04:44,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 90 transitions. [2022-04-15 14:04:44,568 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 90 transitions. Word has length 63 [2022-04-15 14:04:44,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:04:44,568 INFO L478 AbstractCegarLoop]: Abstraction has 78 states and 90 transitions. [2022-04-15 14:04:44,568 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 5 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-15 14:04:44,568 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 78 states and 90 transitions. [2022-04-15 14:04:44,659 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:04:44,659 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 90 transitions. [2022-04-15 14:04:44,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-15 14:04:44,660 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:04:44,660 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2022-04-15 14:04:44,676 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 14:04:44,875 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 14:04:44,875 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:04:44,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:04:44,876 INFO L85 PathProgramCache]: Analyzing trace with hash -2105983492, now seen corresponding path program 1 times [2022-04-15 14:04:44,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:04:44,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2063813407] [2022-04-15 14:04:44,876 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:04:44,876 INFO L85 PathProgramCache]: Analyzing trace with hash -2105983492, now seen corresponding path program 2 times [2022-04-15 14:04:44,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:04:44,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627538805] [2022-04-15 14:04:44,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:04:44,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:04:44,891 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:04:44,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1978721481] [2022-04-15 14:04:44,891 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:04:44,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:04:44,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:04:44,892 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 14:04:44,893 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 14:04:44,940 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 14:04:44,940 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:04:44,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 14:04:44,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:04:44,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:04:46,199 INFO L272 TraceCheckUtils]: 0: Hoare triple {3860#true} call ULTIMATE.init(); {3860#true} is VALID [2022-04-15 14:04:46,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {3860#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(14, 2);call #Ultimate.allocInit(12, 3); {3860#true} is VALID [2022-04-15 14:04:46,199 INFO L290 TraceCheckUtils]: 2: Hoare triple {3860#true} assume true; {3860#true} is VALID [2022-04-15 14:04:46,199 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3860#true} {3860#true} #98#return; {3860#true} is VALID [2022-04-15 14:04:46,199 INFO L272 TraceCheckUtils]: 4: Hoare triple {3860#true} call #t~ret6 := main(); {3860#true} is VALID [2022-04-15 14:04:46,199 INFO L290 TraceCheckUtils]: 5: Hoare triple {3860#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {3860#true} is VALID [2022-04-15 14:04:46,199 INFO L272 TraceCheckUtils]: 6: Hoare triple {3860#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 1 then 1 else 0)); {3860#true} is VALID [2022-04-15 14:04:46,200 INFO L290 TraceCheckUtils]: 7: Hoare triple {3860#true} ~cond := #in~cond; {3886#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 14:04:46,200 INFO L290 TraceCheckUtils]: 8: Hoare triple {3886#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {3890#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 14:04:46,200 INFO L290 TraceCheckUtils]: 9: Hoare triple {3890#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3890#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 14:04:46,201 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3890#(not (= |assume_abort_if_not_#in~cond| 0))} {3860#true} #78#return; {3897#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 14:04:46,201 INFO L290 TraceCheckUtils]: 11: Hoare triple {3897#(and (<= 0 main_~x~0) (<= main_~x~0 1))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3897#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 14:04:46,201 INFO L272 TraceCheckUtils]: 12: Hoare triple {3897#(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)); {3860#true} is VALID [2022-04-15 14:04:46,201 INFO L290 TraceCheckUtils]: 13: Hoare triple {3860#true} ~cond := #in~cond; {3860#true} is VALID [2022-04-15 14:04:46,201 INFO L290 TraceCheckUtils]: 14: Hoare triple {3860#true} assume !(0 == ~cond); {3860#true} is VALID [2022-04-15 14:04:46,201 INFO L290 TraceCheckUtils]: 15: Hoare triple {3860#true} assume true; {3860#true} is VALID [2022-04-15 14:04:46,202 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3860#true} {3897#(and (<= 0 main_~x~0) (<= main_~x~0 1))} #80#return; {3897#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 14:04:46,202 INFO L272 TraceCheckUtils]: 17: Hoare triple {3897#(and (<= 0 main_~x~0) (<= main_~x~0 1))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3860#true} is VALID [2022-04-15 14:04:46,202 INFO L290 TraceCheckUtils]: 18: Hoare triple {3860#true} ~cond := #in~cond; {3860#true} is VALID [2022-04-15 14:04:46,202 INFO L290 TraceCheckUtils]: 19: Hoare triple {3860#true} assume !(0 == ~cond); {3860#true} is VALID [2022-04-15 14:04:46,202 INFO L290 TraceCheckUtils]: 20: Hoare triple {3860#true} assume true; {3860#true} is VALID [2022-04-15 14:04:46,205 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3860#true} {3897#(and (<= 0 main_~x~0) (<= main_~x~0 1))} #82#return; {3897#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 14:04:46,206 INFO L290 TraceCheckUtils]: 22: Hoare triple {3897#(and (<= 0 main_~x~0) (<= main_~x~0 1))} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {3934#(<= main_~r~0 1)} is VALID [2022-04-15 14:04:46,206 INFO L290 TraceCheckUtils]: 23: Hoare triple {3934#(<= main_~r~0 1)} assume !false; {3934#(<= main_~r~0 1)} is VALID [2022-04-15 14:04:46,206 INFO L272 TraceCheckUtils]: 24: Hoare triple {3934#(<= main_~r~0 1)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {3860#true} is VALID [2022-04-15 14:04:46,206 INFO L290 TraceCheckUtils]: 25: Hoare triple {3860#true} ~cond := #in~cond; {3860#true} is VALID [2022-04-15 14:04:46,206 INFO L290 TraceCheckUtils]: 26: Hoare triple {3860#true} assume !(0 == ~cond); {3860#true} is VALID [2022-04-15 14:04:46,206 INFO L290 TraceCheckUtils]: 27: Hoare triple {3860#true} assume true; {3860#true} is VALID [2022-04-15 14:04:46,206 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3860#true} {3934#(<= main_~r~0 1)} #84#return; {3934#(<= main_~r~0 1)} is VALID [2022-04-15 14:04:46,206 INFO L272 TraceCheckUtils]: 29: Hoare triple {3934#(<= main_~r~0 1)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3860#true} is VALID [2022-04-15 14:04:46,207 INFO L290 TraceCheckUtils]: 30: Hoare triple {3860#true} ~cond := #in~cond; {3860#true} is VALID [2022-04-15 14:04:46,207 INFO L290 TraceCheckUtils]: 31: Hoare triple {3860#true} assume !(0 == ~cond); {3860#true} is VALID [2022-04-15 14:04:46,207 INFO L290 TraceCheckUtils]: 32: Hoare triple {3860#true} assume true; {3860#true} is VALID [2022-04-15 14:04:46,207 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {3860#true} {3934#(<= main_~r~0 1)} #86#return; {3934#(<= main_~r~0 1)} is VALID [2022-04-15 14:04:46,207 INFO L290 TraceCheckUtils]: 34: Hoare triple {3934#(<= main_~r~0 1)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {3934#(<= main_~r~0 1)} is VALID [2022-04-15 14:04:46,207 INFO L290 TraceCheckUtils]: 35: Hoare triple {3934#(<= main_~r~0 1)} assume !false; {3934#(<= main_~r~0 1)} is VALID [2022-04-15 14:04:46,208 INFO L272 TraceCheckUtils]: 36: Hoare triple {3934#(<= main_~r~0 1)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {3860#true} is VALID [2022-04-15 14:04:46,208 INFO L290 TraceCheckUtils]: 37: Hoare triple {3860#true} ~cond := #in~cond; {3860#true} is VALID [2022-04-15 14:04:46,208 INFO L290 TraceCheckUtils]: 38: Hoare triple {3860#true} assume !(0 == ~cond); {3860#true} is VALID [2022-04-15 14:04:46,208 INFO L290 TraceCheckUtils]: 39: Hoare triple {3860#true} assume true; {3860#true} is VALID [2022-04-15 14:04:46,208 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3860#true} {3934#(<= main_~r~0 1)} #88#return; {3934#(<= main_~r~0 1)} is VALID [2022-04-15 14:04:46,208 INFO L272 TraceCheckUtils]: 41: Hoare triple {3934#(<= main_~r~0 1)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3860#true} is VALID [2022-04-15 14:04:46,208 INFO L290 TraceCheckUtils]: 42: Hoare triple {3860#true} ~cond := #in~cond; {3860#true} is VALID [2022-04-15 14:04:46,208 INFO L290 TraceCheckUtils]: 43: Hoare triple {3860#true} assume !(0 == ~cond); {3860#true} is VALID [2022-04-15 14:04:46,208 INFO L290 TraceCheckUtils]: 44: Hoare triple {3860#true} assume true; {3860#true} is VALID [2022-04-15 14:04:46,209 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3860#true} {3934#(<= main_~r~0 1)} #90#return; {3934#(<= main_~r~0 1)} is VALID [2022-04-15 14:04:46,209 INFO L272 TraceCheckUtils]: 46: Hoare triple {3934#(<= main_~r~0 1)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {3860#true} is VALID [2022-04-15 14:04:46,209 INFO L290 TraceCheckUtils]: 47: Hoare triple {3860#true} ~cond := #in~cond; {3860#true} is VALID [2022-04-15 14:04:46,209 INFO L290 TraceCheckUtils]: 48: Hoare triple {3860#true} assume !(0 == ~cond); {3860#true} is VALID [2022-04-15 14:04:46,209 INFO L290 TraceCheckUtils]: 49: Hoare triple {3860#true} assume true; {3860#true} is VALID [2022-04-15 14:04:46,209 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3860#true} {3934#(<= main_~r~0 1)} #92#return; {3934#(<= main_~r~0 1)} is VALID [2022-04-15 14:04:46,210 INFO L290 TraceCheckUtils]: 51: Hoare triple {3934#(<= main_~r~0 1)} assume !!(~r~0 >= 2 * ~b~0); {4022#(and (<= main_~r~0 1) (<= (* main_~b~0 2) main_~r~0))} is VALID [2022-04-15 14:04:46,210 INFO L272 TraceCheckUtils]: 52: Hoare triple {4022#(and (<= main_~r~0 1) (<= (* main_~b~0 2) main_~r~0))} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {3860#true} is VALID [2022-04-15 14:04:46,210 INFO L290 TraceCheckUtils]: 53: Hoare triple {3860#true} ~cond := #in~cond; {3860#true} is VALID [2022-04-15 14:04:46,210 INFO L290 TraceCheckUtils]: 54: Hoare triple {3860#true} assume !(0 == ~cond); {3860#true} is VALID [2022-04-15 14:04:46,210 INFO L290 TraceCheckUtils]: 55: Hoare triple {3860#true} assume true; {3860#true} is VALID [2022-04-15 14:04:46,210 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {3860#true} {4022#(and (<= main_~r~0 1) (<= (* main_~b~0 2) main_~r~0))} #94#return; {4022#(and (<= main_~r~0 1) (<= (* main_~b~0 2) main_~r~0))} is VALID [2022-04-15 14:04:46,211 INFO L290 TraceCheckUtils]: 57: Hoare triple {4022#(and (<= main_~r~0 1) (<= (* main_~b~0 2) main_~r~0))} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {4041#(and (<= main_~r~0 1) (<= (div (- main_~b~0) (- 2)) (div main_~r~0 2)))} is VALID [2022-04-15 14:04:46,211 INFO L290 TraceCheckUtils]: 58: Hoare triple {4041#(and (<= main_~r~0 1) (<= (div (- main_~b~0) (- 2)) (div main_~r~0 2)))} assume !false; {4041#(and (<= main_~r~0 1) (<= (div (- main_~b~0) (- 2)) (div main_~r~0 2)))} is VALID [2022-04-15 14:04:46,211 INFO L272 TraceCheckUtils]: 59: Hoare triple {4041#(and (<= main_~r~0 1) (<= (div (- main_~b~0) (- 2)) (div main_~r~0 2)))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {3860#true} is VALID [2022-04-15 14:04:46,211 INFO L290 TraceCheckUtils]: 60: Hoare triple {3860#true} ~cond := #in~cond; {3860#true} is VALID [2022-04-15 14:04:46,212 INFO L290 TraceCheckUtils]: 61: Hoare triple {3860#true} assume !(0 == ~cond); {3860#true} is VALID [2022-04-15 14:04:46,212 INFO L290 TraceCheckUtils]: 62: Hoare triple {3860#true} assume true; {3860#true} is VALID [2022-04-15 14:04:46,213 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {3860#true} {4041#(and (<= main_~r~0 1) (<= (div (- main_~b~0) (- 2)) (div main_~r~0 2)))} #88#return; {4041#(and (<= main_~r~0 1) (<= (div (- main_~b~0) (- 2)) (div main_~r~0 2)))} is VALID [2022-04-15 14:04:46,213 INFO L272 TraceCheckUtils]: 64: Hoare triple {4041#(and (<= main_~r~0 1) (<= (div (- main_~b~0) (- 2)) (div main_~r~0 2)))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3860#true} is VALID [2022-04-15 14:04:46,213 INFO L290 TraceCheckUtils]: 65: Hoare triple {3860#true} ~cond := #in~cond; {3860#true} is VALID [2022-04-15 14:04:46,213 INFO L290 TraceCheckUtils]: 66: Hoare triple {3860#true} assume !(0 == ~cond); {3860#true} is VALID [2022-04-15 14:04:46,213 INFO L290 TraceCheckUtils]: 67: Hoare triple {3860#true} assume true; {3860#true} is VALID [2022-04-15 14:04:46,214 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {3860#true} {4041#(and (<= main_~r~0 1) (<= (div (- main_~b~0) (- 2)) (div main_~r~0 2)))} #90#return; {4041#(and (<= main_~r~0 1) (<= (div (- main_~b~0) (- 2)) (div main_~r~0 2)))} is VALID [2022-04-15 14:04:46,214 INFO L272 TraceCheckUtils]: 69: Hoare triple {4041#(and (<= main_~r~0 1) (<= (div (- main_~b~0) (- 2)) (div main_~r~0 2)))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {3860#true} is VALID [2022-04-15 14:04:46,214 INFO L290 TraceCheckUtils]: 70: Hoare triple {3860#true} ~cond := #in~cond; {3860#true} is VALID [2022-04-15 14:04:46,214 INFO L290 TraceCheckUtils]: 71: Hoare triple {3860#true} assume !(0 == ~cond); {3860#true} is VALID [2022-04-15 14:04:46,214 INFO L290 TraceCheckUtils]: 72: Hoare triple {3860#true} assume true; {3860#true} is VALID [2022-04-15 14:04:46,214 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {3860#true} {4041#(and (<= main_~r~0 1) (<= (div (- main_~b~0) (- 2)) (div main_~r~0 2)))} #92#return; {4041#(and (<= main_~r~0 1) (<= (div (- main_~b~0) (- 2)) (div main_~r~0 2)))} is VALID [2022-04-15 14:04:46,215 INFO L290 TraceCheckUtils]: 74: Hoare triple {4041#(and (<= main_~r~0 1) (<= (div (- main_~b~0) (- 2)) (div main_~r~0 2)))} assume !(~r~0 >= 2 * ~b~0); {3861#false} is VALID [2022-04-15 14:04:46,215 INFO L290 TraceCheckUtils]: 75: Hoare triple {3861#false} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {3861#false} is VALID [2022-04-15 14:04:46,215 INFO L290 TraceCheckUtils]: 76: Hoare triple {3861#false} assume !false; {3861#false} is VALID [2022-04-15 14:04:46,215 INFO L272 TraceCheckUtils]: 77: Hoare triple {3861#false} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {3861#false} is VALID [2022-04-15 14:04:46,215 INFO L290 TraceCheckUtils]: 78: Hoare triple {3861#false} ~cond := #in~cond; {3861#false} is VALID [2022-04-15 14:04:46,215 INFO L290 TraceCheckUtils]: 79: Hoare triple {3861#false} assume !(0 == ~cond); {3861#false} is VALID [2022-04-15 14:04:46,215 INFO L290 TraceCheckUtils]: 80: Hoare triple {3861#false} assume true; {3861#false} is VALID [2022-04-15 14:04:46,215 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {3861#false} {3861#false} #84#return; {3861#false} is VALID [2022-04-15 14:04:46,215 INFO L272 TraceCheckUtils]: 82: Hoare triple {3861#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3861#false} is VALID [2022-04-15 14:04:46,216 INFO L290 TraceCheckUtils]: 83: Hoare triple {3861#false} ~cond := #in~cond; {3861#false} is VALID [2022-04-15 14:04:46,216 INFO L290 TraceCheckUtils]: 84: Hoare triple {3861#false} assume 0 == ~cond; {3861#false} is VALID [2022-04-15 14:04:46,216 INFO L290 TraceCheckUtils]: 85: Hoare triple {3861#false} assume !false; {3861#false} is VALID [2022-04-15 14:04:46,216 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 62 proven. 6 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2022-04-15 14:04:46,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 14:04:46,530 INFO L290 TraceCheckUtils]: 85: Hoare triple {3861#false} assume !false; {3861#false} is VALID [2022-04-15 14:04:46,530 INFO L290 TraceCheckUtils]: 84: Hoare triple {3861#false} assume 0 == ~cond; {3861#false} is VALID [2022-04-15 14:04:46,531 INFO L290 TraceCheckUtils]: 83: Hoare triple {3861#false} ~cond := #in~cond; {3861#false} is VALID [2022-04-15 14:04:46,531 INFO L272 TraceCheckUtils]: 82: Hoare triple {3861#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3861#false} is VALID [2022-04-15 14:04:46,531 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {3860#true} {3861#false} #84#return; {3861#false} is VALID [2022-04-15 14:04:46,531 INFO L290 TraceCheckUtils]: 80: Hoare triple {3860#true} assume true; {3860#true} is VALID [2022-04-15 14:04:46,531 INFO L290 TraceCheckUtils]: 79: Hoare triple {3860#true} assume !(0 == ~cond); {3860#true} is VALID [2022-04-15 14:04:46,531 INFO L290 TraceCheckUtils]: 78: Hoare triple {3860#true} ~cond := #in~cond; {3860#true} is VALID [2022-04-15 14:04:46,531 INFO L272 TraceCheckUtils]: 77: Hoare triple {3861#false} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {3860#true} is VALID [2022-04-15 14:04:46,531 INFO L290 TraceCheckUtils]: 76: Hoare triple {3861#false} assume !false; {3861#false} is VALID [2022-04-15 14:04:46,531 INFO L290 TraceCheckUtils]: 75: Hoare triple {3861#false} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {3861#false} is VALID [2022-04-15 14:04:46,531 INFO L290 TraceCheckUtils]: 74: Hoare triple {4159#(<= (* main_~b~0 2) main_~r~0)} assume !(~r~0 >= 2 * ~b~0); {3861#false} is VALID [2022-04-15 14:04:46,533 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {3860#true} {4159#(<= (* main_~b~0 2) main_~r~0)} #92#return; {4159#(<= (* main_~b~0 2) main_~r~0)} is VALID [2022-04-15 14:04:46,533 INFO L290 TraceCheckUtils]: 72: Hoare triple {3860#true} assume true; {3860#true} is VALID [2022-04-15 14:04:46,533 INFO L290 TraceCheckUtils]: 71: Hoare triple {3860#true} assume !(0 == ~cond); {3860#true} is VALID [2022-04-15 14:04:46,534 INFO L290 TraceCheckUtils]: 70: Hoare triple {3860#true} ~cond := #in~cond; {3860#true} is VALID [2022-04-15 14:04:46,534 INFO L272 TraceCheckUtils]: 69: Hoare triple {4159#(<= (* main_~b~0 2) main_~r~0)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {3860#true} is VALID [2022-04-15 14:04:46,534 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {3860#true} {4159#(<= (* main_~b~0 2) main_~r~0)} #90#return; {4159#(<= (* main_~b~0 2) main_~r~0)} is VALID [2022-04-15 14:04:46,534 INFO L290 TraceCheckUtils]: 67: Hoare triple {3860#true} assume true; {3860#true} is VALID [2022-04-15 14:04:46,534 INFO L290 TraceCheckUtils]: 66: Hoare triple {3860#true} assume !(0 == ~cond); {3860#true} is VALID [2022-04-15 14:04:46,534 INFO L290 TraceCheckUtils]: 65: Hoare triple {3860#true} ~cond := #in~cond; {3860#true} is VALID [2022-04-15 14:04:46,534 INFO L272 TraceCheckUtils]: 64: Hoare triple {4159#(<= (* main_~b~0 2) main_~r~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3860#true} is VALID [2022-04-15 14:04:46,535 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {3860#true} {4159#(<= (* main_~b~0 2) main_~r~0)} #88#return; {4159#(<= (* main_~b~0 2) main_~r~0)} is VALID [2022-04-15 14:04:46,535 INFO L290 TraceCheckUtils]: 62: Hoare triple {3860#true} assume true; {3860#true} is VALID [2022-04-15 14:04:46,535 INFO L290 TraceCheckUtils]: 61: Hoare triple {3860#true} assume !(0 == ~cond); {3860#true} is VALID [2022-04-15 14:04:46,535 INFO L290 TraceCheckUtils]: 60: Hoare triple {3860#true} ~cond := #in~cond; {3860#true} is VALID [2022-04-15 14:04:46,535 INFO L272 TraceCheckUtils]: 59: Hoare triple {4159#(<= (* main_~b~0 2) main_~r~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {3860#true} is VALID [2022-04-15 14:04:46,535 INFO L290 TraceCheckUtils]: 58: Hoare triple {4159#(<= (* main_~b~0 2) main_~r~0)} assume !false; {4159#(<= (* main_~b~0 2) main_~r~0)} is VALID [2022-04-15 14:04:46,536 INFO L290 TraceCheckUtils]: 57: Hoare triple {4211#(<= (* main_~b~0 2) (div main_~r~0 2))} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {4159#(<= (* main_~b~0 2) main_~r~0)} is VALID [2022-04-15 14:04:46,536 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {3860#true} {4211#(<= (* main_~b~0 2) (div main_~r~0 2))} #94#return; {4211#(<= (* main_~b~0 2) (div main_~r~0 2))} is VALID [2022-04-15 14:04:46,536 INFO L290 TraceCheckUtils]: 55: Hoare triple {3860#true} assume true; {3860#true} is VALID [2022-04-15 14:04:46,536 INFO L290 TraceCheckUtils]: 54: Hoare triple {3860#true} assume !(0 == ~cond); {3860#true} is VALID [2022-04-15 14:04:46,536 INFO L290 TraceCheckUtils]: 53: Hoare triple {3860#true} ~cond := #in~cond; {3860#true} is VALID [2022-04-15 14:04:46,536 INFO L272 TraceCheckUtils]: 52: Hoare triple {4211#(<= (* main_~b~0 2) (div main_~r~0 2))} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {3860#true} is VALID [2022-04-15 14:04:46,537 INFO L290 TraceCheckUtils]: 51: Hoare triple {4230#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 2) (div main_~r~0 2)))} assume !!(~r~0 >= 2 * ~b~0); {4211#(<= (* main_~b~0 2) (div main_~r~0 2))} is VALID [2022-04-15 14:04:46,537 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3860#true} {4230#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 2) (div main_~r~0 2)))} #92#return; {4230#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 2) (div main_~r~0 2)))} is VALID [2022-04-15 14:04:46,537 INFO L290 TraceCheckUtils]: 49: Hoare triple {3860#true} assume true; {3860#true} is VALID [2022-04-15 14:04:46,537 INFO L290 TraceCheckUtils]: 48: Hoare triple {3860#true} assume !(0 == ~cond); {3860#true} is VALID [2022-04-15 14:04:46,537 INFO L290 TraceCheckUtils]: 47: Hoare triple {3860#true} ~cond := #in~cond; {3860#true} is VALID [2022-04-15 14:04:46,537 INFO L272 TraceCheckUtils]: 46: Hoare triple {4230#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 2) (div main_~r~0 2)))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {3860#true} is VALID [2022-04-15 14:04:46,538 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3860#true} {4230#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 2) (div main_~r~0 2)))} #90#return; {4230#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 2) (div main_~r~0 2)))} is VALID [2022-04-15 14:04:46,538 INFO L290 TraceCheckUtils]: 44: Hoare triple {3860#true} assume true; {3860#true} is VALID [2022-04-15 14:04:46,538 INFO L290 TraceCheckUtils]: 43: Hoare triple {3860#true} assume !(0 == ~cond); {3860#true} is VALID [2022-04-15 14:04:46,538 INFO L290 TraceCheckUtils]: 42: Hoare triple {3860#true} ~cond := #in~cond; {3860#true} is VALID [2022-04-15 14:04:46,538 INFO L272 TraceCheckUtils]: 41: Hoare triple {4230#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 2) (div main_~r~0 2)))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3860#true} is VALID [2022-04-15 14:04:46,538 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3860#true} {4230#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 2) (div main_~r~0 2)))} #88#return; {4230#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 2) (div main_~r~0 2)))} is VALID [2022-04-15 14:04:46,538 INFO L290 TraceCheckUtils]: 39: Hoare triple {3860#true} assume true; {3860#true} is VALID [2022-04-15 14:04:46,538 INFO L290 TraceCheckUtils]: 38: Hoare triple {3860#true} assume !(0 == ~cond); {3860#true} is VALID [2022-04-15 14:04:46,539 INFO L290 TraceCheckUtils]: 37: Hoare triple {3860#true} ~cond := #in~cond; {3860#true} is VALID [2022-04-15 14:04:46,539 INFO L272 TraceCheckUtils]: 36: Hoare triple {4230#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 2) (div main_~r~0 2)))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {3860#true} is VALID [2022-04-15 14:04:46,539 INFO L290 TraceCheckUtils]: 35: Hoare triple {4230#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 2) (div main_~r~0 2)))} assume !false; {4230#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 2) (div main_~r~0 2)))} is VALID [2022-04-15 14:04:46,539 INFO L290 TraceCheckUtils]: 34: Hoare triple {3934#(<= main_~r~0 1)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {4230#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 2) (div main_~r~0 2)))} is VALID [2022-04-15 14:04:46,540 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {3860#true} {3934#(<= main_~r~0 1)} #86#return; {3934#(<= main_~r~0 1)} is VALID [2022-04-15 14:04:46,540 INFO L290 TraceCheckUtils]: 32: Hoare triple {3860#true} assume true; {3860#true} is VALID [2022-04-15 14:04:46,540 INFO L290 TraceCheckUtils]: 31: Hoare triple {3860#true} assume !(0 == ~cond); {3860#true} is VALID [2022-04-15 14:04:46,540 INFO L290 TraceCheckUtils]: 30: Hoare triple {3860#true} ~cond := #in~cond; {3860#true} is VALID [2022-04-15 14:04:46,540 INFO L272 TraceCheckUtils]: 29: Hoare triple {3934#(<= main_~r~0 1)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3860#true} is VALID [2022-04-15 14:04:46,540 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3860#true} {3934#(<= main_~r~0 1)} #84#return; {3934#(<= main_~r~0 1)} is VALID [2022-04-15 14:04:46,540 INFO L290 TraceCheckUtils]: 27: Hoare triple {3860#true} assume true; {3860#true} is VALID [2022-04-15 14:04:46,541 INFO L290 TraceCheckUtils]: 26: Hoare triple {3860#true} assume !(0 == ~cond); {3860#true} is VALID [2022-04-15 14:04:46,541 INFO L290 TraceCheckUtils]: 25: Hoare triple {3860#true} ~cond := #in~cond; {3860#true} is VALID [2022-04-15 14:04:46,541 INFO L272 TraceCheckUtils]: 24: Hoare triple {3934#(<= main_~r~0 1)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {3860#true} is VALID [2022-04-15 14:04:46,541 INFO L290 TraceCheckUtils]: 23: Hoare triple {3934#(<= main_~r~0 1)} assume !false; {3934#(<= main_~r~0 1)} is VALID [2022-04-15 14:04:46,541 INFO L290 TraceCheckUtils]: 22: Hoare triple {4318#(<= main_~x~0 1)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {3934#(<= main_~r~0 1)} is VALID [2022-04-15 14:04:46,541 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3860#true} {4318#(<= main_~x~0 1)} #82#return; {4318#(<= main_~x~0 1)} is VALID [2022-04-15 14:04:46,542 INFO L290 TraceCheckUtils]: 20: Hoare triple {3860#true} assume true; {3860#true} is VALID [2022-04-15 14:04:46,542 INFO L290 TraceCheckUtils]: 19: Hoare triple {3860#true} assume !(0 == ~cond); {3860#true} is VALID [2022-04-15 14:04:46,542 INFO L290 TraceCheckUtils]: 18: Hoare triple {3860#true} ~cond := #in~cond; {3860#true} is VALID [2022-04-15 14:04:46,542 INFO L272 TraceCheckUtils]: 17: Hoare triple {4318#(<= main_~x~0 1)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3860#true} is VALID [2022-04-15 14:04:46,542 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3860#true} {4318#(<= main_~x~0 1)} #80#return; {4318#(<= main_~x~0 1)} is VALID [2022-04-15 14:04:46,542 INFO L290 TraceCheckUtils]: 15: Hoare triple {3860#true} assume true; {3860#true} is VALID [2022-04-15 14:04:46,542 INFO L290 TraceCheckUtils]: 14: Hoare triple {3860#true} assume !(0 == ~cond); {3860#true} is VALID [2022-04-15 14:04:46,542 INFO L290 TraceCheckUtils]: 13: Hoare triple {3860#true} ~cond := #in~cond; {3860#true} is VALID [2022-04-15 14:04:46,542 INFO L272 TraceCheckUtils]: 12: Hoare triple {4318#(<= main_~x~0 1)} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 1 then 1 else 0)); {3860#true} is VALID [2022-04-15 14:04:46,543 INFO L290 TraceCheckUtils]: 11: Hoare triple {4318#(<= main_~x~0 1)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4318#(<= main_~x~0 1)} is VALID [2022-04-15 14:04:46,543 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3890#(not (= |assume_abort_if_not_#in~cond| 0))} {3860#true} #78#return; {4318#(<= main_~x~0 1)} is VALID [2022-04-15 14:04:46,543 INFO L290 TraceCheckUtils]: 9: Hoare triple {3890#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3890#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 14:04:46,543 INFO L290 TraceCheckUtils]: 8: Hoare triple {4364#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {3890#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 14:04:46,544 INFO L290 TraceCheckUtils]: 7: Hoare triple {3860#true} ~cond := #in~cond; {4364#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-15 14:04:46,544 INFO L272 TraceCheckUtils]: 6: Hoare triple {3860#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 1 then 1 else 0)); {3860#true} is VALID [2022-04-15 14:04:46,544 INFO L290 TraceCheckUtils]: 5: Hoare triple {3860#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {3860#true} is VALID [2022-04-15 14:04:46,544 INFO L272 TraceCheckUtils]: 4: Hoare triple {3860#true} call #t~ret6 := main(); {3860#true} is VALID [2022-04-15 14:04:46,544 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3860#true} {3860#true} #98#return; {3860#true} is VALID [2022-04-15 14:04:46,544 INFO L290 TraceCheckUtils]: 2: Hoare triple {3860#true} assume true; {3860#true} is VALID [2022-04-15 14:04:46,544 INFO L290 TraceCheckUtils]: 1: Hoare triple {3860#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(14, 2);call #Ultimate.allocInit(12, 3); {3860#true} is VALID [2022-04-15 14:04:46,544 INFO L272 TraceCheckUtils]: 0: Hoare triple {3860#true} call ULTIMATE.init(); {3860#true} is VALID [2022-04-15 14:04:46,544 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 23 proven. 11 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2022-04-15 14:04:46,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:04:46,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627538805] [2022-04-15 14:04:46,545 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:04:46,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1978721481] [2022-04-15 14:04:46,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1978721481] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 14:04:46,545 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 14:04:46,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 13 [2022-04-15 14:04:46,545 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:04:46,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2063813407] [2022-04-15 14:04:46,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2063813407] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:04:46,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:04:46,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 14:04:46,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164715835] [2022-04-15 14:04:46,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:04:46,546 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 6 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) Word has length 86 [2022-04-15 14:04:46,546 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:04:46,546 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 6 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-15 14:04:46,590 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:04:46,590 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 14:04:46,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:04:46,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 14:04:46,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-15 14:04:46,591 INFO L87 Difference]: Start difference. First operand 78 states and 90 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 6 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-15 14:04:46,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:04:46,875 INFO L93 Difference]: Finished difference Result 88 states and 99 transitions. [2022-04-15 14:04:46,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 14:04:46,875 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 6 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) Word has length 86 [2022-04-15 14:04:46,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:04:46,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 6 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-15 14:04:46,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 75 transitions. [2022-04-15 14:04:46,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 6 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-15 14:04:46,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 75 transitions. [2022-04-15 14:04:46,878 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 75 transitions. [2022-04-15 14:04:46,917 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:04:46,917 INFO L225 Difference]: With dead ends: 88 [2022-04-15 14:04:46,917 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 14:04:46,918 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 159 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2022-04-15 14:04:46,918 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 11 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 14:04:46,919 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 129 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 14:04:46,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 14:04:46,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 14:04:46,919 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:04:46,919 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 14:04:46,919 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 14:04:46,919 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 14:04:46,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:04:46,919 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 14:04:46,919 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 14:04:46,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:04:46,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:04:46,920 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 14:04:46,920 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 14:04:46,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:04:46,920 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 14:04:46,920 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 14:04:46,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:04:46,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:04:46,920 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:04:46,920 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:04:46,920 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 14:04:46,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 14:04:46,920 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 86 [2022-04-15 14:04:46,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:04:46,920 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 14:04:46,921 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 6 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-15 14:04:46,921 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-15 14:04:46,921 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 14:04:46,921 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 14:04:46,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:04:46,923 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 14:04:46,953 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 14:04:47,131 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 14:04:47,133 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 14:04:48,176 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 8) no Hoare annotation was computed. [2022-04-15 14:04:48,177 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 8) no Hoare annotation was computed. [2022-04-15 14:04:48,177 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 8) no Hoare annotation was computed. [2022-04-15 14:04:48,177 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 11 13) the Hoare annotation is: true [2022-04-15 14:04:48,177 INFO L878 garLoopResultBuilder]: At program point L12(line 12) the Hoare annotation is: (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|) [2022-04-15 14:04:48,177 INFO L878 garLoopResultBuilder]: At program point L12-2(lines 11 13) 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 14:04:48,177 INFO L878 garLoopResultBuilder]: At program point assume_abort_if_notEXIT(lines 11 13) 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 14:04:48,177 INFO L885 garLoopResultBuilder]: At program point L64(line 64) the Hoare annotation is: true [2022-04-15 14:04:48,177 INFO L878 garLoopResultBuilder]: At program point L31(line 31) the Hoare annotation is: (and (<= 0 main_~x~0) (<= main_~x~0 1) (<= 1 main_~y~0) (<= main_~y~0 1)) [2022-04-15 14:04:48,177 INFO L878 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: (and (<= 0 main_~x~0) (<= main_~x~0 1)) [2022-04-15 14:04:48,177 INFO L878 garLoopResultBuilder]: At program point L29-1(line 29) the Hoare annotation is: (and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 1) (<= main_~y~0 1)) [2022-04-15 14:04:48,177 INFO L885 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: true [2022-04-15 14:04:48,177 INFO L878 garLoopResultBuilder]: At program point L27-1(line 27) the Hoare annotation is: (and (<= 0 main_~x~0) (<= main_~x~0 1)) [2022-04-15 14:04:48,178 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 22 66) the Hoare annotation is: true [2022-04-15 14:04:48,178 INFO L878 garLoopResultBuilder]: At program point L50(lines 47 59) the Hoare annotation is: (let ((.cse0 (= main_~x~0 main_~r~0)) (.cse1 (<= main_~x~0 1)) (.cse2 (<= 1 main_~r~0)) (.cse3 (= main_~q~0 0)) (.cse4 (<= 1 main_~y~0)) (.cse5 (= main_~b~0 (* main_~a~0 main_~y~0))) (.cse6 (<= main_~y~0 1))) (or (and .cse0 .cse1 .cse2 (= main_~b~0 main_~y~0) .cse3 .cse4 .cse5 .cse6) (and .cse0 (<= (div (* (- 1) main_~b~0) (- 2)) (div main_~r~0 2)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2022-04-15 14:04:48,178 INFO L878 garLoopResultBuilder]: At program point L48(line 48) the Hoare annotation is: (let ((.cse0 (= main_~x~0 main_~r~0)) (.cse1 (<= main_~x~0 1)) (.cse2 (<= 1 main_~r~0)) (.cse3 (= main_~q~0 0)) (.cse4 (<= 1 main_~y~0)) (.cse5 (= main_~b~0 (* main_~a~0 main_~y~0))) (.cse6 (<= main_~y~0 1))) (or (and .cse0 .cse1 .cse2 (= main_~b~0 main_~y~0) .cse3 .cse4 .cse5 .cse6) (and .cse0 (<= (div (* (- 1) main_~b~0) (- 2)) (div main_~r~0 2)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2022-04-15 14:04:48,178 INFO L878 garLoopResultBuilder]: At program point L48-1(line 48) the Hoare annotation is: (let ((.cse0 (= main_~x~0 main_~r~0)) (.cse1 (<= main_~x~0 1)) (.cse2 (<= 1 main_~r~0)) (.cse3 (= main_~q~0 0)) (.cse4 (<= 1 main_~y~0)) (.cse5 (= main_~b~0 (* main_~a~0 main_~y~0))) (.cse6 (<= main_~y~0 1))) (or (and .cse0 .cse1 .cse2 (= main_~b~0 main_~y~0) .cse3 .cse4 .cse5 .cse6) (and .cse0 (<= (div (* (- 1) main_~b~0) (- 2)) (div main_~r~0 2)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2022-04-15 14:04:48,178 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 22 66) the Hoare annotation is: true [2022-04-15 14:04:48,178 INFO L878 garLoopResultBuilder]: At program point L40(lines 38 62) the Hoare annotation is: (let ((.cse0 (= main_~b~0 (* main_~a~0 main_~y~0))) (.cse1 (<= main_~y~0 1))) (or (and (= main_~x~0 (+ main_~y~0 main_~r~0)) (= main_~q~0 1) .cse0 .cse1 (<= main_~y~0 main_~x~0) (< (* main_~r~0 2) main_~x~0)) (and (= main_~x~0 main_~r~0) (<= (div (* (- 1) main_~b~0) (- 2)) (div main_~r~0 2)) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~q~0 0) (<= 1 main_~y~0) .cse0 .cse1))) [2022-04-15 14:04:48,178 INFO L878 garLoopResultBuilder]: At program point L38-2(lines 38 62) the Hoare annotation is: (let ((.cse0 (= main_~b~0 (* main_~a~0 main_~y~0))) (.cse1 (<= main_~y~0 1))) (or (and (= main_~x~0 (+ main_~y~0 main_~r~0)) (= main_~q~0 1) .cse0 .cse1 (<= main_~y~0 main_~x~0) (< (* main_~r~0 2) main_~x~0)) (and (= main_~x~0 main_~r~0) (<= (div (* (- 1) main_~b~0) (- 2)) (div main_~r~0 2)) (= main_~b~0 0) (<= main_~x~0 1) (= main_~q~0 0) (<= 1 main_~y~0) .cse0 .cse1))) [2022-04-15 14:04:48,178 INFO L878 garLoopResultBuilder]: At program point L38-3(lines 38 62) the Hoare annotation is: (let ((.cse0 (<= main_~y~0 1))) (or (and (= main_~x~0 (+ main_~y~0 main_~r~0)) (= main_~q~0 1) (= main_~b~0 (* main_~a~0 main_~y~0)) .cse0 (<= main_~y~0 main_~x~0) (< (* main_~r~0 2) main_~x~0)) (and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0) .cse0))) [2022-04-15 14:04:48,178 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 22 66) the Hoare annotation is: true [2022-04-15 14:04:48,178 INFO L878 garLoopResultBuilder]: At program point L55(line 55) the Hoare annotation is: (let ((.cse0 (* main_~a~0 main_~y~0))) (and (= main_~x~0 main_~r~0) (<= (* 2 .cse0) main_~r~0) (<= main_~x~0 1) (<= 1 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~b~0 .cse0) (<= main_~y~0 1))) [2022-04-15 14:04:48,178 INFO L878 garLoopResultBuilder]: At program point L55-1(line 55) the Hoare annotation is: (let ((.cse0 (* main_~a~0 main_~y~0))) (and (= main_~x~0 main_~r~0) (<= (* 2 .cse0) main_~r~0) (<= main_~x~0 1) (<= 1 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~b~0 .cse0) (<= main_~y~0 1))) [2022-04-15 14:04:48,178 INFO L878 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: (let ((.cse0 (= main_~x~0 main_~r~0)) (.cse1 (<= main_~x~0 1)) (.cse2 (<= 1 main_~r~0)) (.cse3 (= main_~q~0 0)) (.cse4 (<= 1 main_~y~0)) (.cse5 (= main_~b~0 (* main_~a~0 main_~y~0))) (.cse6 (<= main_~y~0 1))) (or (and .cse0 .cse1 .cse2 (= main_~b~0 main_~y~0) .cse3 .cse4 .cse5 .cse6) (and .cse0 (<= (div (* (- 1) main_~b~0) (- 2)) (div main_~r~0 2)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2022-04-15 14:04:48,178 INFO L878 garLoopResultBuilder]: At program point L47-2(lines 47 59) the Hoare annotation is: (let ((.cse0 (= main_~x~0 main_~r~0)) (.cse1 (<= main_~x~0 1)) (.cse2 (<= 1 main_~r~0)) (.cse3 (= main_~q~0 0)) (.cse4 (<= 1 main_~y~0)) (.cse5 (= main_~b~0 (* main_~a~0 main_~y~0))) (.cse6 (<= main_~y~0 1))) (or (and .cse0 .cse1 .cse2 (= main_~b~0 main_~y~0) .cse3 .cse4 .cse5 .cse6) (and .cse0 (<= (div (* (- 1) main_~b~0) (- 2)) (div main_~r~0 2)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2022-04-15 14:04:48,179 INFO L878 garLoopResultBuilder]: At program point L47-3(lines 47 59) the Hoare annotation is: (and (= main_~x~0 main_~r~0) (<= main_~x~0 1) (<= 1 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~b~0 (* main_~a~0 main_~y~0)) (<= main_~y~0 1)) [2022-04-15 14:04:48,179 INFO L878 garLoopResultBuilder]: At program point L39(line 39) the Hoare annotation is: (let ((.cse0 (= main_~b~0 (* main_~a~0 main_~y~0))) (.cse1 (<= main_~y~0 1))) (or (and (= main_~x~0 (+ main_~y~0 main_~r~0)) (= main_~q~0 1) .cse0 .cse1 (<= main_~y~0 main_~x~0) (< (* main_~r~0 2) main_~x~0)) (and (= main_~x~0 main_~r~0) (<= (div (* (- 1) main_~b~0) (- 2)) (div main_~r~0 2)) (= main_~b~0 0) (<= main_~x~0 1) (= main_~q~0 0) (<= 1 main_~y~0) .cse0 .cse1))) [2022-04-15 14:04:48,179 INFO L878 garLoopResultBuilder]: At program point L39-1(line 39) the Hoare annotation is: (let ((.cse0 (= main_~b~0 (* main_~a~0 main_~y~0))) (.cse1 (<= main_~y~0 1))) (or (and (= main_~x~0 (+ main_~y~0 main_~r~0)) (= main_~q~0 1) .cse0 .cse1 (<= main_~y~0 main_~x~0) (< (* main_~r~0 2) main_~x~0)) (and (= main_~x~0 main_~r~0) (<= (div (* (- 1) main_~b~0) (- 2)) (div main_~r~0 2)) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~q~0 0) (<= 1 main_~y~0) .cse0 .cse1))) [2022-04-15 14:04:48,179 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-15 14:04:48,179 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 14:04:48,179 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-15 14:04:48,179 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-15 14:04:48,179 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 14:04:48,179 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 14:04:48,179 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-15 14:04:48,179 INFO L878 garLoopResultBuilder]: At program point L16(lines 16 17) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-15 14:04:48,179 INFO L878 garLoopResultBuilder]: At program point L15(lines 15 18) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-15 14:04:48,179 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 20) the Hoare annotation is: true [2022-04-15 14:04:48,179 INFO L878 garLoopResultBuilder]: At program point L15-2(lines 14 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-15 14:04:48,179 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 14 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-15 14:04:48,180 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-15 14:04:48,181 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2, 2] [2022-04-15 14:04:48,182 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 14:04:48,184 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 14:04:48,185 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-15 14:04:48,219 INFO L163 areAnnotationChecker]: CFG has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 14:04:48,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 02:04:48 BoogieIcfgContainer [2022-04-15 14:04:48,228 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 14:04:48,229 INFO L158 Benchmark]: Toolchain (without parser) took 38351.75ms. Allocated memory was 184.5MB in the beginning and 267.4MB in the end (delta: 82.8MB). Free memory was 136.1MB in the beginning and 184.5MB in the end (delta: -48.4MB). Peak memory consumption was 130.4MB. Max. memory is 8.0GB. [2022-04-15 14:04:48,229 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 184.5MB. Free memory was 152.6MB in the beginning and 152.5MB in the end (delta: 136.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 14:04:48,230 INFO L158 Benchmark]: CACSL2BoogieTranslator took 216.29ms. Allocated memory is still 184.5MB. Free memory was 136.0MB in the beginning and 160.8MB in the end (delta: -24.9MB). Peak memory consumption was 11.1MB. Max. memory is 8.0GB. [2022-04-15 14:04:48,230 INFO L158 Benchmark]: Boogie Preprocessor took 18.04ms. Allocated memory is still 184.5MB. Free memory was 160.8MB in the beginning and 159.4MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 14:04:48,230 INFO L158 Benchmark]: RCFGBuilder took 291.00ms. Allocated memory is still 184.5MB. Free memory was 159.4MB in the beginning and 147.1MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-15 14:04:48,230 INFO L158 Benchmark]: TraceAbstraction took 37821.47ms. Allocated memory was 184.5MB in the beginning and 267.4MB in the end (delta: 82.8MB). Free memory was 146.8MB in the beginning and 184.5MB in the end (delta: -37.8MB). Peak memory consumption was 142.3MB. Max. memory is 8.0GB. [2022-04-15 14:04:48,232 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.12ms. Allocated memory is still 184.5MB. Free memory was 152.6MB in the beginning and 152.5MB in the end (delta: 136.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 216.29ms. Allocated memory is still 184.5MB. Free memory was 136.0MB in the beginning and 160.8MB in the end (delta: -24.9MB). Peak memory consumption was 11.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 18.04ms. Allocated memory is still 184.5MB. Free memory was 160.8MB in the beginning and 159.4MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 291.00ms. Allocated memory is still 184.5MB. Free memory was 159.4MB in the beginning and 147.1MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 37821.47ms. Allocated memory was 184.5MB in the beginning and 267.4MB in the end (delta: 82.8MB). Free memory was 146.8MB in the beginning and 184.5MB in the end (delta: -37.8MB). Peak memory consumption was 142.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 37.7s, OverallIterations: 8, TraceHistogramMax: 11, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 185 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 141 mSDsluCounter, 1094 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 801 mSDsCounter, 83 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 834 IncrementalHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 83 mSolverCounterUnsat, 293 mSDtfsCounter, 834 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 590 GetRequests, 512 SyntacticMatches, 4 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=7, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 8 MinimizatonAttempts, 7 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 39 LocationsWithAnnotation, 259 PreInvPairs, 341 NumberOfFragments, 780 HoareAnnotationTreeSize, 259 FomulaSimplifications, 56 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 39 FomulaSimplificationsInter, 564 FormulaSimplificationTreeSizeReductionInter, 0.9s 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: 47]: Loop Invariant Derived loop invariant: (((((((x == r && x <= 1) && 1 <= r) && b == y) && q == 0) && 1 <= y) && b == a * y) && y <= 1) || (((((((x == r && -1 * b / -2 <= r / 2) && x <= 1) && 1 <= r) && q == 0) && 1 <= y) && b == a * y) && y <= 1) - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: (((((x == y + r && q == 1) && b == a * y) && y <= 1) && y <= x) && r * 2 < x) || (((((((x == r && -1 * b / -2 <= r / 2) && b == 0) && x <= 1) && q == 0) && 1 <= y) && b == a * y) && y <= 1) - ProcedureContractResult [Line: 11]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not: !(\old(cond) == 0) && cond == \old(cond) - ProcedureContractResult [Line: 22]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == cond || !(1 <= \old(cond)) RESULT: Ultimate proved your program to be correct! [2022-04-15 14:04:48,249 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...