/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench/cohendiv-ll.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 07:13:37,896 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 07:13:37,898 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 07:13:37,941 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 07:13:37,942 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 07:13:37,944 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 07:13:37,947 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 07:13:37,955 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 07:13:37,957 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 07:13:37,958 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 07:13:37,958 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 07:13:37,959 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 07:13:37,960 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 07:13:37,960 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 07:13:37,961 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 07:13:37,962 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 07:13:37,963 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 07:13:37,964 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 07:13:37,965 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 07:13:37,966 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 07:13:37,971 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 07:13:37,976 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 07:13:37,979 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 07:13:37,983 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 07:13:37,986 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 07:13:37,994 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 07:13:37,995 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 07:13:37,995 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 07:13:37,996 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 07:13:37,996 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 07:13:37,998 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 07:13:37,998 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 07:13:38,004 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 07:13:38,004 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 07:13:38,005 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 07:13:38,006 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 07:13:38,006 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 07:13:38,007 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 07:13:38,007 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 07:13:38,007 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 07:13:38,008 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 07:13:38,010 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 07:13:38,011 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 07:13:38,025 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 07:13:38,025 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 07:13:38,026 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 07:13:38,027 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 07:13:38,027 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 07:13:38,027 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 07:13:38,027 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 07:13:38,027 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 07:13:38,028 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 07:13:38,028 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 07:13:38,029 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 07:13:38,029 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 07:13:38,029 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 07:13:38,029 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 07:13:38,029 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 07:13:38,029 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 07:13:38,029 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 07:13:38,029 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 07:13:38,030 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 07:13:38,030 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 07:13:38,030 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 07:13:38,030 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 07:13:38,030 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 07:13:38,030 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 07:13:38,030 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 07:13:38,030 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 07:13:38,280 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 07:13:38,304 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 07:13:38,307 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 07:13:38,308 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 07:13:38,308 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 07:13:38,310 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/cohendiv-ll.c [2022-04-15 07:13:38,380 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6770cda10/6467714ade184d489a0cbdec8729957c/FLAG94d4e090b [2022-04-15 07:13:38,840 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 07:13:38,841 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/cohendiv-ll.c [2022-04-15 07:13:38,849 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6770cda10/6467714ade184d489a0cbdec8729957c/FLAG94d4e090b [2022-04-15 07:13:39,212 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6770cda10/6467714ade184d489a0cbdec8729957c [2022-04-15 07:13:39,214 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 07:13:39,216 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 07:13:39,217 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 07:13:39,218 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 07:13:39,222 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 07:13:39,223 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 07:13:39" (1/1) ... [2022-04-15 07:13:39,224 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@92b2d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:13:39, skipping insertion in model container [2022-04-15 07:13:39,225 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 07:13:39" (1/1) ... [2022-04-15 07:13:39,232 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 07:13:39,247 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 07:13:39,402 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/cohendiv-ll.c[576,589] [2022-04-15 07:13:39,431 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 07:13:39,441 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 07:13:39,456 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/cohendiv-ll.c[576,589] [2022-04-15 07:13:39,474 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 07:13:39,486 INFO L208 MainTranslator]: Completed translation [2022-04-15 07:13:39,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:13:39 WrapperNode [2022-04-15 07:13:39,487 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 07:13:39,488 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 07:13:39,488 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 07:13:39,488 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 07:13:39,498 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:13:39" (1/1) ... [2022-04-15 07:13:39,498 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:13:39" (1/1) ... [2022-04-15 07:13:39,505 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:13:39" (1/1) ... [2022-04-15 07:13:39,506 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:13:39" (1/1) ... [2022-04-15 07:13:39,511 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:13:39" (1/1) ... [2022-04-15 07:13:39,516 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:13:39" (1/1) ... [2022-04-15 07:13:39,521 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:13:39" (1/1) ... [2022-04-15 07:13:39,523 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 07:13:39,524 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 07:13:39,524 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 07:13:39,524 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 07:13:39,527 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:13:39" (1/1) ... [2022-04-15 07:13:39,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 07:13:39,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:13:39,561 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 07:13:39,582 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 07:13:39,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 07:13:39,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 07:13:39,600 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 07:13:39,600 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 07:13:39,600 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 07:13:39,600 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 07:13:39,600 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 07:13:39,600 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 07:13:39,600 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 07:13:39,601 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 07:13:39,601 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 07:13:39,602 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 07:13:39,602 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 07:13:39,602 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 07:13:39,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 07:13:39,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 07:13:39,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 07:13:39,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 07:13:39,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 07:13:39,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 07:13:39,667 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 07:13:39,669 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 07:13:39,835 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 07:13:39,843 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 07:13:39,843 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 07:13:39,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 07:13:39 BoogieIcfgContainer [2022-04-15 07:13:39,845 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 07:13:39,847 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 07:13:39,847 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 07:13:39,866 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 07:13:39,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 07:13:39" (1/3) ... [2022-04-15 07:13:39,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59f6f63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 07:13:39, skipping insertion in model container [2022-04-15 07:13:39,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:13:39" (2/3) ... [2022-04-15 07:13:39,868 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59f6f63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 07:13:39, skipping insertion in model container [2022-04-15 07:13:39,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 07:13:39" (3/3) ... [2022-04-15 07:13:39,869 INFO L111 eAbstractionObserver]: Analyzing ICFG cohendiv-ll.c [2022-04-15 07:13:39,874 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 07:13:39,874 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 07:13:39,942 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 07:13:39,948 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 07:13:39,948 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 07:13:39,965 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 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 07:13:39,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 07:13:39,972 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:13:39,973 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 07:13:39,973 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:13:39,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:13:39,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1389800432, now seen corresponding path program 1 times [2022-04-15 07:13:39,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:13:39,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1530556926] [2022-04-15 07:13:40,001 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:13:40,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1389800432, now seen corresponding path program 2 times [2022-04-15 07:13:40,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:13:40,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508495275] [2022-04-15 07:13:40,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:13:40,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:13:40,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:13:40,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:13:40,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:13:40,196 INFO L290 TraceCheckUtils]: 0: Hoare triple {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {39#true} is VALID [2022-04-15 07:13:40,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#true} assume true; {39#true} is VALID [2022-04-15 07:13:40,197 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39#true} {39#true} #91#return; {39#true} is VALID [2022-04-15 07:13:40,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 07:13:40,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:13:40,223 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#true} ~cond := #in~cond; {39#true} is VALID [2022-04-15 07:13:40,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#true} assume 0 == ~cond;assume false; {40#false} is VALID [2022-04-15 07:13:40,225 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#false} assume true; {40#false} is VALID [2022-04-15 07:13:40,225 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#false} {39#true} #75#return; {40#false} is VALID [2022-04-15 07:13:40,230 INFO L272 TraceCheckUtils]: 0: Hoare triple {39#true} call ULTIMATE.init(); {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:13:40,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {39#true} is VALID [2022-04-15 07:13:40,230 INFO L290 TraceCheckUtils]: 2: Hoare triple {39#true} assume true; {39#true} is VALID [2022-04-15 07:13:40,231 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} #91#return; {39#true} is VALID [2022-04-15 07:13:40,231 INFO L272 TraceCheckUtils]: 4: Hoare triple {39#true} call #t~ret6 := main(); {39#true} is VALID [2022-04-15 07:13:40,231 INFO L290 TraceCheckUtils]: 5: Hoare triple {39#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; {39#true} is VALID [2022-04-15 07:13:40,231 INFO L272 TraceCheckUtils]: 6: Hoare triple {39#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {39#true} is VALID [2022-04-15 07:13:40,232 INFO L290 TraceCheckUtils]: 7: Hoare triple {39#true} ~cond := #in~cond; {39#true} is VALID [2022-04-15 07:13:40,233 INFO L290 TraceCheckUtils]: 8: Hoare triple {39#true} assume 0 == ~cond;assume false; {40#false} is VALID [2022-04-15 07:13:40,233 INFO L290 TraceCheckUtils]: 9: Hoare triple {40#false} assume true; {40#false} is VALID [2022-04-15 07:13:40,234 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {40#false} {39#true} #75#return; {40#false} is VALID [2022-04-15 07:13:40,234 INFO L290 TraceCheckUtils]: 11: Hoare triple {40#false} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {40#false} is VALID [2022-04-15 07:13:40,234 INFO L290 TraceCheckUtils]: 12: Hoare triple {40#false} assume false; {40#false} is VALID [2022-04-15 07:13:40,235 INFO L272 TraceCheckUtils]: 13: Hoare triple {40#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {40#false} is VALID [2022-04-15 07:13:40,235 INFO L290 TraceCheckUtils]: 14: Hoare triple {40#false} ~cond := #in~cond; {40#false} is VALID [2022-04-15 07:13:40,236 INFO L290 TraceCheckUtils]: 15: Hoare triple {40#false} assume 0 == ~cond; {40#false} is VALID [2022-04-15 07:13:40,237 INFO L290 TraceCheckUtils]: 16: Hoare triple {40#false} assume !false; {40#false} is VALID [2022-04-15 07:13:40,237 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 07:13:40,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:13:40,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508495275] [2022-04-15 07:13:40,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508495275] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:13:40,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:13:40,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 07:13:40,241 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:13:40,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1530556926] [2022-04-15 07:13:40,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1530556926] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:13:40,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:13:40,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 07:13:40,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771591783] [2022-04-15 07:13:40,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:13:40,252 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 07:13:40,254 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:13:40,258 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 07:13:40,296 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 07:13:40,296 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 07:13:40,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:13:40,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 07:13:40,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 07:13:40,333 INFO L87 Difference]: Start difference. First operand has 36 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 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 07:13:40,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:13:40,565 INFO L93 Difference]: Finished difference Result 63 states and 95 transitions. [2022-04-15 07:13:40,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 07:13:40,566 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 07:13:40,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:13:40,568 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 07:13:40,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-15 07:13:40,579 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 07:13:40,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-15 07:13:40,587 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 95 transitions. [2022-04-15 07:13:40,716 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:13:40,724 INFO L225 Difference]: With dead ends: 63 [2022-04-15 07:13:40,725 INFO L226 Difference]: Without dead ends: 31 [2022-04-15 07:13:40,728 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 07:13:40,731 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:13:40,732 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 38 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 07:13:40,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-15 07:13:40,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-15 07:13:40,775 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:13:40,776 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 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 07:13:40,777 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 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 07:13:40,777 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 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 07:13:40,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:13:40,782 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2022-04-15 07:13:40,782 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2022-04-15 07:13:40,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:13:40,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:13:40,786 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 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 31 states. [2022-04-15 07:13:40,787 INFO L87 Difference]: Start difference. First operand has 31 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 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 31 states. [2022-04-15 07:13:40,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:13:40,804 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2022-04-15 07:13:40,804 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2022-04-15 07:13:40,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:13:40,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:13:40,805 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:13:40,805 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:13:40,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 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 07:13:40,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2022-04-15 07:13:40,827 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 17 [2022-04-15 07:13:40,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:13:40,827 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2022-04-15 07:13:40,828 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 07:13:40,828 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 38 transitions. [2022-04-15 07:13:40,887 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 07:13:40,887 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2022-04-15 07:13:40,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 07:13:40,889 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:13:40,889 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 07:13:40,889 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 07:13:40,889 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:13:40,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:13:40,892 INFO L85 PathProgramCache]: Analyzing trace with hash 2071348352, now seen corresponding path program 1 times [2022-04-15 07:13:40,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:13:40,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [889346326] [2022-04-15 07:13:40,898 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:13:40,899 INFO L85 PathProgramCache]: Analyzing trace with hash 2071348352, now seen corresponding path program 2 times [2022-04-15 07:13:40,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:13:40,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174807401] [2022-04-15 07:13:40,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:13:40,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:13:40,941 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:13:40,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2100769254] [2022-04-15 07:13:40,941 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:13:40,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:13:40,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:13:40,947 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 07:13:40,963 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 07:13:41,014 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 07:13:41,014 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:13:41,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 07:13:41,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:13:41,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:13:41,205 INFO L272 TraceCheckUtils]: 0: Hoare triple {301#true} call ULTIMATE.init(); {301#true} is VALID [2022-04-15 07:13:41,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {301#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); {301#true} is VALID [2022-04-15 07:13:41,206 INFO L290 TraceCheckUtils]: 2: Hoare triple {301#true} assume true; {301#true} is VALID [2022-04-15 07:13:41,206 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {301#true} {301#true} #91#return; {301#true} is VALID [2022-04-15 07:13:41,206 INFO L272 TraceCheckUtils]: 4: Hoare triple {301#true} call #t~ret6 := main(); {301#true} is VALID [2022-04-15 07:13:41,207 INFO L290 TraceCheckUtils]: 5: Hoare triple {301#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; {301#true} is VALID [2022-04-15 07:13:41,207 INFO L272 TraceCheckUtils]: 6: Hoare triple {301#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {301#true} is VALID [2022-04-15 07:13:41,207 INFO L290 TraceCheckUtils]: 7: Hoare triple {301#true} ~cond := #in~cond; {301#true} is VALID [2022-04-15 07:13:41,207 INFO L290 TraceCheckUtils]: 8: Hoare triple {301#true} assume !(0 == ~cond); {301#true} is VALID [2022-04-15 07:13:41,208 INFO L290 TraceCheckUtils]: 9: Hoare triple {301#true} assume true; {301#true} is VALID [2022-04-15 07:13:41,208 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {301#true} {301#true} #75#return; {301#true} is VALID [2022-04-15 07:13:41,210 INFO L290 TraceCheckUtils]: 11: Hoare triple {301#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {339#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 07:13:41,211 INFO L290 TraceCheckUtils]: 12: Hoare triple {339#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false; {339#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 07:13:41,213 INFO L272 TraceCheckUtils]: 13: Hoare triple {339#(and (= main_~a~0 0) (= main_~b~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {346#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:13:41,214 INFO L290 TraceCheckUtils]: 14: Hoare triple {346#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {350#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:13:41,215 INFO L290 TraceCheckUtils]: 15: Hoare triple {350#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {302#false} is VALID [2022-04-15 07:13:41,215 INFO L290 TraceCheckUtils]: 16: Hoare triple {302#false} assume !false; {302#false} is VALID [2022-04-15 07:13:41,216 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 07:13:41,216 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 07:13:41,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:13:41,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174807401] [2022-04-15 07:13:41,218 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:13:41,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100769254] [2022-04-15 07:13:41,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100769254] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:13:41,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:13:41,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 07:13:41,219 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:13:41,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [889346326] [2022-04-15 07:13:41,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [889346326] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:13:41,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:13:41,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 07:13:41,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262054332] [2022-04-15 07:13:41,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:13:41,221 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-15 07:13:41,221 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:13:41,221 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:13:41,240 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 07:13:41,240 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 07:13:41,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:13:41,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 07:13:41,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 07:13:41,242 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:13:41,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:13:41,453 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-04-15 07:13:41,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 07:13:41,454 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-15 07:13:41,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:13:41,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:13:41,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-04-15 07:13:41,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:13:41,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-04-15 07:13:41,468 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 51 transitions. [2022-04-15 07:13:41,523 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 07:13:41,528 INFO L225 Difference]: With dead ends: 42 [2022-04-15 07:13:41,529 INFO L226 Difference]: Without dead ends: 40 [2022-04-15 07:13:41,530 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 07:13:41,533 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 6 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 129 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 07:13:41,538 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 129 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 07:13:41,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-15 07:13:41,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2022-04-15 07:13:41,558 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:13:41,558 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 37 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 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 07:13:41,559 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 37 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 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 07:13:41,562 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 37 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 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 07:13:41,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:13:41,568 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2022-04-15 07:13:41,568 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2022-04-15 07:13:41,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:13:41,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:13:41,570 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 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 40 states. [2022-04-15 07:13:41,571 INFO L87 Difference]: Start difference. First operand has 37 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 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 40 states. [2022-04-15 07:13:41,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:13:41,574 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2022-04-15 07:13:41,574 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2022-04-15 07:13:41,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:13:41,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:13:41,575 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:13:41,575 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:13:41,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 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 07:13:41,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2022-04-15 07:13:41,579 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 17 [2022-04-15 07:13:41,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:13:41,579 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2022-04-15 07:13:41,579 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:13:41,579 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 44 transitions. [2022-04-15 07:13:41,636 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 07:13:41,637 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2022-04-15 07:13:41,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 07:13:41,639 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:13:41,640 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] [2022-04-15 07:13:41,659 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 07:13:41,843 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 07:13:41,844 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:13:41,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:13:41,844 INFO L85 PathProgramCache]: Analyzing trace with hash 933849696, now seen corresponding path program 1 times [2022-04-15 07:13:41,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:13:41,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1113892519] [2022-04-15 07:13:41,845 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:13:41,845 INFO L85 PathProgramCache]: Analyzing trace with hash 933849696, now seen corresponding path program 2 times [2022-04-15 07:13:41,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:13:41,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904363159] [2022-04-15 07:13:41,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:13:41,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:13:41,880 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:13:41,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1671407962] [2022-04-15 07:13:41,880 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:13:41,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:13:41,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:13:41,886 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 07:13:41,888 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 07:13:41,936 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:13:41,936 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:13:41,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 07:13:41,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:13:41,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:13:42,115 INFO L272 TraceCheckUtils]: 0: Hoare triple {596#true} call ULTIMATE.init(); {596#true} is VALID [2022-04-15 07:13:42,115 INFO L290 TraceCheckUtils]: 1: Hoare triple {596#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); {596#true} is VALID [2022-04-15 07:13:42,116 INFO L290 TraceCheckUtils]: 2: Hoare triple {596#true} assume true; {596#true} is VALID [2022-04-15 07:13:42,116 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {596#true} {596#true} #91#return; {596#true} is VALID [2022-04-15 07:13:42,116 INFO L272 TraceCheckUtils]: 4: Hoare triple {596#true} call #t~ret6 := main(); {596#true} is VALID [2022-04-15 07:13:42,116 INFO L290 TraceCheckUtils]: 5: Hoare triple {596#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; {596#true} is VALID [2022-04-15 07:13:42,117 INFO L272 TraceCheckUtils]: 6: Hoare triple {596#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {596#true} is VALID [2022-04-15 07:13:42,118 INFO L290 TraceCheckUtils]: 7: Hoare triple {596#true} ~cond := #in~cond; {596#true} is VALID [2022-04-15 07:13:42,121 INFO L290 TraceCheckUtils]: 8: Hoare triple {596#true} assume !(0 == ~cond); {596#true} is VALID [2022-04-15 07:13:42,121 INFO L290 TraceCheckUtils]: 9: Hoare triple {596#true} assume true; {596#true} is VALID [2022-04-15 07:13:42,122 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {596#true} {596#true} #75#return; {596#true} is VALID [2022-04-15 07:13:42,123 INFO L290 TraceCheckUtils]: 11: Hoare triple {596#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {634#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 07:13:42,125 INFO L290 TraceCheckUtils]: 12: Hoare triple {634#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !false; {634#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 07:13:42,125 INFO L272 TraceCheckUtils]: 13: Hoare triple {634#(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)); {596#true} is VALID [2022-04-15 07:13:42,125 INFO L290 TraceCheckUtils]: 14: Hoare triple {596#true} ~cond := #in~cond; {596#true} is VALID [2022-04-15 07:13:42,125 INFO L290 TraceCheckUtils]: 15: Hoare triple {596#true} assume !(0 == ~cond); {596#true} is VALID [2022-04-15 07:13:42,125 INFO L290 TraceCheckUtils]: 16: Hoare triple {596#true} assume true; {596#true} is VALID [2022-04-15 07:13:42,128 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {596#true} {634#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #77#return; {634#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 07:13:42,130 INFO L272 TraceCheckUtils]: 18: Hoare triple {634#(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)); {656#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:13:42,131 INFO L290 TraceCheckUtils]: 19: Hoare triple {656#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {660#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:13:42,131 INFO L290 TraceCheckUtils]: 20: Hoare triple {660#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {597#false} is VALID [2022-04-15 07:13:42,132 INFO L290 TraceCheckUtils]: 21: Hoare triple {597#false} assume !false; {597#false} is VALID [2022-04-15 07:13:42,132 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 07:13:42,132 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 07:13:42,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:13:42,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904363159] [2022-04-15 07:13:42,132 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:13:42,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671407962] [2022-04-15 07:13:42,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1671407962] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:13:42,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:13:42,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 07:13:42,133 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:13:42,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1113892519] [2022-04-15 07:13:42,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1113892519] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:13:42,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:13:42,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 07:13:42,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954921804] [2022-04-15 07:13:42,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:13:42,135 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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 22 [2022-04-15 07:13:42,135 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:13:42,135 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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 07:13:42,153 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:13:42,154 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 07:13:42,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:13:42,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 07:13:42,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 07:13:42,156 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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 07:13:42,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:13:42,388 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2022-04-15 07:13:42,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 07:13:42,389 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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 22 [2022-04-15 07:13:42,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:13:42,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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 07:13:42,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-15 07:13:42,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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 07:13:42,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-15 07:13:42,394 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-15 07:13:42,456 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:13:42,458 INFO L225 Difference]: With dead ends: 54 [2022-04-15 07:13:42,458 INFO L226 Difference]: Without dead ends: 51 [2022-04-15 07:13:42,459 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 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 07:13:42,460 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 11 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 123 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 07:13:42,460 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 123 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 07:13:42,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-15 07:13:42,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-04-15 07:13:42,477 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:13:42,477 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 50 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 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 07:13:42,478 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 50 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 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 07:13:42,478 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 50 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 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 07:13:42,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:13:42,481 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2022-04-15 07:13:42,481 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2022-04-15 07:13:42,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:13:42,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:13:42,483 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 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 51 states. [2022-04-15 07:13:42,483 INFO L87 Difference]: Start difference. First operand has 50 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 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 51 states. [2022-04-15 07:13:42,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:13:42,486 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2022-04-15 07:13:42,486 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2022-04-15 07:13:42,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:13:42,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:13:42,487 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:13:42,487 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:13:42,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 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 07:13:42,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2022-04-15 07:13:42,490 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 22 [2022-04-15 07:13:42,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:13:42,491 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2022-04-15 07:13:42,491 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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 07:13:42,491 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 62 transitions. [2022-04-15 07:13:42,560 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:13:42,560 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-15 07:13:42,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 07:13:42,561 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:13:42,561 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] [2022-04-15 07:13:42,587 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 07:13:42,787 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 07:13:42,788 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:13:42,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:13:42,788 INFO L85 PathProgramCache]: Analyzing trace with hash 721086345, now seen corresponding path program 1 times [2022-04-15 07:13:42,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:13:42,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1843842903] [2022-04-15 07:13:42,789 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:13:42,789 INFO L85 PathProgramCache]: Analyzing trace with hash 721086345, now seen corresponding path program 2 times [2022-04-15 07:13:42,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:13:42,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231077271] [2022-04-15 07:13:42,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:13:42,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:13:42,807 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:13:42,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [219482732] [2022-04-15 07:13:42,807 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:13:42,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:13:42,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:13:42,809 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 07:13:42,819 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 07:13:42,859 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:13:42,860 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:13:42,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 07:13:42,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:13:42,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:13:43,005 INFO L272 TraceCheckUtils]: 0: Hoare triple {978#true} call ULTIMATE.init(); {978#true} is VALID [2022-04-15 07:13:43,006 INFO L290 TraceCheckUtils]: 1: Hoare triple {978#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); {978#true} is VALID [2022-04-15 07:13:43,006 INFO L290 TraceCheckUtils]: 2: Hoare triple {978#true} assume true; {978#true} is VALID [2022-04-15 07:13:43,006 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {978#true} {978#true} #91#return; {978#true} is VALID [2022-04-15 07:13:43,006 INFO L272 TraceCheckUtils]: 4: Hoare triple {978#true} call #t~ret6 := main(); {978#true} is VALID [2022-04-15 07:13:43,006 INFO L290 TraceCheckUtils]: 5: Hoare triple {978#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; {978#true} is VALID [2022-04-15 07:13:43,007 INFO L272 TraceCheckUtils]: 6: Hoare triple {978#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {978#true} is VALID [2022-04-15 07:13:43,007 INFO L290 TraceCheckUtils]: 7: Hoare triple {978#true} ~cond := #in~cond; {978#true} is VALID [2022-04-15 07:13:43,007 INFO L290 TraceCheckUtils]: 8: Hoare triple {978#true} assume !(0 == ~cond); {978#true} is VALID [2022-04-15 07:13:43,007 INFO L290 TraceCheckUtils]: 9: Hoare triple {978#true} assume true; {978#true} is VALID [2022-04-15 07:13:43,007 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {978#true} {978#true} #75#return; {978#true} is VALID [2022-04-15 07:13:43,007 INFO L290 TraceCheckUtils]: 11: Hoare triple {978#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {978#true} is VALID [2022-04-15 07:13:43,007 INFO L290 TraceCheckUtils]: 12: Hoare triple {978#true} assume !false; {978#true} is VALID [2022-04-15 07:13:43,008 INFO L272 TraceCheckUtils]: 13: Hoare triple {978#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {978#true} is VALID [2022-04-15 07:13:43,008 INFO L290 TraceCheckUtils]: 14: Hoare triple {978#true} ~cond := #in~cond; {978#true} is VALID [2022-04-15 07:13:43,008 INFO L290 TraceCheckUtils]: 15: Hoare triple {978#true} assume !(0 == ~cond); {978#true} is VALID [2022-04-15 07:13:43,008 INFO L290 TraceCheckUtils]: 16: Hoare triple {978#true} assume true; {978#true} is VALID [2022-04-15 07:13:43,008 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {978#true} {978#true} #77#return; {978#true} is VALID [2022-04-15 07:13:43,008 INFO L272 TraceCheckUtils]: 18: Hoare triple {978#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {978#true} is VALID [2022-04-15 07:13:43,008 INFO L290 TraceCheckUtils]: 19: Hoare triple {978#true} ~cond := #in~cond; {978#true} is VALID [2022-04-15 07:13:43,009 INFO L290 TraceCheckUtils]: 20: Hoare triple {978#true} assume !(0 == ~cond); {978#true} is VALID [2022-04-15 07:13:43,009 INFO L290 TraceCheckUtils]: 21: Hoare triple {978#true} assume true; {978#true} is VALID [2022-04-15 07:13:43,009 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {978#true} {978#true} #79#return; {978#true} is VALID [2022-04-15 07:13:43,010 INFO L290 TraceCheckUtils]: 23: Hoare triple {978#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {1052#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} is VALID [2022-04-15 07:13:43,010 INFO L290 TraceCheckUtils]: 24: Hoare triple {1052#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} assume !false; {1052#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} is VALID [2022-04-15 07:13:43,011 INFO L272 TraceCheckUtils]: 25: Hoare triple {1052#(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)); {1059#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:13:43,012 INFO L290 TraceCheckUtils]: 26: Hoare triple {1059#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1063#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:13:43,012 INFO L290 TraceCheckUtils]: 27: Hoare triple {1063#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {979#false} is VALID [2022-04-15 07:13:43,013 INFO L290 TraceCheckUtils]: 28: Hoare triple {979#false} assume !false; {979#false} is VALID [2022-04-15 07:13:43,013 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 07:13:43,013 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 07:13:43,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:13:43,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231077271] [2022-04-15 07:13:43,013 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:13:43,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219482732] [2022-04-15 07:13:43,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219482732] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:13:43,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:13:43,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 07:13:43,014 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:13:43,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1843842903] [2022-04-15 07:13:43,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1843842903] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:13:43,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:13:43,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 07:13:43,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724013526] [2022-04-15 07:13:43,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:13:43,015 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 29 [2022-04-15 07:13:43,015 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:13:43,016 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 07:13:43,037 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:13:43,037 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 07:13:43,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:13:43,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 07:13:43,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 07:13:43,038 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 07:13:43,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:13:43,275 INFO L93 Difference]: Finished difference Result 76 states and 100 transitions. [2022-04-15 07:13:43,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 07:13:43,275 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 29 [2022-04-15 07:13:43,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:13:43,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 07:13:43,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-15 07:13:43,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 07:13:43,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-15 07:13:43,282 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-15 07:13:43,338 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:13:43,340 INFO L225 Difference]: With dead ends: 76 [2022-04-15 07:13:43,341 INFO L226 Difference]: Without dead ends: 74 [2022-04-15 07:13:43,341 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 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 07:13:43,342 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 10 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 126 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.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:13:43,342 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 126 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 07:13:43,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-15 07:13:43,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 67. [2022-04-15 07:13:43,364 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:13:43,364 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 67 states, 37 states have (on average 1.162162162162162) internal successors, (43), 39 states have internal predecessors, (43), 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 07:13:43,365 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 67 states, 37 states have (on average 1.162162162162162) internal successors, (43), 39 states have internal predecessors, (43), 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 07:13:43,365 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 67 states, 37 states have (on average 1.162162162162162) internal successors, (43), 39 states have internal predecessors, (43), 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 07:13:43,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:13:43,370 INFO L93 Difference]: Finished difference Result 74 states and 98 transitions. [2022-04-15 07:13:43,370 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 98 transitions. [2022-04-15 07:13:43,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:13:43,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:13:43,371 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 37 states have (on average 1.162162162162162) internal successors, (43), 39 states have internal predecessors, (43), 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 74 states. [2022-04-15 07:13:43,372 INFO L87 Difference]: Start difference. First operand has 67 states, 37 states have (on average 1.162162162162162) internal successors, (43), 39 states have internal predecessors, (43), 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 74 states. [2022-04-15 07:13:43,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:13:43,376 INFO L93 Difference]: Finished difference Result 74 states and 98 transitions. [2022-04-15 07:13:43,376 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 98 transitions. [2022-04-15 07:13:43,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:13:43,377 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:13:43,377 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:13:43,377 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:13:43,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 37 states have (on average 1.162162162162162) internal successors, (43), 39 states have internal predecessors, (43), 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 07:13:43,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 87 transitions. [2022-04-15 07:13:43,382 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 87 transitions. Word has length 29 [2022-04-15 07:13:43,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:13:43,382 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 87 transitions. [2022-04-15 07:13:43,382 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 07:13:43,382 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 87 transitions. [2022-04-15 07:13:43,505 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:13:43,506 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 87 transitions. [2022-04-15 07:13:43,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-15 07:13:43,506 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:13:43,506 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] [2022-04-15 07:13:43,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-15 07:13:43,707 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 07:13:43,707 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:13:43,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:13:43,708 INFO L85 PathProgramCache]: Analyzing trace with hash -607067127, now seen corresponding path program 1 times [2022-04-15 07:13:43,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:13:43,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1670783230] [2022-04-15 07:13:43,708 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:13:43,709 INFO L85 PathProgramCache]: Analyzing trace with hash -607067127, now seen corresponding path program 2 times [2022-04-15 07:13:43,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:13:43,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803645077] [2022-04-15 07:13:43,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:13:43,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:13:43,725 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:13:43,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [787965990] [2022-04-15 07:13:43,726 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:13:43,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:13:43,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:13:43,727 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 07:13:43,735 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 07:13:43,777 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:13:43,777 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:13:43,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 07:13:43,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:13:43,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:13:43,998 INFO L272 TraceCheckUtils]: 0: Hoare triple {1505#true} call ULTIMATE.init(); {1505#true} is VALID [2022-04-15 07:13:43,998 INFO L290 TraceCheckUtils]: 1: Hoare triple {1505#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); {1505#true} is VALID [2022-04-15 07:13:43,998 INFO L290 TraceCheckUtils]: 2: Hoare triple {1505#true} assume true; {1505#true} is VALID [2022-04-15 07:13:43,998 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1505#true} {1505#true} #91#return; {1505#true} is VALID [2022-04-15 07:13:43,999 INFO L272 TraceCheckUtils]: 4: Hoare triple {1505#true} call #t~ret6 := main(); {1505#true} is VALID [2022-04-15 07:13:43,999 INFO L290 TraceCheckUtils]: 5: Hoare triple {1505#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; {1505#true} is VALID [2022-04-15 07:13:43,999 INFO L272 TraceCheckUtils]: 6: Hoare triple {1505#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1505#true} is VALID [2022-04-15 07:13:43,999 INFO L290 TraceCheckUtils]: 7: Hoare triple {1505#true} ~cond := #in~cond; {1531#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 07:13:44,000 INFO L290 TraceCheckUtils]: 8: Hoare triple {1531#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1535#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:13:44,000 INFO L290 TraceCheckUtils]: 9: Hoare triple {1535#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1535#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:13:44,001 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1535#(not (= |assume_abort_if_not_#in~cond| 0))} {1505#true} #75#return; {1542#(<= 1 main_~y~0)} is VALID [2022-04-15 07:13:44,004 INFO L290 TraceCheckUtils]: 11: Hoare triple {1542#(<= 1 main_~y~0)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {1542#(<= 1 main_~y~0)} is VALID [2022-04-15 07:13:44,005 INFO L290 TraceCheckUtils]: 12: Hoare triple {1542#(<= 1 main_~y~0)} assume !false; {1542#(<= 1 main_~y~0)} is VALID [2022-04-15 07:13:44,005 INFO L272 TraceCheckUtils]: 13: Hoare triple {1542#(<= 1 main_~y~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {1505#true} is VALID [2022-04-15 07:13:44,005 INFO L290 TraceCheckUtils]: 14: Hoare triple {1505#true} ~cond := #in~cond; {1505#true} is VALID [2022-04-15 07:13:44,005 INFO L290 TraceCheckUtils]: 15: Hoare triple {1505#true} assume !(0 == ~cond); {1505#true} is VALID [2022-04-15 07:13:44,005 INFO L290 TraceCheckUtils]: 16: Hoare triple {1505#true} assume true; {1505#true} is VALID [2022-04-15 07:13:44,006 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1505#true} {1542#(<= 1 main_~y~0)} #77#return; {1542#(<= 1 main_~y~0)} is VALID [2022-04-15 07:13:44,006 INFO L272 TraceCheckUtils]: 18: Hoare triple {1542#(<= 1 main_~y~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {1505#true} is VALID [2022-04-15 07:13:44,006 INFO L290 TraceCheckUtils]: 19: Hoare triple {1505#true} ~cond := #in~cond; {1505#true} is VALID [2022-04-15 07:13:44,007 INFO L290 TraceCheckUtils]: 20: Hoare triple {1505#true} assume !(0 == ~cond); {1505#true} is VALID [2022-04-15 07:13:44,007 INFO L290 TraceCheckUtils]: 21: Hoare triple {1505#true} assume true; {1505#true} is VALID [2022-04-15 07:13:44,007 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1505#true} {1542#(<= 1 main_~y~0)} #79#return; {1542#(<= 1 main_~y~0)} is VALID [2022-04-15 07:13:44,008 INFO L290 TraceCheckUtils]: 23: Hoare triple {1542#(<= 1 main_~y~0)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {1582#(<= 1 main_~r~0)} is VALID [2022-04-15 07:13:44,009 INFO L290 TraceCheckUtils]: 24: Hoare triple {1582#(<= 1 main_~r~0)} assume !false; {1582#(<= 1 main_~r~0)} is VALID [2022-04-15 07:13:44,009 INFO L272 TraceCheckUtils]: 25: Hoare triple {1582#(<= 1 main_~r~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {1505#true} is VALID [2022-04-15 07:13:44,009 INFO L290 TraceCheckUtils]: 26: Hoare triple {1505#true} ~cond := #in~cond; {1505#true} is VALID [2022-04-15 07:13:44,009 INFO L290 TraceCheckUtils]: 27: Hoare triple {1505#true} assume !(0 == ~cond); {1505#true} is VALID [2022-04-15 07:13:44,009 INFO L290 TraceCheckUtils]: 28: Hoare triple {1505#true} assume true; {1505#true} is VALID [2022-04-15 07:13:44,012 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1505#true} {1582#(<= 1 main_~r~0)} #81#return; {1582#(<= 1 main_~r~0)} is VALID [2022-04-15 07:13:44,013 INFO L272 TraceCheckUtils]: 30: Hoare triple {1582#(<= 1 main_~r~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {1505#true} is VALID [2022-04-15 07:13:44,013 INFO L290 TraceCheckUtils]: 31: Hoare triple {1505#true} ~cond := #in~cond; {1505#true} is VALID [2022-04-15 07:13:44,013 INFO L290 TraceCheckUtils]: 32: Hoare triple {1505#true} assume !(0 == ~cond); {1505#true} is VALID [2022-04-15 07:13:44,013 INFO L290 TraceCheckUtils]: 33: Hoare triple {1505#true} assume true; {1505#true} is VALID [2022-04-15 07:13:44,020 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1505#true} {1582#(<= 1 main_~r~0)} #83#return; {1582#(<= 1 main_~r~0)} is VALID [2022-04-15 07:13:44,020 INFO L272 TraceCheckUtils]: 35: Hoare triple {1582#(<= 1 main_~r~0)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {1619#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:13:44,021 INFO L290 TraceCheckUtils]: 36: Hoare triple {1619#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1623#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:13:44,021 INFO L290 TraceCheckUtils]: 37: Hoare triple {1623#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1506#false} is VALID [2022-04-15 07:13:44,022 INFO L290 TraceCheckUtils]: 38: Hoare triple {1506#false} assume !false; {1506#false} is VALID [2022-04-15 07:13:44,022 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 07:13:44,022 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 07:13:44,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:13:44,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803645077] [2022-04-15 07:13:44,022 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:13:44,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787965990] [2022-04-15 07:13:44,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [787965990] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:13:44,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:13:44,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 07:13:44,023 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:13:44,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1670783230] [2022-04-15 07:13:44,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1670783230] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:13:44,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:13:44,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 07:13:44,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667142640] [2022-04-15 07:13:44,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:13:44,024 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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 39 [2022-04-15 07:13:44,024 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:13:44,024 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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 07:13:44,047 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:13:44,048 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 07:13:44,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:13:44,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 07:13:44,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-15 07:13:44,049 INFO L87 Difference]: Start difference. First operand 67 states and 87 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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 07:13:44,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:13:44,429 INFO L93 Difference]: Finished difference Result 73 states and 92 transitions. [2022-04-15 07:13:44,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 07:13:44,429 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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 39 [2022-04-15 07:13:44,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:13:44,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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 07:13:44,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-15 07:13:44,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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 07:13:44,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-15 07:13:44,432 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 43 transitions. [2022-04-15 07:13:44,468 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:13:44,470 INFO L225 Difference]: With dead ends: 73 [2022-04-15 07:13:44,470 INFO L226 Difference]: Without dead ends: 71 [2022-04-15 07:13:44,470 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 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 07:13:44,471 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 16 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 145 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 07:13:44,471 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 145 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 07:13:44,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-15 07:13:44,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-04-15 07:13:44,549 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:13:44,551 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 71 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 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 07:13:44,551 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 71 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 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 07:13:44,552 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 71 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 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 07:13:44,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:13:44,554 INFO L93 Difference]: Finished difference Result 71 states and 90 transitions. [2022-04-15 07:13:44,555 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2022-04-15 07:13:44,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:13:44,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:13:44,555 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 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 71 states. [2022-04-15 07:13:44,556 INFO L87 Difference]: Start difference. First operand has 71 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 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 71 states. [2022-04-15 07:13:44,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:13:44,559 INFO L93 Difference]: Finished difference Result 71 states and 90 transitions. [2022-04-15 07:13:44,559 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2022-04-15 07:13:44,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:13:44,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:13:44,560 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:13:44,560 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:13:44,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 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 07:13:44,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 90 transitions. [2022-04-15 07:13:44,564 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 90 transitions. Word has length 39 [2022-04-15 07:13:44,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:13:44,564 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 90 transitions. [2022-04-15 07:13:44,565 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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 07:13:44,565 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 90 transitions. [2022-04-15 07:13:44,668 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:13:44,668 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2022-04-15 07:13:44,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-15 07:13:44,669 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:13:44,670 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] [2022-04-15 07:13:44,696 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 07:13:44,883 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 07:13:44,883 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:13:44,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:13:44,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1279335692, now seen corresponding path program 1 times [2022-04-15 07:13:44,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:13:44,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1547221390] [2022-04-15 07:13:44,885 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:13:44,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1279335692, now seen corresponding path program 2 times [2022-04-15 07:13:44,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:13:44,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105448110] [2022-04-15 07:13:44,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:13:44,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:13:44,899 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:13:44,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [293543548] [2022-04-15 07:13:44,899 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:13:44,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:13:44,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:13:44,901 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 07:13:44,921 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 07:13:44,957 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:13:44,957 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:13:44,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 07:13:44,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:13:44,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:13:45,345 INFO L272 TraceCheckUtils]: 0: Hoare triple {2065#true} call ULTIMATE.init(); {2065#true} is VALID [2022-04-15 07:13:45,345 INFO L290 TraceCheckUtils]: 1: Hoare triple {2065#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); {2065#true} is VALID [2022-04-15 07:13:45,345 INFO L290 TraceCheckUtils]: 2: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-15 07:13:45,345 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2065#true} {2065#true} #91#return; {2065#true} is VALID [2022-04-15 07:13:45,346 INFO L272 TraceCheckUtils]: 4: Hoare triple {2065#true} call #t~ret6 := main(); {2065#true} is VALID [2022-04-15 07:13:45,346 INFO L290 TraceCheckUtils]: 5: Hoare triple {2065#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; {2065#true} is VALID [2022-04-15 07:13:45,346 INFO L272 TraceCheckUtils]: 6: Hoare triple {2065#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2065#true} is VALID [2022-04-15 07:13:45,346 INFO L290 TraceCheckUtils]: 7: Hoare triple {2065#true} ~cond := #in~cond; {2065#true} is VALID [2022-04-15 07:13:45,346 INFO L290 TraceCheckUtils]: 8: Hoare triple {2065#true} assume !(0 == ~cond); {2065#true} is VALID [2022-04-15 07:13:45,346 INFO L290 TraceCheckUtils]: 9: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-15 07:13:45,346 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2065#true} {2065#true} #75#return; {2065#true} is VALID [2022-04-15 07:13:45,346 INFO L290 TraceCheckUtils]: 11: Hoare triple {2065#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {2065#true} is VALID [2022-04-15 07:13:45,346 INFO L290 TraceCheckUtils]: 12: Hoare triple {2065#true} assume !false; {2065#true} is VALID [2022-04-15 07:13:45,346 INFO L272 TraceCheckUtils]: 13: Hoare triple {2065#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {2065#true} is VALID [2022-04-15 07:13:45,346 INFO L290 TraceCheckUtils]: 14: Hoare triple {2065#true} ~cond := #in~cond; {2065#true} is VALID [2022-04-15 07:13:45,346 INFO L290 TraceCheckUtils]: 15: Hoare triple {2065#true} assume !(0 == ~cond); {2065#true} is VALID [2022-04-15 07:13:45,347 INFO L290 TraceCheckUtils]: 16: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-15 07:13:45,347 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2065#true} {2065#true} #77#return; {2065#true} is VALID [2022-04-15 07:13:45,347 INFO L272 TraceCheckUtils]: 18: Hoare triple {2065#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {2065#true} is VALID [2022-04-15 07:13:45,347 INFO L290 TraceCheckUtils]: 19: Hoare triple {2065#true} ~cond := #in~cond; {2065#true} is VALID [2022-04-15 07:13:45,347 INFO L290 TraceCheckUtils]: 20: Hoare triple {2065#true} assume !(0 == ~cond); {2065#true} is VALID [2022-04-15 07:13:45,347 INFO L290 TraceCheckUtils]: 21: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-15 07:13:45,347 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2065#true} {2065#true} #79#return; {2065#true} is VALID [2022-04-15 07:13:45,347 INFO L290 TraceCheckUtils]: 23: Hoare triple {2065#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {2065#true} is VALID [2022-04-15 07:13:45,347 INFO L290 TraceCheckUtils]: 24: Hoare triple {2065#true} assume !false; {2065#true} is VALID [2022-04-15 07:13:45,347 INFO L272 TraceCheckUtils]: 25: Hoare triple {2065#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {2065#true} is VALID [2022-04-15 07:13:45,348 INFO L290 TraceCheckUtils]: 26: Hoare triple {2065#true} ~cond := #in~cond; {2148#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:13:45,348 INFO L290 TraceCheckUtils]: 27: Hoare triple {2148#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2152#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:13:45,349 INFO L290 TraceCheckUtils]: 28: Hoare triple {2152#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2152#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:13:45,350 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2152#(not (= |__VERIFIER_assert_#in~cond| 0))} {2065#true} #81#return; {2159#(= main_~b~0 (* main_~a~0 main_~y~0))} is VALID [2022-04-15 07:13:45,350 INFO L272 TraceCheckUtils]: 30: Hoare triple {2159#(= 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)); {2065#true} is VALID [2022-04-15 07:13:45,350 INFO L290 TraceCheckUtils]: 31: Hoare triple {2065#true} ~cond := #in~cond; {2065#true} is VALID [2022-04-15 07:13:45,350 INFO L290 TraceCheckUtils]: 32: Hoare triple {2065#true} assume !(0 == ~cond); {2065#true} is VALID [2022-04-15 07:13:45,350 INFO L290 TraceCheckUtils]: 33: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-15 07:13:45,351 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2065#true} {2159#(= main_~b~0 (* main_~a~0 main_~y~0))} #83#return; {2159#(= main_~b~0 (* main_~a~0 main_~y~0))} is VALID [2022-04-15 07:13:45,351 INFO L272 TraceCheckUtils]: 35: Hoare triple {2159#(= main_~b~0 (* main_~a~0 main_~y~0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {2065#true} is VALID [2022-04-15 07:13:45,351 INFO L290 TraceCheckUtils]: 36: Hoare triple {2065#true} ~cond := #in~cond; {2065#true} is VALID [2022-04-15 07:13:45,351 INFO L290 TraceCheckUtils]: 37: Hoare triple {2065#true} assume !(0 == ~cond); {2065#true} is VALID [2022-04-15 07:13:45,351 INFO L290 TraceCheckUtils]: 38: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-15 07:13:45,352 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2065#true} {2159#(= main_~b~0 (* main_~a~0 main_~y~0))} #85#return; {2159#(= main_~b~0 (* main_~a~0 main_~y~0))} is VALID [2022-04-15 07:13:45,353 INFO L290 TraceCheckUtils]: 40: Hoare triple {2159#(= main_~b~0 (* main_~a~0 main_~y~0))} assume !!(~r~0 >= 2 * ~b~0); {2193#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} is VALID [2022-04-15 07:13:45,353 INFO L272 TraceCheckUtils]: 41: Hoare triple {2193#(<= (* 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)); {2197#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:13:45,354 INFO L290 TraceCheckUtils]: 42: Hoare triple {2197#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2201#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:13:45,354 INFO L290 TraceCheckUtils]: 43: Hoare triple {2201#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2066#false} is VALID [2022-04-15 07:13:45,354 INFO L290 TraceCheckUtils]: 44: Hoare triple {2066#false} assume !false; {2066#false} is VALID [2022-04-15 07:13:45,355 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 07:13:45,355 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:13:49,926 INFO L290 TraceCheckUtils]: 44: Hoare triple {2066#false} assume !false; {2066#false} is VALID [2022-04-15 07:13:49,926 INFO L290 TraceCheckUtils]: 43: Hoare triple {2201#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2066#false} is VALID [2022-04-15 07:13:49,927 INFO L290 TraceCheckUtils]: 42: Hoare triple {2197#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2201#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:13:49,928 INFO L272 TraceCheckUtils]: 41: Hoare triple {2193#(<= (* 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)); {2197#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:13:49,928 INFO L290 TraceCheckUtils]: 40: Hoare triple {2220#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} assume !!(~r~0 >= 2 * ~b~0); {2193#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} is VALID [2022-04-15 07:13:49,929 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2065#true} {2220#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} #85#return; {2220#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} is VALID [2022-04-15 07:13:49,929 INFO L290 TraceCheckUtils]: 38: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-15 07:13:49,929 INFO L290 TraceCheckUtils]: 37: Hoare triple {2065#true} assume !(0 == ~cond); {2065#true} is VALID [2022-04-15 07:13:49,929 INFO L290 TraceCheckUtils]: 36: Hoare triple {2065#true} ~cond := #in~cond; {2065#true} is VALID [2022-04-15 07:13:49,929 INFO L272 TraceCheckUtils]: 35: Hoare triple {2220#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {2065#true} is VALID [2022-04-15 07:13:49,931 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2065#true} {2220#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} #83#return; {2220#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} is VALID [2022-04-15 07:13:49,931 INFO L290 TraceCheckUtils]: 33: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-15 07:13:49,931 INFO L290 TraceCheckUtils]: 32: Hoare triple {2065#true} assume !(0 == ~cond); {2065#true} is VALID [2022-04-15 07:13:49,931 INFO L290 TraceCheckUtils]: 31: Hoare triple {2065#true} ~cond := #in~cond; {2065#true} is VALID [2022-04-15 07:13:49,932 INFO L272 TraceCheckUtils]: 30: Hoare triple {2220#(<= (* 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)); {2065#true} is VALID [2022-04-15 07:13:49,935 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2152#(not (= |__VERIFIER_assert_#in~cond| 0))} {2065#true} #81#return; {2220#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} is VALID [2022-04-15 07:13:49,935 INFO L290 TraceCheckUtils]: 28: Hoare triple {2152#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2152#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:13:49,936 INFO L290 TraceCheckUtils]: 27: Hoare triple {2263#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2152#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:13:49,936 INFO L290 TraceCheckUtils]: 26: Hoare triple {2065#true} ~cond := #in~cond; {2263#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:13:49,936 INFO L272 TraceCheckUtils]: 25: Hoare triple {2065#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {2065#true} is VALID [2022-04-15 07:13:49,937 INFO L290 TraceCheckUtils]: 24: Hoare triple {2065#true} assume !false; {2065#true} is VALID [2022-04-15 07:13:49,937 INFO L290 TraceCheckUtils]: 23: Hoare triple {2065#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {2065#true} is VALID [2022-04-15 07:13:49,937 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2065#true} {2065#true} #79#return; {2065#true} is VALID [2022-04-15 07:13:49,937 INFO L290 TraceCheckUtils]: 21: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-15 07:13:49,937 INFO L290 TraceCheckUtils]: 20: Hoare triple {2065#true} assume !(0 == ~cond); {2065#true} is VALID [2022-04-15 07:13:49,937 INFO L290 TraceCheckUtils]: 19: Hoare triple {2065#true} ~cond := #in~cond; {2065#true} is VALID [2022-04-15 07:13:49,937 INFO L272 TraceCheckUtils]: 18: Hoare triple {2065#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {2065#true} is VALID [2022-04-15 07:13:49,937 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2065#true} {2065#true} #77#return; {2065#true} is VALID [2022-04-15 07:13:49,938 INFO L290 TraceCheckUtils]: 16: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-15 07:13:49,938 INFO L290 TraceCheckUtils]: 15: Hoare triple {2065#true} assume !(0 == ~cond); {2065#true} is VALID [2022-04-15 07:13:49,938 INFO L290 TraceCheckUtils]: 14: Hoare triple {2065#true} ~cond := #in~cond; {2065#true} is VALID [2022-04-15 07:13:49,938 INFO L272 TraceCheckUtils]: 13: Hoare triple {2065#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {2065#true} is VALID [2022-04-15 07:13:49,938 INFO L290 TraceCheckUtils]: 12: Hoare triple {2065#true} assume !false; {2065#true} is VALID [2022-04-15 07:13:49,938 INFO L290 TraceCheckUtils]: 11: Hoare triple {2065#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {2065#true} is VALID [2022-04-15 07:13:49,938 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2065#true} {2065#true} #75#return; {2065#true} is VALID [2022-04-15 07:13:49,938 INFO L290 TraceCheckUtils]: 9: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-15 07:13:49,939 INFO L290 TraceCheckUtils]: 8: Hoare triple {2065#true} assume !(0 == ~cond); {2065#true} is VALID [2022-04-15 07:13:49,939 INFO L290 TraceCheckUtils]: 7: Hoare triple {2065#true} ~cond := #in~cond; {2065#true} is VALID [2022-04-15 07:13:49,939 INFO L272 TraceCheckUtils]: 6: Hoare triple {2065#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2065#true} is VALID [2022-04-15 07:13:49,939 INFO L290 TraceCheckUtils]: 5: Hoare triple {2065#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; {2065#true} is VALID [2022-04-15 07:13:49,939 INFO L272 TraceCheckUtils]: 4: Hoare triple {2065#true} call #t~ret6 := main(); {2065#true} is VALID [2022-04-15 07:13:49,939 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2065#true} {2065#true} #91#return; {2065#true} is VALID [2022-04-15 07:13:49,939 INFO L290 TraceCheckUtils]: 2: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-15 07:13:49,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {2065#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); {2065#true} is VALID [2022-04-15 07:13:49,940 INFO L272 TraceCheckUtils]: 0: Hoare triple {2065#true} call ULTIMATE.init(); {2065#true} is VALID [2022-04-15 07:13:49,940 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 07:13:49,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:13:49,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105448110] [2022-04-15 07:13:49,940 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:13:49,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293543548] [2022-04-15 07:13:49,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293543548] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:13:49,940 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:13:49,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-15 07:13:49,941 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:13:49,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1547221390] [2022-04-15 07:13:49,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1547221390] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:13:49,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:13:49,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 07:13:49,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004555953] [2022-04-15 07:13:49,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:13:49,942 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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 45 [2022-04-15 07:13:49,944 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:13:49,944 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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 07:13:49,975 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:13:49,975 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 07:13:49,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:13:49,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 07:13:49,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-15 07:13:49,977 INFO L87 Difference]: Start difference. First operand 71 states and 90 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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 07:13:50,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:13:50,380 INFO L93 Difference]: Finished difference Result 77 states and 95 transitions. [2022-04-15 07:13:50,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 07:13:50,380 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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 45 [2022-04-15 07:13:50,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:13:50,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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 07:13:50,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-15 07:13:50,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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 07:13:50,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-15 07:13:50,383 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 43 transitions. [2022-04-15 07:13:50,423 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:13:50,425 INFO L225 Difference]: With dead ends: 77 [2022-04-15 07:13:50,425 INFO L226 Difference]: Without dead ends: 75 [2022-04-15 07:13:50,425 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 80 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 07:13:50,426 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 18 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 95 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 07:13:50,426 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 95 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 07:13:50,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-15 07:13:50,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-04-15 07:13:50,492 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:13:50,493 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 75 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 45 states have internal predecessors, (49), 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 07:13:50,493 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 75 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 45 states have internal predecessors, (49), 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 07:13:50,493 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 75 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 45 states have internal predecessors, (49), 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 07:13:50,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:13:50,496 INFO L93 Difference]: Finished difference Result 75 states and 93 transitions. [2022-04-15 07:13:50,496 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 93 transitions. [2022-04-15 07:13:50,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:13:50,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:13:50,497 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 45 states have internal predecessors, (49), 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 75 states. [2022-04-15 07:13:50,497 INFO L87 Difference]: Start difference. First operand has 75 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 45 states have internal predecessors, (49), 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 75 states. [2022-04-15 07:13:50,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:13:50,500 INFO L93 Difference]: Finished difference Result 75 states and 93 transitions. [2022-04-15 07:13:50,500 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 93 transitions. [2022-04-15 07:13:50,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:13:50,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:13:50,501 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:13:50,501 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:13:50,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 45 states have internal predecessors, (49), 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 07:13:50,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 93 transitions. [2022-04-15 07:13:50,506 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 93 transitions. Word has length 45 [2022-04-15 07:13:50,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:13:50,506 INFO L478 AbstractCegarLoop]: Abstraction has 75 states and 93 transitions. [2022-04-15 07:13:50,506 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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 07:13:50,506 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 75 states and 93 transitions. [2022-04-15 07:13:50,624 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:13:50,624 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 93 transitions. [2022-04-15 07:13:50,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-15 07:13:50,625 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:13:50,625 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:13:50,649 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 07:13:50,835 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:13:50,836 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:13:50,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:13:50,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1789016266, now seen corresponding path program 1 times [2022-04-15 07:13:50,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:13:50,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1828047967] [2022-04-15 07:14:06,741 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 4 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=2}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:14:06,744 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:14:06,748 INFO L85 PathProgramCache]: Analyzing trace with hash -862809214, now seen corresponding path program 1 times [2022-04-15 07:14:06,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:14:06,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448226156] [2022-04-15 07:14:06,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:14:06,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:14:06,764 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:14:06,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [550698345] [2022-04-15 07:14:06,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:14:06,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:14:06,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:14:06,769 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 07:14:06,786 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 07:14:06,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:14:06,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-15 07:14:06,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:14:06,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:14:09,713 INFO L272 TraceCheckUtils]: 0: Hoare triple {2804#true} call ULTIMATE.init(); {2804#true} is VALID [2022-04-15 07:14:09,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {2804#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); {2804#true} is VALID [2022-04-15 07:14:09,713 INFO L290 TraceCheckUtils]: 2: Hoare triple {2804#true} assume true; {2804#true} is VALID [2022-04-15 07:14:09,713 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2804#true} {2804#true} #91#return; {2804#true} is VALID [2022-04-15 07:14:09,713 INFO L272 TraceCheckUtils]: 4: Hoare triple {2804#true} call #t~ret6 := main(); {2804#true} is VALID [2022-04-15 07:14:09,713 INFO L290 TraceCheckUtils]: 5: Hoare triple {2804#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; {2804#true} is VALID [2022-04-15 07:14:09,714 INFO L272 TraceCheckUtils]: 6: Hoare triple {2804#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2804#true} is VALID [2022-04-15 07:14:09,714 INFO L290 TraceCheckUtils]: 7: Hoare triple {2804#true} ~cond := #in~cond; {2830#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 07:14:09,714 INFO L290 TraceCheckUtils]: 8: Hoare triple {2830#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2834#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:14:09,715 INFO L290 TraceCheckUtils]: 9: Hoare triple {2834#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2834#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:14:09,716 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2834#(not (= |assume_abort_if_not_#in~cond| 0))} {2804#true} #75#return; {2841#(<= 1 main_~y~0)} is VALID [2022-04-15 07:14:09,716 INFO L290 TraceCheckUtils]: 11: Hoare triple {2841#(<= 1 main_~y~0)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {2845#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-15 07:14:09,726 INFO L290 TraceCheckUtils]: 12: Hoare triple {2845#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} [95] L36-2-->L37_primed: Formula: (let ((.cse5 (+ v_main_~r~0_26 (* v_main_~q~0_16 v_main_~y~0_30)))) (let ((.cse0 (= v_main_~a~0_20 v_main_~a~0_19)) (.cse6 (= v_main_~x~0_15 .cse5)) (.cse2 (<= v_main_~y~0_30 v_main_~r~0_26)) (.cse3 (<= (* v_main_~y~0_30 2) v_main_~r~0_26)) (.cse7 (= (* v_main_~y~0_30 v_main_~a~0_20) v_main_~b~0_20)) (.cse1 (= v_main_~q~0_16 v_main_~q~0_15))) (or (and (= v_main_~x~0_15 v_main_~x~0_15) .cse0 (= v_main_~y~0_30 v_main_~y~0_30) (= v_main_~r~0_26 v_main_~r~0_25) (= v_main_~b~0_20 v_main_~b~0_19) .cse1) (and (< v_main_~q~0_16 v_main_~q~0_15) (= v_main_~y~0_30 v_main_~b~0_19) .cse2 (not .cse3) (= 1 v_main_~a~0_19) (forall ((v_it_1 Int)) (or (not (<= (+ v_main_~q~0_16 v_it_1 1) v_main_~q~0_15)) (not (<= 1 v_it_1)) (let ((.cse4 (* v_main_~y~0_30 v_it_1))) (and (< v_main_~r~0_26 (+ (* v_main_~y~0_30 2) .cse4)) (<= (+ v_main_~y~0_30 .cse4) v_main_~r~0_26) (<= .cse4 v_main_~r~0_26))))) (= .cse5 (+ v_main_~r~0_25 (* v_main_~q~0_15 v_main_~y~0_30))) .cse6 .cse7) (and (= v_main_~b~0_19 v_main_~b~0_20) .cse0 (= v_main_~r~0_25 v_main_~r~0_26) (or (not .cse6) (not .cse2) .cse3 (not .cse7)) .cse1)))) InVars {main_~q~0=v_main_~q~0_16, main_~x~0=v_main_~x~0_15, main_~y~0=v_main_~y~0_30, main_~b~0=v_main_~b~0_20, main_~r~0=v_main_~r~0_26, main_~a~0=v_main_~a~0_20} OutVars{main_~q~0=v_main_~q~0_15, main_~x~0=v_main_~x~0_15, main_~y~0=v_main_~y~0_30, main_~b~0=v_main_~b~0_19, main_~r~0=v_main_~r~0_25, main_~a~0=v_main_~a~0_19} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {2849#(and (or (and (forall ((v_it_1 Int)) (or (not (<= (+ v_it_1 1) main_~q~0)) (not (<= 1 v_it_1)))) (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (< 0 main_~q~0) (< main_~x~0 (* main_~y~0 2)) (<= main_~y~0 main_~x~0)) (and (= main_~x~0 main_~r~0) (= main_~q~0 0))) (<= 1 main_~y~0))} is VALID [2022-04-15 07:14:09,728 INFO L290 TraceCheckUtils]: 13: Hoare triple {2849#(and (or (and (forall ((v_it_1 Int)) (or (not (<= (+ v_it_1 1) main_~q~0)) (not (<= 1 v_it_1)))) (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (< 0 main_~q~0) (< main_~x~0 (* main_~y~0 2)) (<= main_~y~0 main_~x~0)) (and (= main_~x~0 main_~r~0) (= main_~q~0 0))) (<= 1 main_~y~0))} [94] L37_primed-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2853#(and (<= 1 main_~y~0) (or (and (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (< 0 main_~q~0) (< main_~q~0 2) (< main_~x~0 (* main_~y~0 2)) (<= main_~y~0 main_~x~0)) (and (= main_~x~0 main_~r~0) (= main_~q~0 0))))} is VALID [2022-04-15 07:14:09,728 INFO L272 TraceCheckUtils]: 14: Hoare triple {2853#(and (<= 1 main_~y~0) (or (and (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (< 0 main_~q~0) (< main_~q~0 2) (< main_~x~0 (* main_~y~0 2)) (<= main_~y~0 main_~x~0)) (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)); {2804#true} is VALID [2022-04-15 07:14:09,728 INFO L290 TraceCheckUtils]: 15: Hoare triple {2804#true} ~cond := #in~cond; {2804#true} is VALID [2022-04-15 07:14:09,729 INFO L290 TraceCheckUtils]: 16: Hoare triple {2804#true} assume !(0 == ~cond); {2804#true} is VALID [2022-04-15 07:14:09,729 INFO L290 TraceCheckUtils]: 17: Hoare triple {2804#true} assume true; {2804#true} is VALID [2022-04-15 07:14:09,730 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2804#true} {2853#(and (<= 1 main_~y~0) (or (and (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (< 0 main_~q~0) (< main_~q~0 2) (< main_~x~0 (* main_~y~0 2)) (<= main_~y~0 main_~x~0)) (and (= main_~x~0 main_~r~0) (= main_~q~0 0))))} #77#return; {2853#(and (<= 1 main_~y~0) (or (and (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (< 0 main_~q~0) (< main_~q~0 2) (< main_~x~0 (* main_~y~0 2)) (<= main_~y~0 main_~x~0)) (and (= main_~x~0 main_~r~0) (= main_~q~0 0))))} is VALID [2022-04-15 07:14:09,732 INFO L272 TraceCheckUtils]: 19: Hoare triple {2853#(and (<= 1 main_~y~0) (or (and (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (< 0 main_~q~0) (< main_~q~0 2) (< main_~x~0 (* main_~y~0 2)) (<= main_~y~0 main_~x~0)) (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)); {2872#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:14:09,732 INFO L290 TraceCheckUtils]: 20: Hoare triple {2872#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2876#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:14:09,733 INFO L290 TraceCheckUtils]: 21: Hoare triple {2876#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2805#false} is VALID [2022-04-15 07:14:09,733 INFO L290 TraceCheckUtils]: 22: Hoare triple {2805#false} assume !false; {2805#false} is VALID [2022-04-15 07:14:09,733 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 07:14:09,733 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 07:14:09,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:14:09,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448226156] [2022-04-15 07:14:09,734 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:14:09,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [550698345] [2022-04-15 07:14:09,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [550698345] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:14:09,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:14:09,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 07:14:20,446 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:14:20,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1828047967] [2022-04-15 07:14:20,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1828047967] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:14:20,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:14:20,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-15 07:14:20,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391873] [2022-04-15 07:14:20,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:14:20,447 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 1.411764705882353) internal successors, (24), 12 states have internal predecessors, (24), 6 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 52 [2022-04-15 07:14:20,448 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:14:20,448 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 17 states have (on average 1.411764705882353) internal successors, (24), 12 states have internal predecessors, (24), 6 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-15 07:14:20,461 WARN L143 InductivityCheck]: Transition 2890#(and (<= 0 (+ main_~b~0 main_~r~0)) (not (<= main_~b~0 main_~r~0))) ( _ , assume !false; , 2853#(and (<= 1 main_~y~0) (or (and (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (< 0 main_~q~0) (< main_~q~0 2) (< main_~x~0 (* main_~y~0 2)) (<= main_~y~0 main_~x~0)) (and (= main_~x~0 main_~r~0) (= main_~q~0 0)))) ) not inductive [2022-04-15 07:14:20,489 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 07:14:20,662 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:14:20,662 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: inductivity failed at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.checkInductivity(InductivityCheck.java:103) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.(InductivityCheck.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.constructInterpolantAutomaton(BasicCegarLoop.java:682) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.constructRefinementAutomaton(AbstractCegarLoop.java:547) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:261) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-15 07:14:20,666 INFO L158 Benchmark]: Toolchain (without parser) took 41450.18ms. Allocated memory was 181.4MB in the beginning and 244.3MB in the end (delta: 62.9MB). Free memory was 125.5MB in the beginning and 213.0MB in the end (delta: -87.5MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 07:14:20,666 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 181.4MB. Free memory is still 141.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 07:14:20,666 INFO L158 Benchmark]: CACSL2BoogieTranslator took 270.08ms. Allocated memory is still 181.4MB. Free memory was 125.2MB in the beginning and 156.9MB in the end (delta: -31.6MB). Peak memory consumption was 9.6MB. Max. memory is 8.0GB. [2022-04-15 07:14:20,667 INFO L158 Benchmark]: Boogie Preprocessor took 35.21ms. Allocated memory is still 181.4MB. Free memory was 156.9MB in the beginning and 155.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 07:14:20,667 INFO L158 Benchmark]: RCFGBuilder took 321.37ms. Allocated memory is still 181.4MB. Free memory was 155.0MB in the beginning and 143.7MB in the end (delta: 11.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 07:14:20,667 INFO L158 Benchmark]: TraceAbstraction took 40818.05ms. Allocated memory was 181.4MB in the beginning and 244.3MB in the end (delta: 62.9MB). Free memory was 143.3MB in the beginning and 213.0MB in the end (delta: -69.7MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 07:14:20,668 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 181.4MB. Free memory is still 141.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 270.08ms. Allocated memory is still 181.4MB. Free memory was 125.2MB in the beginning and 156.9MB in the end (delta: -31.6MB). Peak memory consumption was 9.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.21ms. Allocated memory is still 181.4MB. Free memory was 156.9MB in the beginning and 155.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 321.37ms. Allocated memory is still 181.4MB. Free memory was 155.0MB in the beginning and 143.7MB in the end (delta: 11.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 40818.05ms. Allocated memory was 181.4MB in the beginning and 244.3MB in the end (delta: 62.9MB). Free memory was 143.3MB in the beginning and 213.0MB in the end (delta: -69.7MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inductivity failed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inductivity failed: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-15 07:14:20,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...