/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_unwindbound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 14:03:11,122 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 14:03:11,123 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 14:03:11,156 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 14:03:11,157 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 14:03:11,157 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 14:03:11,158 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 14:03:11,159 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 14:03:11,160 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 14:03:11,161 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 14:03:11,161 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 14:03:11,162 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 14:03:11,162 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 14:03:11,163 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 14:03:11,164 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 14:03:11,165 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 14:03:11,165 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 14:03:11,166 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 14:03:11,167 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 14:03:11,168 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 14:03:11,169 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 14:03:11,177 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 14:03:11,177 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 14:03:11,178 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 14:03:11,179 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 14:03:11,181 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 14:03:11,181 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 14:03:11,181 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 14:03:11,182 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 14:03:11,182 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 14:03:11,183 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 14:03:11,183 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 14:03:11,184 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 14:03:11,184 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 14:03:11,185 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 14:03:11,185 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 14:03:11,185 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 14:03:11,186 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 14:03:11,186 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 14:03:11,186 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 14:03:11,193 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 14:03:11,196 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 14:03:11,196 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:03:11,209 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 14:03:11,210 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 14:03:11,210 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 14:03:11,210 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 14:03:11,211 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 14:03:11,211 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 14:03:11,211 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 14:03:11,211 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 14:03:11,211 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 14:03:11,212 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 14:03:11,212 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 14:03:11,212 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 14:03:11,212 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 14:03:11,212 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 14:03:11,212 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 14:03:11,212 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 14:03:11,212 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 14:03:11,212 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 14:03:11,212 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 14:03:11,212 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 14:03:11,213 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 14:03:11,213 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 14:03:11,213 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:03:11,373 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 14:03:11,386 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 14:03:11,388 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 14:03:11,389 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 14:03:11,389 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 14:03:11,390 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/cohendiv-ll_unwindbound20.c [2022-04-15 14:03:11,439 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec1a0da4b/b5375b1b5907438a9892f07298c61332/FLAG351cde8fc [2022-04-15 14:03:11,789 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 14:03:11,789 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohendiv-ll_unwindbound20.c [2022-04-15 14:03:11,794 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec1a0da4b/b5375b1b5907438a9892f07298c61332/FLAG351cde8fc [2022-04-15 14:03:12,221 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec1a0da4b/b5375b1b5907438a9892f07298c61332 [2022-04-15 14:03:12,223 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 14:03:12,224 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 14:03:12,225 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 14:03:12,225 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 14:03:12,227 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 14:03:12,228 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 02:03:12" (1/1) ... [2022-04-15 14:03:12,228 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c6cb657 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:03:12, skipping insertion in model container [2022-04-15 14:03:12,228 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 02:03:12" (1/1) ... [2022-04-15 14:03:12,233 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 14:03:12,241 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 14:03:12,363 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_unwindbound20.c[576,589] [2022-04-15 14:03:12,386 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 14:03:12,393 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 14:03:12,403 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_unwindbound20.c[576,589] [2022-04-15 14:03:12,418 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 14:03:12,428 INFO L208 MainTranslator]: Completed translation [2022-04-15 14:03:12,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:03:12 WrapperNode [2022-04-15 14:03:12,429 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 14:03:12,430 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 14:03:12,430 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 14:03:12,430 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 14:03:12,446 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:03:12" (1/1) ... [2022-04-15 14:03:12,447 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:03:12" (1/1) ... [2022-04-15 14:03:12,452 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:03:12" (1/1) ... [2022-04-15 14:03:12,452 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:03:12" (1/1) ... [2022-04-15 14:03:12,468 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:03:12" (1/1) ... [2022-04-15 14:03:12,473 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:03:12" (1/1) ... [2022-04-15 14:03:12,477 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:03:12" (1/1) ... [2022-04-15 14:03:12,480 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 14:03:12,481 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 14:03:12,481 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 14:03:12,481 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 14:03:12,481 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:03:12" (1/1) ... [2022-04-15 14:03:12,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 14:03:12,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:03:12,510 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:03:12,550 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:03:12,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 14:03:12,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 14:03:12,564 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 14:03:12,564 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 14:03:12,564 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 14:03:12,564 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 14:03:12,564 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 14:03:12,564 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 14:03:12,564 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 14:03:12,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 14:03:12,565 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 14:03:12,565 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 14:03:12,565 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 14:03:12,565 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 14:03:12,566 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 14:03:12,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 14:03:12,566 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 14:03:12,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 14:03:12,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 14:03:12,566 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 14:03:12,613 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 14:03:12,615 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 14:03:12,749 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 14:03:12,753 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 14:03:12,753 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 14:03:12,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 02:03:12 BoogieIcfgContainer [2022-04-15 14:03:12,755 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 14:03:12,756 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 14:03:12,756 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 14:03:12,758 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 14:03:12,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 02:03:12" (1/3) ... [2022-04-15 14:03:12,759 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dbba51c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 02:03:12, skipping insertion in model container [2022-04-15 14:03:12,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:03:12" (2/3) ... [2022-04-15 14:03:12,759 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dbba51c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 02:03:12, skipping insertion in model container [2022-04-15 14:03:12,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 02:03:12" (3/3) ... [2022-04-15 14:03:12,760 INFO L111 eAbstractionObserver]: Analyzing ICFG cohendiv-ll_unwindbound20.c [2022-04-15 14:03:12,763 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 14:03:12,763 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 14:03:12,795 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 14:03:12,799 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:03:12,800 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 14:03:12,811 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 14:03:12,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 14:03:12,819 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:03:12,819 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 14:03:12,820 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:03:12,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:03:12,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1588022502, now seen corresponding path program 1 times [2022-04-15 14:03:12,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:03:12,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [852258026] [2022-04-15 14:03:12,836 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:03:12,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1588022502, now seen corresponding path program 2 times [2022-04-15 14:03:12,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:03:12,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775080085] [2022-04-15 14:03:12,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:03:12,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:03:12,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:03:12,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 14:03:12,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:03:12,951 INFO L290 TraceCheckUtils]: 0: Hoare triple {50#(and (= ~counter~0 |old(~counter~0)|) (= |#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);~counter~0 := 0; {41#true} is VALID [2022-04-15 14:03:12,951 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume true; {41#true} is VALID [2022-04-15 14:03:12,951 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41#true} {41#true} #93#return; {41#true} is VALID [2022-04-15 14:03:12,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 14:03:12,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:03:12,958 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-15 14:03:12,959 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-15 14:03:12,959 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-15 14:03:12,959 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#false} {41#true} #77#return; {42#false} is VALID [2022-04-15 14:03:12,960 INFO L272 TraceCheckUtils]: 0: Hoare triple {41#true} call ULTIMATE.init(); {50#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 14:03:12,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {50#(and (= ~counter~0 |old(~counter~0)|) (= |#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);~counter~0 := 0; {41#true} is VALID [2022-04-15 14:03:12,960 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#true} assume true; {41#true} is VALID [2022-04-15 14:03:12,960 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#true} {41#true} #93#return; {41#true} is VALID [2022-04-15 14:03:12,960 INFO L272 TraceCheckUtils]: 4: Hoare triple {41#true} call #t~ret8 := main(); {41#true} is VALID [2022-04-15 14:03:12,961 INFO L290 TraceCheckUtils]: 5: Hoare triple {41#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {41#true} is VALID [2022-04-15 14:03:12,961 INFO L272 TraceCheckUtils]: 6: Hoare triple {41#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {41#true} is VALID [2022-04-15 14:03:12,961 INFO L290 TraceCheckUtils]: 7: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-15 14:03:12,961 INFO L290 TraceCheckUtils]: 8: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-15 14:03:12,962 INFO L290 TraceCheckUtils]: 9: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-15 14:03:12,962 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {42#false} {41#true} #77#return; {42#false} is VALID [2022-04-15 14:03:12,962 INFO L290 TraceCheckUtils]: 11: Hoare triple {42#false} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {42#false} is VALID [2022-04-15 14:03:12,962 INFO L290 TraceCheckUtils]: 12: Hoare triple {42#false} assume !true; {42#false} is VALID [2022-04-15 14:03:12,962 INFO L272 TraceCheckUtils]: 13: Hoare triple {42#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {42#false} is VALID [2022-04-15 14:03:12,962 INFO L290 TraceCheckUtils]: 14: Hoare triple {42#false} ~cond := #in~cond; {42#false} is VALID [2022-04-15 14:03:12,963 INFO L290 TraceCheckUtils]: 15: Hoare triple {42#false} assume 0 == ~cond; {42#false} is VALID [2022-04-15 14:03:12,963 INFO L290 TraceCheckUtils]: 16: Hoare triple {42#false} assume !false; {42#false} is VALID [2022-04-15 14:03:12,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 14:03:12,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:03:12,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775080085] [2022-04-15 14:03:12,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775080085] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:03:12,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:03:12,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 14:03:12,966 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:03:12,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [852258026] [2022-04-15 14:03:12,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [852258026] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:03:12,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:03:12,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 14:03:12,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046395731] [2022-04-15 14:03:12,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:03:12,971 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-15 14:03:12,972 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:03:12,974 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 14:03:12,990 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:03:12,990 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 14:03:12,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:03:13,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 14:03:13,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 14:03:13,005 INFO L87 Difference]: Start difference. First operand has 38 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 14:03:13,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:03:13,166 INFO L93 Difference]: Finished difference Result 68 states and 101 transitions. [2022-04-15 14:03:13,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 14:03:13,167 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-15 14:03:13,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:03:13,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 14:03:13,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-15 14:03:13,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 14:03:13,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-15 14:03:13,191 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 101 transitions. [2022-04-15 14:03:13,324 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:03:13,332 INFO L225 Difference]: With dead ends: 68 [2022-04-15 14:03:13,332 INFO L226 Difference]: Without dead ends: 34 [2022-04-15 14:03:13,335 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 14:03:13,339 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 14:03:13,340 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 49 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 14:03:13,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-15 14:03:13,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2022-04-15 14:03:13,360 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:03:13,361 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 33 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 14:03:13,362 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 33 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 14:03:13,362 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 33 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 14:03:13,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:03:13,365 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-15 14:03:13,365 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-15 14:03:13,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:03:13,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:03:13,366 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 34 states. [2022-04-15 14:03:13,367 INFO L87 Difference]: Start difference. First operand has 33 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 34 states. [2022-04-15 14:03:13,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:03:13,369 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-15 14:03:13,369 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-15 14:03:13,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:03:13,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:03:13,370 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:03:13,370 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:03:13,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 14:03:13,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2022-04-15 14:03:13,373 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 17 [2022-04-15 14:03:13,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:03:13,373 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2022-04-15 14:03:13,373 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 14:03:13,374 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 42 transitions. [2022-04-15 14:03:13,407 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:03:13,407 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2022-04-15 14:03:13,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 14:03:13,408 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:03:13,408 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 14:03:13,408 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 14:03:13,408 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:03:13,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:03:13,409 INFO L85 PathProgramCache]: Analyzing trace with hash 766070672, now seen corresponding path program 1 times [2022-04-15 14:03:13,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:03:13,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2146699307] [2022-04-15 14:03:13,410 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:03:13,410 INFO L85 PathProgramCache]: Analyzing trace with hash 766070672, now seen corresponding path program 2 times [2022-04-15 14:03:13,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:03:13,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177881377] [2022-04-15 14:03:13,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:03:13,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:03:13,435 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:03:13,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1343025115] [2022-04-15 14:03:13,435 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:03:13,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:03:13,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:03:13,438 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:03:13,439 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:03:13,486 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 14:03:13,486 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:03:13,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 14:03:13,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:03:13,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:03:13,620 INFO L272 TraceCheckUtils]: 0: Hoare triple {323#true} call ULTIMATE.init(); {323#true} is VALID [2022-04-15 14:03:13,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {323#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);~counter~0 := 0; {331#(<= ~counter~0 0)} is VALID [2022-04-15 14:03:13,621 INFO L290 TraceCheckUtils]: 2: Hoare triple {331#(<= ~counter~0 0)} assume true; {331#(<= ~counter~0 0)} is VALID [2022-04-15 14:03:13,621 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {331#(<= ~counter~0 0)} {323#true} #93#return; {331#(<= ~counter~0 0)} is VALID [2022-04-15 14:03:13,622 INFO L272 TraceCheckUtils]: 4: Hoare triple {331#(<= ~counter~0 0)} call #t~ret8 := main(); {331#(<= ~counter~0 0)} is VALID [2022-04-15 14:03:13,622 INFO L290 TraceCheckUtils]: 5: Hoare triple {331#(<= ~counter~0 0)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {331#(<= ~counter~0 0)} is VALID [2022-04-15 14:03:13,623 INFO L272 TraceCheckUtils]: 6: Hoare triple {331#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {331#(<= ~counter~0 0)} is VALID [2022-04-15 14:03:13,623 INFO L290 TraceCheckUtils]: 7: Hoare triple {331#(<= ~counter~0 0)} ~cond := #in~cond; {331#(<= ~counter~0 0)} is VALID [2022-04-15 14:03:13,623 INFO L290 TraceCheckUtils]: 8: Hoare triple {331#(<= ~counter~0 0)} assume !(0 == ~cond); {331#(<= ~counter~0 0)} is VALID [2022-04-15 14:03:13,624 INFO L290 TraceCheckUtils]: 9: Hoare triple {331#(<= ~counter~0 0)} assume true; {331#(<= ~counter~0 0)} is VALID [2022-04-15 14:03:13,624 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {331#(<= ~counter~0 0)} {331#(<= ~counter~0 0)} #77#return; {331#(<= ~counter~0 0)} is VALID [2022-04-15 14:03:13,625 INFO L290 TraceCheckUtils]: 11: Hoare triple {331#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {331#(<= ~counter~0 0)} is VALID [2022-04-15 14:03:13,625 INFO L290 TraceCheckUtils]: 12: Hoare triple {331#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {365#(<= |main_#t~post6| 0)} is VALID [2022-04-15 14:03:13,626 INFO L290 TraceCheckUtils]: 13: Hoare triple {365#(<= |main_#t~post6| 0)} assume !(#t~post6 < 20);havoc #t~post6; {324#false} is VALID [2022-04-15 14:03:13,626 INFO L272 TraceCheckUtils]: 14: Hoare triple {324#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {324#false} is VALID [2022-04-15 14:03:13,626 INFO L290 TraceCheckUtils]: 15: Hoare triple {324#false} ~cond := #in~cond; {324#false} is VALID [2022-04-15 14:03:13,626 INFO L290 TraceCheckUtils]: 16: Hoare triple {324#false} assume 0 == ~cond; {324#false} is VALID [2022-04-15 14:03:13,627 INFO L290 TraceCheckUtils]: 17: Hoare triple {324#false} assume !false; {324#false} is VALID [2022-04-15 14:03:13,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 14:03:13,627 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 14:03:13,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:03:13,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177881377] [2022-04-15 14:03:13,627 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:03:13,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343025115] [2022-04-15 14:03:13,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343025115] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:03:13,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:03:13,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 14:03:13,629 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:03:13,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2146699307] [2022-04-15 14:03:13,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2146699307] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:03:13,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:03:13,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 14:03:13,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494782483] [2022-04-15 14:03:13,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:03:13,630 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-15 14:03:13,630 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:03:13,630 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 14:03:13,642 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:03:13,643 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 14:03:13,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:03:13,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 14:03:13,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 14:03:13,644 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 14:03:13,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:03:13,718 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-04-15 14:03:13,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 14:03:13,718 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-15 14:03:13,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:03:13,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 14:03:13,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-04-15 14:03:13,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 14:03:13,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-04-15 14:03:13,721 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 51 transitions. [2022-04-15 14:03:13,762 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:03:13,765 INFO L225 Difference]: With dead ends: 42 [2022-04-15 14:03:13,765 INFO L226 Difference]: Without dead ends: 35 [2022-04-15 14:03:13,766 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 14:03:13,767 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 14:03:13,770 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 14:03:13,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-15 14:03:13,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-15 14:03:13,785 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:03:13,786 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 14:03:13,786 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 14:03:13,786 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 14:03:13,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:03:13,788 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-15 14:03:13,788 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-15 14:03:13,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:03:13,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:03:13,789 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 35 states. [2022-04-15 14:03:13,789 INFO L87 Difference]: Start difference. First operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 35 states. [2022-04-15 14:03:13,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:03:13,791 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-15 14:03:13,791 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-15 14:03:13,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:03:13,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:03:13,792 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:03:13,792 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:03:13,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 14:03:13,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2022-04-15 14:03:13,794 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 18 [2022-04-15 14:03:13,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:03:13,794 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2022-04-15 14:03:13,794 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 14:03:13,794 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 44 transitions. [2022-04-15 14:03:13,831 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:03:13,832 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-15 14:03:13,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 14:03:13,832 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:03:13,832 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 14:03:13,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-15 14:03:14,051 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:03:14,052 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:03:14,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:03:14,053 INFO L85 PathProgramCache]: Analyzing trace with hash 767560222, now seen corresponding path program 1 times [2022-04-15 14:03:14,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:03:14,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1254917663] [2022-04-15 14:03:14,053 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:03:14,053 INFO L85 PathProgramCache]: Analyzing trace with hash 767560222, now seen corresponding path program 2 times [2022-04-15 14:03:14,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:03:14,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534525367] [2022-04-15 14:03:14,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:03:14,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:03:14,073 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:03:14,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1389606840] [2022-04-15 14:03:14,073 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:03:14,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:03:14,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:03:14,074 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:03:14,078 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:03:14,116 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 14:03:14,116 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:03:14,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 14:03:14,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:03:14,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:03:14,199 INFO L272 TraceCheckUtils]: 0: Hoare triple {604#true} call ULTIMATE.init(); {604#true} is VALID [2022-04-15 14:03:14,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {604#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);~counter~0 := 0; {604#true} is VALID [2022-04-15 14:03:14,199 INFO L290 TraceCheckUtils]: 2: Hoare triple {604#true} assume true; {604#true} is VALID [2022-04-15 14:03:14,199 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {604#true} {604#true} #93#return; {604#true} is VALID [2022-04-15 14:03:14,200 INFO L272 TraceCheckUtils]: 4: Hoare triple {604#true} call #t~ret8 := main(); {604#true} is VALID [2022-04-15 14:03:14,200 INFO L290 TraceCheckUtils]: 5: Hoare triple {604#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {604#true} is VALID [2022-04-15 14:03:14,200 INFO L272 TraceCheckUtils]: 6: Hoare triple {604#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {604#true} is VALID [2022-04-15 14:03:14,200 INFO L290 TraceCheckUtils]: 7: Hoare triple {604#true} ~cond := #in~cond; {604#true} is VALID [2022-04-15 14:03:14,200 INFO L290 TraceCheckUtils]: 8: Hoare triple {604#true} assume !(0 == ~cond); {604#true} is VALID [2022-04-15 14:03:14,200 INFO L290 TraceCheckUtils]: 9: Hoare triple {604#true} assume true; {604#true} is VALID [2022-04-15 14:03:14,201 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {604#true} {604#true} #77#return; {604#true} is VALID [2022-04-15 14:03:14,201 INFO L290 TraceCheckUtils]: 11: Hoare triple {604#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {642#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 14:03:14,202 INFO L290 TraceCheckUtils]: 12: Hoare triple {642#(and (= main_~a~0 0) (= main_~b~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {642#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 14:03:14,202 INFO L290 TraceCheckUtils]: 13: Hoare triple {642#(and (= main_~a~0 0) (= main_~b~0 0))} assume !!(#t~post6 < 20);havoc #t~post6; {642#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 14:03:14,203 INFO L272 TraceCheckUtils]: 14: Hoare triple {642#(and (= main_~a~0 0) (= main_~b~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {652#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 14:03:14,203 INFO L290 TraceCheckUtils]: 15: Hoare triple {652#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {656#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 14:03:14,204 INFO L290 TraceCheckUtils]: 16: Hoare triple {656#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {605#false} is VALID [2022-04-15 14:03:14,204 INFO L290 TraceCheckUtils]: 17: Hoare triple {605#false} assume !false; {605#false} is VALID [2022-04-15 14:03:14,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 14:03:14,204 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 14:03:14,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:03:14,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534525367] [2022-04-15 14:03:14,205 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:03:14,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389606840] [2022-04-15 14:03:14,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1389606840] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:03:14,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:03:14,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 14:03:14,205 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:03:14,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1254917663] [2022-04-15 14:03:14,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1254917663] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:03:14,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:03:14,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 14:03:14,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263186618] [2022-04-15 14:03:14,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:03:14,206 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-15 14:03:14,206 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:03:14,207 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 14:03:14,218 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:03:14,218 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 14:03:14,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:03:14,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 14:03:14,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 14:03:14,219 INFO L87 Difference]: Start difference. First operand 35 states and 44 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 14:03:14,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:03:14,372 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-04-15 14:03:14,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 14:03:14,372 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-15 14:03:14,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:03:14,373 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 14:03:14,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-04-15 14:03:14,374 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 14:03:14,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-04-15 14:03:14,375 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 56 transitions. [2022-04-15 14:03:14,408 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:03:14,409 INFO L225 Difference]: With dead ends: 45 [2022-04-15 14:03:14,409 INFO L226 Difference]: Without dead ends: 43 [2022-04-15 14:03:14,410 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 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:03:14,410 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 6 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 145 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:03:14,411 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 145 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 14:03:14,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-15 14:03:14,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2022-04-15 14:03:14,427 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:03:14,428 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 40 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 14:03:14,428 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 40 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 14:03:14,428 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 40 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 14:03:14,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:03:14,430 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2022-04-15 14:03:14,430 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2022-04-15 14:03:14,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:03:14,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:03:14,431 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand 43 states. [2022-04-15 14:03:14,431 INFO L87 Difference]: Start difference. First operand has 40 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand 43 states. [2022-04-15 14:03:14,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:03:14,433 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2022-04-15 14:03:14,433 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2022-04-15 14:03:14,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:03:14,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:03:14,434 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:03:14,434 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:03:14,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 14:03:14,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2022-04-15 14:03:14,435 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 49 transitions. Word has length 18 [2022-04-15 14:03:14,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:03:14,435 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 49 transitions. [2022-04-15 14:03:14,436 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 14:03:14,436 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 49 transitions. [2022-04-15 14:03:14,481 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:03:14,482 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2022-04-15 14:03:14,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 14:03:14,482 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:03:14,482 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 14:03:14,503 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:03:14,700 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:03:14,701 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:03:14,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:03:14,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1016228092, now seen corresponding path program 1 times [2022-04-15 14:03:14,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:03:14,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [179652459] [2022-04-15 14:03:14,702 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:03:14,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1016228092, now seen corresponding path program 2 times [2022-04-15 14:03:14,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:03:14,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430935390] [2022-04-15 14:03:14,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:03:14,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:03:14,716 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:03:14,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1137092320] [2022-04-15 14:03:14,717 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:03:14,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:03:14,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:03:14,718 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:03:14,721 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:03:14,765 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 14:03:14,765 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:03:14,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 14:03:14,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:03:14,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:03:14,875 INFO L272 TraceCheckUtils]: 0: Hoare triple {920#true} call ULTIMATE.init(); {920#true} is VALID [2022-04-15 14:03:14,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {920#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);~counter~0 := 0; {920#true} is VALID [2022-04-15 14:03:14,875 INFO L290 TraceCheckUtils]: 2: Hoare triple {920#true} assume true; {920#true} is VALID [2022-04-15 14:03:14,876 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {920#true} {920#true} #93#return; {920#true} is VALID [2022-04-15 14:03:14,876 INFO L272 TraceCheckUtils]: 4: Hoare triple {920#true} call #t~ret8 := main(); {920#true} is VALID [2022-04-15 14:03:14,876 INFO L290 TraceCheckUtils]: 5: Hoare triple {920#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {920#true} is VALID [2022-04-15 14:03:14,876 INFO L272 TraceCheckUtils]: 6: Hoare triple {920#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {920#true} is VALID [2022-04-15 14:03:14,876 INFO L290 TraceCheckUtils]: 7: Hoare triple {920#true} ~cond := #in~cond; {920#true} is VALID [2022-04-15 14:03:14,876 INFO L290 TraceCheckUtils]: 8: Hoare triple {920#true} assume !(0 == ~cond); {920#true} is VALID [2022-04-15 14:03:14,876 INFO L290 TraceCheckUtils]: 9: Hoare triple {920#true} assume true; {920#true} is VALID [2022-04-15 14:03:14,876 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {920#true} {920#true} #77#return; {920#true} is VALID [2022-04-15 14:03:14,877 INFO L290 TraceCheckUtils]: 11: Hoare triple {920#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {958#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 14:03:14,878 INFO L290 TraceCheckUtils]: 12: Hoare triple {958#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {958#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 14:03:14,878 INFO L290 TraceCheckUtils]: 13: Hoare triple {958#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 20);havoc #t~post6; {958#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 14:03:14,881 INFO L272 TraceCheckUtils]: 14: Hoare triple {958#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {920#true} is VALID [2022-04-15 14:03:14,881 INFO L290 TraceCheckUtils]: 15: Hoare triple {920#true} ~cond := #in~cond; {920#true} is VALID [2022-04-15 14:03:14,882 INFO L290 TraceCheckUtils]: 16: Hoare triple {920#true} assume !(0 == ~cond); {920#true} is VALID [2022-04-15 14:03:14,882 INFO L290 TraceCheckUtils]: 17: Hoare triple {920#true} assume true; {920#true} is VALID [2022-04-15 14:03:14,882 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {920#true} {958#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #79#return; {958#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 14:03:14,883 INFO L272 TraceCheckUtils]: 19: Hoare triple {958#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {983#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 14:03:14,883 INFO L290 TraceCheckUtils]: 20: Hoare triple {983#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {987#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 14:03:14,884 INFO L290 TraceCheckUtils]: 21: Hoare triple {987#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {921#false} is VALID [2022-04-15 14:03:14,884 INFO L290 TraceCheckUtils]: 22: Hoare triple {921#false} assume !false; {921#false} is VALID [2022-04-15 14:03:14,885 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 14:03:14,885 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 14:03:14,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:03:14,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430935390] [2022-04-15 14:03:14,885 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:03:14,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137092320] [2022-04-15 14:03:14,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137092320] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:03:14,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:03:14,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 14:03:14,886 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:03:14,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [179652459] [2022-04-15 14:03:14,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [179652459] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:03:14,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:03:14,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 14:03:14,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52071592] [2022-04-15 14:03:14,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:03:14,889 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-15 14:03:14,890 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:03:14,890 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 14:03:14,903 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:03:14,903 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 14:03:14,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:03:14,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 14:03:14,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 14:03:14,906 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 14:03:15,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:03:15,105 INFO L93 Difference]: Finished difference Result 58 states and 74 transitions. [2022-04-15 14:03:15,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 14:03:15,105 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-15 14:03:15,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:03:15,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 14:03:15,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-04-15 14:03:15,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 14:03:15,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-04-15 14:03:15,108 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 71 transitions. [2022-04-15 14:03:15,154 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:03:15,156 INFO L225 Difference]: With dead ends: 58 [2022-04-15 14:03:15,156 INFO L226 Difference]: Without dead ends: 55 [2022-04-15 14:03:15,156 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 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:03:15,157 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 13 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 14:03:15,157 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 139 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 14:03:15,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-15 14:03:15,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2022-04-15 14:03:15,174 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:03:15,175 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 14:03:15,175 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 14:03:15,175 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 14:03:15,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:03:15,180 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2022-04-15 14:03:15,180 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2022-04-15 14:03:15,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:03:15,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:03:15,181 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 55 states. [2022-04-15 14:03:15,181 INFO L87 Difference]: Start difference. First operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 55 states. [2022-04-15 14:03:15,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:03:15,183 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2022-04-15 14:03:15,183 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2022-04-15 14:03:15,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:03:15,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:03:15,183 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:03:15,184 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:03:15,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 14:03:15,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2022-04-15 14:03:15,185 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 23 [2022-04-15 14:03:15,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:03:15,186 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2022-04-15 14:03:15,186 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 14:03:15,186 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 69 transitions. [2022-04-15 14:03:15,234 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:03:15,234 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2022-04-15 14:03:15,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 14:03:15,235 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:03:15,235 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 14:03:15,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-15 14:03:15,451 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:03:15,452 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:03:15,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:03:15,452 INFO L85 PathProgramCache]: Analyzing trace with hash 2019703110, now seen corresponding path program 1 times [2022-04-15 14:03:15,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:03:15,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [866380923] [2022-04-15 14:03:15,453 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:03:15,453 INFO L85 PathProgramCache]: Analyzing trace with hash 2019703110, now seen corresponding path program 2 times [2022-04-15 14:03:15,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:03:15,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818212892] [2022-04-15 14:03:15,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:03:15,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:03:15,465 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:03:15,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1188326369] [2022-04-15 14:03:15,465 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:03:15,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:03:15,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:03:15,466 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:03:15,475 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:03:15,513 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 14:03:15,514 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:03:15,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 14:03:15,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:03:15,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:03:15,637 INFO L272 TraceCheckUtils]: 0: Hoare triple {1329#true} call ULTIMATE.init(); {1329#true} is VALID [2022-04-15 14:03:15,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {1329#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);~counter~0 := 0; {1329#true} is VALID [2022-04-15 14:03:15,637 INFO L290 TraceCheckUtils]: 2: Hoare triple {1329#true} assume true; {1329#true} is VALID [2022-04-15 14:03:15,638 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1329#true} {1329#true} #93#return; {1329#true} is VALID [2022-04-15 14:03:15,638 INFO L272 TraceCheckUtils]: 4: Hoare triple {1329#true} call #t~ret8 := main(); {1329#true} is VALID [2022-04-15 14:03:15,638 INFO L290 TraceCheckUtils]: 5: Hoare triple {1329#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1329#true} is VALID [2022-04-15 14:03:15,638 INFO L272 TraceCheckUtils]: 6: Hoare triple {1329#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1329#true} is VALID [2022-04-15 14:03:15,639 INFO L290 TraceCheckUtils]: 7: Hoare triple {1329#true} ~cond := #in~cond; {1329#true} is VALID [2022-04-15 14:03:15,640 INFO L290 TraceCheckUtils]: 8: Hoare triple {1329#true} assume !(0 == ~cond); {1329#true} is VALID [2022-04-15 14:03:15,640 INFO L290 TraceCheckUtils]: 9: Hoare triple {1329#true} assume true; {1329#true} is VALID [2022-04-15 14:03:15,640 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1329#true} {1329#true} #77#return; {1329#true} is VALID [2022-04-15 14:03:15,640 INFO L290 TraceCheckUtils]: 11: Hoare triple {1329#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {1329#true} is VALID [2022-04-15 14:03:15,640 INFO L290 TraceCheckUtils]: 12: Hoare triple {1329#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1329#true} is VALID [2022-04-15 14:03:15,640 INFO L290 TraceCheckUtils]: 13: Hoare triple {1329#true} assume !!(#t~post6 < 20);havoc #t~post6; {1329#true} is VALID [2022-04-15 14:03:15,640 INFO L272 TraceCheckUtils]: 14: Hoare triple {1329#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {1329#true} is VALID [2022-04-15 14:03:15,641 INFO L290 TraceCheckUtils]: 15: Hoare triple {1329#true} ~cond := #in~cond; {1329#true} is VALID [2022-04-15 14:03:15,641 INFO L290 TraceCheckUtils]: 16: Hoare triple {1329#true} assume !(0 == ~cond); {1329#true} is VALID [2022-04-15 14:03:15,641 INFO L290 TraceCheckUtils]: 17: Hoare triple {1329#true} assume true; {1329#true} is VALID [2022-04-15 14:03:15,641 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1329#true} {1329#true} #79#return; {1329#true} is VALID [2022-04-15 14:03:15,642 INFO L272 TraceCheckUtils]: 19: Hoare triple {1329#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {1329#true} is VALID [2022-04-15 14:03:15,642 INFO L290 TraceCheckUtils]: 20: Hoare triple {1329#true} ~cond := #in~cond; {1329#true} is VALID [2022-04-15 14:03:15,643 INFO L290 TraceCheckUtils]: 21: Hoare triple {1329#true} assume !(0 == ~cond); {1329#true} is VALID [2022-04-15 14:03:15,643 INFO L290 TraceCheckUtils]: 22: Hoare triple {1329#true} assume true; {1329#true} is VALID [2022-04-15 14:03:15,643 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1329#true} {1329#true} #81#return; {1329#true} is VALID [2022-04-15 14:03:15,643 INFO L290 TraceCheckUtils]: 24: Hoare triple {1329#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {1406#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} is VALID [2022-04-15 14:03:15,644 INFO L290 TraceCheckUtils]: 25: Hoare triple {1406#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1406#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} is VALID [2022-04-15 14:03:15,644 INFO L290 TraceCheckUtils]: 26: Hoare triple {1406#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} assume !!(#t~post7 < 20);havoc #t~post7; {1406#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} is VALID [2022-04-15 14:03:15,645 INFO L272 TraceCheckUtils]: 27: Hoare triple {1406#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {1416#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 14:03:15,645 INFO L290 TraceCheckUtils]: 28: Hoare triple {1416#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1420#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 14:03:15,646 INFO L290 TraceCheckUtils]: 29: Hoare triple {1420#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1330#false} is VALID [2022-04-15 14:03:15,646 INFO L290 TraceCheckUtils]: 30: Hoare triple {1330#false} assume !false; {1330#false} is VALID [2022-04-15 14:03:15,646 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 14:03:15,646 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 14:03:15,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:03:15,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818212892] [2022-04-15 14:03:15,649 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:03:15,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188326369] [2022-04-15 14:03:15,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188326369] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:03:15,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:03:15,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 14:03:15,650 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:03:15,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [866380923] [2022-04-15 14:03:15,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [866380923] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:03:15,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:03:15,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 14:03:15,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231093383] [2022-04-15 14:03:15,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:03:15,651 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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 31 [2022-04-15 14:03:15,652 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:03:15,652 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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:03:15,668 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:03:15,669 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 14:03:15,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:03:15,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 14:03:15,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 14:03:15,670 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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:03:15,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:03:15,854 INFO L93 Difference]: Finished difference Result 83 states and 113 transitions. [2022-04-15 14:03:15,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 14:03:15,855 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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 31 [2022-04-15 14:03:15,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:03:15,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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:03:15,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-04-15 14:03:15,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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:03:15,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-04-15 14:03:15,857 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 72 transitions. [2022-04-15 14:03:15,903 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:03:15,905 INFO L225 Difference]: With dead ends: 83 [2022-04-15 14:03:15,905 INFO L226 Difference]: Without dead ends: 81 [2022-04-15 14:03:15,906 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 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:03:15,906 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 13 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 14:03:15,906 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 145 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 14:03:15,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-15 14:03:15,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 74. [2022-04-15 14:03:15,926 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:03:15,926 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 74 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 46 states have internal predecessors, (56), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 14:03:15,926 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 74 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 46 states have internal predecessors, (56), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 14:03:15,927 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 74 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 46 states have internal predecessors, (56), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 14:03:15,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:03:15,930 INFO L93 Difference]: Finished difference Result 81 states and 111 transitions. [2022-04-15 14:03:15,930 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 111 transitions. [2022-04-15 14:03:15,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:03:15,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:03:15,931 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 46 states have internal predecessors, (56), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 81 states. [2022-04-15 14:03:15,931 INFO L87 Difference]: Start difference. First operand has 74 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 46 states have internal predecessors, (56), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 81 states. [2022-04-15 14:03:15,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:03:15,934 INFO L93 Difference]: Finished difference Result 81 states and 111 transitions. [2022-04-15 14:03:15,934 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 111 transitions. [2022-04-15 14:03:15,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:03:15,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:03:15,935 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:03:15,935 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:03:15,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 46 states have internal predecessors, (56), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 14:03:15,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 100 transitions. [2022-04-15 14:03:15,938 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 100 transitions. Word has length 31 [2022-04-15 14:03:15,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:03:15,938 INFO L478 AbstractCegarLoop]: Abstraction has 74 states and 100 transitions. [2022-04-15 14:03:15,938 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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:03:15,938 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 74 states and 100 transitions. [2022-04-15 14:03:16,012 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:03:16,012 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 100 transitions. [2022-04-15 14:03:16,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-15 14:03:16,013 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:03:16,013 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 14:03:16,031 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:03:16,227 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:03:16,227 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:03:16,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:03:16,228 INFO L85 PathProgramCache]: Analyzing trace with hash 202176206, now seen corresponding path program 1 times [2022-04-15 14:03:16,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:03:16,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1797478216] [2022-04-15 14:13:39,709 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 14:13:39,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1923851590, now seen corresponding path program 1 times [2022-04-15 14:13:39,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:13:39,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266362511] [2022-04-15 14:13:39,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:13:39,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:13:39,718 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:13:39,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1018605945] [2022-04-15 14:13:39,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:13:39,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:13:39,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:13:39,720 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:13:39,720 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:13:39,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 14:13:39,749 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 14:13:39,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 14:13:39,765 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 14:13:39,765 INFO L85 PathProgramCache]: Analyzing trace with hash 202176206, now seen corresponding path program 2 times [2022-04-15 14:13:39,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:13:39,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756602028] [2022-04-15 14:13:39,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:13:39,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:13:39,775 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:13:39,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [886990712] [2022-04-15 14:13:39,775 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:13:39,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:13:39,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:13:39,777 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:13:39,777 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:13:39,826 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 14:13:39,826 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:13:39,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 14:13:39,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:13:39,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:13:39,997 INFO L272 TraceCheckUtils]: 0: Hoare triple {1904#true} call ULTIMATE.init(); {1904#true} is VALID [2022-04-15 14:13:39,999 INFO L290 TraceCheckUtils]: 1: Hoare triple {1904#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);~counter~0 := 0; {1912#(<= ~counter~0 0)} is VALID [2022-04-15 14:13:39,999 INFO L290 TraceCheckUtils]: 2: Hoare triple {1912#(<= ~counter~0 0)} assume true; {1912#(<= ~counter~0 0)} is VALID [2022-04-15 14:13:40,000 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1912#(<= ~counter~0 0)} {1904#true} #93#return; {1912#(<= ~counter~0 0)} is VALID [2022-04-15 14:13:40,001 INFO L272 TraceCheckUtils]: 4: Hoare triple {1912#(<= ~counter~0 0)} call #t~ret8 := main(); {1912#(<= ~counter~0 0)} is VALID [2022-04-15 14:13:40,001 INFO L290 TraceCheckUtils]: 5: Hoare triple {1912#(<= ~counter~0 0)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1912#(<= ~counter~0 0)} is VALID [2022-04-15 14:13:40,002 INFO L272 TraceCheckUtils]: 6: Hoare triple {1912#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1912#(<= ~counter~0 0)} is VALID [2022-04-15 14:13:40,004 INFO L290 TraceCheckUtils]: 7: Hoare triple {1912#(<= ~counter~0 0)} ~cond := #in~cond; {1912#(<= ~counter~0 0)} is VALID [2022-04-15 14:13:40,004 INFO L290 TraceCheckUtils]: 8: Hoare triple {1912#(<= ~counter~0 0)} assume !(0 == ~cond); {1912#(<= ~counter~0 0)} is VALID [2022-04-15 14:13:40,015 INFO L290 TraceCheckUtils]: 9: Hoare triple {1912#(<= ~counter~0 0)} assume true; {1912#(<= ~counter~0 0)} is VALID [2022-04-15 14:13:40,015 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1912#(<= ~counter~0 0)} {1912#(<= ~counter~0 0)} #77#return; {1912#(<= ~counter~0 0)} is VALID [2022-04-15 14:13:40,016 INFO L290 TraceCheckUtils]: 11: Hoare triple {1912#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {1912#(<= ~counter~0 0)} is VALID [2022-04-15 14:13:40,017 INFO L290 TraceCheckUtils]: 12: Hoare triple {1912#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1946#(<= ~counter~0 1)} is VALID [2022-04-15 14:13:40,017 INFO L290 TraceCheckUtils]: 13: Hoare triple {1946#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {1946#(<= ~counter~0 1)} is VALID [2022-04-15 14:13:40,017 INFO L272 TraceCheckUtils]: 14: Hoare triple {1946#(<= ~counter~0 1)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {1946#(<= ~counter~0 1)} is VALID [2022-04-15 14:13:40,018 INFO L290 TraceCheckUtils]: 15: Hoare triple {1946#(<= ~counter~0 1)} ~cond := #in~cond; {1946#(<= ~counter~0 1)} is VALID [2022-04-15 14:13:40,018 INFO L290 TraceCheckUtils]: 16: Hoare triple {1946#(<= ~counter~0 1)} assume !(0 == ~cond); {1946#(<= ~counter~0 1)} is VALID [2022-04-15 14:13:40,018 INFO L290 TraceCheckUtils]: 17: Hoare triple {1946#(<= ~counter~0 1)} assume true; {1946#(<= ~counter~0 1)} is VALID [2022-04-15 14:13:40,019 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1946#(<= ~counter~0 1)} {1946#(<= ~counter~0 1)} #79#return; {1946#(<= ~counter~0 1)} is VALID [2022-04-15 14:13:40,019 INFO L272 TraceCheckUtils]: 19: Hoare triple {1946#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {1946#(<= ~counter~0 1)} is VALID [2022-04-15 14:13:40,020 INFO L290 TraceCheckUtils]: 20: Hoare triple {1946#(<= ~counter~0 1)} ~cond := #in~cond; {1946#(<= ~counter~0 1)} is VALID [2022-04-15 14:13:40,020 INFO L290 TraceCheckUtils]: 21: Hoare triple {1946#(<= ~counter~0 1)} assume !(0 == ~cond); {1946#(<= ~counter~0 1)} is VALID [2022-04-15 14:13:40,020 INFO L290 TraceCheckUtils]: 22: Hoare triple {1946#(<= ~counter~0 1)} assume true; {1946#(<= ~counter~0 1)} is VALID [2022-04-15 14:13:40,021 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1946#(<= ~counter~0 1)} {1946#(<= ~counter~0 1)} #81#return; {1946#(<= ~counter~0 1)} is VALID [2022-04-15 14:13:40,021 INFO L290 TraceCheckUtils]: 24: Hoare triple {1946#(<= ~counter~0 1)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {1946#(<= ~counter~0 1)} is VALID [2022-04-15 14:13:40,021 INFO L290 TraceCheckUtils]: 25: Hoare triple {1946#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1986#(<= |main_#t~post7| 1)} is VALID [2022-04-15 14:13:40,022 INFO L290 TraceCheckUtils]: 26: Hoare triple {1986#(<= |main_#t~post7| 1)} assume !(#t~post7 < 20);havoc #t~post7; {1905#false} is VALID [2022-04-15 14:13:40,022 INFO L290 TraceCheckUtils]: 27: Hoare triple {1905#false} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {1905#false} is VALID [2022-04-15 14:13:40,022 INFO L290 TraceCheckUtils]: 28: Hoare triple {1905#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1905#false} is VALID [2022-04-15 14:13:40,022 INFO L290 TraceCheckUtils]: 29: Hoare triple {1905#false} assume !(#t~post6 < 20);havoc #t~post6; {1905#false} is VALID [2022-04-15 14:13:40,022 INFO L272 TraceCheckUtils]: 30: Hoare triple {1905#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {1905#false} is VALID [2022-04-15 14:13:40,022 INFO L290 TraceCheckUtils]: 31: Hoare triple {1905#false} ~cond := #in~cond; {1905#false} is VALID [2022-04-15 14:13:40,023 INFO L290 TraceCheckUtils]: 32: Hoare triple {1905#false} assume 0 == ~cond; {1905#false} is VALID [2022-04-15 14:13:40,023 INFO L290 TraceCheckUtils]: 33: Hoare triple {1905#false} assume !false; {1905#false} is VALID [2022-04-15 14:13:40,023 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 14:13:40,023 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 14:13:40,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:13:40,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756602028] [2022-04-15 14:13:40,023 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:13:40,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [886990712] [2022-04-15 14:13:40,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [886990712] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:13:40,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:13:40,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 14:13:40,024 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:13:40,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1797478216] [2022-04-15 14:13:40,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1797478216] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:13:40,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:13:40,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 14:13:40,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070901085] [2022-04-15 14:13:40,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:13:40,024 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 34 [2022-04-15 14:13:40,025 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:13:40,025 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 14:13:40,047 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:13:40,047 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 14:13:40,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:13:40,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 14:13:40,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 14:13:40,049 INFO L87 Difference]: Start difference. First operand 74 states and 100 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 14:13:40,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:13:40,165 INFO L93 Difference]: Finished difference Result 113 states and 153 transitions. [2022-04-15 14:13:40,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 14:13:40,165 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 34 [2022-04-15 14:13:40,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:13:40,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 14:13:40,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2022-04-15 14:13:40,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 14:13:40,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2022-04-15 14:13:40,169 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 85 transitions. [2022-04-15 14:13:40,228 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:13:40,231 INFO L225 Difference]: With dead ends: 113 [2022-04-15 14:13:40,231 INFO L226 Difference]: Without dead ends: 78 [2022-04-15 14:13:40,231 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 14:13:40,233 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 6 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 14:13:40,233 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 114 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 14:13:40,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-04-15 14:13:40,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-04-15 14:13:40,274 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:13:40,274 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 78 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 49 states have internal predecessors, (58), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 14:13:40,275 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 78 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 49 states have internal predecessors, (58), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 14:13:40,275 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 78 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 49 states have internal predecessors, (58), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 14:13:40,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:13:40,280 INFO L93 Difference]: Finished difference Result 78 states and 102 transitions. [2022-04-15 14:13:40,280 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 102 transitions. [2022-04-15 14:13:40,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:13:40,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:13:40,281 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 49 states have internal predecessors, (58), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 78 states. [2022-04-15 14:13:40,282 INFO L87 Difference]: Start difference. First operand has 78 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 49 states have internal predecessors, (58), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 78 states. [2022-04-15 14:13:40,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:13:40,285 INFO L93 Difference]: Finished difference Result 78 states and 102 transitions. [2022-04-15 14:13:40,285 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 102 transitions. [2022-04-15 14:13:40,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:13:40,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:13:40,286 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:13:40,286 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:13:40,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 49 states have internal predecessors, (58), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 14:13:40,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 102 transitions. [2022-04-15 14:13:40,288 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 102 transitions. Word has length 34 [2022-04-15 14:13:40,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:13:40,289 INFO L478 AbstractCegarLoop]: Abstraction has 78 states and 102 transitions. [2022-04-15 14:13:40,289 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 14:13:40,289 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 78 states and 102 transitions. [2022-04-15 14:13:40,378 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:13:40,378 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 102 transitions. [2022-04-15 14:13:40,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-15 14:13:40,379 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:13:40,379 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 14:13:40,397 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:13:40,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-15 14:13:40,795 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:13:40,796 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:13:40,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:13:40,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1813008070, now seen corresponding path program 1 times [2022-04-15 14:13:40,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:13:40,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [789929626] [2022-04-15 14:13:40,797 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:13:40,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1813008070, now seen corresponding path program 2 times [2022-04-15 14:13:40,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:13:40,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799554416] [2022-04-15 14:13:40,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:13:40,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:13:40,809 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:13:40,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1374898230] [2022-04-15 14:13:40,809 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:13:40,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:13:40,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:13:40,810 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:13:40,811 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:13:40,861 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 14:13:40,861 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:13:40,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 14:13:40,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:13:40,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:13:41,056 INFO L272 TraceCheckUtils]: 0: Hoare triple {2548#true} call ULTIMATE.init(); {2548#true} is VALID [2022-04-15 14:13:41,057 INFO L290 TraceCheckUtils]: 1: Hoare triple {2548#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);~counter~0 := 0; {2548#true} is VALID [2022-04-15 14:13:41,057 INFO L290 TraceCheckUtils]: 2: Hoare triple {2548#true} assume true; {2548#true} is VALID [2022-04-15 14:13:41,057 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2548#true} {2548#true} #93#return; {2548#true} is VALID [2022-04-15 14:13:41,057 INFO L272 TraceCheckUtils]: 4: Hoare triple {2548#true} call #t~ret8 := main(); {2548#true} is VALID [2022-04-15 14:13:41,057 INFO L290 TraceCheckUtils]: 5: Hoare triple {2548#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2548#true} is VALID [2022-04-15 14:13:41,057 INFO L272 TraceCheckUtils]: 6: Hoare triple {2548#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2548#true} is VALID [2022-04-15 14:13:41,057 INFO L290 TraceCheckUtils]: 7: Hoare triple {2548#true} ~cond := #in~cond; {2574#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 14:13:41,058 INFO L290 TraceCheckUtils]: 8: Hoare triple {2574#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2578#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 14:13:41,058 INFO L290 TraceCheckUtils]: 9: Hoare triple {2578#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2578#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 14:13:41,059 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2578#(not (= |assume_abort_if_not_#in~cond| 0))} {2548#true} #77#return; {2585#(<= 1 main_~y~0)} is VALID [2022-04-15 14:13:41,059 INFO L290 TraceCheckUtils]: 11: Hoare triple {2585#(<= 1 main_~y~0)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {2585#(<= 1 main_~y~0)} is VALID [2022-04-15 14:13:41,059 INFO L290 TraceCheckUtils]: 12: Hoare triple {2585#(<= 1 main_~y~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2585#(<= 1 main_~y~0)} is VALID [2022-04-15 14:13:41,060 INFO L290 TraceCheckUtils]: 13: Hoare triple {2585#(<= 1 main_~y~0)} assume !!(#t~post6 < 20);havoc #t~post6; {2585#(<= 1 main_~y~0)} is VALID [2022-04-15 14:13:41,060 INFO L272 TraceCheckUtils]: 14: Hoare triple {2585#(<= 1 main_~y~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {2548#true} is VALID [2022-04-15 14:13:41,060 INFO L290 TraceCheckUtils]: 15: Hoare triple {2548#true} ~cond := #in~cond; {2548#true} is VALID [2022-04-15 14:13:41,060 INFO L290 TraceCheckUtils]: 16: Hoare triple {2548#true} assume !(0 == ~cond); {2548#true} is VALID [2022-04-15 14:13:41,060 INFO L290 TraceCheckUtils]: 17: Hoare triple {2548#true} assume true; {2548#true} is VALID [2022-04-15 14:13:41,061 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2548#true} {2585#(<= 1 main_~y~0)} #79#return; {2585#(<= 1 main_~y~0)} is VALID [2022-04-15 14:13:41,061 INFO L272 TraceCheckUtils]: 19: Hoare triple {2585#(<= 1 main_~y~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {2548#true} is VALID [2022-04-15 14:13:41,061 INFO L290 TraceCheckUtils]: 20: Hoare triple {2548#true} ~cond := #in~cond; {2548#true} is VALID [2022-04-15 14:13:41,061 INFO L290 TraceCheckUtils]: 21: Hoare triple {2548#true} assume !(0 == ~cond); {2548#true} is VALID [2022-04-15 14:13:41,061 INFO L290 TraceCheckUtils]: 22: Hoare triple {2548#true} assume true; {2548#true} is VALID [2022-04-15 14:13:41,062 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2548#true} {2585#(<= 1 main_~y~0)} #81#return; {2585#(<= 1 main_~y~0)} is VALID [2022-04-15 14:13:41,062 INFO L290 TraceCheckUtils]: 24: Hoare triple {2585#(<= 1 main_~y~0)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {2628#(<= 1 main_~r~0)} is VALID [2022-04-15 14:13:41,063 INFO L290 TraceCheckUtils]: 25: Hoare triple {2628#(<= 1 main_~r~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2628#(<= 1 main_~r~0)} is VALID [2022-04-15 14:13:41,063 INFO L290 TraceCheckUtils]: 26: Hoare triple {2628#(<= 1 main_~r~0)} assume !!(#t~post7 < 20);havoc #t~post7; {2628#(<= 1 main_~r~0)} is VALID [2022-04-15 14:13:41,063 INFO L272 TraceCheckUtils]: 27: Hoare triple {2628#(<= 1 main_~r~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {2548#true} is VALID [2022-04-15 14:13:41,063 INFO L290 TraceCheckUtils]: 28: Hoare triple {2548#true} ~cond := #in~cond; {2548#true} is VALID [2022-04-15 14:13:41,063 INFO L290 TraceCheckUtils]: 29: Hoare triple {2548#true} assume !(0 == ~cond); {2548#true} is VALID [2022-04-15 14:13:41,063 INFO L290 TraceCheckUtils]: 30: Hoare triple {2548#true} assume true; {2548#true} is VALID [2022-04-15 14:13:41,064 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2548#true} {2628#(<= 1 main_~r~0)} #83#return; {2628#(<= 1 main_~r~0)} is VALID [2022-04-15 14:13:41,064 INFO L272 TraceCheckUtils]: 32: Hoare triple {2628#(<= 1 main_~r~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {2548#true} is VALID [2022-04-15 14:13:41,064 INFO L290 TraceCheckUtils]: 33: Hoare triple {2548#true} ~cond := #in~cond; {2548#true} is VALID [2022-04-15 14:13:41,064 INFO L290 TraceCheckUtils]: 34: Hoare triple {2548#true} assume !(0 == ~cond); {2548#true} is VALID [2022-04-15 14:13:41,064 INFO L290 TraceCheckUtils]: 35: Hoare triple {2548#true} assume true; {2548#true} is VALID [2022-04-15 14:13:41,065 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2548#true} {2628#(<= 1 main_~r~0)} #85#return; {2628#(<= 1 main_~r~0)} is VALID [2022-04-15 14:13:41,065 INFO L272 TraceCheckUtils]: 37: Hoare triple {2628#(<= 1 main_~r~0)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {2668#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 14:13:41,066 INFO L290 TraceCheckUtils]: 38: Hoare triple {2668#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2672#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 14:13:41,066 INFO L290 TraceCheckUtils]: 39: Hoare triple {2672#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2549#false} is VALID [2022-04-15 14:13:41,066 INFO L290 TraceCheckUtils]: 40: Hoare triple {2549#false} assume !false; {2549#false} is VALID [2022-04-15 14:13:41,066 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-15 14:13:41,066 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 14:13:41,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:13:41,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799554416] [2022-04-15 14:13:41,066 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:13:41,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1374898230] [2022-04-15 14:13:41,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1374898230] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:13:41,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:13:41,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 14:13:41,067 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:13:41,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [789929626] [2022-04-15 14:13:41,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [789929626] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:13:41,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:13:41,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 14:13:41,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624118435] [2022-04-15 14:13:41,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:13:41,068 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 41 [2022-04-15 14:13:41,068 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:13:41,068 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-15 14:13:41,088 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:13:41,088 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 14:13:41,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:13:41,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 14:13:41,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-15 14:13:41,089 INFO L87 Difference]: Start difference. First operand 78 states and 102 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-15 14:13:41,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:13:41,380 INFO L93 Difference]: Finished difference Result 84 states and 107 transitions. [2022-04-15 14:13:41,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 14:13:41,380 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 41 [2022-04-15 14:13:41,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:13:41,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-15 14:13:41,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-15 14:13:41,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-15 14:13:41,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-15 14:13:41,382 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 47 transitions. [2022-04-15 14:13:41,413 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:13:41,414 INFO L225 Difference]: With dead ends: 84 [2022-04-15 14:13:41,414 INFO L226 Difference]: Without dead ends: 82 [2022-04-15 14:13:41,414 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 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:13:41,415 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 20 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 14:13:41,415 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 167 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 14:13:41,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-15 14:13:41,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-04-15 14:13:41,480 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:13:41,480 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 82 states, 50 states have (on average 1.22) internal successors, (61), 52 states have internal predecessors, (61), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 14:13:41,480 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 82 states, 50 states have (on average 1.22) internal successors, (61), 52 states have internal predecessors, (61), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 14:13:41,481 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 82 states, 50 states have (on average 1.22) internal successors, (61), 52 states have internal predecessors, (61), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 14:13:41,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:13:41,483 INFO L93 Difference]: Finished difference Result 82 states and 105 transitions. [2022-04-15 14:13:41,483 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 105 transitions. [2022-04-15 14:13:41,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:13:41,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:13:41,483 INFO L74 IsIncluded]: Start isIncluded. First operand has 82 states, 50 states have (on average 1.22) internal successors, (61), 52 states have internal predecessors, (61), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 82 states. [2022-04-15 14:13:41,484 INFO L87 Difference]: Start difference. First operand has 82 states, 50 states have (on average 1.22) internal successors, (61), 52 states have internal predecessors, (61), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 82 states. [2022-04-15 14:13:41,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:13:41,486 INFO L93 Difference]: Finished difference Result 82 states and 105 transitions. [2022-04-15 14:13:41,486 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 105 transitions. [2022-04-15 14:13:41,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:13:41,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:13:41,486 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:13:41,486 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:13:41,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 50 states have (on average 1.22) internal successors, (61), 52 states have internal predecessors, (61), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 14:13:41,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 105 transitions. [2022-04-15 14:13:41,489 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 105 transitions. Word has length 41 [2022-04-15 14:13:41,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:13:41,489 INFO L478 AbstractCegarLoop]: Abstraction has 82 states and 105 transitions. [2022-04-15 14:13:41,489 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-15 14:13:41,489 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 82 states and 105 transitions. [2022-04-15 14:13:41,572 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:13:41,572 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 105 transitions. [2022-04-15 14:13:41,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-15 14:13:41,578 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:13:41,578 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 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:13:41,597 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:13:41,779 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:13:41,779 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:13:41,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:13:41,780 INFO L85 PathProgramCache]: Analyzing trace with hash -683043127, now seen corresponding path program 1 times [2022-04-15 14:13:41,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:13:41,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [682353368] [2022-04-15 14:13:41,780 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:13:41,780 INFO L85 PathProgramCache]: Analyzing trace with hash -683043127, now seen corresponding path program 2 times [2022-04-15 14:13:41,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:13:41,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717915361] [2022-04-15 14:13:41,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:13:41,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:13:41,792 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:13:41,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [79016088] [2022-04-15 14:13:41,793 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:13:41,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:13:41,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:13:41,794 INFO L229 MonitoredProcess]: Starting monitored process 9 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:13:41,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-15 14:13:41,827 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 14:13:41,827 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:13:41,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 14:13:41,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:13:41,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:13:42,018 INFO L272 TraceCheckUtils]: 0: Hoare triple {3180#true} call ULTIMATE.init(); {3180#true} is VALID [2022-04-15 14:13:42,018 INFO L290 TraceCheckUtils]: 1: Hoare triple {3180#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);~counter~0 := 0; {3180#true} is VALID [2022-04-15 14:13:42,019 INFO L290 TraceCheckUtils]: 2: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-15 14:13:42,019 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3180#true} {3180#true} #93#return; {3180#true} is VALID [2022-04-15 14:13:42,019 INFO L272 TraceCheckUtils]: 4: Hoare triple {3180#true} call #t~ret8 := main(); {3180#true} is VALID [2022-04-15 14:13:42,019 INFO L290 TraceCheckUtils]: 5: Hoare triple {3180#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3180#true} is VALID [2022-04-15 14:13:42,019 INFO L272 TraceCheckUtils]: 6: Hoare triple {3180#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3180#true} is VALID [2022-04-15 14:13:42,019 INFO L290 TraceCheckUtils]: 7: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-15 14:13:42,019 INFO L290 TraceCheckUtils]: 8: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-15 14:13:42,019 INFO L290 TraceCheckUtils]: 9: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-15 14:13:42,019 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3180#true} {3180#true} #77#return; {3180#true} is VALID [2022-04-15 14:13:42,019 INFO L290 TraceCheckUtils]: 11: Hoare triple {3180#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {3180#true} is VALID [2022-04-15 14:13:42,020 INFO L290 TraceCheckUtils]: 12: Hoare triple {3180#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3180#true} is VALID [2022-04-15 14:13:42,020 INFO L290 TraceCheckUtils]: 13: Hoare triple {3180#true} assume !!(#t~post6 < 20);havoc #t~post6; {3180#true} is VALID [2022-04-15 14:13:42,020 INFO L272 TraceCheckUtils]: 14: Hoare triple {3180#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {3180#true} is VALID [2022-04-15 14:13:42,020 INFO L290 TraceCheckUtils]: 15: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-15 14:13:42,020 INFO L290 TraceCheckUtils]: 16: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-15 14:13:42,020 INFO L290 TraceCheckUtils]: 17: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-15 14:13:42,020 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3180#true} {3180#true} #79#return; {3180#true} is VALID [2022-04-15 14:13:42,020 INFO L272 TraceCheckUtils]: 19: Hoare triple {3180#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3180#true} is VALID [2022-04-15 14:13:42,020 INFO L290 TraceCheckUtils]: 20: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-15 14:13:42,020 INFO L290 TraceCheckUtils]: 21: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-15 14:13:42,020 INFO L290 TraceCheckUtils]: 22: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-15 14:13:42,021 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3180#true} {3180#true} #81#return; {3180#true} is VALID [2022-04-15 14:13:42,021 INFO L290 TraceCheckUtils]: 24: Hoare triple {3180#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {3180#true} is VALID [2022-04-15 14:13:42,021 INFO L290 TraceCheckUtils]: 25: Hoare triple {3180#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3180#true} is VALID [2022-04-15 14:13:42,021 INFO L290 TraceCheckUtils]: 26: Hoare triple {3180#true} assume !!(#t~post7 < 20);havoc #t~post7; {3180#true} is VALID [2022-04-15 14:13:42,021 INFO L272 TraceCheckUtils]: 27: Hoare triple {3180#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {3180#true} is VALID [2022-04-15 14:13:42,021 INFO L290 TraceCheckUtils]: 28: Hoare triple {3180#true} ~cond := #in~cond; {3269#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 14:13:42,022 INFO L290 TraceCheckUtils]: 29: Hoare triple {3269#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3273#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 14:13:42,022 INFO L290 TraceCheckUtils]: 30: Hoare triple {3273#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3273#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 14:13:42,023 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3273#(not (= |__VERIFIER_assert_#in~cond| 0))} {3180#true} #83#return; {3280#(= main_~b~0 (* main_~a~0 main_~y~0))} is VALID [2022-04-15 14:13:42,023 INFO L272 TraceCheckUtils]: 32: Hoare triple {3280#(= 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)); {3180#true} is VALID [2022-04-15 14:13:42,023 INFO L290 TraceCheckUtils]: 33: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-15 14:13:42,023 INFO L290 TraceCheckUtils]: 34: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-15 14:13:42,023 INFO L290 TraceCheckUtils]: 35: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-15 14:13:42,024 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3180#true} {3280#(= main_~b~0 (* main_~a~0 main_~y~0))} #85#return; {3280#(= main_~b~0 (* main_~a~0 main_~y~0))} is VALID [2022-04-15 14:13:42,024 INFO L272 TraceCheckUtils]: 37: Hoare triple {3280#(= main_~b~0 (* main_~a~0 main_~y~0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {3180#true} is VALID [2022-04-15 14:13:42,024 INFO L290 TraceCheckUtils]: 38: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-15 14:13:42,024 INFO L290 TraceCheckUtils]: 39: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-15 14:13:42,024 INFO L290 TraceCheckUtils]: 40: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-15 14:13:42,025 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3180#true} {3280#(= main_~b~0 (* main_~a~0 main_~y~0))} #87#return; {3280#(= main_~b~0 (* main_~a~0 main_~y~0))} is VALID [2022-04-15 14:13:42,025 INFO L290 TraceCheckUtils]: 42: Hoare triple {3280#(= main_~b~0 (* main_~a~0 main_~y~0))} assume !!(~r~0 >= 2 * ~b~0); {3314#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} is VALID [2022-04-15 14:13:42,026 INFO L272 TraceCheckUtils]: 43: Hoare triple {3314#(<= (* 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)); {3318#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 14:13:42,026 INFO L290 TraceCheckUtils]: 44: Hoare triple {3318#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3322#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 14:13:42,027 INFO L290 TraceCheckUtils]: 45: Hoare triple {3322#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3181#false} is VALID [2022-04-15 14:13:42,027 INFO L290 TraceCheckUtils]: 46: Hoare triple {3181#false} assume !false; {3181#false} is VALID [2022-04-15 14:13:42,027 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-15 14:13:42,027 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 14:13:50,388 INFO L290 TraceCheckUtils]: 46: Hoare triple {3181#false} assume !false; {3181#false} is VALID [2022-04-15 14:13:50,388 INFO L290 TraceCheckUtils]: 45: Hoare triple {3322#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3181#false} is VALID [2022-04-15 14:13:50,389 INFO L290 TraceCheckUtils]: 44: Hoare triple {3318#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3322#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 14:13:50,389 INFO L272 TraceCheckUtils]: 43: Hoare triple {3314#(<= (* 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)); {3318#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 14:13:50,390 INFO L290 TraceCheckUtils]: 42: Hoare triple {3341#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} assume !!(~r~0 >= 2 * ~b~0); {3314#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} is VALID [2022-04-15 14:13:50,390 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3180#true} {3341#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} #87#return; {3341#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} is VALID [2022-04-15 14:13:50,391 INFO L290 TraceCheckUtils]: 40: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-15 14:13:50,391 INFO L290 TraceCheckUtils]: 39: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-15 14:13:50,391 INFO L290 TraceCheckUtils]: 38: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-15 14:13:50,391 INFO L272 TraceCheckUtils]: 37: Hoare triple {3341#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {3180#true} is VALID [2022-04-15 14:13:50,392 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3180#true} {3341#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} #85#return; {3341#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} is VALID [2022-04-15 14:13:50,392 INFO L290 TraceCheckUtils]: 35: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-15 14:13:50,392 INFO L290 TraceCheckUtils]: 34: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-15 14:13:50,392 INFO L290 TraceCheckUtils]: 33: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-15 14:13:50,392 INFO L272 TraceCheckUtils]: 32: Hoare triple {3341#(<= (* 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)); {3180#true} is VALID [2022-04-15 14:13:50,393 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3273#(not (= |__VERIFIER_assert_#in~cond| 0))} {3180#true} #83#return; {3341#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} is VALID [2022-04-15 14:13:50,393 INFO L290 TraceCheckUtils]: 30: Hoare triple {3273#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3273#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 14:13:50,393 INFO L290 TraceCheckUtils]: 29: Hoare triple {3384#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3273#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 14:13:50,394 INFO L290 TraceCheckUtils]: 28: Hoare triple {3180#true} ~cond := #in~cond; {3384#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 14:13:50,394 INFO L272 TraceCheckUtils]: 27: Hoare triple {3180#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {3180#true} is VALID [2022-04-15 14:13:50,394 INFO L290 TraceCheckUtils]: 26: Hoare triple {3180#true} assume !!(#t~post7 < 20);havoc #t~post7; {3180#true} is VALID [2022-04-15 14:13:50,394 INFO L290 TraceCheckUtils]: 25: Hoare triple {3180#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3180#true} is VALID [2022-04-15 14:13:50,394 INFO L290 TraceCheckUtils]: 24: Hoare triple {3180#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {3180#true} is VALID [2022-04-15 14:13:50,394 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3180#true} {3180#true} #81#return; {3180#true} is VALID [2022-04-15 14:13:50,394 INFO L290 TraceCheckUtils]: 22: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-15 14:13:50,395 INFO L290 TraceCheckUtils]: 21: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-15 14:13:50,395 INFO L290 TraceCheckUtils]: 20: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-15 14:13:50,395 INFO L272 TraceCheckUtils]: 19: Hoare triple {3180#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3180#true} is VALID [2022-04-15 14:13:50,395 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3180#true} {3180#true} #79#return; {3180#true} is VALID [2022-04-15 14:13:50,395 INFO L290 TraceCheckUtils]: 17: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-15 14:13:50,395 INFO L290 TraceCheckUtils]: 16: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-15 14:13:50,395 INFO L290 TraceCheckUtils]: 15: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-15 14:13:50,395 INFO L272 TraceCheckUtils]: 14: Hoare triple {3180#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {3180#true} is VALID [2022-04-15 14:13:50,395 INFO L290 TraceCheckUtils]: 13: Hoare triple {3180#true} assume !!(#t~post6 < 20);havoc #t~post6; {3180#true} is VALID [2022-04-15 14:13:50,395 INFO L290 TraceCheckUtils]: 12: Hoare triple {3180#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3180#true} is VALID [2022-04-15 14:13:50,395 INFO L290 TraceCheckUtils]: 11: Hoare triple {3180#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {3180#true} is VALID [2022-04-15 14:13:50,396 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3180#true} {3180#true} #77#return; {3180#true} is VALID [2022-04-15 14:13:50,396 INFO L290 TraceCheckUtils]: 9: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-15 14:13:50,396 INFO L290 TraceCheckUtils]: 8: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-15 14:13:50,396 INFO L290 TraceCheckUtils]: 7: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-15 14:13:50,396 INFO L272 TraceCheckUtils]: 6: Hoare triple {3180#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3180#true} is VALID [2022-04-15 14:13:50,396 INFO L290 TraceCheckUtils]: 5: Hoare triple {3180#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3180#true} is VALID [2022-04-15 14:13:50,396 INFO L272 TraceCheckUtils]: 4: Hoare triple {3180#true} call #t~ret8 := main(); {3180#true} is VALID [2022-04-15 14:13:50,396 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3180#true} {3180#true} #93#return; {3180#true} is VALID [2022-04-15 14:13:50,396 INFO L290 TraceCheckUtils]: 2: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-15 14:13:50,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {3180#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);~counter~0 := 0; {3180#true} is VALID [2022-04-15 14:13:50,396 INFO L272 TraceCheckUtils]: 0: Hoare triple {3180#true} call ULTIMATE.init(); {3180#true} is VALID [2022-04-15 14:13:50,397 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-15 14:13:50,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:13:50,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717915361] [2022-04-15 14:13:50,397 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:13:50,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79016088] [2022-04-15 14:13:50,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79016088] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 14:13:50,397 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 14:13:50,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-15 14:13:50,397 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:13:50,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [682353368] [2022-04-15 14:13:50,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [682353368] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:13:50,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:13:50,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 14:13:50,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310970382] [2022-04-15 14:13:50,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:13:50,398 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 47 [2022-04-15 14:13:50,398 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:13:50,398 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-15 14:13:50,428 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:13:50,428 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 14:13:50,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:13:50,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 14:13:50,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-15 14:13:50,428 INFO L87 Difference]: Start difference. First operand 82 states and 105 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-15 14:13:50,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:13:50,762 INFO L93 Difference]: Finished difference Result 88 states and 110 transitions. [2022-04-15 14:13:50,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 14:13:50,762 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 47 [2022-04-15 14:13:50,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:13:50,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-15 14:13:50,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-15 14:13:50,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-15 14:13:50,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-15 14:13:50,764 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 47 transitions. [2022-04-15 14:13:50,798 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:13:50,800 INFO L225 Difference]: With dead ends: 88 [2022-04-15 14:13:50,800 INFO L226 Difference]: Without dead ends: 86 [2022-04-15 14:13:50,800 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 84 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:13:50,800 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 22 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 14:13:50,801 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 115 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 14:13:50,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-04-15 14:13:50,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-04-15 14:13:50,863 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:13:50,863 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand has 86 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 55 states have internal predecessors, (64), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 14:13:50,863 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand has 86 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 55 states have internal predecessors, (64), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 14:13:50,863 INFO L87 Difference]: Start difference. First operand 86 states. Second operand has 86 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 55 states have internal predecessors, (64), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 14:13:50,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:13:50,866 INFO L93 Difference]: Finished difference Result 86 states and 108 transitions. [2022-04-15 14:13:50,866 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 108 transitions. [2022-04-15 14:13:50,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:13:50,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:13:50,866 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 55 states have internal predecessors, (64), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 86 states. [2022-04-15 14:13:50,866 INFO L87 Difference]: Start difference. First operand has 86 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 55 states have internal predecessors, (64), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 86 states. [2022-04-15 14:13:50,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:13:50,868 INFO L93 Difference]: Finished difference Result 86 states and 108 transitions. [2022-04-15 14:13:50,869 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 108 transitions. [2022-04-15 14:13:50,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:13:50,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:13:50,869 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:13:50,869 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:13:50,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 55 states have internal predecessors, (64), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 14:13:50,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 108 transitions. [2022-04-15 14:13:50,871 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 108 transitions. Word has length 47 [2022-04-15 14:13:50,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:13:50,872 INFO L478 AbstractCegarLoop]: Abstraction has 86 states and 108 transitions. [2022-04-15 14:13:50,872 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-15 14:13:50,872 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 86 states and 108 transitions. [2022-04-15 14:13:50,964 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:13:50,964 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 108 transitions. [2022-04-15 14:13:50,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-15 14:13:50,965 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:13:50,965 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 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, 1, 1, 1, 1, 1] [2022-04-15 14:13:50,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-15 14:13:51,165 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-15 14:13:51,166 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:13:51,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:13:51,166 INFO L85 PathProgramCache]: Analyzing trace with hash -589126939, now seen corresponding path program 1 times [2022-04-15 14:13:51,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:13:51,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [903585373]