/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/cohendiv-ll_unwindbound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 07:49:12,772 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 07:49:12,775 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 07:49:12,832 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 07:49:12,833 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 07:49:12,834 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 07:49:12,837 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 07:49:12,841 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 07:49:12,843 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 07:49:12,847 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 07:49:12,848 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 07:49:12,849 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 07:49:12,849 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 07:49:12,851 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 07:49:12,852 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 07:49:12,855 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 07:49:12,855 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 07:49:12,857 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 07:49:12,859 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 07:49:12,864 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 07:49:12,865 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 07:49:12,867 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 07:49:12,867 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 07:49:12,868 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 07:49:12,869 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 07:49:12,875 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 07:49:12,875 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 07:49:12,876 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 07:49:12,876 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 07:49:12,877 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 07:49:12,878 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 07:49:12,878 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 07:49:12,884 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 07:49:12,884 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 07:49:12,885 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 07:49:12,885 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 07:49:12,886 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 07:49:12,886 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 07:49:12,887 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 07:49:12,887 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 07:49:12,887 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 07:49:12,889 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 07:49:12,890 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:49:12,900 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 07:49:12,900 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 07:49:12,901 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 07:49:12,902 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 07:49:12,902 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 07:49:12,902 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 07:49:12,902 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 07:49:12,902 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 07:49:12,903 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 07:49:12,903 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 07:49:12,904 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 07:49:12,904 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 07:49:12,904 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 07:49:12,904 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 07:49:12,904 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 07:49:12,904 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 07:49:12,905 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 07:49:12,905 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 07:49:12,905 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 07:49:12,905 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 07:49:12,905 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 07:49:12,905 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 07:49:12,906 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 07:49:12,906 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 07:49:12,906 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 07:49:12,906 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:49:13,143 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 07:49:13,176 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 07:49:13,178 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 07:49:13,179 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 07:49:13,180 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 07:49:13,181 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/cohendiv-ll_unwindbound20.c [2022-04-15 07:49:13,243 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b5e211a2/c755d3b34fa04d828cbb4b882e95e8b0/FLAGfae59a59e [2022-04-15 07:49:13,652 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 07:49:13,652 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohendiv-ll_unwindbound20.c [2022-04-15 07:49:13,660 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b5e211a2/c755d3b34fa04d828cbb4b882e95e8b0/FLAGfae59a59e [2022-04-15 07:49:14,069 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b5e211a2/c755d3b34fa04d828cbb4b882e95e8b0 [2022-04-15 07:49:14,071 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 07:49:14,073 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 07:49:14,077 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 07:49:14,077 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 07:49:14,081 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 07:49:14,082 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 07:49:14" (1/1) ... [2022-04-15 07:49:14,083 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@347d198c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:49:14, skipping insertion in model container [2022-04-15 07:49:14,083 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 07:49:14" (1/1) ... [2022-04-15 07:49:14,089 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 07:49:14,101 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 07:49:14,244 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohendiv-ll_unwindbound20.c[576,589] [2022-04-15 07:49:14,259 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 07:49:14,266 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 07:49:14,280 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohendiv-ll_unwindbound20.c[576,589] [2022-04-15 07:49:14,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 07:49:14,300 INFO L208 MainTranslator]: Completed translation [2022-04-15 07:49:14,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:49:14 WrapperNode [2022-04-15 07:49:14,300 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 07:49:14,301 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 07:49:14,301 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 07:49:14,301 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 07:49:14,310 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:49:14" (1/1) ... [2022-04-15 07:49:14,310 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:49:14" (1/1) ... [2022-04-15 07:49:14,315 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:49:14" (1/1) ... [2022-04-15 07:49:14,315 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:49:14" (1/1) ... [2022-04-15 07:49:14,321 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:49:14" (1/1) ... [2022-04-15 07:49:14,325 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:49:14" (1/1) ... [2022-04-15 07:49:14,326 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:49:14" (1/1) ... [2022-04-15 07:49:14,329 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 07:49:14,330 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 07:49:14,330 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 07:49:14,330 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 07:49:14,332 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:49:14" (1/1) ... [2022-04-15 07:49:14,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 07:49:14,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:49:14,361 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:49:14,379 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:49:14,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 07:49:14,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 07:49:14,404 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 07:49:14,404 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 07:49:14,405 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 07:49:14,405 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 07:49:14,405 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 07:49:14,405 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 07:49:14,406 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 07:49:14,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 07:49:14,406 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 07:49:14,407 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 07:49:14,413 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 07:49:14,413 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 07:49:14,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 07:49:14,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 07:49:14,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 07:49:14,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 07:49:14,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 07:49:14,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 07:49:14,466 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 07:49:14,468 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 07:49:14,665 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 07:49:14,670 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 07:49:14,671 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 07:49:14,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 07:49:14 BoogieIcfgContainer [2022-04-15 07:49:14,672 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 07:49:14,673 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 07:49:14,674 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 07:49:14,676 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 07:49:14,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 07:49:14" (1/3) ... [2022-04-15 07:49:14,677 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e33bffe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 07:49:14, skipping insertion in model container [2022-04-15 07:49:14,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:49:14" (2/3) ... [2022-04-15 07:49:14,677 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e33bffe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 07:49:14, skipping insertion in model container [2022-04-15 07:49:14,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 07:49:14" (3/3) ... [2022-04-15 07:49:14,678 INFO L111 eAbstractionObserver]: Analyzing ICFG cohendiv-ll_unwindbound20.c [2022-04-15 07:49:14,682 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 07:49:14,682 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 07:49:14,717 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 07:49:14,722 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:49:14,722 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 07:49:14,739 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 07:49:14,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 07:49:14,745 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:49:14,745 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:49:14,746 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:49:14,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:49:14,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1588022502, now seen corresponding path program 1 times [2022-04-15 07:49:14,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:49:14,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1935105203] [2022-04-15 07:49:14,771 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:49:14,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1588022502, now seen corresponding path program 2 times [2022-04-15 07:49:14,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:49:14,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558706131] [2022-04-15 07:49:14,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:49:14,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:49:14,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:49:14,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:49:14,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:49:14,989 INFO L290 TraceCheckUtils]: 0: Hoare triple {50#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {41#true} is VALID [2022-04-15 07:49:14,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume true; {41#true} is VALID [2022-04-15 07:49:14,990 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41#true} {41#true} #93#return; {41#true} is VALID [2022-04-15 07:49:14,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 07:49:15,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:49:15,008 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-15 07:49:15,009 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-15 07:49:15,009 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-15 07:49:15,010 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#false} {41#true} #77#return; {42#false} is VALID [2022-04-15 07:49:15,012 INFO L272 TraceCheckUtils]: 0: Hoare triple {41#true} call ULTIMATE.init(); {50#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:49:15,012 INFO L290 TraceCheckUtils]: 1: Hoare triple {50#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {41#true} is VALID [2022-04-15 07:49:15,013 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#true} assume true; {41#true} is VALID [2022-04-15 07:49:15,013 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#true} {41#true} #93#return; {41#true} is VALID [2022-04-15 07:49:15,013 INFO L272 TraceCheckUtils]: 4: Hoare triple {41#true} call #t~ret8 := main(); {41#true} is VALID [2022-04-15 07:49:15,013 INFO L290 TraceCheckUtils]: 5: Hoare triple {41#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {41#true} is VALID [2022-04-15 07:49:15,014 INFO L272 TraceCheckUtils]: 6: Hoare triple {41#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {41#true} is VALID [2022-04-15 07:49:15,014 INFO L290 TraceCheckUtils]: 7: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-15 07:49:15,015 INFO L290 TraceCheckUtils]: 8: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-15 07:49:15,016 INFO L290 TraceCheckUtils]: 9: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-15 07:49:15,016 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {42#false} {41#true} #77#return; {42#false} is VALID [2022-04-15 07:49:15,016 INFO L290 TraceCheckUtils]: 11: Hoare triple {42#false} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {42#false} is VALID [2022-04-15 07:49:15,016 INFO L290 TraceCheckUtils]: 12: Hoare triple {42#false} assume !true; {42#false} is VALID [2022-04-15 07:49:15,017 INFO L272 TraceCheckUtils]: 13: Hoare triple {42#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {42#false} is VALID [2022-04-15 07:49:15,017 INFO L290 TraceCheckUtils]: 14: Hoare triple {42#false} ~cond := #in~cond; {42#false} is VALID [2022-04-15 07:49:15,017 INFO L290 TraceCheckUtils]: 15: Hoare triple {42#false} assume 0 == ~cond; {42#false} is VALID [2022-04-15 07:49:15,017 INFO L290 TraceCheckUtils]: 16: Hoare triple {42#false} assume !false; {42#false} is VALID [2022-04-15 07:49:15,018 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:49:15,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:49:15,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558706131] [2022-04-15 07:49:15,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558706131] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:49:15,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:49:15,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 07:49:15,022 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:49:15,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1935105203] [2022-04-15 07:49:15,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1935105203] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:49:15,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:49:15,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 07:49:15,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649442726] [2022-04-15 07:49:15,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:49:15,028 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:49:15,029 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:49:15,032 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:49:15,062 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:49:15,062 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 07:49:15,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:49:15,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 07:49:15,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 07:49:15,090 INFO L87 Difference]: Start difference. First operand has 38 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:49:15,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:49:15,318 INFO L93 Difference]: Finished difference Result 68 states and 101 transitions. [2022-04-15 07:49:15,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 07:49:15,318 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:49:15,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:49:15,320 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:49:15,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-15 07:49:15,329 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:49:15,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-15 07:49:15,347 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 101 transitions. [2022-04-15 07:49:15,458 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:49:15,471 INFO L225 Difference]: With dead ends: 68 [2022-04-15 07:49:15,471 INFO L226 Difference]: Without dead ends: 34 [2022-04-15 07:49:15,474 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:49:15,477 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:49:15,479 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 49 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 07:49:15,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-15 07:49:15,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2022-04-15 07:49:15,501 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:49:15,502 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 33 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 07:49:15,503 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 33 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 07:49:15,503 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 33 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 07:49:15,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:49:15,508 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-15 07:49:15,508 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-15 07:49:15,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:49:15,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:49:15,509 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 34 states. [2022-04-15 07:49:15,509 INFO L87 Difference]: Start difference. First operand has 33 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 34 states. [2022-04-15 07:49:15,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:49:15,513 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-15 07:49:15,513 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-15 07:49:15,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:49:15,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:49:15,514 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:49:15,514 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:49:15,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 07:49:15,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2022-04-15 07:49:15,518 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 17 [2022-04-15 07:49:15,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:49:15,519 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2022-04-15 07:49:15,519 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:49:15,519 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 42 transitions. [2022-04-15 07:49:15,556 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:49:15,557 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2022-04-15 07:49:15,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 07:49:15,557 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:49:15,558 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:49:15,558 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 07:49:15,558 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:49:15,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:49:15,559 INFO L85 PathProgramCache]: Analyzing trace with hash 766070672, now seen corresponding path program 1 times [2022-04-15 07:49:15,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:49:15,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [753737335] [2022-04-15 07:49:15,560 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:49:15,560 INFO L85 PathProgramCache]: Analyzing trace with hash 766070672, now seen corresponding path program 2 times [2022-04-15 07:49:15,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:49:15,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947886429] [2022-04-15 07:49:15,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:49:15,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:49:15,576 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:49:15,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2123067493] [2022-04-15 07:49:15,576 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:49:15,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:49:15,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:49:15,583 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:49:15,603 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:49:15,634 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 07:49:15,635 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:49:15,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 07:49:15,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:49:15,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:49:15,806 INFO L272 TraceCheckUtils]: 0: Hoare triple {323#true} call ULTIMATE.init(); {323#true} is VALID [2022-04-15 07:49:15,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {323#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {331#(<= ~counter~0 0)} is VALID [2022-04-15 07:49:15,808 INFO L290 TraceCheckUtils]: 2: Hoare triple {331#(<= ~counter~0 0)} assume true; {331#(<= ~counter~0 0)} is VALID [2022-04-15 07:49:15,808 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {331#(<= ~counter~0 0)} {323#true} #93#return; {331#(<= ~counter~0 0)} is VALID [2022-04-15 07:49:15,809 INFO L272 TraceCheckUtils]: 4: Hoare triple {331#(<= ~counter~0 0)} call #t~ret8 := main(); {331#(<= ~counter~0 0)} is VALID [2022-04-15 07:49:15,809 INFO L290 TraceCheckUtils]: 5: Hoare triple {331#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {331#(<= ~counter~0 0)} is VALID [2022-04-15 07:49:15,810 INFO L272 TraceCheckUtils]: 6: Hoare triple {331#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {331#(<= ~counter~0 0)} is VALID [2022-04-15 07:49:15,810 INFO L290 TraceCheckUtils]: 7: Hoare triple {331#(<= ~counter~0 0)} ~cond := #in~cond; {331#(<= ~counter~0 0)} is VALID [2022-04-15 07:49:15,811 INFO L290 TraceCheckUtils]: 8: Hoare triple {331#(<= ~counter~0 0)} assume !(0 == ~cond); {331#(<= ~counter~0 0)} is VALID [2022-04-15 07:49:15,811 INFO L290 TraceCheckUtils]: 9: Hoare triple {331#(<= ~counter~0 0)} assume true; {331#(<= ~counter~0 0)} is VALID [2022-04-15 07:49:15,812 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {331#(<= ~counter~0 0)} {331#(<= ~counter~0 0)} #77#return; {331#(<= ~counter~0 0)} is VALID [2022-04-15 07:49:15,812 INFO L290 TraceCheckUtils]: 11: Hoare triple {331#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {331#(<= ~counter~0 0)} is VALID [2022-04-15 07:49:15,814 INFO L290 TraceCheckUtils]: 12: Hoare triple {331#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {365#(<= |main_#t~post6| 0)} is VALID [2022-04-15 07:49:15,814 INFO L290 TraceCheckUtils]: 13: Hoare triple {365#(<= |main_#t~post6| 0)} assume !(#t~post6 < 20);havoc #t~post6; {324#false} is VALID [2022-04-15 07:49:15,814 INFO L272 TraceCheckUtils]: 14: Hoare triple {324#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {324#false} is VALID [2022-04-15 07:49:15,815 INFO L290 TraceCheckUtils]: 15: Hoare triple {324#false} ~cond := #in~cond; {324#false} is VALID [2022-04-15 07:49:15,816 INFO L290 TraceCheckUtils]: 16: Hoare triple {324#false} assume 0 == ~cond; {324#false} is VALID [2022-04-15 07:49:15,816 INFO L290 TraceCheckUtils]: 17: Hoare triple {324#false} assume !false; {324#false} is VALID [2022-04-15 07:49:15,816 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:49:15,817 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 07:49:15,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:49:15,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947886429] [2022-04-15 07:49:15,817 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:49:15,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123067493] [2022-04-15 07:49:15,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123067493] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:49:15,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:49:15,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:49:15,819 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:49:15,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [753737335] [2022-04-15 07:49:15,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [753737335] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:49:15,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:49:15,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:49:15,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107265586] [2022-04-15 07:49:15,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:49:15,821 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-15 07:49:15,821 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:49:15,821 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:49:15,836 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:49:15,836 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 07:49:15,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:49:15,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 07:49:15,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 07:49:15,838 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:49:15,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:49:15,952 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-04-15 07:49:15,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 07:49:15,953 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-15 07:49:15,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:49:15,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:49:15,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-04-15 07:49:15,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:49:15,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-04-15 07:49:15,965 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 51 transitions. [2022-04-15 07:49:16,020 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:49:16,025 INFO L225 Difference]: With dead ends: 42 [2022-04-15 07:49:16,025 INFO L226 Difference]: Without dead ends: 35 [2022-04-15 07:49:16,026 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 07:49:16,028 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:49:16,031 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 07:49:16,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-15 07:49:16,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-15 07:49:16,050 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:49:16,051 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 07:49:16,052 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 07:49:16,054 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 07:49:16,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:49:16,062 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-15 07:49:16,062 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-15 07:49:16,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:49:16,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:49:16,063 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 35 states. [2022-04-15 07:49:16,063 INFO L87 Difference]: Start difference. First operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 35 states. [2022-04-15 07:49:16,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:49:16,065 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-15 07:49:16,066 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-15 07:49:16,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:49:16,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:49:16,066 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:49:16,066 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:49:16,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 07:49:16,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2022-04-15 07:49:16,069 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 18 [2022-04-15 07:49:16,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:49:16,069 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2022-04-15 07:49:16,069 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:49:16,069 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 44 transitions. [2022-04-15 07:49:16,115 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:49:16,115 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-15 07:49:16,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 07:49:16,116 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:49:16,116 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:49:16,137 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:49:16,326 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:49:16,327 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:49:16,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:49:16,327 INFO L85 PathProgramCache]: Analyzing trace with hash 767560222, now seen corresponding path program 1 times [2022-04-15 07:49:16,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:49:16,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [683555021] [2022-04-15 07:49:16,328 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:49:16,328 INFO L85 PathProgramCache]: Analyzing trace with hash 767560222, now seen corresponding path program 2 times [2022-04-15 07:49:16,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:49:16,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700703102] [2022-04-15 07:49:16,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:49:16,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:49:16,346 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:49:16,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [54730554] [2022-04-15 07:49:16,346 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:49:16,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:49:16,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:49:16,348 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:49:16,349 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:49:16,400 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 07:49:16,400 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:49:16,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 07:49:16,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:49:16,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:49:16,515 INFO L272 TraceCheckUtils]: 0: Hoare triple {604#true} call ULTIMATE.init(); {604#true} is VALID [2022-04-15 07:49:16,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {604#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {604#true} is VALID [2022-04-15 07:49:16,516 INFO L290 TraceCheckUtils]: 2: Hoare triple {604#true} assume true; {604#true} is VALID [2022-04-15 07:49:16,516 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {604#true} {604#true} #93#return; {604#true} is VALID [2022-04-15 07:49:16,516 INFO L272 TraceCheckUtils]: 4: Hoare triple {604#true} call #t~ret8 := main(); {604#true} is VALID [2022-04-15 07:49:16,517 INFO L290 TraceCheckUtils]: 5: Hoare triple {604#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {604#true} is VALID [2022-04-15 07:49:16,517 INFO L272 TraceCheckUtils]: 6: Hoare triple {604#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {604#true} is VALID [2022-04-15 07:49:16,517 INFO L290 TraceCheckUtils]: 7: Hoare triple {604#true} ~cond := #in~cond; {604#true} is VALID [2022-04-15 07:49:16,517 INFO L290 TraceCheckUtils]: 8: Hoare triple {604#true} assume !(0 == ~cond); {604#true} is VALID [2022-04-15 07:49:16,517 INFO L290 TraceCheckUtils]: 9: Hoare triple {604#true} assume true; {604#true} is VALID [2022-04-15 07:49:16,518 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {604#true} {604#true} #77#return; {604#true} is VALID [2022-04-15 07:49:16,518 INFO L290 TraceCheckUtils]: 11: Hoare triple {604#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {642#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 07:49:16,519 INFO L290 TraceCheckUtils]: 12: Hoare triple {642#(and (= main_~a~0 0) (= main_~b~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {642#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 07:49:16,519 INFO L290 TraceCheckUtils]: 13: Hoare triple {642#(and (= main_~a~0 0) (= main_~b~0 0))} assume !!(#t~post6 < 20);havoc #t~post6; {642#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 07:49:16,520 INFO L272 TraceCheckUtils]: 14: Hoare triple {642#(and (= main_~a~0 0) (= main_~b~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {652#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:49:16,521 INFO L290 TraceCheckUtils]: 15: Hoare triple {652#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {656#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:49:16,521 INFO L290 TraceCheckUtils]: 16: Hoare triple {656#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {605#false} is VALID [2022-04-15 07:49:16,521 INFO L290 TraceCheckUtils]: 17: Hoare triple {605#false} assume !false; {605#false} is VALID [2022-04-15 07:49:16,522 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:49:16,522 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 07:49:16,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:49:16,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700703102] [2022-04-15 07:49:16,522 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:49:16,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [54730554] [2022-04-15 07:49:16,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [54730554] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:49:16,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:49:16,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 07:49:16,523 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:49:16,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [683555021] [2022-04-15 07:49:16,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [683555021] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:49:16,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:49:16,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 07:49:16,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094095905] [2022-04-15 07:49:16,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:49:16,524 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-15 07:49:16,524 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:49:16,525 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:49:16,538 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:49:16,538 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 07:49:16,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:49:16,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 07:49:16,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 07:49:16,539 INFO L87 Difference]: Start difference. First operand 35 states and 44 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:49:16,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:49:16,708 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-04-15 07:49:16,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 07:49:16,708 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-15 07:49:16,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:49:16,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:49:16,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-04-15 07:49:16,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:49:16,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-04-15 07:49:16,712 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 56 transitions. [2022-04-15 07:49:16,765 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:49:16,767 INFO L225 Difference]: With dead ends: 45 [2022-04-15 07:49:16,767 INFO L226 Difference]: Without dead ends: 43 [2022-04-15 07:49:16,767 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 07:49:16,768 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 6 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:49:16,768 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 145 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 07:49:16,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-15 07:49:16,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2022-04-15 07:49:16,793 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:49:16,794 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 40 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 07:49:16,794 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 40 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 07:49:16,794 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 40 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 07:49:16,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:49:16,797 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2022-04-15 07:49:16,797 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2022-04-15 07:49:16,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:49:16,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:49:16,798 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand 43 states. [2022-04-15 07:49:16,799 INFO L87 Difference]: Start difference. First operand has 40 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand 43 states. [2022-04-15 07:49:16,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:49:16,801 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2022-04-15 07:49:16,801 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2022-04-15 07:49:16,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:49:16,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:49:16,802 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:49:16,802 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:49:16,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 07:49:16,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2022-04-15 07:49:16,804 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 49 transitions. Word has length 18 [2022-04-15 07:49:16,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:49:16,805 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 49 transitions. [2022-04-15 07:49:16,805 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:49:16,805 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 49 transitions. [2022-04-15 07:49:16,854 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:49:16,854 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2022-04-15 07:49:16,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 07:49:16,855 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:49:16,855 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:49:16,884 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:49:17,079 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:49:17,080 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:49:17,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:49:17,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1016228092, now seen corresponding path program 1 times [2022-04-15 07:49:17,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:49:17,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1790510562] [2022-04-15 07:49:17,081 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:49:17,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1016228092, now seen corresponding path program 2 times [2022-04-15 07:49:17,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:49:17,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031141923] [2022-04-15 07:49:17,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:49:17,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:49:17,094 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:49:17,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1670275573] [2022-04-15 07:49:17,095 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:49:17,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:49:17,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:49:17,100 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:49:17,101 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:49:17,148 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:49:17,148 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:49:17,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 07:49:17,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:49:17,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:49:17,259 INFO L272 TraceCheckUtils]: 0: Hoare triple {920#true} call ULTIMATE.init(); {920#true} is VALID [2022-04-15 07:49:17,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {920#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {920#true} is VALID [2022-04-15 07:49:17,260 INFO L290 TraceCheckUtils]: 2: Hoare triple {920#true} assume true; {920#true} is VALID [2022-04-15 07:49:17,260 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {920#true} {920#true} #93#return; {920#true} is VALID [2022-04-15 07:49:17,260 INFO L272 TraceCheckUtils]: 4: Hoare triple {920#true} call #t~ret8 := main(); {920#true} is VALID [2022-04-15 07:49:17,260 INFO L290 TraceCheckUtils]: 5: Hoare triple {920#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {920#true} is VALID [2022-04-15 07:49:17,260 INFO L272 TraceCheckUtils]: 6: Hoare triple {920#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {920#true} is VALID [2022-04-15 07:49:17,261 INFO L290 TraceCheckUtils]: 7: Hoare triple {920#true} ~cond := #in~cond; {920#true} is VALID [2022-04-15 07:49:17,261 INFO L290 TraceCheckUtils]: 8: Hoare triple {920#true} assume !(0 == ~cond); {920#true} is VALID [2022-04-15 07:49:17,261 INFO L290 TraceCheckUtils]: 9: Hoare triple {920#true} assume true; {920#true} is VALID [2022-04-15 07:49:17,261 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {920#true} {920#true} #77#return; {920#true} is VALID [2022-04-15 07:49:17,262 INFO L290 TraceCheckUtils]: 11: Hoare triple {920#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {958#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 07:49:17,262 INFO L290 TraceCheckUtils]: 12: Hoare triple {958#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {958#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 07:49:17,280 INFO L290 TraceCheckUtils]: 13: Hoare triple {958#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 20);havoc #t~post6; {958#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 07:49:17,280 INFO L272 TraceCheckUtils]: 14: Hoare triple {958#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {920#true} is VALID [2022-04-15 07:49:17,280 INFO L290 TraceCheckUtils]: 15: Hoare triple {920#true} ~cond := #in~cond; {920#true} is VALID [2022-04-15 07:49:17,281 INFO L290 TraceCheckUtils]: 16: Hoare triple {920#true} assume !(0 == ~cond); {920#true} is VALID [2022-04-15 07:49:17,281 INFO L290 TraceCheckUtils]: 17: Hoare triple {920#true} assume true; {920#true} is VALID [2022-04-15 07:49:17,283 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {920#true} {958#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #79#return; {958#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 07:49:17,284 INFO L272 TraceCheckUtils]: 19: Hoare triple {958#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {983#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:49:17,285 INFO L290 TraceCheckUtils]: 20: Hoare triple {983#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {987#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:49:17,285 INFO L290 TraceCheckUtils]: 21: Hoare triple {987#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {921#false} is VALID [2022-04-15 07:49:17,286 INFO L290 TraceCheckUtils]: 22: Hoare triple {921#false} assume !false; {921#false} is VALID [2022-04-15 07:49:17,286 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:49:17,286 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 07:49:17,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:49:17,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031141923] [2022-04-15 07:49:17,287 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:49:17,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670275573] [2022-04-15 07:49:17,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670275573] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:49:17,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:49:17,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 07:49:17,288 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:49:17,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1790510562] [2022-04-15 07:49:17,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1790510562] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:49:17,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:49:17,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 07:49:17,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701588703] [2022-04-15 07:49:17,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:49:17,289 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-15 07:49:17,289 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:49:17,289 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 07:49:17,312 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:49:17,313 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 07:49:17,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:49:17,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 07:49:17,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 07:49:17,314 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 07:49:17,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:49:17,566 INFO L93 Difference]: Finished difference Result 58 states and 74 transitions. [2022-04-15 07:49:17,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 07:49:17,567 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-15 07:49:17,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:49:17,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 07:49:17,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-04-15 07:49:17,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 07:49:17,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-04-15 07:49:17,572 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 71 transitions. [2022-04-15 07:49:17,628 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:49:17,630 INFO L225 Difference]: With dead ends: 58 [2022-04-15 07:49:17,630 INFO L226 Difference]: Without dead ends: 55 [2022-04-15 07:49:17,630 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 07:49:17,631 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 13 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:49:17,632 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 139 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 07:49:17,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-15 07:49:17,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2022-04-15 07:49:17,655 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:49:17,656 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 07:49:17,656 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 07:49:17,657 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 07:49:17,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:49:17,660 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2022-04-15 07:49:17,660 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2022-04-15 07:49:17,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:49:17,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:49:17,662 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 55 states. [2022-04-15 07:49:17,662 INFO L87 Difference]: Start difference. First operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 55 states. [2022-04-15 07:49:17,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:49:17,665 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2022-04-15 07:49:17,665 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2022-04-15 07:49:17,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:49:17,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:49:17,666 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:49:17,666 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:49:17,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 07:49:17,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2022-04-15 07:49:17,669 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 23 [2022-04-15 07:49:17,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:49:17,670 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2022-04-15 07:49:17,670 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 07:49:17,670 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 69 transitions. [2022-04-15 07:49:17,733 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:49:17,733 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2022-04-15 07:49:17,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 07:49:17,734 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:49:17,734 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:49:17,751 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:49:17,939 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:49:17,940 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:49:17,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:49:17,940 INFO L85 PathProgramCache]: Analyzing trace with hash 2019703110, now seen corresponding path program 1 times [2022-04-15 07:49:17,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:49:17,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [35871882] [2022-04-15 07:49:17,941 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:49:17,941 INFO L85 PathProgramCache]: Analyzing trace with hash 2019703110, now seen corresponding path program 2 times [2022-04-15 07:49:17,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:49:17,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503171595] [2022-04-15 07:49:17,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:49:17,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:49:17,969 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:49:17,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [492484398] [2022-04-15 07:49:17,970 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:49:17,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:49:17,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:49:17,975 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:49:18,005 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:49:18,027 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:49:18,028 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:49:18,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 07:49:18,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:49:18,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:49:18,156 INFO L272 TraceCheckUtils]: 0: Hoare triple {1329#true} call ULTIMATE.init(); {1329#true} is VALID [2022-04-15 07:49:18,158 INFO L290 TraceCheckUtils]: 1: Hoare triple {1329#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1329#true} is VALID [2022-04-15 07:49:18,159 INFO L290 TraceCheckUtils]: 2: Hoare triple {1329#true} assume true; {1329#true} is VALID [2022-04-15 07:49:18,159 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1329#true} {1329#true} #93#return; {1329#true} is VALID [2022-04-15 07:49:18,159 INFO L272 TraceCheckUtils]: 4: Hoare triple {1329#true} call #t~ret8 := main(); {1329#true} is VALID [2022-04-15 07:49:18,159 INFO L290 TraceCheckUtils]: 5: Hoare triple {1329#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1329#true} is VALID [2022-04-15 07:49:18,159 INFO L272 TraceCheckUtils]: 6: Hoare triple {1329#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1329#true} is VALID [2022-04-15 07:49:18,160 INFO L290 TraceCheckUtils]: 7: Hoare triple {1329#true} ~cond := #in~cond; {1329#true} is VALID [2022-04-15 07:49:18,160 INFO L290 TraceCheckUtils]: 8: Hoare triple {1329#true} assume !(0 == ~cond); {1329#true} is VALID [2022-04-15 07:49:18,160 INFO L290 TraceCheckUtils]: 9: Hoare triple {1329#true} assume true; {1329#true} is VALID [2022-04-15 07:49:18,160 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1329#true} {1329#true} #77#return; {1329#true} is VALID [2022-04-15 07:49:18,160 INFO L290 TraceCheckUtils]: 11: Hoare triple {1329#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {1329#true} is VALID [2022-04-15 07:49:18,160 INFO L290 TraceCheckUtils]: 12: Hoare triple {1329#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1329#true} is VALID [2022-04-15 07:49:18,161 INFO L290 TraceCheckUtils]: 13: Hoare triple {1329#true} assume !!(#t~post6 < 20);havoc #t~post6; {1329#true} is VALID [2022-04-15 07:49:18,161 INFO L272 TraceCheckUtils]: 14: Hoare triple {1329#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {1329#true} is VALID [2022-04-15 07:49:18,161 INFO L290 TraceCheckUtils]: 15: Hoare triple {1329#true} ~cond := #in~cond; {1329#true} is VALID [2022-04-15 07:49:18,161 INFO L290 TraceCheckUtils]: 16: Hoare triple {1329#true} assume !(0 == ~cond); {1329#true} is VALID [2022-04-15 07:49:18,161 INFO L290 TraceCheckUtils]: 17: Hoare triple {1329#true} assume true; {1329#true} is VALID [2022-04-15 07:49:18,164 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1329#true} {1329#true} #79#return; {1329#true} is VALID [2022-04-15 07:49:18,164 INFO L272 TraceCheckUtils]: 19: Hoare triple {1329#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {1329#true} is VALID [2022-04-15 07:49:18,165 INFO L290 TraceCheckUtils]: 20: Hoare triple {1329#true} ~cond := #in~cond; {1329#true} is VALID [2022-04-15 07:49:18,165 INFO L290 TraceCheckUtils]: 21: Hoare triple {1329#true} assume !(0 == ~cond); {1329#true} is VALID [2022-04-15 07:49:18,165 INFO L290 TraceCheckUtils]: 22: Hoare triple {1329#true} assume true; {1329#true} is VALID [2022-04-15 07:49:18,165 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1329#true} {1329#true} #81#return; {1329#true} is VALID [2022-04-15 07:49:18,166 INFO L290 TraceCheckUtils]: 24: Hoare triple {1329#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {1406#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} is VALID [2022-04-15 07:49:18,166 INFO L290 TraceCheckUtils]: 25: Hoare triple {1406#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1406#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} is VALID [2022-04-15 07:49:18,167 INFO L290 TraceCheckUtils]: 26: Hoare triple {1406#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} assume !!(#t~post7 < 20);havoc #t~post7; {1406#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} is VALID [2022-04-15 07:49:18,168 INFO L272 TraceCheckUtils]: 27: Hoare triple {1406#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {1416#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:49:18,170 INFO L290 TraceCheckUtils]: 28: Hoare triple {1416#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1420#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:49:18,170 INFO L290 TraceCheckUtils]: 29: Hoare triple {1420#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1330#false} is VALID [2022-04-15 07:49:18,170 INFO L290 TraceCheckUtils]: 30: Hoare triple {1330#false} assume !false; {1330#false} is VALID [2022-04-15 07:49:18,171 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:49:18,171 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 07:49:18,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:49:18,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503171595] [2022-04-15 07:49:18,176 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:49:18,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492484398] [2022-04-15 07:49:18,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492484398] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:49:18,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:49:18,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 07:49:18,176 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:49:18,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [35871882] [2022-04-15 07:49:18,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [35871882] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:49:18,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:49:18,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 07:49:18,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977705642] [2022-04-15 07:49:18,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:49:18,178 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 31 [2022-04-15 07:49:18,179 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:49:18,180 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 07:49:18,199 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:49:18,200 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 07:49:18,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:49:18,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 07:49:18,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 07:49:18,201 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 07:49:18,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:49:18,434 INFO L93 Difference]: Finished difference Result 83 states and 113 transitions. [2022-04-15 07:49:18,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 07:49:18,434 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 31 [2022-04-15 07:49:18,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:49:18,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 07:49:18,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-04-15 07:49:18,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 07:49:18,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-04-15 07:49:18,438 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 72 transitions. [2022-04-15 07:49:18,493 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:49:18,497 INFO L225 Difference]: With dead ends: 83 [2022-04-15 07:49:18,497 INFO L226 Difference]: Without dead ends: 81 [2022-04-15 07:49:18,497 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 07:49:18,498 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 13 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:49:18,498 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 145 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 07:49:18,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-15 07:49:18,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 74. [2022-04-15 07:49:18,526 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:49:18,526 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 74 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 46 states have internal predecessors, (56), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 07:49:18,527 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 74 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 46 states have internal predecessors, (56), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 07:49:18,527 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 74 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 46 states have internal predecessors, (56), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 07:49:18,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:49:18,531 INFO L93 Difference]: Finished difference Result 81 states and 111 transitions. [2022-04-15 07:49:18,531 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 111 transitions. [2022-04-15 07:49:18,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:49:18,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:49:18,533 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 46 states have internal predecessors, (56), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 81 states. [2022-04-15 07:49:18,533 INFO L87 Difference]: Start difference. First operand has 74 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 46 states have internal predecessors, (56), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 81 states. [2022-04-15 07:49:18,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:49:18,537 INFO L93 Difference]: Finished difference Result 81 states and 111 transitions. [2022-04-15 07:49:18,537 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 111 transitions. [2022-04-15 07:49:18,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:49:18,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:49:18,538 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:49:18,538 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:49:18,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 46 states have internal predecessors, (56), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 07:49:18,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 100 transitions. [2022-04-15 07:49:18,541 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 100 transitions. Word has length 31 [2022-04-15 07:49:18,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:49:18,542 INFO L478 AbstractCegarLoop]: Abstraction has 74 states and 100 transitions. [2022-04-15 07:49:18,542 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 07:49:18,542 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 74 states and 100 transitions. [2022-04-15 07:49:18,636 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:49:18,636 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 100 transitions. [2022-04-15 07:49:18,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-15 07:49:18,637 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:49:18,637 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:49:18,659 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-15 07:49:18,859 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:49:18,859 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:49:18,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:49:18,860 INFO L85 PathProgramCache]: Analyzing trace with hash 202176206, now seen corresponding path program 1 times [2022-04-15 07:49:18,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:49:18,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1956242643] [2022-04-15 07:49:27,116 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 5 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={1=1, 2=2}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:49:27,120 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:49:27,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1923851590, now seen corresponding path program 1 times [2022-04-15 07:49:27,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:49:27,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411527750] [2022-04-15 07:49:27,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:49:27,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:49:27,139 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:49:27,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [974914986] [2022-04-15 07:49:27,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:49:27,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:49:27,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:49:27,140 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:49:27,154 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:49:27,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:49:27,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 07:49:27,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:49:27,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:49:27,328 INFO L272 TraceCheckUtils]: 0: Hoare triple {1904#true} call ULTIMATE.init(); {1904#true} is VALID [2022-04-15 07:49:27,330 INFO L290 TraceCheckUtils]: 1: Hoare triple {1904#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1912#(<= ~counter~0 0)} is VALID [2022-04-15 07:49:27,331 INFO L290 TraceCheckUtils]: 2: Hoare triple {1912#(<= ~counter~0 0)} assume true; {1912#(<= ~counter~0 0)} is VALID [2022-04-15 07:49:27,338 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1912#(<= ~counter~0 0)} {1904#true} #93#return; {1912#(<= ~counter~0 0)} is VALID [2022-04-15 07:49:27,339 INFO L272 TraceCheckUtils]: 4: Hoare triple {1912#(<= ~counter~0 0)} call #t~ret8 := main(); {1912#(<= ~counter~0 0)} is VALID [2022-04-15 07:49:27,339 INFO L290 TraceCheckUtils]: 5: Hoare triple {1912#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1912#(<= ~counter~0 0)} is VALID [2022-04-15 07:49:27,340 INFO L272 TraceCheckUtils]: 6: Hoare triple {1912#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1912#(<= ~counter~0 0)} is VALID [2022-04-15 07:49:27,340 INFO L290 TraceCheckUtils]: 7: Hoare triple {1912#(<= ~counter~0 0)} ~cond := #in~cond; {1912#(<= ~counter~0 0)} is VALID [2022-04-15 07:49:27,341 INFO L290 TraceCheckUtils]: 8: Hoare triple {1912#(<= ~counter~0 0)} assume !(0 == ~cond); {1912#(<= ~counter~0 0)} is VALID [2022-04-15 07:49:27,341 INFO L290 TraceCheckUtils]: 9: Hoare triple {1912#(<= ~counter~0 0)} assume true; {1912#(<= ~counter~0 0)} is VALID [2022-04-15 07:49:27,342 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1912#(<= ~counter~0 0)} {1912#(<= ~counter~0 0)} #77#return; {1912#(<= ~counter~0 0)} is VALID [2022-04-15 07:49:27,342 INFO L290 TraceCheckUtils]: 11: Hoare triple {1912#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {1912#(<= ~counter~0 0)} is VALID [2022-04-15 07:49:27,344 INFO L290 TraceCheckUtils]: 12: Hoare triple {1912#(<= ~counter~0 0)} [97] L37-3-->L37-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post7_8| |v_main_#t~post7_6|)) (.cse1 (= v_main_~b~0_16 v_main_~b~0_15)) (.cse2 (= v_main_~r~0_22 v_main_~r~0_21)) (.cse3 (= v_main_~a~0_16 v_main_~a~0_15)) (.cse9 (= |v_main_#t~post6_9| |v_main_#t~post6_7|)) (.cse10 (= v_~counter~0_13 v_~counter~0_11)) (.cse5 (<= 19 v_~counter~0_13)) (.cse6 (<= v_main_~y~0_24 v_main_~r~0_22)) (.cse8 (= (* v_main_~y~0_24 v_main_~a~0_16) v_main_~b~0_16)) (.cse7 (= v_main_~x~0_13 (+ v_main_~r~0_22 (* v_main_~q~0_14 v_main_~y~0_24)))) (.cse4 (< v_~counter~0_13 20))) (or (and .cse0 (= v_main_~q~0_13 v_main_~q~0_14) .cse1 .cse2 .cse3 (or (not .cse4) (not .cse5) (not .cse6) (not .cse7) (not .cse8)) .cse9 .cse10) (and .cse0 (= v_main_~q~0_14 v_main_~q~0_13) .cse1 (= v_main_~y~0_24 v_main_~y~0_24) .cse2 (= v_main_~x~0_13 v_main_~x~0_13) .cse3 .cse9 .cse10) (and .cse5 (= 1 v_main_~a~0_15) (< v_main_~q~0_14 v_main_~q~0_13) .cse6 (= (+ (* v_main_~q~0_14 (- 2)) v_~counter~0_13 (* v_main_~q~0_13 2)) v_~counter~0_11) (= v_main_~r~0_21 (+ v_main_~r~0_22 (* v_main_~y~0_24 (+ v_main_~q~0_14 (* (- 1) v_main_~q~0_13))))) (= v_main_~y~0_24 v_main_~b~0_15) .cse8 (forall ((v_it_1 Int)) (or (let ((.cse11 (+ (* v_it_1 2) v_~counter~0_13))) (and (< .cse11 20) (<= (+ v_main_~y~0_24 (* v_main_~y~0_24 v_it_1)) v_main_~r~0_22) (<= 19 .cse11))) (not (<= 1 v_it_1)) (not (<= (+ v_main_~q~0_14 v_it_1 1) v_main_~q~0_13)))) .cse7 .cse4))) InVars {main_~q~0=v_main_~q~0_14, ~counter~0=v_~counter~0_13, main_~x~0=v_main_~x~0_13, main_~y~0=v_main_~y~0_24, main_~b~0=v_main_~b~0_16, main_~r~0=v_main_~r~0_22, main_#t~post6=|v_main_#t~post6_9|, main_~a~0=v_main_~a~0_16, main_#t~post7=|v_main_#t~post7_8|} OutVars{main_~q~0=v_main_~q~0_13, ~counter~0=v_~counter~0_11, main_~x~0=v_main_~x~0_13, main_~y~0=v_main_~y~0_24, main_~b~0=v_main_~b~0_15, main_~r~0=v_main_~r~0_21, main_#t~post6=|v_main_#t~post6_7|, main_~a~0=v_main_~a~0_15, main_#t~post7=|v_main_#t~post7_6|} AuxVars[] AssignedVars[main_~q~0, ~counter~0, main_~b~0, main_~r~0, main_#t~post6, main_~a~0, main_#t~post7] {1912#(<= ~counter~0 0)} is VALID [2022-04-15 07:49:27,345 INFO L290 TraceCheckUtils]: 13: Hoare triple {1912#(<= ~counter~0 0)} [96] L37-1_primed-->L37-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1949#(<= |main_#t~post6| 0)} is VALID [2022-04-15 07:49:27,345 INFO L290 TraceCheckUtils]: 14: Hoare triple {1949#(<= |main_#t~post6| 0)} assume !(#t~post6 < 20);havoc #t~post6; {1905#false} is VALID [2022-04-15 07:49:27,345 INFO L272 TraceCheckUtils]: 15: Hoare triple {1905#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {1905#false} is VALID [2022-04-15 07:49:27,346 INFO L290 TraceCheckUtils]: 16: Hoare triple {1905#false} ~cond := #in~cond; {1905#false} is VALID [2022-04-15 07:49:27,346 INFO L290 TraceCheckUtils]: 17: Hoare triple {1905#false} assume 0 == ~cond; {1905#false} is VALID [2022-04-15 07:49:27,346 INFO L290 TraceCheckUtils]: 18: Hoare triple {1905#false} assume !false; {1905#false} is VALID [2022-04-15 07:49:27,346 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:49:27,346 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 07:49:27,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:49:27,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411527750] [2022-04-15 07:49:27,347 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:49:27,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [974914986] [2022-04-15 07:49:27,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [974914986] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:49:27,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:49:27,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:49:33,410 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:49:33,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1956242643] [2022-04-15 07:49:33,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1956242643] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:49:33,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:49:33,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 07:49:33,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742800282] [2022-04-15 07:49:33,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:49:33,412 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 34 [2022-04-15 07:49:33,412 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:49:33,412 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 07:49:33,440 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:49:33,441 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 07:49:33,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:49:33,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 07:49:33,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-15 07:49:33,442 INFO L87 Difference]: Start difference. First operand 74 states and 100 transitions. Second operand has 13 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 07:49:34,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:49:34,023 INFO L93 Difference]: Finished difference Result 113 states and 153 transitions. [2022-04-15 07:49:34,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 07:49:34,023 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 34 [2022-04-15 07:49:34,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:49:34,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 07:49:34,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 85 transitions. [2022-04-15 07:49:34,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 07:49:34,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 85 transitions. [2022-04-15 07:49:34,027 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 85 transitions. [2022-04-15 07:49:34,099 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:49:34,101 INFO L225 Difference]: With dead ends: 113 [2022-04-15 07:49:34,101 INFO L226 Difference]: Without dead ends: 78 [2022-04-15 07:49:34,102 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2022-04-15 07:49:34,102 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 14 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 07:49:34,103 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 213 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 07:49:34,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-04-15 07:49:34,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-04-15 07:49:34,145 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:49:34,146 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 78 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 49 states have internal predecessors, (58), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 07:49:34,146 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 78 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 49 states have internal predecessors, (58), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 07:49:34,146 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 78 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 49 states have internal predecessors, (58), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 07:49:34,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:49:34,150 INFO L93 Difference]: Finished difference Result 78 states and 102 transitions. [2022-04-15 07:49:34,150 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 102 transitions. [2022-04-15 07:49:34,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:49:34,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:49:34,151 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 49 states have internal predecessors, (58), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 78 states. [2022-04-15 07:49:34,151 INFO L87 Difference]: Start difference. First operand has 78 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 49 states have internal predecessors, (58), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 78 states. [2022-04-15 07:49:34,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:49:34,155 INFO L93 Difference]: Finished difference Result 78 states and 102 transitions. [2022-04-15 07:49:34,155 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 102 transitions. [2022-04-15 07:49:34,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:49:34,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:49:34,155 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:49:34,155 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:49:34,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 49 states have internal predecessors, (58), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 07:49:34,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 102 transitions. [2022-04-15 07:49:34,159 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 102 transitions. Word has length 34 [2022-04-15 07:49:34,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:49:34,159 INFO L478 AbstractCegarLoop]: Abstraction has 78 states and 102 transitions. [2022-04-15 07:49:34,159 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 07:49:34,159 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 78 states and 102 transitions. [2022-04-15 07:49:34,282 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:49:34,283 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 102 transitions. [2022-04-15 07:49:34,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-15 07:49:34,284 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:49:34,285 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:49:34,314 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:49:34,497 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:49:34,498 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:49:34,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:49:34,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1813008070, now seen corresponding path program 1 times [2022-04-15 07:49:34,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:49:34,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [639382959] [2022-04-15 07:49:34,499 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:49:34,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1813008070, now seen corresponding path program 2 times [2022-04-15 07:49:34,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:49:34,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191249324] [2022-04-15 07:49:34,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:49:34,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:49:34,516 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:49:34,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [86209412] [2022-04-15 07:49:34,516 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:49:34,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:49:34,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:49:34,519 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:49:34,520 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:49:34,561 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:49:34,562 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:49:34,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 07:49:34,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:49:34,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:49:34,787 INFO L272 TraceCheckUtils]: 0: Hoare triple {2517#true} call ULTIMATE.init(); {2517#true} is VALID [2022-04-15 07:49:34,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {2517#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2517#true} is VALID [2022-04-15 07:49:34,790 INFO L290 TraceCheckUtils]: 2: Hoare triple {2517#true} assume true; {2517#true} is VALID [2022-04-15 07:49:34,790 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2517#true} {2517#true} #93#return; {2517#true} is VALID [2022-04-15 07:49:34,791 INFO L272 TraceCheckUtils]: 4: Hoare triple {2517#true} call #t~ret8 := main(); {2517#true} is VALID [2022-04-15 07:49:34,791 INFO L290 TraceCheckUtils]: 5: Hoare triple {2517#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; {2517#true} is VALID [2022-04-15 07:49:34,791 INFO L272 TraceCheckUtils]: 6: Hoare triple {2517#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2517#true} is VALID [2022-04-15 07:49:34,791 INFO L290 TraceCheckUtils]: 7: Hoare triple {2517#true} ~cond := #in~cond; {2543#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 07:49:34,792 INFO L290 TraceCheckUtils]: 8: Hoare triple {2543#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2547#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:49:34,792 INFO L290 TraceCheckUtils]: 9: Hoare triple {2547#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2547#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:49:34,793 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2547#(not (= |assume_abort_if_not_#in~cond| 0))} {2517#true} #77#return; {2554#(<= 1 main_~y~0)} is VALID [2022-04-15 07:49:34,793 INFO L290 TraceCheckUtils]: 11: Hoare triple {2554#(<= 1 main_~y~0)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {2554#(<= 1 main_~y~0)} is VALID [2022-04-15 07:49:34,793 INFO L290 TraceCheckUtils]: 12: Hoare triple {2554#(<= 1 main_~y~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2554#(<= 1 main_~y~0)} is VALID [2022-04-15 07:49:34,794 INFO L290 TraceCheckUtils]: 13: Hoare triple {2554#(<= 1 main_~y~0)} assume !!(#t~post6 < 20);havoc #t~post6; {2554#(<= 1 main_~y~0)} is VALID [2022-04-15 07:49:34,794 INFO L272 TraceCheckUtils]: 14: Hoare triple {2554#(<= 1 main_~y~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {2517#true} is VALID [2022-04-15 07:49:34,794 INFO L290 TraceCheckUtils]: 15: Hoare triple {2517#true} ~cond := #in~cond; {2517#true} is VALID [2022-04-15 07:49:34,794 INFO L290 TraceCheckUtils]: 16: Hoare triple {2517#true} assume !(0 == ~cond); {2517#true} is VALID [2022-04-15 07:49:34,794 INFO L290 TraceCheckUtils]: 17: Hoare triple {2517#true} assume true; {2517#true} is VALID [2022-04-15 07:49:34,795 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2517#true} {2554#(<= 1 main_~y~0)} #79#return; {2554#(<= 1 main_~y~0)} is VALID [2022-04-15 07:49:34,795 INFO L272 TraceCheckUtils]: 19: Hoare triple {2554#(<= 1 main_~y~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {2517#true} is VALID [2022-04-15 07:49:34,795 INFO L290 TraceCheckUtils]: 20: Hoare triple {2517#true} ~cond := #in~cond; {2517#true} is VALID [2022-04-15 07:49:34,795 INFO L290 TraceCheckUtils]: 21: Hoare triple {2517#true} assume !(0 == ~cond); {2517#true} is VALID [2022-04-15 07:49:34,795 INFO L290 TraceCheckUtils]: 22: Hoare triple {2517#true} assume true; {2517#true} is VALID [2022-04-15 07:49:34,796 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2517#true} {2554#(<= 1 main_~y~0)} #81#return; {2554#(<= 1 main_~y~0)} is VALID [2022-04-15 07:49:34,797 INFO L290 TraceCheckUtils]: 24: Hoare triple {2554#(<= 1 main_~y~0)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {2597#(<= 1 main_~r~0)} is VALID [2022-04-15 07:49:34,797 INFO L290 TraceCheckUtils]: 25: Hoare triple {2597#(<= 1 main_~r~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2597#(<= 1 main_~r~0)} is VALID [2022-04-15 07:49:34,797 INFO L290 TraceCheckUtils]: 26: Hoare triple {2597#(<= 1 main_~r~0)} assume !!(#t~post7 < 20);havoc #t~post7; {2597#(<= 1 main_~r~0)} is VALID [2022-04-15 07:49:34,798 INFO L272 TraceCheckUtils]: 27: Hoare triple {2597#(<= 1 main_~r~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {2517#true} is VALID [2022-04-15 07:49:34,798 INFO L290 TraceCheckUtils]: 28: Hoare triple {2517#true} ~cond := #in~cond; {2517#true} is VALID [2022-04-15 07:49:34,798 INFO L290 TraceCheckUtils]: 29: Hoare triple {2517#true} assume !(0 == ~cond); {2517#true} is VALID [2022-04-15 07:49:34,798 INFO L290 TraceCheckUtils]: 30: Hoare triple {2517#true} assume true; {2517#true} is VALID [2022-04-15 07:49:34,799 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2517#true} {2597#(<= 1 main_~r~0)} #83#return; {2597#(<= 1 main_~r~0)} is VALID [2022-04-15 07:49:34,799 INFO L272 TraceCheckUtils]: 32: Hoare triple {2597#(<= 1 main_~r~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {2517#true} is VALID [2022-04-15 07:49:34,800 INFO L290 TraceCheckUtils]: 33: Hoare triple {2517#true} ~cond := #in~cond; {2517#true} is VALID [2022-04-15 07:49:34,800 INFO L290 TraceCheckUtils]: 34: Hoare triple {2517#true} assume !(0 == ~cond); {2517#true} is VALID [2022-04-15 07:49:34,801 INFO L290 TraceCheckUtils]: 35: Hoare triple {2517#true} assume true; {2517#true} is VALID [2022-04-15 07:49:34,801 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2517#true} {2597#(<= 1 main_~r~0)} #85#return; {2597#(<= 1 main_~r~0)} is VALID [2022-04-15 07:49:34,802 INFO L272 TraceCheckUtils]: 37: Hoare triple {2597#(<= 1 main_~r~0)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {2637#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:49:34,802 INFO L290 TraceCheckUtils]: 38: Hoare triple {2637#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2641#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:49:34,803 INFO L290 TraceCheckUtils]: 39: Hoare triple {2641#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2518#false} is VALID [2022-04-15 07:49:34,803 INFO L290 TraceCheckUtils]: 40: Hoare triple {2518#false} assume !false; {2518#false} is VALID [2022-04-15 07:49:34,803 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:49:34,803 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 07:49:34,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:49:34,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191249324] [2022-04-15 07:49:34,804 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:49:34,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86209412] [2022-04-15 07:49:34,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86209412] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:49:34,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:49:34,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 07:49:34,804 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:49:34,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [639382959] [2022-04-15 07:49:34,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [639382959] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:49:34,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:49:34,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 07:49:34,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552577066] [2022-04-15 07:49:34,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:49:34,805 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 41 [2022-04-15 07:49:34,806 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:49:34,806 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-15 07:49:34,829 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:49:34,829 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 07:49:34,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:49:34,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 07:49:34,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-15 07:49:34,830 INFO L87 Difference]: Start difference. First operand 78 states and 102 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-15 07:49:35,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:49:35,181 INFO L93 Difference]: Finished difference Result 84 states and 107 transitions. [2022-04-15 07:49:35,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 07:49:35,181 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 41 [2022-04-15 07:49:35,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:49:35,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-15 07:49:35,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-15 07:49:35,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-15 07:49:35,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-15 07:49:35,184 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 47 transitions. [2022-04-15 07:49:35,224 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:49:35,225 INFO L225 Difference]: With dead ends: 84 [2022-04-15 07:49:35,226 INFO L226 Difference]: Without dead ends: 82 [2022-04-15 07:49:35,226 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-15 07:49:35,226 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 20 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:49:35,227 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 167 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 07:49:35,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-15 07:49:35,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-04-15 07:49:35,314 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:49:35,315 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 82 states, 50 states have (on average 1.22) internal successors, (61), 52 states have internal predecessors, (61), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 07:49:35,315 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 82 states, 50 states have (on average 1.22) internal successors, (61), 52 states have internal predecessors, (61), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 07:49:35,315 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 82 states, 50 states have (on average 1.22) internal successors, (61), 52 states have internal predecessors, (61), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 07:49:35,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:49:35,318 INFO L93 Difference]: Finished difference Result 82 states and 105 transitions. [2022-04-15 07:49:35,319 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 105 transitions. [2022-04-15 07:49:35,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:49:35,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:49:35,319 INFO L74 IsIncluded]: Start isIncluded. First operand has 82 states, 50 states have (on average 1.22) internal successors, (61), 52 states have internal predecessors, (61), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 82 states. [2022-04-15 07:49:35,320 INFO L87 Difference]: Start difference. First operand has 82 states, 50 states have (on average 1.22) internal successors, (61), 52 states have internal predecessors, (61), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 82 states. [2022-04-15 07:49:35,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:49:35,323 INFO L93 Difference]: Finished difference Result 82 states and 105 transitions. [2022-04-15 07:49:35,323 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 105 transitions. [2022-04-15 07:49:35,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:49:35,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:49:35,323 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:49:35,324 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:49:35,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 50 states have (on average 1.22) internal successors, (61), 52 states have internal predecessors, (61), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 07:49:35,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 105 transitions. [2022-04-15 07:49:35,327 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 105 transitions. Word has length 41 [2022-04-15 07:49:35,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:49:35,327 INFO L478 AbstractCegarLoop]: Abstraction has 82 states and 105 transitions. [2022-04-15 07:49:35,327 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-15 07:49:35,327 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 82 states and 105 transitions. [2022-04-15 07:49:35,434 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:49:35,434 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 105 transitions. [2022-04-15 07:49:35,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-15 07:49:35,435 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:49:35,435 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:49:35,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-15 07:49:35,639 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:49:35,639 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:49:35,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:49:35,640 INFO L85 PathProgramCache]: Analyzing trace with hash -683043127, now seen corresponding path program 1 times [2022-04-15 07:49:35,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:49:35,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [250127785] [2022-04-15 07:49:35,641 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:49:35,641 INFO L85 PathProgramCache]: Analyzing trace with hash -683043127, now seen corresponding path program 2 times [2022-04-15 07:49:35,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:49:35,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110909128] [2022-04-15 07:49:35,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:49:35,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:49:35,653 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:49:35,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [440983303] [2022-04-15 07:49:35,653 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:49:35,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:49:35,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:49:35,655 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:49:35,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-15 07:49:35,709 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:49:35,709 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:49:35,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 07:49:35,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:49:35,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:49:35,915 INFO L272 TraceCheckUtils]: 0: Hoare triple {3149#true} call ULTIMATE.init(); {3149#true} is VALID [2022-04-15 07:49:35,915 INFO L290 TraceCheckUtils]: 1: Hoare triple {3149#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3149#true} is VALID [2022-04-15 07:49:35,915 INFO L290 TraceCheckUtils]: 2: Hoare triple {3149#true} assume true; {3149#true} is VALID [2022-04-15 07:49:35,916 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3149#true} {3149#true} #93#return; {3149#true} is VALID [2022-04-15 07:49:35,916 INFO L272 TraceCheckUtils]: 4: Hoare triple {3149#true} call #t~ret8 := main(); {3149#true} is VALID [2022-04-15 07:49:35,916 INFO L290 TraceCheckUtils]: 5: Hoare triple {3149#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; {3149#true} is VALID [2022-04-15 07:49:35,916 INFO L272 TraceCheckUtils]: 6: Hoare triple {3149#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3149#true} is VALID [2022-04-15 07:49:35,916 INFO L290 TraceCheckUtils]: 7: Hoare triple {3149#true} ~cond := #in~cond; {3149#true} is VALID [2022-04-15 07:49:35,916 INFO L290 TraceCheckUtils]: 8: Hoare triple {3149#true} assume !(0 == ~cond); {3149#true} is VALID [2022-04-15 07:49:35,916 INFO L290 TraceCheckUtils]: 9: Hoare triple {3149#true} assume true; {3149#true} is VALID [2022-04-15 07:49:35,916 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3149#true} {3149#true} #77#return; {3149#true} is VALID [2022-04-15 07:49:35,917 INFO L290 TraceCheckUtils]: 11: Hoare triple {3149#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {3149#true} is VALID [2022-04-15 07:49:35,917 INFO L290 TraceCheckUtils]: 12: Hoare triple {3149#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3149#true} is VALID [2022-04-15 07:49:35,917 INFO L290 TraceCheckUtils]: 13: Hoare triple {3149#true} assume !!(#t~post6 < 20);havoc #t~post6; {3149#true} is VALID [2022-04-15 07:49:35,917 INFO L272 TraceCheckUtils]: 14: Hoare triple {3149#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {3149#true} is VALID [2022-04-15 07:49:35,918 INFO L290 TraceCheckUtils]: 15: Hoare triple {3149#true} ~cond := #in~cond; {3149#true} is VALID [2022-04-15 07:49:35,918 INFO L290 TraceCheckUtils]: 16: Hoare triple {3149#true} assume !(0 == ~cond); {3149#true} is VALID [2022-04-15 07:49:35,918 INFO L290 TraceCheckUtils]: 17: Hoare triple {3149#true} assume true; {3149#true} is VALID [2022-04-15 07:49:35,918 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3149#true} {3149#true} #79#return; {3149#true} is VALID [2022-04-15 07:49:35,918 INFO L272 TraceCheckUtils]: 19: Hoare triple {3149#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3149#true} is VALID [2022-04-15 07:49:35,918 INFO L290 TraceCheckUtils]: 20: Hoare triple {3149#true} ~cond := #in~cond; {3149#true} is VALID [2022-04-15 07:49:35,918 INFO L290 TraceCheckUtils]: 21: Hoare triple {3149#true} assume !(0 == ~cond); {3149#true} is VALID [2022-04-15 07:49:35,919 INFO L290 TraceCheckUtils]: 22: Hoare triple {3149#true} assume true; {3149#true} is VALID [2022-04-15 07:49:35,919 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3149#true} {3149#true} #81#return; {3149#true} is VALID [2022-04-15 07:49:35,922 INFO L290 TraceCheckUtils]: 24: Hoare triple {3149#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {3149#true} is VALID [2022-04-15 07:49:35,922 INFO L290 TraceCheckUtils]: 25: Hoare triple {3149#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3149#true} is VALID [2022-04-15 07:49:35,922 INFO L290 TraceCheckUtils]: 26: Hoare triple {3149#true} assume !!(#t~post7 < 20);havoc #t~post7; {3149#true} is VALID [2022-04-15 07:49:35,922 INFO L272 TraceCheckUtils]: 27: Hoare triple {3149#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {3149#true} is VALID [2022-04-15 07:49:35,923 INFO L290 TraceCheckUtils]: 28: Hoare triple {3149#true} ~cond := #in~cond; {3238#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:49:35,924 INFO L290 TraceCheckUtils]: 29: Hoare triple {3238#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3242#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:49:35,924 INFO L290 TraceCheckUtils]: 30: Hoare triple {3242#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3242#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:49:35,925 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3242#(not (= |__VERIFIER_assert_#in~cond| 0))} {3149#true} #83#return; {3249#(= main_~b~0 (* main_~a~0 main_~y~0))} is VALID [2022-04-15 07:49:35,925 INFO L272 TraceCheckUtils]: 32: Hoare triple {3249#(= 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)); {3149#true} is VALID [2022-04-15 07:49:35,925 INFO L290 TraceCheckUtils]: 33: Hoare triple {3149#true} ~cond := #in~cond; {3149#true} is VALID [2022-04-15 07:49:35,925 INFO L290 TraceCheckUtils]: 34: Hoare triple {3149#true} assume !(0 == ~cond); {3149#true} is VALID [2022-04-15 07:49:35,926 INFO L290 TraceCheckUtils]: 35: Hoare triple {3149#true} assume true; {3149#true} is VALID [2022-04-15 07:49:35,926 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3149#true} {3249#(= main_~b~0 (* main_~a~0 main_~y~0))} #85#return; {3249#(= main_~b~0 (* main_~a~0 main_~y~0))} is VALID [2022-04-15 07:49:35,926 INFO L272 TraceCheckUtils]: 37: Hoare triple {3249#(= main_~b~0 (* main_~a~0 main_~y~0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {3149#true} is VALID [2022-04-15 07:49:35,927 INFO L290 TraceCheckUtils]: 38: Hoare triple {3149#true} ~cond := #in~cond; {3149#true} is VALID [2022-04-15 07:49:35,927 INFO L290 TraceCheckUtils]: 39: Hoare triple {3149#true} assume !(0 == ~cond); {3149#true} is VALID [2022-04-15 07:49:35,927 INFO L290 TraceCheckUtils]: 40: Hoare triple {3149#true} assume true; {3149#true} is VALID [2022-04-15 07:49:35,927 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3149#true} {3249#(= main_~b~0 (* main_~a~0 main_~y~0))} #87#return; {3249#(= main_~b~0 (* main_~a~0 main_~y~0))} is VALID [2022-04-15 07:49:35,928 INFO L290 TraceCheckUtils]: 42: Hoare triple {3249#(= main_~b~0 (* main_~a~0 main_~y~0))} assume !!(~r~0 >= 2 * ~b~0); {3283#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} is VALID [2022-04-15 07:49:35,929 INFO L272 TraceCheckUtils]: 43: Hoare triple {3283#(<= (* 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)); {3287#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:49:35,929 INFO L290 TraceCheckUtils]: 44: Hoare triple {3287#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3291#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:49:35,929 INFO L290 TraceCheckUtils]: 45: Hoare triple {3291#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3150#false} is VALID [2022-04-15 07:49:35,930 INFO L290 TraceCheckUtils]: 46: Hoare triple {3150#false} assume !false; {3150#false} is VALID [2022-04-15 07:49:35,930 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:49:35,931 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:49:41,774 INFO L290 TraceCheckUtils]: 46: Hoare triple {3150#false} assume !false; {3150#false} is VALID [2022-04-15 07:49:41,775 INFO L290 TraceCheckUtils]: 45: Hoare triple {3291#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3150#false} is VALID [2022-04-15 07:49:41,775 INFO L290 TraceCheckUtils]: 44: Hoare triple {3287#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3291#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:49:41,777 INFO L272 TraceCheckUtils]: 43: Hoare triple {3283#(<= (* 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)); {3287#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:49:41,778 INFO L290 TraceCheckUtils]: 42: Hoare triple {3310#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} assume !!(~r~0 >= 2 * ~b~0); {3283#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} is VALID [2022-04-15 07:49:41,778 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3149#true} {3310#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} #87#return; {3310#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} is VALID [2022-04-15 07:49:41,778 INFO L290 TraceCheckUtils]: 40: Hoare triple {3149#true} assume true; {3149#true} is VALID [2022-04-15 07:49:41,778 INFO L290 TraceCheckUtils]: 39: Hoare triple {3149#true} assume !(0 == ~cond); {3149#true} is VALID [2022-04-15 07:49:41,778 INFO L290 TraceCheckUtils]: 38: Hoare triple {3149#true} ~cond := #in~cond; {3149#true} is VALID [2022-04-15 07:49:41,779 INFO L272 TraceCheckUtils]: 37: Hoare triple {3310#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {3149#true} is VALID [2022-04-15 07:49:41,781 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3149#true} {3310#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} #85#return; {3310#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} is VALID [2022-04-15 07:49:41,781 INFO L290 TraceCheckUtils]: 35: Hoare triple {3149#true} assume true; {3149#true} is VALID [2022-04-15 07:49:41,781 INFO L290 TraceCheckUtils]: 34: Hoare triple {3149#true} assume !(0 == ~cond); {3149#true} is VALID [2022-04-15 07:49:41,782 INFO L290 TraceCheckUtils]: 33: Hoare triple {3149#true} ~cond := #in~cond; {3149#true} is VALID [2022-04-15 07:49:41,782 INFO L272 TraceCheckUtils]: 32: Hoare triple {3310#(<= (* 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)); {3149#true} is VALID [2022-04-15 07:49:41,783 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3242#(not (= |__VERIFIER_assert_#in~cond| 0))} {3149#true} #83#return; {3310#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} is VALID [2022-04-15 07:49:41,783 INFO L290 TraceCheckUtils]: 30: Hoare triple {3242#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3242#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:49:41,783 INFO L290 TraceCheckUtils]: 29: Hoare triple {3353#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3242#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:49:41,784 INFO L290 TraceCheckUtils]: 28: Hoare triple {3149#true} ~cond := #in~cond; {3353#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:49:41,784 INFO L272 TraceCheckUtils]: 27: Hoare triple {3149#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {3149#true} is VALID [2022-04-15 07:49:41,784 INFO L290 TraceCheckUtils]: 26: Hoare triple {3149#true} assume !!(#t~post7 < 20);havoc #t~post7; {3149#true} is VALID [2022-04-15 07:49:41,784 INFO L290 TraceCheckUtils]: 25: Hoare triple {3149#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3149#true} is VALID [2022-04-15 07:49:41,784 INFO L290 TraceCheckUtils]: 24: Hoare triple {3149#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {3149#true} is VALID [2022-04-15 07:49:41,784 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3149#true} {3149#true} #81#return; {3149#true} is VALID [2022-04-15 07:49:41,785 INFO L290 TraceCheckUtils]: 22: Hoare triple {3149#true} assume true; {3149#true} is VALID [2022-04-15 07:49:41,785 INFO L290 TraceCheckUtils]: 21: Hoare triple {3149#true} assume !(0 == ~cond); {3149#true} is VALID [2022-04-15 07:49:41,785 INFO L290 TraceCheckUtils]: 20: Hoare triple {3149#true} ~cond := #in~cond; {3149#true} is VALID [2022-04-15 07:49:41,785 INFO L272 TraceCheckUtils]: 19: Hoare triple {3149#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3149#true} is VALID [2022-04-15 07:49:41,785 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3149#true} {3149#true} #79#return; {3149#true} is VALID [2022-04-15 07:49:41,785 INFO L290 TraceCheckUtils]: 17: Hoare triple {3149#true} assume true; {3149#true} is VALID [2022-04-15 07:49:41,785 INFO L290 TraceCheckUtils]: 16: Hoare triple {3149#true} assume !(0 == ~cond); {3149#true} is VALID [2022-04-15 07:49:41,785 INFO L290 TraceCheckUtils]: 15: Hoare triple {3149#true} ~cond := #in~cond; {3149#true} is VALID [2022-04-15 07:49:41,786 INFO L272 TraceCheckUtils]: 14: Hoare triple {3149#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {3149#true} is VALID [2022-04-15 07:49:41,786 INFO L290 TraceCheckUtils]: 13: Hoare triple {3149#true} assume !!(#t~post6 < 20);havoc #t~post6; {3149#true} is VALID [2022-04-15 07:49:41,786 INFO L290 TraceCheckUtils]: 12: Hoare triple {3149#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3149#true} is VALID [2022-04-15 07:49:41,786 INFO L290 TraceCheckUtils]: 11: Hoare triple {3149#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {3149#true} is VALID [2022-04-15 07:49:41,786 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3149#true} {3149#true} #77#return; {3149#true} is VALID [2022-04-15 07:49:41,786 INFO L290 TraceCheckUtils]: 9: Hoare triple {3149#true} assume true; {3149#true} is VALID [2022-04-15 07:49:41,786 INFO L290 TraceCheckUtils]: 8: Hoare triple {3149#true} assume !(0 == ~cond); {3149#true} is VALID [2022-04-15 07:49:41,786 INFO L290 TraceCheckUtils]: 7: Hoare triple {3149#true} ~cond := #in~cond; {3149#true} is VALID [2022-04-15 07:49:41,787 INFO L272 TraceCheckUtils]: 6: Hoare triple {3149#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3149#true} is VALID [2022-04-15 07:49:41,787 INFO L290 TraceCheckUtils]: 5: Hoare triple {3149#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; {3149#true} is VALID [2022-04-15 07:49:41,787 INFO L272 TraceCheckUtils]: 4: Hoare triple {3149#true} call #t~ret8 := main(); {3149#true} is VALID [2022-04-15 07:49:41,787 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3149#true} {3149#true} #93#return; {3149#true} is VALID [2022-04-15 07:49:41,787 INFO L290 TraceCheckUtils]: 2: Hoare triple {3149#true} assume true; {3149#true} is VALID [2022-04-15 07:49:41,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {3149#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3149#true} is VALID [2022-04-15 07:49:41,787 INFO L272 TraceCheckUtils]: 0: Hoare triple {3149#true} call ULTIMATE.init(); {3149#true} is VALID [2022-04-15 07:49:41,788 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:49:41,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:49:41,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110909128] [2022-04-15 07:49:41,788 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:49:41,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440983303] [2022-04-15 07:49:41,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [440983303] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:49:41,788 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:49:41,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-15 07:49:41,789 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:49:41,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [250127785] [2022-04-15 07:49:41,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [250127785] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:49:41,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:49:41,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 07:49:41,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964962637] [2022-04-15 07:49:41,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:49:41,790 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 47 [2022-04-15 07:49:41,790 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:49:41,790 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-15 07:49:41,823 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:49:41,823 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 07:49:41,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:49:41,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 07:49:41,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-15 07:49:41,824 INFO L87 Difference]: Start difference. First operand 82 states and 105 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-15 07:49:42,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:49:42,260 INFO L93 Difference]: Finished difference Result 88 states and 110 transitions. [2022-04-15 07:49:42,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 07:49:42,260 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 47 [2022-04-15 07:49:42,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:49:42,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-15 07:49:42,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-15 07:49:42,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-15 07:49:42,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-15 07:49:42,263 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 47 transitions. [2022-04-15 07:49:42,307 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:49:42,309 INFO L225 Difference]: With dead ends: 88 [2022-04-15 07:49:42,309 INFO L226 Difference]: Without dead ends: 86 [2022-04-15 07:49:42,309 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-04-15 07:49:42,310 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 21 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:49:42,310 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 134 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 07:49:42,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-04-15 07:49:42,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-04-15 07:49:42,393 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:49:42,394 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand has 86 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 55 states have internal predecessors, (64), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 07:49:42,394 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand has 86 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 55 states have internal predecessors, (64), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 07:49:42,395 INFO L87 Difference]: Start difference. First operand 86 states. Second operand has 86 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 55 states have internal predecessors, (64), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 07:49:42,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:49:42,401 INFO L93 Difference]: Finished difference Result 86 states and 108 transitions. [2022-04-15 07:49:42,401 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 108 transitions. [2022-04-15 07:49:42,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:49:42,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:49:42,408 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 55 states have internal predecessors, (64), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 86 states. [2022-04-15 07:49:42,409 INFO L87 Difference]: Start difference. First operand has 86 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 55 states have internal predecessors, (64), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 86 states. [2022-04-15 07:49:42,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:49:42,413 INFO L93 Difference]: Finished difference Result 86 states and 108 transitions. [2022-04-15 07:49:42,413 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 108 transitions. [2022-04-15 07:49:42,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:49:42,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:49:42,414 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:49:42,414 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:49:42,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 55 states have internal predecessors, (64), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 07:49:42,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 108 transitions. [2022-04-15 07:49:42,417 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 108 transitions. Word has length 47 [2022-04-15 07:49:42,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:49:42,418 INFO L478 AbstractCegarLoop]: Abstraction has 86 states and 108 transitions. [2022-04-15 07:49:42,418 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-15 07:49:42,418 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 86 states and 108 transitions. [2022-04-15 07:49:42,532 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:49:42,533 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 108 transitions. [2022-04-15 07:49:42,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-15 07:49:42,533 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:49:42,533 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:49:42,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-15 07:49:42,736 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:49:42,736 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:49:42,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:49:42,737 INFO L85 PathProgramCache]: Analyzing trace with hash -589126939, now seen corresponding path program 1 times [2022-04-15 07:49:42,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:49:42,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [250767613] [2022-04-15 07:49:55,960 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 5 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={1=1, 2=2}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:49:55,964 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:49:55,968 INFO L85 PathProgramCache]: Analyzing trace with hash -91585926, now seen corresponding path program 1 times [2022-04-15 07:49:55,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:49:55,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678096065] [2022-04-15 07:49:55,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:49:55,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:49:55,981 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:49:55,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2105347334] [2022-04-15 07:49:55,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:49:55,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:49:55,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:49:55,987 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:49:56,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-15 07:49:56,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:49:56,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 07:49:56,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:49:56,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:49:57,709 INFO L272 TraceCheckUtils]: 0: Hoare triple {3966#true} call ULTIMATE.init(); {3966#true} is VALID [2022-04-15 07:49:57,710 INFO L290 TraceCheckUtils]: 1: Hoare triple {3966#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3974#(<= ~counter~0 0)} is VALID [2022-04-15 07:49:57,710 INFO L290 TraceCheckUtils]: 2: Hoare triple {3974#(<= ~counter~0 0)} assume true; {3974#(<= ~counter~0 0)} is VALID [2022-04-15 07:49:57,711 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3974#(<= ~counter~0 0)} {3966#true} #93#return; {3974#(<= ~counter~0 0)} is VALID [2022-04-15 07:49:57,711 INFO L272 TraceCheckUtils]: 4: Hoare triple {3974#(<= ~counter~0 0)} call #t~ret8 := main(); {3974#(<= ~counter~0 0)} is VALID [2022-04-15 07:49:57,712 INFO L290 TraceCheckUtils]: 5: Hoare triple {3974#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3974#(<= ~counter~0 0)} is VALID [2022-04-15 07:49:57,712 INFO L272 TraceCheckUtils]: 6: Hoare triple {3974#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3974#(<= ~counter~0 0)} is VALID [2022-04-15 07:49:57,713 INFO L290 TraceCheckUtils]: 7: Hoare triple {3974#(<= ~counter~0 0)} ~cond := #in~cond; {3974#(<= ~counter~0 0)} is VALID [2022-04-15 07:49:57,713 INFO L290 TraceCheckUtils]: 8: Hoare triple {3974#(<= ~counter~0 0)} assume !(0 == ~cond); {3974#(<= ~counter~0 0)} is VALID [2022-04-15 07:49:57,714 INFO L290 TraceCheckUtils]: 9: Hoare triple {3974#(<= ~counter~0 0)} assume true; {3974#(<= ~counter~0 0)} is VALID [2022-04-15 07:49:57,714 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3974#(<= ~counter~0 0)} {3974#(<= ~counter~0 0)} #77#return; {3974#(<= ~counter~0 0)} is VALID [2022-04-15 07:49:57,715 INFO L290 TraceCheckUtils]: 11: Hoare triple {3974#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {3974#(<= ~counter~0 0)} is VALID [2022-04-15 07:49:57,750 INFO L290 TraceCheckUtils]: 12: Hoare triple {3974#(<= ~counter~0 0)} [99] L37-3-->L37-1_primed: Formula: (let ((.cse12 (+ (* v_main_~q~0_25 v_main_~y~0_36) v_main_~r~0_35))) (let ((.cse5 (= v_main_~a~0_29 v_main_~a~0_28)) (.cse6 (= v_main_~b~0_29 v_main_~b~0_28)) (.cse7 (= |v_main_#t~post6_19| |v_main_#t~post6_17|)) (.cse8 (= v_~counter~0_27 v_~counter~0_25)) (.cse9 (= v_main_~r~0_35 v_main_~r~0_34)) (.cse10 (= v_main_~q~0_25 v_main_~q~0_24)) (.cse11 (= |v_main_#t~post7_16| |v_main_#t~post7_14|)) (.cse4 (<= v_main_~y~0_36 v_main_~r~0_35)) (.cse3 (= v_main_~b~0_29 (* v_main_~y~0_36 v_main_~a~0_29))) (.cse0 (< v_main_~r~0_35 (* v_main_~y~0_36 2))) (.cse1 (< v_~counter~0_27 19)) (.cse2 (= v_main_~x~0_19 .cse12))) (or (and (or (not .cse0) (not .cse1) (not .cse2) (not .cse3) (not .cse4)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse5 (= v_main_~x~0_19 v_main_~x~0_19) .cse6 .cse7 (= v_main_~y~0_36 v_main_~y~0_36) .cse8 .cse9 .cse10 .cse11) (and .cse4 .cse3 (= v_main_~y~0_36 v_main_~b~0_28) (= (+ v_main_~r~0_34 (* v_main_~q~0_24 v_main_~y~0_36)) .cse12) (forall ((v_it_2 Int)) (or (not (<= 1 v_it_2)) (let ((.cse13 (* v_main_~y~0_36 v_it_2))) (and (< (+ (* v_it_2 2) v_~counter~0_27) 19) (< v_main_~r~0_35 (+ (* v_main_~y~0_36 2) .cse13)) (<= (+ v_main_~y~0_36 .cse13) v_main_~r~0_35) (<= .cse13 v_main_~r~0_35))) (not (<= (+ v_main_~q~0_25 v_it_2 1) v_main_~q~0_24)))) .cse0 (< v_main_~q~0_25 v_main_~q~0_24) (= 1 v_main_~a~0_28) .cse1 (= (+ (* v_main_~q~0_25 2) v_~counter~0_25) (+ (* v_main_~q~0_24 2) v_~counter~0_27)) .cse2)))) InVars {main_~q~0=v_main_~q~0_25, ~counter~0=v_~counter~0_27, main_~x~0=v_main_~x~0_19, main_~y~0=v_main_~y~0_36, main_~b~0=v_main_~b~0_29, main_~r~0=v_main_~r~0_35, main_#t~post6=|v_main_#t~post6_19|, main_~a~0=v_main_~a~0_29, main_#t~post7=|v_main_#t~post7_16|} OutVars{main_~q~0=v_main_~q~0_24, ~counter~0=v_~counter~0_25, main_~x~0=v_main_~x~0_19, main_~y~0=v_main_~y~0_36, main_~b~0=v_main_~b~0_28, main_~r~0=v_main_~r~0_34, main_#t~post6=|v_main_#t~post6_17|, main_~a~0=v_main_~a~0_28, main_#t~post7=|v_main_#t~post7_14|} AuxVars[] AssignedVars[main_~q~0, ~counter~0, main_~b~0, main_~r~0, main_#t~post6, main_~a~0, main_#t~post7] {4008#(or (<= ~counter~0 0) (exists ((v_main_~q~0_29 Int)) (and (= (+ (* (- 1) v_main_~q~0_29 main_~y~0) (* main_~q~0 main_~y~0) (* v_main_~q~0_29 main_~y~0) main_~r~0) main_~x~0) (< main_~q~0 (+ v_main_~q~0_29 2)) (< (+ (* main_~q~0 main_~y~0) main_~r~0) (+ (* v_main_~q~0_29 main_~y~0) (* main_~y~0 2))) (<= (+ (* v_main_~q~0_29 main_~y~0) main_~y~0) (+ (* main_~q~0 main_~y~0) main_~r~0)) (<= (+ ~counter~0 (* v_main_~q~0_29 2)) (* main_~q~0 2)))))} is VALID [2022-04-15 07:49:57,752 INFO L290 TraceCheckUtils]: 13: Hoare triple {4008#(or (<= ~counter~0 0) (exists ((v_main_~q~0_29 Int)) (and (= (+ (* (- 1) v_main_~q~0_29 main_~y~0) (* main_~q~0 main_~y~0) (* v_main_~q~0_29 main_~y~0) main_~r~0) main_~x~0) (< main_~q~0 (+ v_main_~q~0_29 2)) (< (+ (* main_~q~0 main_~y~0) main_~r~0) (+ (* v_main_~q~0_29 main_~y~0) (* main_~y~0 2))) (<= (+ (* v_main_~q~0_29 main_~y~0) main_~y~0) (+ (* main_~q~0 main_~y~0) main_~r~0)) (<= (+ ~counter~0 (* v_main_~q~0_29 2)) (* main_~q~0 2)))))} [98] L37-1_primed-->L37-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {4012#(or (exists ((v_main_~q~0_29 Int)) (and (= (+ (* (- 1) v_main_~q~0_29 main_~y~0) (* main_~q~0 main_~y~0) (* v_main_~q~0_29 main_~y~0) main_~r~0) main_~x~0) (< main_~q~0 (+ v_main_~q~0_29 2)) (< (+ (* main_~q~0 main_~y~0) main_~r~0) (+ (* v_main_~q~0_29 main_~y~0) (* main_~y~0 2))) (<= (+ (* v_main_~q~0_29 main_~y~0) main_~y~0) (+ (* main_~q~0 main_~y~0) main_~r~0)) (<= (+ |main_#t~post6| (* v_main_~q~0_29 2)) (* main_~q~0 2)))) (<= |main_#t~post6| 0))} is VALID [2022-04-15 07:49:57,753 INFO L290 TraceCheckUtils]: 14: Hoare triple {4012#(or (exists ((v_main_~q~0_29 Int)) (and (= (+ (* (- 1) v_main_~q~0_29 main_~y~0) (* main_~q~0 main_~y~0) (* v_main_~q~0_29 main_~y~0) main_~r~0) main_~x~0) (< main_~q~0 (+ v_main_~q~0_29 2)) (< (+ (* main_~q~0 main_~y~0) main_~r~0) (+ (* v_main_~q~0_29 main_~y~0) (* main_~y~0 2))) (<= (+ (* v_main_~q~0_29 main_~y~0) main_~y~0) (+ (* main_~q~0 main_~y~0) main_~r~0)) (<= (+ |main_#t~post6| (* v_main_~q~0_29 2)) (* main_~q~0 2)))) (<= |main_#t~post6| 0))} assume !(#t~post6 < 20);havoc #t~post6; {3967#false} is VALID [2022-04-15 07:49:57,753 INFO L272 TraceCheckUtils]: 15: Hoare triple {3967#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3967#false} is VALID [2022-04-15 07:49:57,753 INFO L290 TraceCheckUtils]: 16: Hoare triple {3967#false} ~cond := #in~cond; {3967#false} is VALID [2022-04-15 07:49:57,753 INFO L290 TraceCheckUtils]: 17: Hoare triple {3967#false} assume 0 == ~cond; {3967#false} is VALID [2022-04-15 07:49:57,754 INFO L290 TraceCheckUtils]: 18: Hoare triple {3967#false} assume !false; {3967#false} is VALID [2022-04-15 07:49:57,754 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:49:57,754 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 07:49:57,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:49:57,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678096065] [2022-04-15 07:49:57,754 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:49:57,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105347334] [2022-04-15 07:49:57,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2105347334] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:49:57,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:49:57,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 07:51:50,413 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:51:50,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [250767613] [2022-04-15 07:51:50,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [250767613] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:51:50,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:51:50,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-15 07:51:50,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388125701] [2022-04-15 07:51:50,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:51:50,414 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 17 states have internal predecessors, (30), 8 states have call successors, (9), 7 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Word has length 50 [2022-04-15 07:51:50,414 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:51:50,414 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 17 states have internal predecessors, (30), 8 states have call successors, (9), 7 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 07:51:56,531 WARN L143 InductivityCheck]: Transition 4047#(and (<= 0 (+ main_~b~0 main_~r~0)) (exists ((v_~counter~0_33 Int)) (and (or (= ~counter~0 (+ 2 v_~counter~0_33)) (exists ((v_main_~q~0_30 Int) (v_main_~y~0_BEFORE_CALL_22 Int) (v_main_~q~0_BEFORE_CALL_8 Int) (v_main_~r~0_BEFORE_CALL_13 Int)) (and (< (+ (* v_main_~y~0_BEFORE_CALL_22 v_main_~q~0_BEFORE_CALL_8) v_main_~r~0_BEFORE_CALL_13) (+ (* 2 v_main_~y~0_BEFORE_CALL_22) (* v_main_~q~0_30 v_main_~y~0_BEFORE_CALL_22))) (<= (+ (* v_main_~q~0_30 v_main_~y~0_BEFORE_CALL_22) v_main_~y~0_BEFORE_CALL_22) (+ (* v_main_~y~0_BEFORE_CALL_22 v_main_~q~0_BEFORE_CALL_8) v_main_~r~0_BEFORE_CALL_13)) (< v_main_~q~0_30 v_main_~q~0_BEFORE_CALL_8) (forall ((v_it_2 Int)) (or (and (< (+ (* v_main_~y~0_BEFORE_CALL_22 v_main_~q~0_BEFORE_CALL_8) v_main_~r~0_BEFORE_CALL_13) (+ (* 2 v_main_~y~0_BEFORE_CALL_22) (* v_main_~q~0_30 v_main_~y~0_BEFORE_CALL_22) (* v_it_2 v_main_~y~0_BEFORE_CALL_22))) (<= (+ (* v_main_~q~0_30 v_main_~y~0_BEFORE_CALL_22) (* v_it_2 v_main_~y~0_BEFORE_CALL_22)) (+ (* v_main_~y~0_BEFORE_CALL_22 v_main_~q~0_BEFORE_CALL_8) v_main_~r~0_BEFORE_CALL_13)) (< (+ (* v_it_2 2) v_~counter~0_33) 19) (<= (+ (* v_main_~q~0_30 v_main_~y~0_BEFORE_CALL_22) v_main_~y~0_BEFORE_CALL_22 (* v_it_2 v_main_~y~0_BEFORE_CALL_22)) (+ (* v_main_~y~0_BEFORE_CALL_22 v_main_~q~0_BEFORE_CALL_8) v_main_~r~0_BEFORE_CALL_13))) (not (<= 1 v_it_2)) (not (<= (+ v_main_~q~0_30 v_it_2 1) v_main_~q~0_BEFORE_CALL_8)))) (= (+ 2 v_~counter~0_33 (* 2 v_main_~q~0_BEFORE_CALL_8)) (+ ~counter~0 (* v_main_~q~0_30 2)))))) (<= v_~counter~0_33 0))) (not (<= main_~b~0 main_~r~0))) ( _ , #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; , 4012#(or (exists ((v_main_~q~0_29 Int)) (and (= (+ (* (- 1) v_main_~q~0_29 main_~y~0) (* main_~q~0 main_~y~0) (* v_main_~q~0_29 main_~y~0) main_~r~0) main_~x~0) (< main_~q~0 (+ v_main_~q~0_29 2)) (< (+ (* main_~q~0 main_~y~0) main_~r~0) (+ (* v_main_~q~0_29 main_~y~0) (* main_~y~0 2))) (<= (+ (* v_main_~q~0_29 main_~y~0) main_~y~0) (+ (* main_~q~0 main_~y~0) main_~r~0)) (<= (+ |main_#t~post6| (* v_main_~q~0_29 2)) (* main_~q~0 2)))) (<= |main_#t~post6| 0)) ) not inductive [2022-04-15 07:51:56,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-15 07:51:56,731 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-15 07:51:56,732 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:51:56,736 INFO L158 Benchmark]: Toolchain (without parser) took 162663.27ms. Allocated memory was 192.9MB in the beginning and 248.5MB in the end (delta: 55.6MB). Free memory was 146.1MB in the beginning and 148.0MB in the end (delta: -2.0MB). Peak memory consumption was 54.5MB. Max. memory is 8.0GB. [2022-04-15 07:51:56,736 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 192.9MB. Free memory was 163.0MB in the beginning and 162.9MB in the end (delta: 71.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 07:51:56,737 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.91ms. Allocated memory is still 192.9MB. Free memory was 145.9MB in the beginning and 170.7MB in the end (delta: -24.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 07:51:56,737 INFO L158 Benchmark]: Boogie Preprocessor took 27.84ms. Allocated memory is still 192.9MB. Free memory was 170.7MB in the beginning and 169.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 07:51:56,737 INFO L158 Benchmark]: RCFGBuilder took 342.50ms. Allocated memory is still 192.9MB. Free memory was 169.0MB in the beginning and 157.3MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 07:51:56,737 INFO L158 Benchmark]: TraceAbstraction took 162061.77ms. Allocated memory was 192.9MB in the beginning and 248.5MB in the end (delta: 55.6MB). Free memory was 156.8MB in the beginning and 148.6MB in the end (delta: 8.2MB). Peak memory consumption was 65.6MB. Max. memory is 8.0GB. [2022-04-15 07:51:56,738 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.13ms. Allocated memory is still 192.9MB. Free memory was 163.0MB in the beginning and 162.9MB in the end (delta: 71.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 223.91ms. Allocated memory is still 192.9MB. Free memory was 145.9MB in the beginning and 170.7MB in the end (delta: -24.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.84ms. Allocated memory is still 192.9MB. Free memory was 170.7MB in the beginning and 169.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 342.50ms. Allocated memory is still 192.9MB. Free memory was 169.0MB in the beginning and 157.3MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 162061.77ms. Allocated memory was 192.9MB in the beginning and 248.5MB in the end (delta: 55.6MB). Free memory was 156.8MB in the beginning and 148.6MB in the end (delta: 8.2MB). Peak memory consumption was 65.6MB. 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:51:56,959 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-04-15 07:51:57,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request...