/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/mannadiv_unwindbound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 07:15:30,058 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 07:15:30,059 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 07:15:30,084 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 07:15:30,085 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 07:15:30,085 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 07:15:30,086 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 07:15:30,087 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 07:15:30,089 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 07:15:30,089 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 07:15:30,090 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 07:15:30,091 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 07:15:30,091 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 07:15:30,100 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 07:15:30,101 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 07:15:30,101 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 07:15:30,102 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 07:15:30,102 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 07:15:30,103 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 07:15:30,105 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 07:15:30,106 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 07:15:30,110 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 07:15:30,111 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 07:15:30,112 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 07:15:30,112 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 07:15:30,114 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 07:15:30,114 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 07:15:30,114 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 07:15:30,115 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 07:15:30,115 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 07:15:30,116 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 07:15:30,116 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 07:15:30,116 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 07:15:30,117 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 07:15:30,117 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 07:15:30,118 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 07:15:30,118 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 07:15:30,119 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 07:15:30,119 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 07:15:30,125 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 07:15:30,125 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 07:15:30,127 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 07:15:30,128 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 07:15:30,142 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 07:15:30,142 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 07:15:30,143 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 07:15:30,143 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 07:15:30,143 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 07:15:30,143 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 07:15:30,143 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 07:15:30,144 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 07:15:30,144 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 07:15:30,144 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 07:15:30,144 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 07:15:30,144 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 07:15:30,144 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 07:15:30,144 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 07:15:30,144 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 07:15:30,144 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 07:15:30,144 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 07:15:30,144 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 07:15:30,144 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 07:15:30,145 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 07:15:30,145 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 07:15:30,145 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 07:15:30,145 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 07:15:30,145 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 07:15:30,145 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 07:15:30,145 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-28 07:15:30,318 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 07:15:30,334 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 07:15:30,336 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 07:15:30,337 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 07:15:30,339 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 07:15:30,340 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/mannadiv_unwindbound10.c [2022-04-28 07:15:30,388 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91417b348/3562726bdcf74dea84aefa0273b500cf/FLAG7830e6493 [2022-04-28 07:15:30,721 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 07:15:30,722 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/mannadiv_unwindbound10.c [2022-04-28 07:15:30,726 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91417b348/3562726bdcf74dea84aefa0273b500cf/FLAG7830e6493 [2022-04-28 07:15:30,734 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91417b348/3562726bdcf74dea84aefa0273b500cf [2022-04-28 07:15:30,735 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 07:15:30,736 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 07:15:30,748 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 07:15:30,748 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 07:15:30,750 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 07:15:30,751 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 07:15:30" (1/1) ... [2022-04-28 07:15:30,752 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39811291 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:15:30, skipping insertion in model container [2022-04-28 07:15:30,752 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 07:15:30" (1/1) ... [2022-04-28 07:15:30,757 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 07:15:30,768 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 07:15:30,926 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/mannadiv_unwindbound10.c[573,586] [2022-04-28 07:15:30,950 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 07:15:30,955 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 07:15:30,963 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/mannadiv_unwindbound10.c[573,586] [2022-04-28 07:15:30,967 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 07:15:30,975 INFO L208 MainTranslator]: Completed translation [2022-04-28 07:15:30,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:15:30 WrapperNode [2022-04-28 07:15:30,975 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 07:15:30,976 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 07:15:30,976 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 07:15:30,976 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 07:15:30,983 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:15:30" (1/1) ... [2022-04-28 07:15:30,983 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:15:30" (1/1) ... [2022-04-28 07:15:30,987 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:15:30" (1/1) ... [2022-04-28 07:15:30,987 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:15:30" (1/1) ... [2022-04-28 07:15:30,991 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:15:30" (1/1) ... [2022-04-28 07:15:30,993 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:15:30" (1/1) ... [2022-04-28 07:15:30,994 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:15:30" (1/1) ... [2022-04-28 07:15:30,995 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 07:15:30,996 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 07:15:30,996 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 07:15:30,996 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 07:15:30,997 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:15:30" (1/1) ... [2022-04-28 07:15:31,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 07:15:31,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:15:31,033 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-28 07:15:31,045 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-28 07:15:31,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 07:15:31,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 07:15:31,062 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 07:15:31,062 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 07:15:31,062 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 07:15:31,062 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 07:15:31,062 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 07:15:31,062 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 07:15:31,062 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 07:15:31,062 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 07:15:31,062 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 07:15:31,062 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 07:15:31,063 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 07:15:31,063 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 07:15:31,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 07:15:31,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 07:15:31,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 07:15:31,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 07:15:31,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 07:15:31,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 07:15:31,104 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 07:15:31,105 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 07:15:31,257 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 07:15:31,261 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 07:15:31,262 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 07:15:31,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 07:15:31 BoogieIcfgContainer [2022-04-28 07:15:31,263 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 07:15:31,270 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 07:15:31,270 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 07:15:31,279 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 07:15:31,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 07:15:30" (1/3) ... [2022-04-28 07:15:31,280 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4baee5c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 07:15:31, skipping insertion in model container [2022-04-28 07:15:31,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:15:30" (2/3) ... [2022-04-28 07:15:31,280 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4baee5c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 07:15:31, skipping insertion in model container [2022-04-28 07:15:31,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 07:15:31" (3/3) ... [2022-04-28 07:15:31,281 INFO L111 eAbstractionObserver]: Analyzing ICFG mannadiv_unwindbound10.c [2022-04-28 07:15:31,290 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 07:15:31,290 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 07:15:31,335 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 07:15:31,340 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5d728a82, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4122fe5f [2022-04-28 07:15:31,340 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 07:15:31,352 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:15:31,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 07:15:31,357 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:15:31,357 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:15:31,357 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:15:31,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:15:31,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1859024204, now seen corresponding path program 1 times [2022-04-28 07:15:31,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:15:31,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1740690454] [2022-04-28 07:15:31,372 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:15:31,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1859024204, now seen corresponding path program 2 times [2022-04-28 07:15:31,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:15:31,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896188601] [2022-04-28 07:15:31,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:15:31,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:15:31,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:15:31,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 07:15:31,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:15:31,532 INFO L290 TraceCheckUtils]: 0: Hoare triple {46#(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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {33#true} is VALID [2022-04-28 07:15:31,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-28 07:15:31,532 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} #67#return; {33#true} is VALID [2022-04-28 07:15:31,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 07:15:31,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:15:31,552 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-28 07:15:31,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-28 07:15:31,554 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-28 07:15:31,554 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#false} {33#true} #59#return; {34#false} is VALID [2022-04-28 07:15:31,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 07:15:31,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:15:31,567 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-28 07:15:31,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-28 07:15:31,568 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-28 07:15:31,568 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#false} {34#false} #61#return; {34#false} is VALID [2022-04-28 07:15:31,569 INFO L272 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {46#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 07:15:31,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {46#(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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {33#true} is VALID [2022-04-28 07:15:31,569 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-28 07:15:31,570 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #67#return; {33#true} is VALID [2022-04-28 07:15:31,570 INFO L272 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret7 := main(); {33#true} is VALID [2022-04-28 07:15:31,570 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#true} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {33#true} is VALID [2022-04-28 07:15:31,570 INFO L272 TraceCheckUtils]: 6: Hoare triple {33#true} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {33#true} is VALID [2022-04-28 07:15:31,570 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-28 07:15:31,572 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-28 07:15:31,572 INFO L290 TraceCheckUtils]: 9: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-28 07:15:31,572 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {34#false} {33#true} #59#return; {34#false} is VALID [2022-04-28 07:15:31,572 INFO L272 TraceCheckUtils]: 11: Hoare triple {34#false} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {33#true} is VALID [2022-04-28 07:15:31,572 INFO L290 TraceCheckUtils]: 12: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-28 07:15:31,573 INFO L290 TraceCheckUtils]: 13: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-28 07:15:31,573 INFO L290 TraceCheckUtils]: 14: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-28 07:15:31,573 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {34#false} {34#false} #61#return; {34#false} is VALID [2022-04-28 07:15:31,573 INFO L290 TraceCheckUtils]: 16: Hoare triple {34#false} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {34#false} is VALID [2022-04-28 07:15:31,574 INFO L290 TraceCheckUtils]: 17: Hoare triple {34#false} assume !true; {34#false} is VALID [2022-04-28 07:15:31,574 INFO L272 TraceCheckUtils]: 18: Hoare triple {34#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {34#false} is VALID [2022-04-28 07:15:31,574 INFO L290 TraceCheckUtils]: 19: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2022-04-28 07:15:31,574 INFO L290 TraceCheckUtils]: 20: Hoare triple {34#false} assume 0 == ~cond; {34#false} is VALID [2022-04-28 07:15:31,575 INFO L290 TraceCheckUtils]: 21: Hoare triple {34#false} assume !false; {34#false} is VALID [2022-04-28 07:15:31,575 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 07:15:31,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:15:31,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896188601] [2022-04-28 07:15:31,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896188601] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:15:31,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:15:31,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 07:15:31,578 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:15:31,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1740690454] [2022-04-28 07:15:31,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1740690454] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:15:31,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:15:31,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 07:15:31,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370878291] [2022-04-28 07:15:31,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:15:31,585 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-28 07:15:31,586 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:15:31,588 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 07:15:31,617 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:15:31,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 07:15:31,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:15:31,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 07:15:31,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 07:15:31,640 INFO L87 Difference]: Start difference. First operand has 30 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 07:15:31,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:15:31,768 INFO L93 Difference]: Finished difference Result 54 states and 72 transitions. [2022-04-28 07:15:31,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 07:15:31,769 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-28 07:15:31,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:15:31,770 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 07:15:31,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2022-04-28 07:15:31,776 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 07:15:31,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2022-04-28 07:15:31,780 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 72 transitions. [2022-04-28 07:15:31,838 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-28 07:15:31,843 INFO L225 Difference]: With dead ends: 54 [2022-04-28 07:15:31,843 INFO L226 Difference]: Without dead ends: 26 [2022-04-28 07:15:31,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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-28 07:15:31,847 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 07:15:31,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 35 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 07:15:31,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-28 07:15:31,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-04-28 07:15:31,867 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:15:31,868 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 07:15:31,868 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 07:15:31,869 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 07:15:31,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:15:31,876 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-28 07:15:31,876 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-28 07:15:31,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:15:31,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:15:31,877 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-28 07:15:31,877 INFO L87 Difference]: Start difference. First operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-28 07:15:31,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:15:31,882 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-28 07:15:31,882 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-28 07:15:31,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:15:31,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:15:31,882 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:15:31,883 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:15:31,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 07:15:31,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-04-28 07:15:31,892 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 22 [2022-04-28 07:15:31,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:15:31,893 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-04-28 07:15:31,893 INFO L496 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 07:15:31,893 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 29 transitions. [2022-04-28 07:15:31,915 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:15:31,916 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-28 07:15:31,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 07:15:31,917 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:15:31,917 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:15:31,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 07:15:31,917 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:15:31,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:15:31,918 INFO L85 PathProgramCache]: Analyzing trace with hash 243739414, now seen corresponding path program 1 times [2022-04-28 07:15:31,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:15:31,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [426952713] [2022-04-28 07:15:31,920 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:15:31,921 INFO L85 PathProgramCache]: Analyzing trace with hash 243739414, now seen corresponding path program 2 times [2022-04-28 07:15:31,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:15:31,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243301042] [2022-04-28 07:15:31,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:15:31,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:15:31,951 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:15:31,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [655668740] [2022-04-28 07:15:31,951 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:15:31,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:15:31,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:15:31,956 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-28 07:15:31,969 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-28 07:15:31,999 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 07:15:31,999 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:15:32,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 07:15:32,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:15:32,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:15:32,172 INFO L272 TraceCheckUtils]: 0: Hoare triple {259#true} call ULTIMATE.init(); {259#true} is VALID [2022-04-28 07:15:32,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {259#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {267#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:32,174 INFO L290 TraceCheckUtils]: 2: Hoare triple {267#(<= ~counter~0 0)} assume true; {267#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:32,174 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {267#(<= ~counter~0 0)} {259#true} #67#return; {267#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:32,175 INFO L272 TraceCheckUtils]: 4: Hoare triple {267#(<= ~counter~0 0)} call #t~ret7 := main(); {267#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:32,175 INFO L290 TraceCheckUtils]: 5: Hoare triple {267#(<= ~counter~0 0)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {267#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:32,175 INFO L272 TraceCheckUtils]: 6: Hoare triple {267#(<= ~counter~0 0)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {267#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:32,176 INFO L290 TraceCheckUtils]: 7: Hoare triple {267#(<= ~counter~0 0)} ~cond := #in~cond; {267#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:32,176 INFO L290 TraceCheckUtils]: 8: Hoare triple {267#(<= ~counter~0 0)} assume !(0 == ~cond); {267#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:32,177 INFO L290 TraceCheckUtils]: 9: Hoare triple {267#(<= ~counter~0 0)} assume true; {267#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:32,178 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {267#(<= ~counter~0 0)} {267#(<= ~counter~0 0)} #59#return; {267#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:32,179 INFO L272 TraceCheckUtils]: 11: Hoare triple {267#(<= ~counter~0 0)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {267#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:32,179 INFO L290 TraceCheckUtils]: 12: Hoare triple {267#(<= ~counter~0 0)} ~cond := #in~cond; {267#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:32,180 INFO L290 TraceCheckUtils]: 13: Hoare triple {267#(<= ~counter~0 0)} assume !(0 == ~cond); {267#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:32,180 INFO L290 TraceCheckUtils]: 14: Hoare triple {267#(<= ~counter~0 0)} assume true; {267#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:32,184 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {267#(<= ~counter~0 0)} {267#(<= ~counter~0 0)} #61#return; {267#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:32,184 INFO L290 TraceCheckUtils]: 16: Hoare triple {267#(<= ~counter~0 0)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {267#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:32,185 INFO L290 TraceCheckUtils]: 17: Hoare triple {267#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {316#(<= |main_#t~post6| 0)} is VALID [2022-04-28 07:15:32,185 INFO L290 TraceCheckUtils]: 18: Hoare triple {316#(<= |main_#t~post6| 0)} assume !(#t~post6 < 10);havoc #t~post6; {260#false} is VALID [2022-04-28 07:15:32,185 INFO L272 TraceCheckUtils]: 19: Hoare triple {260#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {260#false} is VALID [2022-04-28 07:15:32,186 INFO L290 TraceCheckUtils]: 20: Hoare triple {260#false} ~cond := #in~cond; {260#false} is VALID [2022-04-28 07:15:32,186 INFO L290 TraceCheckUtils]: 21: Hoare triple {260#false} assume 0 == ~cond; {260#false} is VALID [2022-04-28 07:15:32,186 INFO L290 TraceCheckUtils]: 22: Hoare triple {260#false} assume !false; {260#false} is VALID [2022-04-28 07:15:32,186 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 07:15:32,186 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 07:15:32,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:15:32,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243301042] [2022-04-28 07:15:32,187 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:15:32,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655668740] [2022-04-28 07:15:32,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655668740] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:15:32,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:15:32,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 07:15:32,188 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:15:32,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [426952713] [2022-04-28 07:15:32,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [426952713] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:15:32,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:15:32,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 07:15:32,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854681298] [2022-04-28 07:15:32,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:15:32,189 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-28 07:15:32,189 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:15:32,189 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 07:15:32,202 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:15:32,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 07:15:32,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:15:32,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 07:15:32,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 07:15:32,203 INFO L87 Difference]: Start difference. First operand 25 states and 29 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 07:15:32,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:15:32,255 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-28 07:15:32,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 07:15:32,256 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-28 07:15:32,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:15:32,256 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 07:15:32,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-28 07:15:32,257 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 07:15:32,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-28 07:15:32,259 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2022-04-28 07:15:32,285 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-28 07:15:32,287 INFO L225 Difference]: With dead ends: 34 [2022-04-28 07:15:32,287 INFO L226 Difference]: Without dead ends: 27 [2022-04-28 07:15:32,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 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-28 07:15:32,288 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 07:15:32,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 07:15:32,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-28 07:15:32,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-28 07:15:32,308 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:15:32,309 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 07:15:32,309 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 07:15:32,309 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 07:15:32,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:15:32,313 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-28 07:15:32,313 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-28 07:15:32,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:15:32,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:15:32,315 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 27 states. [2022-04-28 07:15:32,318 INFO L87 Difference]: Start difference. First operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 27 states. [2022-04-28 07:15:32,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:15:32,323 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-28 07:15:32,323 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-28 07:15:32,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:15:32,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:15:32,325 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:15:32,325 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:15:32,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 07:15:32,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-04-28 07:15:32,330 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 23 [2022-04-28 07:15:32,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:15:32,330 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-04-28 07:15:32,330 INFO L496 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 07:15:32,330 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 31 transitions. [2022-04-28 07:15:32,356 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-28 07:15:32,356 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-28 07:15:32,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 07:15:32,357 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:15:32,357 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:15:32,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 07:15:32,571 WARN L477 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-28 07:15:32,571 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:15:32,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:15:32,572 INFO L85 PathProgramCache]: Analyzing trace with hash 245526874, now seen corresponding path program 1 times [2022-04-28 07:15:32,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:15:32,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [515890267] [2022-04-28 07:15:32,572 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:15:32,573 INFO L85 PathProgramCache]: Analyzing trace with hash 245526874, now seen corresponding path program 2 times [2022-04-28 07:15:32,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:15:32,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341604567] [2022-04-28 07:15:32,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:15:32,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:15:32,593 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:15:32,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1208897954] [2022-04-28 07:15:32,593 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:15:32,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:15:32,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:15:32,608 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-28 07:15:32,608 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-28 07:15:32,645 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 07:15:32,645 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:15:32,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 07:15:32,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:15:32,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:15:36,101 INFO L272 TraceCheckUtils]: 0: Hoare triple {507#true} call ULTIMATE.init(); {507#true} is VALID [2022-04-28 07:15:36,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {507#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {507#true} is VALID [2022-04-28 07:15:36,102 INFO L290 TraceCheckUtils]: 2: Hoare triple {507#true} assume true; {507#true} is VALID [2022-04-28 07:15:36,102 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {507#true} {507#true} #67#return; {507#true} is VALID [2022-04-28 07:15:36,102 INFO L272 TraceCheckUtils]: 4: Hoare triple {507#true} call #t~ret7 := main(); {507#true} is VALID [2022-04-28 07:15:36,102 INFO L290 TraceCheckUtils]: 5: Hoare triple {507#true} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {507#true} is VALID [2022-04-28 07:15:36,102 INFO L272 TraceCheckUtils]: 6: Hoare triple {507#true} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {507#true} is VALID [2022-04-28 07:15:36,102 INFO L290 TraceCheckUtils]: 7: Hoare triple {507#true} ~cond := #in~cond; {507#true} is VALID [2022-04-28 07:15:36,103 INFO L290 TraceCheckUtils]: 8: Hoare triple {507#true} assume !(0 == ~cond); {507#true} is VALID [2022-04-28 07:15:36,103 INFO L290 TraceCheckUtils]: 9: Hoare triple {507#true} assume true; {507#true} is VALID [2022-04-28 07:15:36,103 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {507#true} {507#true} #59#return; {507#true} is VALID [2022-04-28 07:15:36,103 INFO L272 TraceCheckUtils]: 11: Hoare triple {507#true} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {507#true} is VALID [2022-04-28 07:15:36,103 INFO L290 TraceCheckUtils]: 12: Hoare triple {507#true} ~cond := #in~cond; {507#true} is VALID [2022-04-28 07:15:36,103 INFO L290 TraceCheckUtils]: 13: Hoare triple {507#true} assume !(0 == ~cond); {507#true} is VALID [2022-04-28 07:15:36,103 INFO L290 TraceCheckUtils]: 14: Hoare triple {507#true} assume true; {507#true} is VALID [2022-04-28 07:15:36,103 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {507#true} {507#true} #61#return; {507#true} is VALID [2022-04-28 07:15:36,104 INFO L290 TraceCheckUtils]: 16: Hoare triple {507#true} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {560#(and (= main_~y2~0 0) (= main_~y1~0 0) (= main_~x1~0 main_~y3~0))} is VALID [2022-04-28 07:15:36,104 INFO L290 TraceCheckUtils]: 17: Hoare triple {560#(and (= main_~y2~0 0) (= main_~y1~0 0) (= main_~x1~0 main_~y3~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {560#(and (= main_~y2~0 0) (= main_~y1~0 0) (= main_~x1~0 main_~y3~0))} is VALID [2022-04-28 07:15:36,105 INFO L290 TraceCheckUtils]: 18: Hoare triple {560#(and (= main_~y2~0 0) (= main_~y1~0 0) (= main_~x1~0 main_~y3~0))} assume !!(#t~post6 < 10);havoc #t~post6; {560#(and (= main_~y2~0 0) (= main_~y1~0 0) (= main_~x1~0 main_~y3~0))} is VALID [2022-04-28 07:15:36,105 INFO L272 TraceCheckUtils]: 19: Hoare triple {560#(and (= main_~y2~0 0) (= main_~y1~0 0) (= main_~x1~0 main_~y3~0))} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {570#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:15:36,106 INFO L290 TraceCheckUtils]: 20: Hoare triple {570#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {574#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:15:36,106 INFO L290 TraceCheckUtils]: 21: Hoare triple {574#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {508#false} is VALID [2022-04-28 07:15:36,106 INFO L290 TraceCheckUtils]: 22: Hoare triple {508#false} assume !false; {508#false} is VALID [2022-04-28 07:15:36,106 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 07:15:36,107 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 07:15:36,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:15:36,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341604567] [2022-04-28 07:15:36,107 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:15:36,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1208897954] [2022-04-28 07:15:36,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1208897954] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:15:36,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:15:36,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 07:15:36,107 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:15:36,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [515890267] [2022-04-28 07:15:36,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [515890267] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:15:36,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:15:36,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 07:15:36,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617689950] [2022-04-28 07:15:36,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:15:36,108 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-28 07:15:36,108 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:15:36,109 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 07:15:36,120 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:15:36,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 07:15:36,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:15:36,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 07:15:36,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 07:15:36,121 INFO L87 Difference]: Start difference. First operand 27 states and 31 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 07:15:36,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:15:36,205 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-04-28 07:15:36,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 07:15:36,205 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-28 07:15:36,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:15:36,206 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 07:15:36,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-04-28 07:15:36,207 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 07:15:36,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-04-28 07:15:36,208 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 43 transitions. [2022-04-28 07:15:36,237 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:15:36,238 INFO L225 Difference]: With dead ends: 37 [2022-04-28 07:15:36,238 INFO L226 Difference]: Without dead ends: 35 [2022-04-28 07:15:36,238 INFO L412 NwaCegarLoop]: 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-28 07:15:36,239 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 7 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 07:15:36,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 83 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 07:15:36,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-28 07:15:36,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2022-04-28 07:15:36,253 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:15:36,254 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:15:36,254 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:15:36,254 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:15:36,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:15:36,256 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-28 07:15:36,256 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-28 07:15:36,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:15:36,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:15:36,257 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 35 states. [2022-04-28 07:15:36,257 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 35 states. [2022-04-28 07:15:36,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:15:36,258 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-28 07:15:36,258 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-28 07:15:36,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:15:36,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:15:36,259 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:15:36,259 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:15:36,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:15:36,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-04-28 07:15:36,261 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 23 [2022-04-28 07:15:36,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:15:36,261 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-04-28 07:15:36,261 INFO L496 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 07:15:36,261 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 36 transitions. [2022-04-28 07:15:36,290 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:15:36,291 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-04-28 07:15:36,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 07:15:36,292 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:15:36,292 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:15:36,310 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-28 07:15:36,507 WARN L477 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-28 07:15:36,508 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:15:36,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:15:36,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1019533657, now seen corresponding path program 1 times [2022-04-28 07:15:36,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:15:36,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1504269532] [2022-04-28 07:15:36,509 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:15:36,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1019533657, now seen corresponding path program 2 times [2022-04-28 07:15:36,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:15:36,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776347684] [2022-04-28 07:15:36,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:15:36,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:15:36,533 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:15:36,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [759899336] [2022-04-28 07:15:36,534 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:15:36,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:15:36,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:15:36,541 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-28 07:15:36,541 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-28 07:15:36,576 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:15:36,576 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:15:36,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 07:15:36,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:15:36,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:15:36,730 INFO L272 TraceCheckUtils]: 0: Hoare triple {790#true} call ULTIMATE.init(); {790#true} is VALID [2022-04-28 07:15:36,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {790#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {790#true} is VALID [2022-04-28 07:15:36,731 INFO L290 TraceCheckUtils]: 2: Hoare triple {790#true} assume true; {790#true} is VALID [2022-04-28 07:15:36,731 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {790#true} {790#true} #67#return; {790#true} is VALID [2022-04-28 07:15:36,731 INFO L272 TraceCheckUtils]: 4: Hoare triple {790#true} call #t~ret7 := main(); {790#true} is VALID [2022-04-28 07:15:36,731 INFO L290 TraceCheckUtils]: 5: Hoare triple {790#true} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {790#true} is VALID [2022-04-28 07:15:36,731 INFO L272 TraceCheckUtils]: 6: Hoare triple {790#true} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {790#true} is VALID [2022-04-28 07:15:36,731 INFO L290 TraceCheckUtils]: 7: Hoare triple {790#true} ~cond := #in~cond; {790#true} is VALID [2022-04-28 07:15:36,733 INFO L290 TraceCheckUtils]: 8: Hoare triple {790#true} assume !(0 == ~cond); {790#true} is VALID [2022-04-28 07:15:36,733 INFO L290 TraceCheckUtils]: 9: Hoare triple {790#true} assume true; {790#true} is VALID [2022-04-28 07:15:36,734 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {790#true} {790#true} #59#return; {790#true} is VALID [2022-04-28 07:15:36,734 INFO L272 TraceCheckUtils]: 11: Hoare triple {790#true} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {790#true} is VALID [2022-04-28 07:15:36,734 INFO L290 TraceCheckUtils]: 12: Hoare triple {790#true} ~cond := #in~cond; {790#true} is VALID [2022-04-28 07:15:36,734 INFO L290 TraceCheckUtils]: 13: Hoare triple {790#true} assume !(0 == ~cond); {790#true} is VALID [2022-04-28 07:15:36,734 INFO L290 TraceCheckUtils]: 14: Hoare triple {790#true} assume true; {790#true} is VALID [2022-04-28 07:15:36,734 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {790#true} {790#true} #61#return; {790#true} is VALID [2022-04-28 07:15:36,734 INFO L290 TraceCheckUtils]: 16: Hoare triple {790#true} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {790#true} is VALID [2022-04-28 07:15:36,734 INFO L290 TraceCheckUtils]: 17: Hoare triple {790#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {790#true} is VALID [2022-04-28 07:15:36,735 INFO L290 TraceCheckUtils]: 18: Hoare triple {790#true} assume !!(#t~post6 < 10);havoc #t~post6; {790#true} is VALID [2022-04-28 07:15:36,735 INFO L272 TraceCheckUtils]: 19: Hoare triple {790#true} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {790#true} is VALID [2022-04-28 07:15:36,735 INFO L290 TraceCheckUtils]: 20: Hoare triple {790#true} ~cond := #in~cond; {855#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:15:36,736 INFO L290 TraceCheckUtils]: 21: Hoare triple {855#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {859#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:15:36,736 INFO L290 TraceCheckUtils]: 22: Hoare triple {859#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {859#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:15:36,739 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {859#(not (= |__VERIFIER_assert_#in~cond| 0))} {790#true} #63#return; {866#(= (+ (* main_~x2~0 main_~y1~0) main_~y3~0 main_~y2~0) main_~x1~0)} is VALID [2022-04-28 07:15:36,740 INFO L290 TraceCheckUtils]: 24: Hoare triple {866#(= (+ (* main_~x2~0 main_~y1~0) main_~y3~0 main_~y2~0) main_~x1~0)} assume !(0 != ~y3~0); {870#(= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0)} is VALID [2022-04-28 07:15:36,740 INFO L272 TraceCheckUtils]: 25: Hoare triple {870#(= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {874#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:15:36,741 INFO L290 TraceCheckUtils]: 26: Hoare triple {874#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {878#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:15:36,741 INFO L290 TraceCheckUtils]: 27: Hoare triple {878#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {791#false} is VALID [2022-04-28 07:15:36,741 INFO L290 TraceCheckUtils]: 28: Hoare triple {791#false} assume !false; {791#false} is VALID [2022-04-28 07:15:36,742 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 07:15:36,742 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:15:41,537 INFO L290 TraceCheckUtils]: 28: Hoare triple {791#false} assume !false; {791#false} is VALID [2022-04-28 07:15:41,538 INFO L290 TraceCheckUtils]: 27: Hoare triple {878#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {791#false} is VALID [2022-04-28 07:15:41,539 INFO L290 TraceCheckUtils]: 26: Hoare triple {874#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {878#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:15:41,540 INFO L272 TraceCheckUtils]: 25: Hoare triple {870#(= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {874#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:15:41,540 INFO L290 TraceCheckUtils]: 24: Hoare triple {897#(or (not (= main_~y3~0 0)) (= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0))} assume !(0 != ~y3~0); {870#(= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0)} is VALID [2022-04-28 07:15:41,541 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {859#(not (= |__VERIFIER_assert_#in~cond| 0))} {790#true} #63#return; {897#(or (not (= main_~y3~0 0)) (= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0))} is VALID [2022-04-28 07:15:41,542 INFO L290 TraceCheckUtils]: 22: Hoare triple {859#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {859#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:15:41,543 INFO L290 TraceCheckUtils]: 21: Hoare triple {910#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {859#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:15:41,544 INFO L290 TraceCheckUtils]: 20: Hoare triple {790#true} ~cond := #in~cond; {910#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 07:15:41,545 INFO L272 TraceCheckUtils]: 19: Hoare triple {790#true} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {790#true} is VALID [2022-04-28 07:15:41,545 INFO L290 TraceCheckUtils]: 18: Hoare triple {790#true} assume !!(#t~post6 < 10);havoc #t~post6; {790#true} is VALID [2022-04-28 07:15:41,555 INFO L290 TraceCheckUtils]: 17: Hoare triple {790#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {790#true} is VALID [2022-04-28 07:15:41,555 INFO L290 TraceCheckUtils]: 16: Hoare triple {790#true} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {790#true} is VALID [2022-04-28 07:15:41,555 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {790#true} {790#true} #61#return; {790#true} is VALID [2022-04-28 07:15:41,555 INFO L290 TraceCheckUtils]: 14: Hoare triple {790#true} assume true; {790#true} is VALID [2022-04-28 07:15:41,555 INFO L290 TraceCheckUtils]: 13: Hoare triple {790#true} assume !(0 == ~cond); {790#true} is VALID [2022-04-28 07:15:41,555 INFO L290 TraceCheckUtils]: 12: Hoare triple {790#true} ~cond := #in~cond; {790#true} is VALID [2022-04-28 07:15:41,556 INFO L272 TraceCheckUtils]: 11: Hoare triple {790#true} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {790#true} is VALID [2022-04-28 07:15:41,556 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {790#true} {790#true} #59#return; {790#true} is VALID [2022-04-28 07:15:41,556 INFO L290 TraceCheckUtils]: 9: Hoare triple {790#true} assume true; {790#true} is VALID [2022-04-28 07:15:41,556 INFO L290 TraceCheckUtils]: 8: Hoare triple {790#true} assume !(0 == ~cond); {790#true} is VALID [2022-04-28 07:15:41,556 INFO L290 TraceCheckUtils]: 7: Hoare triple {790#true} ~cond := #in~cond; {790#true} is VALID [2022-04-28 07:15:41,556 INFO L272 TraceCheckUtils]: 6: Hoare triple {790#true} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {790#true} is VALID [2022-04-28 07:15:41,556 INFO L290 TraceCheckUtils]: 5: Hoare triple {790#true} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {790#true} is VALID [2022-04-28 07:15:41,556 INFO L272 TraceCheckUtils]: 4: Hoare triple {790#true} call #t~ret7 := main(); {790#true} is VALID [2022-04-28 07:15:41,556 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {790#true} {790#true} #67#return; {790#true} is VALID [2022-04-28 07:15:41,556 INFO L290 TraceCheckUtils]: 2: Hoare triple {790#true} assume true; {790#true} is VALID [2022-04-28 07:15:41,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {790#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {790#true} is VALID [2022-04-28 07:15:41,557 INFO L272 TraceCheckUtils]: 0: Hoare triple {790#true} call ULTIMATE.init(); {790#true} is VALID [2022-04-28 07:15:41,557 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 07:15:41,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:15:41,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776347684] [2022-04-28 07:15:41,557 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:15:41,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759899336] [2022-04-28 07:15:41,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [759899336] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:15:41,557 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:15:41,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-28 07:15:41,557 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:15:41,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1504269532] [2022-04-28 07:15:41,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1504269532] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:15:41,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:15:41,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 07:15:41,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651960723] [2022-04-28 07:15:41,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:15:41,558 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2022-04-28 07:15:41,558 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:15:41,559 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 07:15:41,577 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:15:41,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 07:15:41,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:15:41,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 07:15:41,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-28 07:15:41,578 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 07:15:41,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:15:41,766 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2022-04-28 07:15:41,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 07:15:41,766 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2022-04-28 07:15:41,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:15:41,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 07:15:41,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-04-28 07:15:41,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 07:15:41,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-04-28 07:15:41,769 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 35 transitions. [2022-04-28 07:15:41,793 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:15:41,793 INFO L225 Difference]: With dead ends: 39 [2022-04-28 07:15:41,794 INFO L226 Difference]: Without dead ends: 34 [2022-04-28 07:15:41,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-28 07:15:41,794 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 17 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 07:15:41,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 103 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 07:15:41,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-28 07:15:41,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2022-04-28 07:15:41,809 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:15:41,809 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 07:15:41,809 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 07:15:41,809 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 07:15:41,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:15:41,810 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-28 07:15:41,811 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-04-28 07:15:41,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:15:41,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:15:41,811 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-28 07:15:41,811 INFO L87 Difference]: Start difference. First operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-28 07:15:41,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:15:41,812 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-28 07:15:41,812 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-04-28 07:15:41,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:15:41,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:15:41,813 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:15:41,813 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:15:41,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 07:15:41,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2022-04-28 07:15:41,814 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 29 [2022-04-28 07:15:41,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:15:41,814 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2022-04-28 07:15:41,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 07:15:41,814 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 31 transitions. [2022-04-28 07:15:41,840 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-28 07:15:41,841 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-28 07:15:41,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 07:15:41,841 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:15:41,841 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:15:41,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 07:15:42,049 WARN L477 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-28 07:15:42,049 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:15:42,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:15:42,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1080225052, now seen corresponding path program 1 times [2022-04-28 07:15:42,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:15:42,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1374076145] [2022-04-28 07:15:42,050 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:15:42,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1080225052, now seen corresponding path program 2 times [2022-04-28 07:15:42,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:15:42,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955397267] [2022-04-28 07:15:42,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:15:42,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:15:42,065 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:15:42,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [454843593] [2022-04-28 07:15:42,065 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:15:42,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:15:42,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:15:42,066 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-28 07:15:42,067 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-28 07:15:42,098 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:15:42,098 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:15:42,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 07:15:42,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:15:42,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:15:42,230 INFO L272 TraceCheckUtils]: 0: Hoare triple {1183#true} call ULTIMATE.init(); {1183#true} is VALID [2022-04-28 07:15:42,231 INFO L290 TraceCheckUtils]: 1: Hoare triple {1183#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1191#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:42,232 INFO L290 TraceCheckUtils]: 2: Hoare triple {1191#(<= ~counter~0 0)} assume true; {1191#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:42,232 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1191#(<= ~counter~0 0)} {1183#true} #67#return; {1191#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:42,232 INFO L272 TraceCheckUtils]: 4: Hoare triple {1191#(<= ~counter~0 0)} call #t~ret7 := main(); {1191#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:42,233 INFO L290 TraceCheckUtils]: 5: Hoare triple {1191#(<= ~counter~0 0)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {1191#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:42,233 INFO L272 TraceCheckUtils]: 6: Hoare triple {1191#(<= ~counter~0 0)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {1191#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:42,233 INFO L290 TraceCheckUtils]: 7: Hoare triple {1191#(<= ~counter~0 0)} ~cond := #in~cond; {1191#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:42,233 INFO L290 TraceCheckUtils]: 8: Hoare triple {1191#(<= ~counter~0 0)} assume !(0 == ~cond); {1191#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:42,234 INFO L290 TraceCheckUtils]: 9: Hoare triple {1191#(<= ~counter~0 0)} assume true; {1191#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:42,234 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1191#(<= ~counter~0 0)} {1191#(<= ~counter~0 0)} #59#return; {1191#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:42,234 INFO L272 TraceCheckUtils]: 11: Hoare triple {1191#(<= ~counter~0 0)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {1191#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:42,235 INFO L290 TraceCheckUtils]: 12: Hoare triple {1191#(<= ~counter~0 0)} ~cond := #in~cond; {1191#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:42,235 INFO L290 TraceCheckUtils]: 13: Hoare triple {1191#(<= ~counter~0 0)} assume !(0 == ~cond); {1191#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:42,235 INFO L290 TraceCheckUtils]: 14: Hoare triple {1191#(<= ~counter~0 0)} assume true; {1191#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:42,236 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1191#(<= ~counter~0 0)} {1191#(<= ~counter~0 0)} #61#return; {1191#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:42,236 INFO L290 TraceCheckUtils]: 16: Hoare triple {1191#(<= ~counter~0 0)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {1191#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:42,236 INFO L290 TraceCheckUtils]: 17: Hoare triple {1191#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1240#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:42,237 INFO L290 TraceCheckUtils]: 18: Hoare triple {1240#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {1240#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:42,237 INFO L272 TraceCheckUtils]: 19: Hoare triple {1240#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {1240#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:42,237 INFO L290 TraceCheckUtils]: 20: Hoare triple {1240#(<= ~counter~0 1)} ~cond := #in~cond; {1240#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:42,238 INFO L290 TraceCheckUtils]: 21: Hoare triple {1240#(<= ~counter~0 1)} assume !(0 == ~cond); {1240#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:42,238 INFO L290 TraceCheckUtils]: 22: Hoare triple {1240#(<= ~counter~0 1)} assume true; {1240#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:42,238 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1240#(<= ~counter~0 1)} {1240#(<= ~counter~0 1)} #63#return; {1240#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:42,239 INFO L290 TraceCheckUtils]: 24: Hoare triple {1240#(<= ~counter~0 1)} assume !!(0 != ~y3~0); {1240#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:42,239 INFO L290 TraceCheckUtils]: 25: Hoare triple {1240#(<= ~counter~0 1)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {1240#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:42,239 INFO L290 TraceCheckUtils]: 26: Hoare triple {1240#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1268#(<= |main_#t~post6| 1)} is VALID [2022-04-28 07:15:42,240 INFO L290 TraceCheckUtils]: 27: Hoare triple {1268#(<= |main_#t~post6| 1)} assume !(#t~post6 < 10);havoc #t~post6; {1184#false} is VALID [2022-04-28 07:15:42,240 INFO L272 TraceCheckUtils]: 28: Hoare triple {1184#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {1184#false} is VALID [2022-04-28 07:15:42,240 INFO L290 TraceCheckUtils]: 29: Hoare triple {1184#false} ~cond := #in~cond; {1184#false} is VALID [2022-04-28 07:15:42,240 INFO L290 TraceCheckUtils]: 30: Hoare triple {1184#false} assume 0 == ~cond; {1184#false} is VALID [2022-04-28 07:15:42,240 INFO L290 TraceCheckUtils]: 31: Hoare triple {1184#false} assume !false; {1184#false} is VALID [2022-04-28 07:15:42,241 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 07:15:42,241 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:15:42,363 INFO L290 TraceCheckUtils]: 31: Hoare triple {1184#false} assume !false; {1184#false} is VALID [2022-04-28 07:15:42,364 INFO L290 TraceCheckUtils]: 30: Hoare triple {1184#false} assume 0 == ~cond; {1184#false} is VALID [2022-04-28 07:15:42,364 INFO L290 TraceCheckUtils]: 29: Hoare triple {1184#false} ~cond := #in~cond; {1184#false} is VALID [2022-04-28 07:15:42,364 INFO L272 TraceCheckUtils]: 28: Hoare triple {1184#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {1184#false} is VALID [2022-04-28 07:15:42,365 INFO L290 TraceCheckUtils]: 27: Hoare triple {1296#(< |main_#t~post6| 10)} assume !(#t~post6 < 10);havoc #t~post6; {1184#false} is VALID [2022-04-28 07:15:42,365 INFO L290 TraceCheckUtils]: 26: Hoare triple {1300#(< ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1296#(< |main_#t~post6| 10)} is VALID [2022-04-28 07:15:42,365 INFO L290 TraceCheckUtils]: 25: Hoare triple {1300#(< ~counter~0 10)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {1300#(< ~counter~0 10)} is VALID [2022-04-28 07:15:42,366 INFO L290 TraceCheckUtils]: 24: Hoare triple {1300#(< ~counter~0 10)} assume !!(0 != ~y3~0); {1300#(< ~counter~0 10)} is VALID [2022-04-28 07:15:42,366 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1183#true} {1300#(< ~counter~0 10)} #63#return; {1300#(< ~counter~0 10)} is VALID [2022-04-28 07:15:42,366 INFO L290 TraceCheckUtils]: 22: Hoare triple {1183#true} assume true; {1183#true} is VALID [2022-04-28 07:15:42,367 INFO L290 TraceCheckUtils]: 21: Hoare triple {1183#true} assume !(0 == ~cond); {1183#true} is VALID [2022-04-28 07:15:42,367 INFO L290 TraceCheckUtils]: 20: Hoare triple {1183#true} ~cond := #in~cond; {1183#true} is VALID [2022-04-28 07:15:42,367 INFO L272 TraceCheckUtils]: 19: Hoare triple {1300#(< ~counter~0 10)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {1183#true} is VALID [2022-04-28 07:15:42,367 INFO L290 TraceCheckUtils]: 18: Hoare triple {1300#(< ~counter~0 10)} assume !!(#t~post6 < 10);havoc #t~post6; {1300#(< ~counter~0 10)} is VALID [2022-04-28 07:15:42,367 INFO L290 TraceCheckUtils]: 17: Hoare triple {1328#(< ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1300#(< ~counter~0 10)} is VALID [2022-04-28 07:15:42,368 INFO L290 TraceCheckUtils]: 16: Hoare triple {1328#(< ~counter~0 9)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {1328#(< ~counter~0 9)} is VALID [2022-04-28 07:15:42,368 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1183#true} {1328#(< ~counter~0 9)} #61#return; {1328#(< ~counter~0 9)} is VALID [2022-04-28 07:15:42,368 INFO L290 TraceCheckUtils]: 14: Hoare triple {1183#true} assume true; {1183#true} is VALID [2022-04-28 07:15:42,368 INFO L290 TraceCheckUtils]: 13: Hoare triple {1183#true} assume !(0 == ~cond); {1183#true} is VALID [2022-04-28 07:15:42,368 INFO L290 TraceCheckUtils]: 12: Hoare triple {1183#true} ~cond := #in~cond; {1183#true} is VALID [2022-04-28 07:15:42,368 INFO L272 TraceCheckUtils]: 11: Hoare triple {1328#(< ~counter~0 9)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {1183#true} is VALID [2022-04-28 07:15:42,369 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1183#true} {1328#(< ~counter~0 9)} #59#return; {1328#(< ~counter~0 9)} is VALID [2022-04-28 07:15:42,369 INFO L290 TraceCheckUtils]: 9: Hoare triple {1183#true} assume true; {1183#true} is VALID [2022-04-28 07:15:42,369 INFO L290 TraceCheckUtils]: 8: Hoare triple {1183#true} assume !(0 == ~cond); {1183#true} is VALID [2022-04-28 07:15:42,369 INFO L290 TraceCheckUtils]: 7: Hoare triple {1183#true} ~cond := #in~cond; {1183#true} is VALID [2022-04-28 07:15:42,369 INFO L272 TraceCheckUtils]: 6: Hoare triple {1328#(< ~counter~0 9)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {1183#true} is VALID [2022-04-28 07:15:42,370 INFO L290 TraceCheckUtils]: 5: Hoare triple {1328#(< ~counter~0 9)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {1328#(< ~counter~0 9)} is VALID [2022-04-28 07:15:42,370 INFO L272 TraceCheckUtils]: 4: Hoare triple {1328#(< ~counter~0 9)} call #t~ret7 := main(); {1328#(< ~counter~0 9)} is VALID [2022-04-28 07:15:42,370 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1328#(< ~counter~0 9)} {1183#true} #67#return; {1328#(< ~counter~0 9)} is VALID [2022-04-28 07:15:42,371 INFO L290 TraceCheckUtils]: 2: Hoare triple {1328#(< ~counter~0 9)} assume true; {1328#(< ~counter~0 9)} is VALID [2022-04-28 07:15:42,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {1183#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1328#(< ~counter~0 9)} is VALID [2022-04-28 07:15:42,374 INFO L272 TraceCheckUtils]: 0: Hoare triple {1183#true} call ULTIMATE.init(); {1183#true} is VALID [2022-04-28 07:15:42,374 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 07:15:42,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:15:42,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955397267] [2022-04-28 07:15:42,374 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:15:42,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [454843593] [2022-04-28 07:15:42,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [454843593] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:15:42,374 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:15:42,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-28 07:15:42,375 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:15:42,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1374076145] [2022-04-28 07:15:42,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1374076145] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:15:42,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:15:42,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 07:15:42,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570085907] [2022-04-28 07:15:42,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:15:42,375 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 32 [2022-04-28 07:15:42,375 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:15:42,376 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 07:15:42,393 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:15:42,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 07:15:42,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:15:42,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 07:15:42,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-28 07:15:42,394 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 07:15:42,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:15:42,474 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2022-04-28 07:15:42,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 07:15:42,474 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 32 [2022-04-28 07:15:42,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:15:42,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 07:15:42,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-28 07:15:42,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 07:15:42,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-28 07:15:42,477 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 45 transitions. [2022-04-28 07:15:42,502 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:15:42,503 INFO L225 Difference]: With dead ends: 43 [2022-04-28 07:15:42,503 INFO L226 Difference]: Without dead ends: 38 [2022-04-28 07:15:42,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-28 07:15:42,504 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 07:15:42,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 78 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 07:15:42,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-28 07:15:42,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-28 07:15:42,524 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:15:42,524 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:15:42,524 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:15:42,524 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:15:42,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:15:42,525 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-28 07:15:42,525 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-28 07:15:42,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:15:42,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:15:42,526 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 38 states. [2022-04-28 07:15:42,526 INFO L87 Difference]: Start difference. First operand has 38 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 38 states. [2022-04-28 07:15:42,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:15:42,527 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-28 07:15:42,527 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-28 07:15:42,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:15:42,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:15:42,527 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:15:42,527 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:15:42,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:15:42,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2022-04-28 07:15:42,528 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 32 [2022-04-28 07:15:42,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:15:42,529 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2022-04-28 07:15:42,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 07:15:42,529 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 41 transitions. [2022-04-28 07:15:42,561 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:15:42,562 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-28 07:15:42,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 07:15:42,562 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:15:42,562 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:15:42,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-28 07:15:42,768 WARN L477 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-28 07:15:42,768 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:15:42,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:15:42,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1448743382, now seen corresponding path program 3 times [2022-04-28 07:15:42,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:15:42,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1269355220] [2022-04-28 07:15:42,769 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:15:42,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1448743382, now seen corresponding path program 4 times [2022-04-28 07:15:42,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:15:42,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815038581] [2022-04-28 07:15:42,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:15:42,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:15:42,784 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:15:42,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [961004759] [2022-04-28 07:15:42,784 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:15:42,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:15:42,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:15:42,785 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-28 07:15:42,786 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-28 07:15:42,820 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:15:42,821 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:15:42,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 07:15:42,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:15:42,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:15:42,974 INFO L272 TraceCheckUtils]: 0: Hoare triple {1622#true} call ULTIMATE.init(); {1622#true} is VALID [2022-04-28 07:15:42,975 INFO L290 TraceCheckUtils]: 1: Hoare triple {1622#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1630#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:42,975 INFO L290 TraceCheckUtils]: 2: Hoare triple {1630#(<= ~counter~0 0)} assume true; {1630#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:42,975 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1630#(<= ~counter~0 0)} {1622#true} #67#return; {1630#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:42,975 INFO L272 TraceCheckUtils]: 4: Hoare triple {1630#(<= ~counter~0 0)} call #t~ret7 := main(); {1630#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:42,976 INFO L290 TraceCheckUtils]: 5: Hoare triple {1630#(<= ~counter~0 0)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {1630#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:42,976 INFO L272 TraceCheckUtils]: 6: Hoare triple {1630#(<= ~counter~0 0)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {1630#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:42,976 INFO L290 TraceCheckUtils]: 7: Hoare triple {1630#(<= ~counter~0 0)} ~cond := #in~cond; {1630#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:42,976 INFO L290 TraceCheckUtils]: 8: Hoare triple {1630#(<= ~counter~0 0)} assume !(0 == ~cond); {1630#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:42,977 INFO L290 TraceCheckUtils]: 9: Hoare triple {1630#(<= ~counter~0 0)} assume true; {1630#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:42,977 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1630#(<= ~counter~0 0)} {1630#(<= ~counter~0 0)} #59#return; {1630#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:42,977 INFO L272 TraceCheckUtils]: 11: Hoare triple {1630#(<= ~counter~0 0)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {1630#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:42,978 INFO L290 TraceCheckUtils]: 12: Hoare triple {1630#(<= ~counter~0 0)} ~cond := #in~cond; {1630#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:42,978 INFO L290 TraceCheckUtils]: 13: Hoare triple {1630#(<= ~counter~0 0)} assume !(0 == ~cond); {1630#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:42,978 INFO L290 TraceCheckUtils]: 14: Hoare triple {1630#(<= ~counter~0 0)} assume true; {1630#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:42,978 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1630#(<= ~counter~0 0)} {1630#(<= ~counter~0 0)} #61#return; {1630#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:42,979 INFO L290 TraceCheckUtils]: 16: Hoare triple {1630#(<= ~counter~0 0)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {1630#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:42,979 INFO L290 TraceCheckUtils]: 17: Hoare triple {1630#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1679#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:42,979 INFO L290 TraceCheckUtils]: 18: Hoare triple {1679#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {1679#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:42,980 INFO L272 TraceCheckUtils]: 19: Hoare triple {1679#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {1679#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:42,980 INFO L290 TraceCheckUtils]: 20: Hoare triple {1679#(<= ~counter~0 1)} ~cond := #in~cond; {1679#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:42,980 INFO L290 TraceCheckUtils]: 21: Hoare triple {1679#(<= ~counter~0 1)} assume !(0 == ~cond); {1679#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:42,981 INFO L290 TraceCheckUtils]: 22: Hoare triple {1679#(<= ~counter~0 1)} assume true; {1679#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:42,981 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1679#(<= ~counter~0 1)} {1679#(<= ~counter~0 1)} #63#return; {1679#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:42,981 INFO L290 TraceCheckUtils]: 24: Hoare triple {1679#(<= ~counter~0 1)} assume !!(0 != ~y3~0); {1679#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:42,981 INFO L290 TraceCheckUtils]: 25: Hoare triple {1679#(<= ~counter~0 1)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {1679#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:42,982 INFO L290 TraceCheckUtils]: 26: Hoare triple {1679#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1707#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:42,982 INFO L290 TraceCheckUtils]: 27: Hoare triple {1707#(<= ~counter~0 2)} assume !!(#t~post6 < 10);havoc #t~post6; {1707#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:42,983 INFO L272 TraceCheckUtils]: 28: Hoare triple {1707#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {1707#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:42,983 INFO L290 TraceCheckUtils]: 29: Hoare triple {1707#(<= ~counter~0 2)} ~cond := #in~cond; {1707#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:42,983 INFO L290 TraceCheckUtils]: 30: Hoare triple {1707#(<= ~counter~0 2)} assume !(0 == ~cond); {1707#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:42,983 INFO L290 TraceCheckUtils]: 31: Hoare triple {1707#(<= ~counter~0 2)} assume true; {1707#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:42,984 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1707#(<= ~counter~0 2)} {1707#(<= ~counter~0 2)} #63#return; {1707#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:42,984 INFO L290 TraceCheckUtils]: 33: Hoare triple {1707#(<= ~counter~0 2)} assume !!(0 != ~y3~0); {1707#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:42,984 INFO L290 TraceCheckUtils]: 34: Hoare triple {1707#(<= ~counter~0 2)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {1707#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:42,985 INFO L290 TraceCheckUtils]: 35: Hoare triple {1707#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1735#(<= |main_#t~post6| 2)} is VALID [2022-04-28 07:15:42,985 INFO L290 TraceCheckUtils]: 36: Hoare triple {1735#(<= |main_#t~post6| 2)} assume !(#t~post6 < 10);havoc #t~post6; {1623#false} is VALID [2022-04-28 07:15:42,985 INFO L272 TraceCheckUtils]: 37: Hoare triple {1623#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {1623#false} is VALID [2022-04-28 07:15:42,985 INFO L290 TraceCheckUtils]: 38: Hoare triple {1623#false} ~cond := #in~cond; {1623#false} is VALID [2022-04-28 07:15:42,985 INFO L290 TraceCheckUtils]: 39: Hoare triple {1623#false} assume 0 == ~cond; {1623#false} is VALID [2022-04-28 07:15:42,985 INFO L290 TraceCheckUtils]: 40: Hoare triple {1623#false} assume !false; {1623#false} is VALID [2022-04-28 07:15:42,986 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 07:15:42,986 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:15:43,168 INFO L290 TraceCheckUtils]: 40: Hoare triple {1623#false} assume !false; {1623#false} is VALID [2022-04-28 07:15:43,169 INFO L290 TraceCheckUtils]: 39: Hoare triple {1623#false} assume 0 == ~cond; {1623#false} is VALID [2022-04-28 07:15:43,169 INFO L290 TraceCheckUtils]: 38: Hoare triple {1623#false} ~cond := #in~cond; {1623#false} is VALID [2022-04-28 07:15:43,170 INFO L272 TraceCheckUtils]: 37: Hoare triple {1623#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {1623#false} is VALID [2022-04-28 07:15:43,174 INFO L290 TraceCheckUtils]: 36: Hoare triple {1763#(< |main_#t~post6| 10)} assume !(#t~post6 < 10);havoc #t~post6; {1623#false} is VALID [2022-04-28 07:15:43,175 INFO L290 TraceCheckUtils]: 35: Hoare triple {1767#(< ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1763#(< |main_#t~post6| 10)} is VALID [2022-04-28 07:15:43,175 INFO L290 TraceCheckUtils]: 34: Hoare triple {1767#(< ~counter~0 10)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {1767#(< ~counter~0 10)} is VALID [2022-04-28 07:15:43,176 INFO L290 TraceCheckUtils]: 33: Hoare triple {1767#(< ~counter~0 10)} assume !!(0 != ~y3~0); {1767#(< ~counter~0 10)} is VALID [2022-04-28 07:15:43,176 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1622#true} {1767#(< ~counter~0 10)} #63#return; {1767#(< ~counter~0 10)} is VALID [2022-04-28 07:15:43,176 INFO L290 TraceCheckUtils]: 31: Hoare triple {1622#true} assume true; {1622#true} is VALID [2022-04-28 07:15:43,177 INFO L290 TraceCheckUtils]: 30: Hoare triple {1622#true} assume !(0 == ~cond); {1622#true} is VALID [2022-04-28 07:15:43,177 INFO L290 TraceCheckUtils]: 29: Hoare triple {1622#true} ~cond := #in~cond; {1622#true} is VALID [2022-04-28 07:15:43,178 INFO L272 TraceCheckUtils]: 28: Hoare triple {1767#(< ~counter~0 10)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {1622#true} is VALID [2022-04-28 07:15:43,180 INFO L290 TraceCheckUtils]: 27: Hoare triple {1767#(< ~counter~0 10)} assume !!(#t~post6 < 10);havoc #t~post6; {1767#(< ~counter~0 10)} is VALID [2022-04-28 07:15:43,181 INFO L290 TraceCheckUtils]: 26: Hoare triple {1795#(< ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1767#(< ~counter~0 10)} is VALID [2022-04-28 07:15:43,181 INFO L290 TraceCheckUtils]: 25: Hoare triple {1795#(< ~counter~0 9)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {1795#(< ~counter~0 9)} is VALID [2022-04-28 07:15:43,181 INFO L290 TraceCheckUtils]: 24: Hoare triple {1795#(< ~counter~0 9)} assume !!(0 != ~y3~0); {1795#(< ~counter~0 9)} is VALID [2022-04-28 07:15:43,182 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1622#true} {1795#(< ~counter~0 9)} #63#return; {1795#(< ~counter~0 9)} is VALID [2022-04-28 07:15:43,182 INFO L290 TraceCheckUtils]: 22: Hoare triple {1622#true} assume true; {1622#true} is VALID [2022-04-28 07:15:43,182 INFO L290 TraceCheckUtils]: 21: Hoare triple {1622#true} assume !(0 == ~cond); {1622#true} is VALID [2022-04-28 07:15:43,182 INFO L290 TraceCheckUtils]: 20: Hoare triple {1622#true} ~cond := #in~cond; {1622#true} is VALID [2022-04-28 07:15:43,182 INFO L272 TraceCheckUtils]: 19: Hoare triple {1795#(< ~counter~0 9)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {1622#true} is VALID [2022-04-28 07:15:43,182 INFO L290 TraceCheckUtils]: 18: Hoare triple {1795#(< ~counter~0 9)} assume !!(#t~post6 < 10);havoc #t~post6; {1795#(< ~counter~0 9)} is VALID [2022-04-28 07:15:43,183 INFO L290 TraceCheckUtils]: 17: Hoare triple {1823#(< ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1795#(< ~counter~0 9)} is VALID [2022-04-28 07:15:43,183 INFO L290 TraceCheckUtils]: 16: Hoare triple {1823#(< ~counter~0 8)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {1823#(< ~counter~0 8)} is VALID [2022-04-28 07:15:43,183 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1622#true} {1823#(< ~counter~0 8)} #61#return; {1823#(< ~counter~0 8)} is VALID [2022-04-28 07:15:43,183 INFO L290 TraceCheckUtils]: 14: Hoare triple {1622#true} assume true; {1622#true} is VALID [2022-04-28 07:15:43,183 INFO L290 TraceCheckUtils]: 13: Hoare triple {1622#true} assume !(0 == ~cond); {1622#true} is VALID [2022-04-28 07:15:43,184 INFO L290 TraceCheckUtils]: 12: Hoare triple {1622#true} ~cond := #in~cond; {1622#true} is VALID [2022-04-28 07:15:43,184 INFO L272 TraceCheckUtils]: 11: Hoare triple {1823#(< ~counter~0 8)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {1622#true} is VALID [2022-04-28 07:15:43,184 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1622#true} {1823#(< ~counter~0 8)} #59#return; {1823#(< ~counter~0 8)} is VALID [2022-04-28 07:15:43,184 INFO L290 TraceCheckUtils]: 9: Hoare triple {1622#true} assume true; {1622#true} is VALID [2022-04-28 07:15:43,184 INFO L290 TraceCheckUtils]: 8: Hoare triple {1622#true} assume !(0 == ~cond); {1622#true} is VALID [2022-04-28 07:15:43,184 INFO L290 TraceCheckUtils]: 7: Hoare triple {1622#true} ~cond := #in~cond; {1622#true} is VALID [2022-04-28 07:15:43,184 INFO L272 TraceCheckUtils]: 6: Hoare triple {1823#(< ~counter~0 8)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {1622#true} is VALID [2022-04-28 07:15:43,184 INFO L290 TraceCheckUtils]: 5: Hoare triple {1823#(< ~counter~0 8)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {1823#(< ~counter~0 8)} is VALID [2022-04-28 07:15:43,185 INFO L272 TraceCheckUtils]: 4: Hoare triple {1823#(< ~counter~0 8)} call #t~ret7 := main(); {1823#(< ~counter~0 8)} is VALID [2022-04-28 07:15:43,185 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1823#(< ~counter~0 8)} {1622#true} #67#return; {1823#(< ~counter~0 8)} is VALID [2022-04-28 07:15:43,185 INFO L290 TraceCheckUtils]: 2: Hoare triple {1823#(< ~counter~0 8)} assume true; {1823#(< ~counter~0 8)} is VALID [2022-04-28 07:15:43,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {1622#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1823#(< ~counter~0 8)} is VALID [2022-04-28 07:15:43,186 INFO L272 TraceCheckUtils]: 0: Hoare triple {1622#true} call ULTIMATE.init(); {1622#true} is VALID [2022-04-28 07:15:43,188 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-28 07:15:43,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:15:43,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815038581] [2022-04-28 07:15:43,188 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:15:43,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961004759] [2022-04-28 07:15:43,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [961004759] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:15:43,188 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:15:43,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-28 07:15:43,188 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:15:43,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1269355220] [2022-04-28 07:15:43,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1269355220] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:15:43,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:15:43,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 07:15:43,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432908200] [2022-04-28 07:15:43,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:15:43,189 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 41 [2022-04-28 07:15:43,190 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:15:43,191 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 07:15:43,212 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-28 07:15:43,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 07:15:43,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:15:43,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 07:15:43,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-28 07:15:43,213 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 07:15:43,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:15:43,337 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2022-04-28 07:15:43,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 07:15:43,337 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 41 [2022-04-28 07:15:43,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:15:43,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 07:15:43,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 55 transitions. [2022-04-28 07:15:43,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 07:15:43,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 55 transitions. [2022-04-28 07:15:43,340 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 55 transitions. [2022-04-28 07:15:43,367 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:15:43,368 INFO L225 Difference]: With dead ends: 52 [2022-04-28 07:15:43,368 INFO L226 Difference]: Without dead ends: 47 [2022-04-28 07:15:43,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2022-04-28 07:15:43,369 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 15 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 07:15:43,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 80 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 07:15:43,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-28 07:15:43,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-28 07:15:43,397 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:15:43,397 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:15:43,397 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:15:43,397 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:15:43,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:15:43,398 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-04-28 07:15:43,398 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-28 07:15:43,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:15:43,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:15:43,399 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 47 states. [2022-04-28 07:15:43,399 INFO L87 Difference]: Start difference. First operand has 47 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 47 states. [2022-04-28 07:15:43,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:15:43,400 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-04-28 07:15:43,400 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-28 07:15:43,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:15:43,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:15:43,400 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:15:43,401 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:15:43,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:15:43,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2022-04-28 07:15:43,402 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 41 [2022-04-28 07:15:43,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:15:43,402 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2022-04-28 07:15:43,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 07:15:43,402 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 51 transitions. [2022-04-28 07:15:43,443 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-28 07:15:43,443 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-28 07:15:43,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-28 07:15:43,444 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:15:43,444 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:15:43,462 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-28 07:15:43,659 WARN L477 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-28 07:15:43,659 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:15:43,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:15:43,660 INFO L85 PathProgramCache]: Analyzing trace with hash -678977956, now seen corresponding path program 5 times [2022-04-28 07:15:43,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:15:43,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [468033907] [2022-04-28 07:15:43,660 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:15:43,660 INFO L85 PathProgramCache]: Analyzing trace with hash -678977956, now seen corresponding path program 6 times [2022-04-28 07:15:43,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:15:43,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832502603] [2022-04-28 07:15:43,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:15:43,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:15:43,670 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:15:43,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1122086553] [2022-04-28 07:15:43,671 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 07:15:43,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:15:43,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:15:43,672 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-28 07:15:43,672 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-28 07:15:43,710 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 07:15:43,711 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:15:43,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 07:15:43,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:15:43,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:15:43,965 INFO L272 TraceCheckUtils]: 0: Hoare triple {2173#true} call ULTIMATE.init(); {2173#true} is VALID [2022-04-28 07:15:43,966 INFO L290 TraceCheckUtils]: 1: Hoare triple {2173#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2181#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:43,966 INFO L290 TraceCheckUtils]: 2: Hoare triple {2181#(<= ~counter~0 0)} assume true; {2181#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:43,967 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2181#(<= ~counter~0 0)} {2173#true} #67#return; {2181#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:43,967 INFO L272 TraceCheckUtils]: 4: Hoare triple {2181#(<= ~counter~0 0)} call #t~ret7 := main(); {2181#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:43,967 INFO L290 TraceCheckUtils]: 5: Hoare triple {2181#(<= ~counter~0 0)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {2181#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:43,968 INFO L272 TraceCheckUtils]: 6: Hoare triple {2181#(<= ~counter~0 0)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {2181#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:43,968 INFO L290 TraceCheckUtils]: 7: Hoare triple {2181#(<= ~counter~0 0)} ~cond := #in~cond; {2181#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:43,968 INFO L290 TraceCheckUtils]: 8: Hoare triple {2181#(<= ~counter~0 0)} assume !(0 == ~cond); {2181#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:43,968 INFO L290 TraceCheckUtils]: 9: Hoare triple {2181#(<= ~counter~0 0)} assume true; {2181#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:43,969 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2181#(<= ~counter~0 0)} {2181#(<= ~counter~0 0)} #59#return; {2181#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:43,969 INFO L272 TraceCheckUtils]: 11: Hoare triple {2181#(<= ~counter~0 0)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {2181#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:43,969 INFO L290 TraceCheckUtils]: 12: Hoare triple {2181#(<= ~counter~0 0)} ~cond := #in~cond; {2181#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:43,970 INFO L290 TraceCheckUtils]: 13: Hoare triple {2181#(<= ~counter~0 0)} assume !(0 == ~cond); {2181#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:43,970 INFO L290 TraceCheckUtils]: 14: Hoare triple {2181#(<= ~counter~0 0)} assume true; {2181#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:43,970 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2181#(<= ~counter~0 0)} {2181#(<= ~counter~0 0)} #61#return; {2181#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:43,970 INFO L290 TraceCheckUtils]: 16: Hoare triple {2181#(<= ~counter~0 0)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {2181#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:43,971 INFO L290 TraceCheckUtils]: 17: Hoare triple {2181#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2230#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:43,971 INFO L290 TraceCheckUtils]: 18: Hoare triple {2230#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {2230#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:43,971 INFO L272 TraceCheckUtils]: 19: Hoare triple {2230#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2230#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:43,972 INFO L290 TraceCheckUtils]: 20: Hoare triple {2230#(<= ~counter~0 1)} ~cond := #in~cond; {2230#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:43,973 INFO L290 TraceCheckUtils]: 21: Hoare triple {2230#(<= ~counter~0 1)} assume !(0 == ~cond); {2230#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:43,973 INFO L290 TraceCheckUtils]: 22: Hoare triple {2230#(<= ~counter~0 1)} assume true; {2230#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:43,973 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2230#(<= ~counter~0 1)} {2230#(<= ~counter~0 1)} #63#return; {2230#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:43,974 INFO L290 TraceCheckUtils]: 24: Hoare triple {2230#(<= ~counter~0 1)} assume !!(0 != ~y3~0); {2230#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:43,974 INFO L290 TraceCheckUtils]: 25: Hoare triple {2230#(<= ~counter~0 1)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2230#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:43,974 INFO L290 TraceCheckUtils]: 26: Hoare triple {2230#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2258#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:43,974 INFO L290 TraceCheckUtils]: 27: Hoare triple {2258#(<= ~counter~0 2)} assume !!(#t~post6 < 10);havoc #t~post6; {2258#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:43,975 INFO L272 TraceCheckUtils]: 28: Hoare triple {2258#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2258#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:43,975 INFO L290 TraceCheckUtils]: 29: Hoare triple {2258#(<= ~counter~0 2)} ~cond := #in~cond; {2258#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:43,975 INFO L290 TraceCheckUtils]: 30: Hoare triple {2258#(<= ~counter~0 2)} assume !(0 == ~cond); {2258#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:43,975 INFO L290 TraceCheckUtils]: 31: Hoare triple {2258#(<= ~counter~0 2)} assume true; {2258#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:43,976 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2258#(<= ~counter~0 2)} {2258#(<= ~counter~0 2)} #63#return; {2258#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:43,976 INFO L290 TraceCheckUtils]: 33: Hoare triple {2258#(<= ~counter~0 2)} assume !!(0 != ~y3~0); {2258#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:43,976 INFO L290 TraceCheckUtils]: 34: Hoare triple {2258#(<= ~counter~0 2)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2258#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:43,977 INFO L290 TraceCheckUtils]: 35: Hoare triple {2258#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2286#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:43,977 INFO L290 TraceCheckUtils]: 36: Hoare triple {2286#(<= ~counter~0 3)} assume !!(#t~post6 < 10);havoc #t~post6; {2286#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:43,978 INFO L272 TraceCheckUtils]: 37: Hoare triple {2286#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2286#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:43,978 INFO L290 TraceCheckUtils]: 38: Hoare triple {2286#(<= ~counter~0 3)} ~cond := #in~cond; {2286#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:43,978 INFO L290 TraceCheckUtils]: 39: Hoare triple {2286#(<= ~counter~0 3)} assume !(0 == ~cond); {2286#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:43,978 INFO L290 TraceCheckUtils]: 40: Hoare triple {2286#(<= ~counter~0 3)} assume true; {2286#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:43,979 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2286#(<= ~counter~0 3)} {2286#(<= ~counter~0 3)} #63#return; {2286#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:43,979 INFO L290 TraceCheckUtils]: 42: Hoare triple {2286#(<= ~counter~0 3)} assume !!(0 != ~y3~0); {2286#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:43,979 INFO L290 TraceCheckUtils]: 43: Hoare triple {2286#(<= ~counter~0 3)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2286#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:43,980 INFO L290 TraceCheckUtils]: 44: Hoare triple {2286#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2314#(<= |main_#t~post6| 3)} is VALID [2022-04-28 07:15:43,980 INFO L290 TraceCheckUtils]: 45: Hoare triple {2314#(<= |main_#t~post6| 3)} assume !(#t~post6 < 10);havoc #t~post6; {2174#false} is VALID [2022-04-28 07:15:43,980 INFO L272 TraceCheckUtils]: 46: Hoare triple {2174#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {2174#false} is VALID [2022-04-28 07:15:43,980 INFO L290 TraceCheckUtils]: 47: Hoare triple {2174#false} ~cond := #in~cond; {2174#false} is VALID [2022-04-28 07:15:43,980 INFO L290 TraceCheckUtils]: 48: Hoare triple {2174#false} assume 0 == ~cond; {2174#false} is VALID [2022-04-28 07:15:43,980 INFO L290 TraceCheckUtils]: 49: Hoare triple {2174#false} assume !false; {2174#false} is VALID [2022-04-28 07:15:43,980 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 07:15:43,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:15:44,201 INFO L290 TraceCheckUtils]: 49: Hoare triple {2174#false} assume !false; {2174#false} is VALID [2022-04-28 07:15:44,201 INFO L290 TraceCheckUtils]: 48: Hoare triple {2174#false} assume 0 == ~cond; {2174#false} is VALID [2022-04-28 07:15:44,202 INFO L290 TraceCheckUtils]: 47: Hoare triple {2174#false} ~cond := #in~cond; {2174#false} is VALID [2022-04-28 07:15:44,202 INFO L272 TraceCheckUtils]: 46: Hoare triple {2174#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {2174#false} is VALID [2022-04-28 07:15:44,202 INFO L290 TraceCheckUtils]: 45: Hoare triple {2342#(< |main_#t~post6| 10)} assume !(#t~post6 < 10);havoc #t~post6; {2174#false} is VALID [2022-04-28 07:15:44,202 INFO L290 TraceCheckUtils]: 44: Hoare triple {2346#(< ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2342#(< |main_#t~post6| 10)} is VALID [2022-04-28 07:15:44,203 INFO L290 TraceCheckUtils]: 43: Hoare triple {2346#(< ~counter~0 10)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2346#(< ~counter~0 10)} is VALID [2022-04-28 07:15:44,203 INFO L290 TraceCheckUtils]: 42: Hoare triple {2346#(< ~counter~0 10)} assume !!(0 != ~y3~0); {2346#(< ~counter~0 10)} is VALID [2022-04-28 07:15:44,204 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2173#true} {2346#(< ~counter~0 10)} #63#return; {2346#(< ~counter~0 10)} is VALID [2022-04-28 07:15:44,204 INFO L290 TraceCheckUtils]: 40: Hoare triple {2173#true} assume true; {2173#true} is VALID [2022-04-28 07:15:44,204 INFO L290 TraceCheckUtils]: 39: Hoare triple {2173#true} assume !(0 == ~cond); {2173#true} is VALID [2022-04-28 07:15:44,204 INFO L290 TraceCheckUtils]: 38: Hoare triple {2173#true} ~cond := #in~cond; {2173#true} is VALID [2022-04-28 07:15:44,204 INFO L272 TraceCheckUtils]: 37: Hoare triple {2346#(< ~counter~0 10)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2173#true} is VALID [2022-04-28 07:15:44,204 INFO L290 TraceCheckUtils]: 36: Hoare triple {2346#(< ~counter~0 10)} assume !!(#t~post6 < 10);havoc #t~post6; {2346#(< ~counter~0 10)} is VALID [2022-04-28 07:15:44,205 INFO L290 TraceCheckUtils]: 35: Hoare triple {2374#(< ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2346#(< ~counter~0 10)} is VALID [2022-04-28 07:15:44,205 INFO L290 TraceCheckUtils]: 34: Hoare triple {2374#(< ~counter~0 9)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2374#(< ~counter~0 9)} is VALID [2022-04-28 07:15:44,205 INFO L290 TraceCheckUtils]: 33: Hoare triple {2374#(< ~counter~0 9)} assume !!(0 != ~y3~0); {2374#(< ~counter~0 9)} is VALID [2022-04-28 07:15:44,206 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2173#true} {2374#(< ~counter~0 9)} #63#return; {2374#(< ~counter~0 9)} is VALID [2022-04-28 07:15:44,206 INFO L290 TraceCheckUtils]: 31: Hoare triple {2173#true} assume true; {2173#true} is VALID [2022-04-28 07:15:44,206 INFO L290 TraceCheckUtils]: 30: Hoare triple {2173#true} assume !(0 == ~cond); {2173#true} is VALID [2022-04-28 07:15:44,206 INFO L290 TraceCheckUtils]: 29: Hoare triple {2173#true} ~cond := #in~cond; {2173#true} is VALID [2022-04-28 07:15:44,206 INFO L272 TraceCheckUtils]: 28: Hoare triple {2374#(< ~counter~0 9)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2173#true} is VALID [2022-04-28 07:15:44,207 INFO L290 TraceCheckUtils]: 27: Hoare triple {2374#(< ~counter~0 9)} assume !!(#t~post6 < 10);havoc #t~post6; {2374#(< ~counter~0 9)} is VALID [2022-04-28 07:15:44,207 INFO L290 TraceCheckUtils]: 26: Hoare triple {2402#(< ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2374#(< ~counter~0 9)} is VALID [2022-04-28 07:15:44,207 INFO L290 TraceCheckUtils]: 25: Hoare triple {2402#(< ~counter~0 8)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2402#(< ~counter~0 8)} is VALID [2022-04-28 07:15:44,208 INFO L290 TraceCheckUtils]: 24: Hoare triple {2402#(< ~counter~0 8)} assume !!(0 != ~y3~0); {2402#(< ~counter~0 8)} is VALID [2022-04-28 07:15:44,208 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2173#true} {2402#(< ~counter~0 8)} #63#return; {2402#(< ~counter~0 8)} is VALID [2022-04-28 07:15:44,208 INFO L290 TraceCheckUtils]: 22: Hoare triple {2173#true} assume true; {2173#true} is VALID [2022-04-28 07:15:44,208 INFO L290 TraceCheckUtils]: 21: Hoare triple {2173#true} assume !(0 == ~cond); {2173#true} is VALID [2022-04-28 07:15:44,209 INFO L290 TraceCheckUtils]: 20: Hoare triple {2173#true} ~cond := #in~cond; {2173#true} is VALID [2022-04-28 07:15:44,209 INFO L272 TraceCheckUtils]: 19: Hoare triple {2402#(< ~counter~0 8)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2173#true} is VALID [2022-04-28 07:15:44,209 INFO L290 TraceCheckUtils]: 18: Hoare triple {2402#(< ~counter~0 8)} assume !!(#t~post6 < 10);havoc #t~post6; {2402#(< ~counter~0 8)} is VALID [2022-04-28 07:15:44,209 INFO L290 TraceCheckUtils]: 17: Hoare triple {2430#(< ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2402#(< ~counter~0 8)} is VALID [2022-04-28 07:15:44,210 INFO L290 TraceCheckUtils]: 16: Hoare triple {2430#(< ~counter~0 7)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {2430#(< ~counter~0 7)} is VALID [2022-04-28 07:15:44,210 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2173#true} {2430#(< ~counter~0 7)} #61#return; {2430#(< ~counter~0 7)} is VALID [2022-04-28 07:15:44,210 INFO L290 TraceCheckUtils]: 14: Hoare triple {2173#true} assume true; {2173#true} is VALID [2022-04-28 07:15:44,210 INFO L290 TraceCheckUtils]: 13: Hoare triple {2173#true} assume !(0 == ~cond); {2173#true} is VALID [2022-04-28 07:15:44,210 INFO L290 TraceCheckUtils]: 12: Hoare triple {2173#true} ~cond := #in~cond; {2173#true} is VALID [2022-04-28 07:15:44,210 INFO L272 TraceCheckUtils]: 11: Hoare triple {2430#(< ~counter~0 7)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {2173#true} is VALID [2022-04-28 07:15:44,211 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2173#true} {2430#(< ~counter~0 7)} #59#return; {2430#(< ~counter~0 7)} is VALID [2022-04-28 07:15:44,211 INFO L290 TraceCheckUtils]: 9: Hoare triple {2173#true} assume true; {2173#true} is VALID [2022-04-28 07:15:44,211 INFO L290 TraceCheckUtils]: 8: Hoare triple {2173#true} assume !(0 == ~cond); {2173#true} is VALID [2022-04-28 07:15:44,211 INFO L290 TraceCheckUtils]: 7: Hoare triple {2173#true} ~cond := #in~cond; {2173#true} is VALID [2022-04-28 07:15:44,211 INFO L272 TraceCheckUtils]: 6: Hoare triple {2430#(< ~counter~0 7)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {2173#true} is VALID [2022-04-28 07:15:44,211 INFO L290 TraceCheckUtils]: 5: Hoare triple {2430#(< ~counter~0 7)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {2430#(< ~counter~0 7)} is VALID [2022-04-28 07:15:44,212 INFO L272 TraceCheckUtils]: 4: Hoare triple {2430#(< ~counter~0 7)} call #t~ret7 := main(); {2430#(< ~counter~0 7)} is VALID [2022-04-28 07:15:44,212 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2430#(< ~counter~0 7)} {2173#true} #67#return; {2430#(< ~counter~0 7)} is VALID [2022-04-28 07:15:44,212 INFO L290 TraceCheckUtils]: 2: Hoare triple {2430#(< ~counter~0 7)} assume true; {2430#(< ~counter~0 7)} is VALID [2022-04-28 07:15:44,213 INFO L290 TraceCheckUtils]: 1: Hoare triple {2173#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2430#(< ~counter~0 7)} is VALID [2022-04-28 07:15:44,213 INFO L272 TraceCheckUtils]: 0: Hoare triple {2173#true} call ULTIMATE.init(); {2173#true} is VALID [2022-04-28 07:15:44,213 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 07:15:44,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:15:44,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832502603] [2022-04-28 07:15:44,213 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:15:44,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122086553] [2022-04-28 07:15:44,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122086553] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:15:44,213 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:15:44,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-28 07:15:44,214 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:15:44,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [468033907] [2022-04-28 07:15:44,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [468033907] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:15:44,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:15:44,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 07:15:44,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832205903] [2022-04-28 07:15:44,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:15:44,214 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 50 [2022-04-28 07:15:44,214 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:15:44,215 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 07:15:44,248 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-28 07:15:44,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 07:15:44,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:15:44,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 07:15:44,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-28 07:15:44,249 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 07:15:44,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:15:44,395 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2022-04-28 07:15:44,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 07:15:44,395 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 50 [2022-04-28 07:15:44,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:15:44,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 07:15:44,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 65 transitions. [2022-04-28 07:15:44,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 07:15:44,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 65 transitions. [2022-04-28 07:15:44,398 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 65 transitions. [2022-04-28 07:15:44,443 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:15:44,444 INFO L225 Difference]: With dead ends: 61 [2022-04-28 07:15:44,444 INFO L226 Difference]: Without dead ends: 56 [2022-04-28 07:15:44,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2022-04-28 07:15:44,445 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 10 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 07:15:44,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 94 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 07:15:44,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-28 07:15:44,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-28 07:15:44,479 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:15:44,479 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:15:44,479 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:15:44,480 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:15:44,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:15:44,481 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2022-04-28 07:15:44,481 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-28 07:15:44,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:15:44,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:15:44,481 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 56 states. [2022-04-28 07:15:44,481 INFO L87 Difference]: Start difference. First operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 56 states. [2022-04-28 07:15:44,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:15:44,483 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2022-04-28 07:15:44,483 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-28 07:15:44,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:15:44,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:15:44,483 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:15:44,483 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:15:44,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:15:44,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2022-04-28 07:15:44,485 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 50 [2022-04-28 07:15:44,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:15:44,485 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2022-04-28 07:15:44,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 07:15:44,485 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 61 transitions. [2022-04-28 07:15:44,536 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:15:44,536 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-28 07:15:44,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-28 07:15:44,536 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:15:44,536 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:15:44,553 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-28 07:15:44,752 WARN L477 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-28 07:15:44,753 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:15:44,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:15:44,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1632159894, now seen corresponding path program 7 times [2022-04-28 07:15:44,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:15:44,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1495837815] [2022-04-28 07:15:44,754 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:15:44,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1632159894, now seen corresponding path program 8 times [2022-04-28 07:15:44,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:15:44,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88231914] [2022-04-28 07:15:44,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:15:44,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:15:44,764 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:15:44,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [132666412] [2022-04-28 07:15:44,764 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:15:44,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:15:44,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:15:44,765 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-28 07:15:44,766 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-28 07:15:44,803 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:15:44,804 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:15:44,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 07:15:44,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:15:44,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:15:45,054 INFO L272 TraceCheckUtils]: 0: Hoare triple {2836#true} call ULTIMATE.init(); {2836#true} is VALID [2022-04-28 07:15:45,055 INFO L290 TraceCheckUtils]: 1: Hoare triple {2836#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2844#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:45,055 INFO L290 TraceCheckUtils]: 2: Hoare triple {2844#(<= ~counter~0 0)} assume true; {2844#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:45,055 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2844#(<= ~counter~0 0)} {2836#true} #67#return; {2844#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:45,056 INFO L272 TraceCheckUtils]: 4: Hoare triple {2844#(<= ~counter~0 0)} call #t~ret7 := main(); {2844#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:45,056 INFO L290 TraceCheckUtils]: 5: Hoare triple {2844#(<= ~counter~0 0)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {2844#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:45,056 INFO L272 TraceCheckUtils]: 6: Hoare triple {2844#(<= ~counter~0 0)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {2844#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:45,056 INFO L290 TraceCheckUtils]: 7: Hoare triple {2844#(<= ~counter~0 0)} ~cond := #in~cond; {2844#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:45,057 INFO L290 TraceCheckUtils]: 8: Hoare triple {2844#(<= ~counter~0 0)} assume !(0 == ~cond); {2844#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:45,057 INFO L290 TraceCheckUtils]: 9: Hoare triple {2844#(<= ~counter~0 0)} assume true; {2844#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:45,057 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2844#(<= ~counter~0 0)} {2844#(<= ~counter~0 0)} #59#return; {2844#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:45,058 INFO L272 TraceCheckUtils]: 11: Hoare triple {2844#(<= ~counter~0 0)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {2844#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:45,058 INFO L290 TraceCheckUtils]: 12: Hoare triple {2844#(<= ~counter~0 0)} ~cond := #in~cond; {2844#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:45,058 INFO L290 TraceCheckUtils]: 13: Hoare triple {2844#(<= ~counter~0 0)} assume !(0 == ~cond); {2844#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:45,058 INFO L290 TraceCheckUtils]: 14: Hoare triple {2844#(<= ~counter~0 0)} assume true; {2844#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:45,059 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2844#(<= ~counter~0 0)} {2844#(<= ~counter~0 0)} #61#return; {2844#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:45,059 INFO L290 TraceCheckUtils]: 16: Hoare triple {2844#(<= ~counter~0 0)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {2844#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:45,059 INFO L290 TraceCheckUtils]: 17: Hoare triple {2844#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2893#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:45,060 INFO L290 TraceCheckUtils]: 18: Hoare triple {2893#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {2893#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:45,060 INFO L272 TraceCheckUtils]: 19: Hoare triple {2893#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2893#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:45,060 INFO L290 TraceCheckUtils]: 20: Hoare triple {2893#(<= ~counter~0 1)} ~cond := #in~cond; {2893#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:45,061 INFO L290 TraceCheckUtils]: 21: Hoare triple {2893#(<= ~counter~0 1)} assume !(0 == ~cond); {2893#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:45,061 INFO L290 TraceCheckUtils]: 22: Hoare triple {2893#(<= ~counter~0 1)} assume true; {2893#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:45,061 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2893#(<= ~counter~0 1)} {2893#(<= ~counter~0 1)} #63#return; {2893#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:45,061 INFO L290 TraceCheckUtils]: 24: Hoare triple {2893#(<= ~counter~0 1)} assume !!(0 != ~y3~0); {2893#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:45,062 INFO L290 TraceCheckUtils]: 25: Hoare triple {2893#(<= ~counter~0 1)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2893#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:45,062 INFO L290 TraceCheckUtils]: 26: Hoare triple {2893#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2921#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:45,062 INFO L290 TraceCheckUtils]: 27: Hoare triple {2921#(<= ~counter~0 2)} assume !!(#t~post6 < 10);havoc #t~post6; {2921#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:45,063 INFO L272 TraceCheckUtils]: 28: Hoare triple {2921#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2921#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:45,063 INFO L290 TraceCheckUtils]: 29: Hoare triple {2921#(<= ~counter~0 2)} ~cond := #in~cond; {2921#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:45,063 INFO L290 TraceCheckUtils]: 30: Hoare triple {2921#(<= ~counter~0 2)} assume !(0 == ~cond); {2921#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:45,063 INFO L290 TraceCheckUtils]: 31: Hoare triple {2921#(<= ~counter~0 2)} assume true; {2921#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:45,064 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2921#(<= ~counter~0 2)} {2921#(<= ~counter~0 2)} #63#return; {2921#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:45,064 INFO L290 TraceCheckUtils]: 33: Hoare triple {2921#(<= ~counter~0 2)} assume !!(0 != ~y3~0); {2921#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:45,064 INFO L290 TraceCheckUtils]: 34: Hoare triple {2921#(<= ~counter~0 2)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2921#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:45,065 INFO L290 TraceCheckUtils]: 35: Hoare triple {2921#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2949#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:45,065 INFO L290 TraceCheckUtils]: 36: Hoare triple {2949#(<= ~counter~0 3)} assume !!(#t~post6 < 10);havoc #t~post6; {2949#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:45,065 INFO L272 TraceCheckUtils]: 37: Hoare triple {2949#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2949#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:45,066 INFO L290 TraceCheckUtils]: 38: Hoare triple {2949#(<= ~counter~0 3)} ~cond := #in~cond; {2949#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:45,066 INFO L290 TraceCheckUtils]: 39: Hoare triple {2949#(<= ~counter~0 3)} assume !(0 == ~cond); {2949#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:45,066 INFO L290 TraceCheckUtils]: 40: Hoare triple {2949#(<= ~counter~0 3)} assume true; {2949#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:45,066 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2949#(<= ~counter~0 3)} {2949#(<= ~counter~0 3)} #63#return; {2949#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:45,067 INFO L290 TraceCheckUtils]: 42: Hoare triple {2949#(<= ~counter~0 3)} assume !!(0 != ~y3~0); {2949#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:45,067 INFO L290 TraceCheckUtils]: 43: Hoare triple {2949#(<= ~counter~0 3)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2949#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:45,067 INFO L290 TraceCheckUtils]: 44: Hoare triple {2949#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2977#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:45,068 INFO L290 TraceCheckUtils]: 45: Hoare triple {2977#(<= ~counter~0 4)} assume !!(#t~post6 < 10);havoc #t~post6; {2977#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:45,068 INFO L272 TraceCheckUtils]: 46: Hoare triple {2977#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2977#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:45,068 INFO L290 TraceCheckUtils]: 47: Hoare triple {2977#(<= ~counter~0 4)} ~cond := #in~cond; {2977#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:45,068 INFO L290 TraceCheckUtils]: 48: Hoare triple {2977#(<= ~counter~0 4)} assume !(0 == ~cond); {2977#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:45,069 INFO L290 TraceCheckUtils]: 49: Hoare triple {2977#(<= ~counter~0 4)} assume true; {2977#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:45,069 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2977#(<= ~counter~0 4)} {2977#(<= ~counter~0 4)} #63#return; {2977#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:45,069 INFO L290 TraceCheckUtils]: 51: Hoare triple {2977#(<= ~counter~0 4)} assume !!(0 != ~y3~0); {2977#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:45,070 INFO L290 TraceCheckUtils]: 52: Hoare triple {2977#(<= ~counter~0 4)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2977#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:45,070 INFO L290 TraceCheckUtils]: 53: Hoare triple {2977#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3005#(<= |main_#t~post6| 4)} is VALID [2022-04-28 07:15:45,070 INFO L290 TraceCheckUtils]: 54: Hoare triple {3005#(<= |main_#t~post6| 4)} assume !(#t~post6 < 10);havoc #t~post6; {2837#false} is VALID [2022-04-28 07:15:45,070 INFO L272 TraceCheckUtils]: 55: Hoare triple {2837#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {2837#false} is VALID [2022-04-28 07:15:45,070 INFO L290 TraceCheckUtils]: 56: Hoare triple {2837#false} ~cond := #in~cond; {2837#false} is VALID [2022-04-28 07:15:45,070 INFO L290 TraceCheckUtils]: 57: Hoare triple {2837#false} assume 0 == ~cond; {2837#false} is VALID [2022-04-28 07:15:45,070 INFO L290 TraceCheckUtils]: 58: Hoare triple {2837#false} assume !false; {2837#false} is VALID [2022-04-28 07:15:45,071 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 62 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 07:15:45,071 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:15:45,352 INFO L290 TraceCheckUtils]: 58: Hoare triple {2837#false} assume !false; {2837#false} is VALID [2022-04-28 07:15:45,352 INFO L290 TraceCheckUtils]: 57: Hoare triple {2837#false} assume 0 == ~cond; {2837#false} is VALID [2022-04-28 07:15:45,352 INFO L290 TraceCheckUtils]: 56: Hoare triple {2837#false} ~cond := #in~cond; {2837#false} is VALID [2022-04-28 07:15:45,352 INFO L272 TraceCheckUtils]: 55: Hoare triple {2837#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {2837#false} is VALID [2022-04-28 07:15:45,353 INFO L290 TraceCheckUtils]: 54: Hoare triple {3033#(< |main_#t~post6| 10)} assume !(#t~post6 < 10);havoc #t~post6; {2837#false} is VALID [2022-04-28 07:15:45,353 INFO L290 TraceCheckUtils]: 53: Hoare triple {3037#(< ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3033#(< |main_#t~post6| 10)} is VALID [2022-04-28 07:15:45,353 INFO L290 TraceCheckUtils]: 52: Hoare triple {3037#(< ~counter~0 10)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {3037#(< ~counter~0 10)} is VALID [2022-04-28 07:15:45,354 INFO L290 TraceCheckUtils]: 51: Hoare triple {3037#(< ~counter~0 10)} assume !!(0 != ~y3~0); {3037#(< ~counter~0 10)} is VALID [2022-04-28 07:15:45,354 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2836#true} {3037#(< ~counter~0 10)} #63#return; {3037#(< ~counter~0 10)} is VALID [2022-04-28 07:15:45,354 INFO L290 TraceCheckUtils]: 49: Hoare triple {2836#true} assume true; {2836#true} is VALID [2022-04-28 07:15:45,354 INFO L290 TraceCheckUtils]: 48: Hoare triple {2836#true} assume !(0 == ~cond); {2836#true} is VALID [2022-04-28 07:15:45,354 INFO L290 TraceCheckUtils]: 47: Hoare triple {2836#true} ~cond := #in~cond; {2836#true} is VALID [2022-04-28 07:15:45,354 INFO L272 TraceCheckUtils]: 46: Hoare triple {3037#(< ~counter~0 10)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2836#true} is VALID [2022-04-28 07:15:45,355 INFO L290 TraceCheckUtils]: 45: Hoare triple {3037#(< ~counter~0 10)} assume !!(#t~post6 < 10);havoc #t~post6; {3037#(< ~counter~0 10)} is VALID [2022-04-28 07:15:45,355 INFO L290 TraceCheckUtils]: 44: Hoare triple {3065#(< ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3037#(< ~counter~0 10)} is VALID [2022-04-28 07:15:45,355 INFO L290 TraceCheckUtils]: 43: Hoare triple {3065#(< ~counter~0 9)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {3065#(< ~counter~0 9)} is VALID [2022-04-28 07:15:45,356 INFO L290 TraceCheckUtils]: 42: Hoare triple {3065#(< ~counter~0 9)} assume !!(0 != ~y3~0); {3065#(< ~counter~0 9)} is VALID [2022-04-28 07:15:45,356 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2836#true} {3065#(< ~counter~0 9)} #63#return; {3065#(< ~counter~0 9)} is VALID [2022-04-28 07:15:45,356 INFO L290 TraceCheckUtils]: 40: Hoare triple {2836#true} assume true; {2836#true} is VALID [2022-04-28 07:15:45,356 INFO L290 TraceCheckUtils]: 39: Hoare triple {2836#true} assume !(0 == ~cond); {2836#true} is VALID [2022-04-28 07:15:45,356 INFO L290 TraceCheckUtils]: 38: Hoare triple {2836#true} ~cond := #in~cond; {2836#true} is VALID [2022-04-28 07:15:45,356 INFO L272 TraceCheckUtils]: 37: Hoare triple {3065#(< ~counter~0 9)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2836#true} is VALID [2022-04-28 07:15:45,357 INFO L290 TraceCheckUtils]: 36: Hoare triple {3065#(< ~counter~0 9)} assume !!(#t~post6 < 10);havoc #t~post6; {3065#(< ~counter~0 9)} is VALID [2022-04-28 07:15:45,357 INFO L290 TraceCheckUtils]: 35: Hoare triple {3093#(< ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3065#(< ~counter~0 9)} is VALID [2022-04-28 07:15:45,357 INFO L290 TraceCheckUtils]: 34: Hoare triple {3093#(< ~counter~0 8)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {3093#(< ~counter~0 8)} is VALID [2022-04-28 07:15:45,358 INFO L290 TraceCheckUtils]: 33: Hoare triple {3093#(< ~counter~0 8)} assume !!(0 != ~y3~0); {3093#(< ~counter~0 8)} is VALID [2022-04-28 07:15:45,358 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2836#true} {3093#(< ~counter~0 8)} #63#return; {3093#(< ~counter~0 8)} is VALID [2022-04-28 07:15:45,358 INFO L290 TraceCheckUtils]: 31: Hoare triple {2836#true} assume true; {2836#true} is VALID [2022-04-28 07:15:45,358 INFO L290 TraceCheckUtils]: 30: Hoare triple {2836#true} assume !(0 == ~cond); {2836#true} is VALID [2022-04-28 07:15:45,358 INFO L290 TraceCheckUtils]: 29: Hoare triple {2836#true} ~cond := #in~cond; {2836#true} is VALID [2022-04-28 07:15:45,358 INFO L272 TraceCheckUtils]: 28: Hoare triple {3093#(< ~counter~0 8)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2836#true} is VALID [2022-04-28 07:15:45,359 INFO L290 TraceCheckUtils]: 27: Hoare triple {3093#(< ~counter~0 8)} assume !!(#t~post6 < 10);havoc #t~post6; {3093#(< ~counter~0 8)} is VALID [2022-04-28 07:15:45,359 INFO L290 TraceCheckUtils]: 26: Hoare triple {3121#(< ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3093#(< ~counter~0 8)} is VALID [2022-04-28 07:15:45,359 INFO L290 TraceCheckUtils]: 25: Hoare triple {3121#(< ~counter~0 7)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {3121#(< ~counter~0 7)} is VALID [2022-04-28 07:15:45,359 INFO L290 TraceCheckUtils]: 24: Hoare triple {3121#(< ~counter~0 7)} assume !!(0 != ~y3~0); {3121#(< ~counter~0 7)} is VALID [2022-04-28 07:15:45,360 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2836#true} {3121#(< ~counter~0 7)} #63#return; {3121#(< ~counter~0 7)} is VALID [2022-04-28 07:15:45,360 INFO L290 TraceCheckUtils]: 22: Hoare triple {2836#true} assume true; {2836#true} is VALID [2022-04-28 07:15:45,360 INFO L290 TraceCheckUtils]: 21: Hoare triple {2836#true} assume !(0 == ~cond); {2836#true} is VALID [2022-04-28 07:15:45,360 INFO L290 TraceCheckUtils]: 20: Hoare triple {2836#true} ~cond := #in~cond; {2836#true} is VALID [2022-04-28 07:15:45,360 INFO L272 TraceCheckUtils]: 19: Hoare triple {3121#(< ~counter~0 7)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2836#true} is VALID [2022-04-28 07:15:45,360 INFO L290 TraceCheckUtils]: 18: Hoare triple {3121#(< ~counter~0 7)} assume !!(#t~post6 < 10);havoc #t~post6; {3121#(< ~counter~0 7)} is VALID [2022-04-28 07:15:45,361 INFO L290 TraceCheckUtils]: 17: Hoare triple {3149#(< ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3121#(< ~counter~0 7)} is VALID [2022-04-28 07:15:45,361 INFO L290 TraceCheckUtils]: 16: Hoare triple {3149#(< ~counter~0 6)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {3149#(< ~counter~0 6)} is VALID [2022-04-28 07:15:45,361 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2836#true} {3149#(< ~counter~0 6)} #61#return; {3149#(< ~counter~0 6)} is VALID [2022-04-28 07:15:45,361 INFO L290 TraceCheckUtils]: 14: Hoare triple {2836#true} assume true; {2836#true} is VALID [2022-04-28 07:15:45,361 INFO L290 TraceCheckUtils]: 13: Hoare triple {2836#true} assume !(0 == ~cond); {2836#true} is VALID [2022-04-28 07:15:45,361 INFO L290 TraceCheckUtils]: 12: Hoare triple {2836#true} ~cond := #in~cond; {2836#true} is VALID [2022-04-28 07:15:45,361 INFO L272 TraceCheckUtils]: 11: Hoare triple {3149#(< ~counter~0 6)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {2836#true} is VALID [2022-04-28 07:15:45,362 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2836#true} {3149#(< ~counter~0 6)} #59#return; {3149#(< ~counter~0 6)} is VALID [2022-04-28 07:15:45,362 INFO L290 TraceCheckUtils]: 9: Hoare triple {2836#true} assume true; {2836#true} is VALID [2022-04-28 07:15:45,362 INFO L290 TraceCheckUtils]: 8: Hoare triple {2836#true} assume !(0 == ~cond); {2836#true} is VALID [2022-04-28 07:15:45,362 INFO L290 TraceCheckUtils]: 7: Hoare triple {2836#true} ~cond := #in~cond; {2836#true} is VALID [2022-04-28 07:15:45,362 INFO L272 TraceCheckUtils]: 6: Hoare triple {3149#(< ~counter~0 6)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {2836#true} is VALID [2022-04-28 07:15:45,362 INFO L290 TraceCheckUtils]: 5: Hoare triple {3149#(< ~counter~0 6)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {3149#(< ~counter~0 6)} is VALID [2022-04-28 07:15:45,363 INFO L272 TraceCheckUtils]: 4: Hoare triple {3149#(< ~counter~0 6)} call #t~ret7 := main(); {3149#(< ~counter~0 6)} is VALID [2022-04-28 07:15:45,363 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3149#(< ~counter~0 6)} {2836#true} #67#return; {3149#(< ~counter~0 6)} is VALID [2022-04-28 07:15:45,363 INFO L290 TraceCheckUtils]: 2: Hoare triple {3149#(< ~counter~0 6)} assume true; {3149#(< ~counter~0 6)} is VALID [2022-04-28 07:15:45,363 INFO L290 TraceCheckUtils]: 1: Hoare triple {2836#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3149#(< ~counter~0 6)} is VALID [2022-04-28 07:15:45,364 INFO L272 TraceCheckUtils]: 0: Hoare triple {2836#true} call ULTIMATE.init(); {2836#true} is VALID [2022-04-28 07:15:45,364 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 07:15:45,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:15:45,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88231914] [2022-04-28 07:15:45,364 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:15:45,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132666412] [2022-04-28 07:15:45,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132666412] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:15:45,364 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:15:45,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-28 07:15:45,364 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:15:45,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1495837815] [2022-04-28 07:15:45,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1495837815] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:15:45,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:15:45,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 07:15:45,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604130249] [2022-04-28 07:15:45,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:15:45,365 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 59 [2022-04-28 07:15:45,365 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:15:45,365 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 07:15:45,397 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-28 07:15:45,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 07:15:45,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:15:45,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 07:15:45,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 07:15:45,398 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 07:15:45,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:15:45,584 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2022-04-28 07:15:45,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 07:15:45,585 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 59 [2022-04-28 07:15:45,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:15:45,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 07:15:45,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 75 transitions. [2022-04-28 07:15:45,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 07:15:45,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 75 transitions. [2022-04-28 07:15:45,588 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 75 transitions. [2022-04-28 07:15:45,632 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:15:45,633 INFO L225 Difference]: With dead ends: 70 [2022-04-28 07:15:45,633 INFO L226 Difference]: Without dead ends: 65 [2022-04-28 07:15:45,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=183, Unknown=0, NotChecked=0, Total=306 [2022-04-28 07:15:45,634 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 25 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 07:15:45,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 108 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 07:15:45,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-28 07:15:45,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-04-28 07:15:45,675 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:15:45,675 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 65 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:15:45,676 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 65 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:15:45,676 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 65 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:15:45,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:15:45,677 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2022-04-28 07:15:45,677 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2022-04-28 07:15:45,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:15:45,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:15:45,678 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 65 states. [2022-04-28 07:15:45,678 INFO L87 Difference]: Start difference. First operand has 65 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 65 states. [2022-04-28 07:15:45,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:15:45,679 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2022-04-28 07:15:45,679 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2022-04-28 07:15:45,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:15:45,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:15:45,679 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:15:45,679 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:15:45,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:15:45,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2022-04-28 07:15:45,681 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 59 [2022-04-28 07:15:45,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:15:45,681 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2022-04-28 07:15:45,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 07:15:45,681 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 71 transitions. [2022-04-28 07:15:45,742 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-28 07:15:45,742 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2022-04-28 07:15:45,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-28 07:15:45,743 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:15:45,743 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:15:45,759 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-28 07:15:45,954 WARN L477 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-28 07:15:45,955 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:15:45,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:15:45,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1512407140, now seen corresponding path program 9 times [2022-04-28 07:15:45,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:15:45,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1207084583] [2022-04-28 07:15:45,955 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:15:45,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1512407140, now seen corresponding path program 10 times [2022-04-28 07:15:45,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:15:45,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361804690] [2022-04-28 07:15:45,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:15:45,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:15:45,989 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:15:45,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1517747794] [2022-04-28 07:15:45,989 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:15:45,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:15:45,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:15:45,992 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-28 07:15:45,993 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-28 07:15:46,032 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:15:46,032 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:15:46,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 07:15:46,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:15:46,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:15:46,381 INFO L272 TraceCheckUtils]: 0: Hoare triple {3611#true} call ULTIMATE.init(); {3611#true} is VALID [2022-04-28 07:15:46,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {3611#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3619#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:46,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {3619#(<= ~counter~0 0)} assume true; {3619#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:46,385 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3619#(<= ~counter~0 0)} {3611#true} #67#return; {3619#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:46,385 INFO L272 TraceCheckUtils]: 4: Hoare triple {3619#(<= ~counter~0 0)} call #t~ret7 := main(); {3619#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:46,385 INFO L290 TraceCheckUtils]: 5: Hoare triple {3619#(<= ~counter~0 0)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {3619#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:46,386 INFO L272 TraceCheckUtils]: 6: Hoare triple {3619#(<= ~counter~0 0)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {3619#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:46,386 INFO L290 TraceCheckUtils]: 7: Hoare triple {3619#(<= ~counter~0 0)} ~cond := #in~cond; {3619#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:46,386 INFO L290 TraceCheckUtils]: 8: Hoare triple {3619#(<= ~counter~0 0)} assume !(0 == ~cond); {3619#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:46,386 INFO L290 TraceCheckUtils]: 9: Hoare triple {3619#(<= ~counter~0 0)} assume true; {3619#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:46,387 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3619#(<= ~counter~0 0)} {3619#(<= ~counter~0 0)} #59#return; {3619#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:46,387 INFO L272 TraceCheckUtils]: 11: Hoare triple {3619#(<= ~counter~0 0)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {3619#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:46,387 INFO L290 TraceCheckUtils]: 12: Hoare triple {3619#(<= ~counter~0 0)} ~cond := #in~cond; {3619#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:46,387 INFO L290 TraceCheckUtils]: 13: Hoare triple {3619#(<= ~counter~0 0)} assume !(0 == ~cond); {3619#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:46,388 INFO L290 TraceCheckUtils]: 14: Hoare triple {3619#(<= ~counter~0 0)} assume true; {3619#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:46,388 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3619#(<= ~counter~0 0)} {3619#(<= ~counter~0 0)} #61#return; {3619#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:46,388 INFO L290 TraceCheckUtils]: 16: Hoare triple {3619#(<= ~counter~0 0)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {3619#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:46,389 INFO L290 TraceCheckUtils]: 17: Hoare triple {3619#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3668#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:46,389 INFO L290 TraceCheckUtils]: 18: Hoare triple {3668#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {3668#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:46,390 INFO L272 TraceCheckUtils]: 19: Hoare triple {3668#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {3668#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:46,390 INFO L290 TraceCheckUtils]: 20: Hoare triple {3668#(<= ~counter~0 1)} ~cond := #in~cond; {3668#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:46,390 INFO L290 TraceCheckUtils]: 21: Hoare triple {3668#(<= ~counter~0 1)} assume !(0 == ~cond); {3668#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:46,390 INFO L290 TraceCheckUtils]: 22: Hoare triple {3668#(<= ~counter~0 1)} assume true; {3668#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:46,391 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3668#(<= ~counter~0 1)} {3668#(<= ~counter~0 1)} #63#return; {3668#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:46,391 INFO L290 TraceCheckUtils]: 24: Hoare triple {3668#(<= ~counter~0 1)} assume !!(0 != ~y3~0); {3668#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:46,391 INFO L290 TraceCheckUtils]: 25: Hoare triple {3668#(<= ~counter~0 1)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {3668#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:46,392 INFO L290 TraceCheckUtils]: 26: Hoare triple {3668#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3696#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:46,392 INFO L290 TraceCheckUtils]: 27: Hoare triple {3696#(<= ~counter~0 2)} assume !!(#t~post6 < 10);havoc #t~post6; {3696#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:46,392 INFO L272 TraceCheckUtils]: 28: Hoare triple {3696#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {3696#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:46,393 INFO L290 TraceCheckUtils]: 29: Hoare triple {3696#(<= ~counter~0 2)} ~cond := #in~cond; {3696#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:46,393 INFO L290 TraceCheckUtils]: 30: Hoare triple {3696#(<= ~counter~0 2)} assume !(0 == ~cond); {3696#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:46,393 INFO L290 TraceCheckUtils]: 31: Hoare triple {3696#(<= ~counter~0 2)} assume true; {3696#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:46,393 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3696#(<= ~counter~0 2)} {3696#(<= ~counter~0 2)} #63#return; {3696#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:46,394 INFO L290 TraceCheckUtils]: 33: Hoare triple {3696#(<= ~counter~0 2)} assume !!(0 != ~y3~0); {3696#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:46,394 INFO L290 TraceCheckUtils]: 34: Hoare triple {3696#(<= ~counter~0 2)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {3696#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:46,394 INFO L290 TraceCheckUtils]: 35: Hoare triple {3696#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3724#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:46,395 INFO L290 TraceCheckUtils]: 36: Hoare triple {3724#(<= ~counter~0 3)} assume !!(#t~post6 < 10);havoc #t~post6; {3724#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:46,395 INFO L272 TraceCheckUtils]: 37: Hoare triple {3724#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {3724#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:46,395 INFO L290 TraceCheckUtils]: 38: Hoare triple {3724#(<= ~counter~0 3)} ~cond := #in~cond; {3724#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:46,396 INFO L290 TraceCheckUtils]: 39: Hoare triple {3724#(<= ~counter~0 3)} assume !(0 == ~cond); {3724#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:46,396 INFO L290 TraceCheckUtils]: 40: Hoare triple {3724#(<= ~counter~0 3)} assume true; {3724#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:46,396 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3724#(<= ~counter~0 3)} {3724#(<= ~counter~0 3)} #63#return; {3724#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:46,396 INFO L290 TraceCheckUtils]: 42: Hoare triple {3724#(<= ~counter~0 3)} assume !!(0 != ~y3~0); {3724#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:46,397 INFO L290 TraceCheckUtils]: 43: Hoare triple {3724#(<= ~counter~0 3)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {3724#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:46,397 INFO L290 TraceCheckUtils]: 44: Hoare triple {3724#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3752#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:46,397 INFO L290 TraceCheckUtils]: 45: Hoare triple {3752#(<= ~counter~0 4)} assume !!(#t~post6 < 10);havoc #t~post6; {3752#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:46,398 INFO L272 TraceCheckUtils]: 46: Hoare triple {3752#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {3752#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:46,398 INFO L290 TraceCheckUtils]: 47: Hoare triple {3752#(<= ~counter~0 4)} ~cond := #in~cond; {3752#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:46,398 INFO L290 TraceCheckUtils]: 48: Hoare triple {3752#(<= ~counter~0 4)} assume !(0 == ~cond); {3752#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:46,399 INFO L290 TraceCheckUtils]: 49: Hoare triple {3752#(<= ~counter~0 4)} assume true; {3752#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:46,403 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3752#(<= ~counter~0 4)} {3752#(<= ~counter~0 4)} #63#return; {3752#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:46,404 INFO L290 TraceCheckUtils]: 51: Hoare triple {3752#(<= ~counter~0 4)} assume !!(0 != ~y3~0); {3752#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:46,404 INFO L290 TraceCheckUtils]: 52: Hoare triple {3752#(<= ~counter~0 4)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {3752#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:46,404 INFO L290 TraceCheckUtils]: 53: Hoare triple {3752#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3780#(<= ~counter~0 5)} is VALID [2022-04-28 07:15:46,405 INFO L290 TraceCheckUtils]: 54: Hoare triple {3780#(<= ~counter~0 5)} assume !!(#t~post6 < 10);havoc #t~post6; {3780#(<= ~counter~0 5)} is VALID [2022-04-28 07:15:46,405 INFO L272 TraceCheckUtils]: 55: Hoare triple {3780#(<= ~counter~0 5)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {3780#(<= ~counter~0 5)} is VALID [2022-04-28 07:15:46,405 INFO L290 TraceCheckUtils]: 56: Hoare triple {3780#(<= ~counter~0 5)} ~cond := #in~cond; {3780#(<= ~counter~0 5)} is VALID [2022-04-28 07:15:46,406 INFO L290 TraceCheckUtils]: 57: Hoare triple {3780#(<= ~counter~0 5)} assume !(0 == ~cond); {3780#(<= ~counter~0 5)} is VALID [2022-04-28 07:15:46,406 INFO L290 TraceCheckUtils]: 58: Hoare triple {3780#(<= ~counter~0 5)} assume true; {3780#(<= ~counter~0 5)} is VALID [2022-04-28 07:15:46,407 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {3780#(<= ~counter~0 5)} {3780#(<= ~counter~0 5)} #63#return; {3780#(<= ~counter~0 5)} is VALID [2022-04-28 07:15:46,407 INFO L290 TraceCheckUtils]: 60: Hoare triple {3780#(<= ~counter~0 5)} assume !!(0 != ~y3~0); {3780#(<= ~counter~0 5)} is VALID [2022-04-28 07:15:46,408 INFO L290 TraceCheckUtils]: 61: Hoare triple {3780#(<= ~counter~0 5)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {3780#(<= ~counter~0 5)} is VALID [2022-04-28 07:15:46,408 INFO L290 TraceCheckUtils]: 62: Hoare triple {3780#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3808#(<= |main_#t~post6| 5)} is VALID [2022-04-28 07:15:46,408 INFO L290 TraceCheckUtils]: 63: Hoare triple {3808#(<= |main_#t~post6| 5)} assume !(#t~post6 < 10);havoc #t~post6; {3612#false} is VALID [2022-04-28 07:15:46,409 INFO L272 TraceCheckUtils]: 64: Hoare triple {3612#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {3612#false} is VALID [2022-04-28 07:15:46,409 INFO L290 TraceCheckUtils]: 65: Hoare triple {3612#false} ~cond := #in~cond; {3612#false} is VALID [2022-04-28 07:15:46,409 INFO L290 TraceCheckUtils]: 66: Hoare triple {3612#false} assume 0 == ~cond; {3612#false} is VALID [2022-04-28 07:15:46,409 INFO L290 TraceCheckUtils]: 67: Hoare triple {3612#false} assume !false; {3612#false} is VALID [2022-04-28 07:15:46,409 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 10 proven. 100 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 07:15:46,409 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:15:46,706 INFO L290 TraceCheckUtils]: 67: Hoare triple {3612#false} assume !false; {3612#false} is VALID [2022-04-28 07:15:46,706 INFO L290 TraceCheckUtils]: 66: Hoare triple {3612#false} assume 0 == ~cond; {3612#false} is VALID [2022-04-28 07:15:46,707 INFO L290 TraceCheckUtils]: 65: Hoare triple {3612#false} ~cond := #in~cond; {3612#false} is VALID [2022-04-28 07:15:46,707 INFO L272 TraceCheckUtils]: 64: Hoare triple {3612#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {3612#false} is VALID [2022-04-28 07:15:46,707 INFO L290 TraceCheckUtils]: 63: Hoare triple {3836#(< |main_#t~post6| 10)} assume !(#t~post6 < 10);havoc #t~post6; {3612#false} is VALID [2022-04-28 07:15:46,707 INFO L290 TraceCheckUtils]: 62: Hoare triple {3840#(< ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3836#(< |main_#t~post6| 10)} is VALID [2022-04-28 07:15:46,707 INFO L290 TraceCheckUtils]: 61: Hoare triple {3840#(< ~counter~0 10)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {3840#(< ~counter~0 10)} is VALID [2022-04-28 07:15:46,708 INFO L290 TraceCheckUtils]: 60: Hoare triple {3840#(< ~counter~0 10)} assume !!(0 != ~y3~0); {3840#(< ~counter~0 10)} is VALID [2022-04-28 07:15:46,708 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {3611#true} {3840#(< ~counter~0 10)} #63#return; {3840#(< ~counter~0 10)} is VALID [2022-04-28 07:15:46,708 INFO L290 TraceCheckUtils]: 58: Hoare triple {3611#true} assume true; {3611#true} is VALID [2022-04-28 07:15:46,708 INFO L290 TraceCheckUtils]: 57: Hoare triple {3611#true} assume !(0 == ~cond); {3611#true} is VALID [2022-04-28 07:15:46,708 INFO L290 TraceCheckUtils]: 56: Hoare triple {3611#true} ~cond := #in~cond; {3611#true} is VALID [2022-04-28 07:15:46,708 INFO L272 TraceCheckUtils]: 55: Hoare triple {3840#(< ~counter~0 10)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {3611#true} is VALID [2022-04-28 07:15:46,708 INFO L290 TraceCheckUtils]: 54: Hoare triple {3840#(< ~counter~0 10)} assume !!(#t~post6 < 10);havoc #t~post6; {3840#(< ~counter~0 10)} is VALID [2022-04-28 07:15:46,709 INFO L290 TraceCheckUtils]: 53: Hoare triple {3868#(< ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3840#(< ~counter~0 10)} is VALID [2022-04-28 07:15:46,709 INFO L290 TraceCheckUtils]: 52: Hoare triple {3868#(< ~counter~0 9)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {3868#(< ~counter~0 9)} is VALID [2022-04-28 07:15:46,709 INFO L290 TraceCheckUtils]: 51: Hoare triple {3868#(< ~counter~0 9)} assume !!(0 != ~y3~0); {3868#(< ~counter~0 9)} is VALID [2022-04-28 07:15:46,710 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3611#true} {3868#(< ~counter~0 9)} #63#return; {3868#(< ~counter~0 9)} is VALID [2022-04-28 07:15:46,710 INFO L290 TraceCheckUtils]: 49: Hoare triple {3611#true} assume true; {3611#true} is VALID [2022-04-28 07:15:46,710 INFO L290 TraceCheckUtils]: 48: Hoare triple {3611#true} assume !(0 == ~cond); {3611#true} is VALID [2022-04-28 07:15:46,710 INFO L290 TraceCheckUtils]: 47: Hoare triple {3611#true} ~cond := #in~cond; {3611#true} is VALID [2022-04-28 07:15:46,710 INFO L272 TraceCheckUtils]: 46: Hoare triple {3868#(< ~counter~0 9)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {3611#true} is VALID [2022-04-28 07:15:46,710 INFO L290 TraceCheckUtils]: 45: Hoare triple {3868#(< ~counter~0 9)} assume !!(#t~post6 < 10);havoc #t~post6; {3868#(< ~counter~0 9)} is VALID [2022-04-28 07:15:46,710 INFO L290 TraceCheckUtils]: 44: Hoare triple {3896#(< ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3868#(< ~counter~0 9)} is VALID [2022-04-28 07:15:46,711 INFO L290 TraceCheckUtils]: 43: Hoare triple {3896#(< ~counter~0 8)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {3896#(< ~counter~0 8)} is VALID [2022-04-28 07:15:46,711 INFO L290 TraceCheckUtils]: 42: Hoare triple {3896#(< ~counter~0 8)} assume !!(0 != ~y3~0); {3896#(< ~counter~0 8)} is VALID [2022-04-28 07:15:46,711 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3611#true} {3896#(< ~counter~0 8)} #63#return; {3896#(< ~counter~0 8)} is VALID [2022-04-28 07:15:46,711 INFO L290 TraceCheckUtils]: 40: Hoare triple {3611#true} assume true; {3611#true} is VALID [2022-04-28 07:15:46,711 INFO L290 TraceCheckUtils]: 39: Hoare triple {3611#true} assume !(0 == ~cond); {3611#true} is VALID [2022-04-28 07:15:46,711 INFO L290 TraceCheckUtils]: 38: Hoare triple {3611#true} ~cond := #in~cond; {3611#true} is VALID [2022-04-28 07:15:46,712 INFO L272 TraceCheckUtils]: 37: Hoare triple {3896#(< ~counter~0 8)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {3611#true} is VALID [2022-04-28 07:15:46,712 INFO L290 TraceCheckUtils]: 36: Hoare triple {3896#(< ~counter~0 8)} assume !!(#t~post6 < 10);havoc #t~post6; {3896#(< ~counter~0 8)} is VALID [2022-04-28 07:15:46,712 INFO L290 TraceCheckUtils]: 35: Hoare triple {3924#(< ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3896#(< ~counter~0 8)} is VALID [2022-04-28 07:15:46,712 INFO L290 TraceCheckUtils]: 34: Hoare triple {3924#(< ~counter~0 7)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {3924#(< ~counter~0 7)} is VALID [2022-04-28 07:15:46,712 INFO L290 TraceCheckUtils]: 33: Hoare triple {3924#(< ~counter~0 7)} assume !!(0 != ~y3~0); {3924#(< ~counter~0 7)} is VALID [2022-04-28 07:15:46,713 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3611#true} {3924#(< ~counter~0 7)} #63#return; {3924#(< ~counter~0 7)} is VALID [2022-04-28 07:15:46,713 INFO L290 TraceCheckUtils]: 31: Hoare triple {3611#true} assume true; {3611#true} is VALID [2022-04-28 07:15:46,713 INFO L290 TraceCheckUtils]: 30: Hoare triple {3611#true} assume !(0 == ~cond); {3611#true} is VALID [2022-04-28 07:15:46,713 INFO L290 TraceCheckUtils]: 29: Hoare triple {3611#true} ~cond := #in~cond; {3611#true} is VALID [2022-04-28 07:15:46,713 INFO L272 TraceCheckUtils]: 28: Hoare triple {3924#(< ~counter~0 7)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {3611#true} is VALID [2022-04-28 07:15:46,713 INFO L290 TraceCheckUtils]: 27: Hoare triple {3924#(< ~counter~0 7)} assume !!(#t~post6 < 10);havoc #t~post6; {3924#(< ~counter~0 7)} is VALID [2022-04-28 07:15:46,714 INFO L290 TraceCheckUtils]: 26: Hoare triple {3780#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3924#(< ~counter~0 7)} is VALID [2022-04-28 07:15:46,714 INFO L290 TraceCheckUtils]: 25: Hoare triple {3780#(<= ~counter~0 5)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {3780#(<= ~counter~0 5)} is VALID [2022-04-28 07:15:46,714 INFO L290 TraceCheckUtils]: 24: Hoare triple {3780#(<= ~counter~0 5)} assume !!(0 != ~y3~0); {3780#(<= ~counter~0 5)} is VALID [2022-04-28 07:15:46,714 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3611#true} {3780#(<= ~counter~0 5)} #63#return; {3780#(<= ~counter~0 5)} is VALID [2022-04-28 07:15:46,714 INFO L290 TraceCheckUtils]: 22: Hoare triple {3611#true} assume true; {3611#true} is VALID [2022-04-28 07:15:46,714 INFO L290 TraceCheckUtils]: 21: Hoare triple {3611#true} assume !(0 == ~cond); {3611#true} is VALID [2022-04-28 07:15:46,715 INFO L290 TraceCheckUtils]: 20: Hoare triple {3611#true} ~cond := #in~cond; {3611#true} is VALID [2022-04-28 07:15:46,715 INFO L272 TraceCheckUtils]: 19: Hoare triple {3780#(<= ~counter~0 5)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {3611#true} is VALID [2022-04-28 07:15:46,715 INFO L290 TraceCheckUtils]: 18: Hoare triple {3780#(<= ~counter~0 5)} assume !!(#t~post6 < 10);havoc #t~post6; {3780#(<= ~counter~0 5)} is VALID [2022-04-28 07:15:46,715 INFO L290 TraceCheckUtils]: 17: Hoare triple {3752#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3780#(<= ~counter~0 5)} is VALID [2022-04-28 07:15:46,715 INFO L290 TraceCheckUtils]: 16: Hoare triple {3752#(<= ~counter~0 4)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {3752#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:46,716 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3611#true} {3752#(<= ~counter~0 4)} #61#return; {3752#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:46,716 INFO L290 TraceCheckUtils]: 14: Hoare triple {3611#true} assume true; {3611#true} is VALID [2022-04-28 07:15:46,716 INFO L290 TraceCheckUtils]: 13: Hoare triple {3611#true} assume !(0 == ~cond); {3611#true} is VALID [2022-04-28 07:15:46,716 INFO L290 TraceCheckUtils]: 12: Hoare triple {3611#true} ~cond := #in~cond; {3611#true} is VALID [2022-04-28 07:15:46,716 INFO L272 TraceCheckUtils]: 11: Hoare triple {3752#(<= ~counter~0 4)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {3611#true} is VALID [2022-04-28 07:15:46,716 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3611#true} {3752#(<= ~counter~0 4)} #59#return; {3752#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:46,716 INFO L290 TraceCheckUtils]: 9: Hoare triple {3611#true} assume true; {3611#true} is VALID [2022-04-28 07:15:46,716 INFO L290 TraceCheckUtils]: 8: Hoare triple {3611#true} assume !(0 == ~cond); {3611#true} is VALID [2022-04-28 07:15:46,716 INFO L290 TraceCheckUtils]: 7: Hoare triple {3611#true} ~cond := #in~cond; {3611#true} is VALID [2022-04-28 07:15:46,716 INFO L272 TraceCheckUtils]: 6: Hoare triple {3752#(<= ~counter~0 4)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {3611#true} is VALID [2022-04-28 07:15:46,717 INFO L290 TraceCheckUtils]: 5: Hoare triple {3752#(<= ~counter~0 4)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {3752#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:46,717 INFO L272 TraceCheckUtils]: 4: Hoare triple {3752#(<= ~counter~0 4)} call #t~ret7 := main(); {3752#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:46,717 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3752#(<= ~counter~0 4)} {3611#true} #67#return; {3752#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:46,717 INFO L290 TraceCheckUtils]: 2: Hoare triple {3752#(<= ~counter~0 4)} assume true; {3752#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:46,718 INFO L290 TraceCheckUtils]: 1: Hoare triple {3611#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3752#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:46,718 INFO L272 TraceCheckUtils]: 0: Hoare triple {3611#true} call ULTIMATE.init(); {3611#true} is VALID [2022-04-28 07:15:46,718 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 10 proven. 60 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-28 07:15:46,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:15:46,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361804690] [2022-04-28 07:15:46,718 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:15:46,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517747794] [2022-04-28 07:15:46,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1517747794] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:15:46,718 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:15:46,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2022-04-28 07:15:46,719 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:15:46,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1207084583] [2022-04-28 07:15:46,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1207084583] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:15:46,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:15:46,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 07:15:46,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761068529] [2022-04-28 07:15:46,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:15:46,720 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 8 states have internal predecessors, (47), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) Word has length 68 [2022-04-28 07:15:46,720 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:15:46,720 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 8 states have internal predecessors, (47), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 07:15:46,755 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:15:46,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 07:15:46,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:15:46,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 07:15:46,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 07:15:46,756 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 8 states have internal predecessors, (47), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 07:15:46,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:15:46,914 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2022-04-28 07:15:46,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 07:15:46,915 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 8 states have internal predecessors, (47), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) Word has length 68 [2022-04-28 07:15:46,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:15:46,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 8 states have internal predecessors, (47), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 07:15:46,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 85 transitions. [2022-04-28 07:15:46,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 8 states have internal predecessors, (47), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 07:15:46,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 85 transitions. [2022-04-28 07:15:46,918 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 85 transitions. [2022-04-28 07:15:46,985 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-28 07:15:46,987 INFO L225 Difference]: With dead ends: 79 [2022-04-28 07:15:46,987 INFO L226 Difference]: Without dead ends: 74 [2022-04-28 07:15:46,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=206, Unknown=0, NotChecked=0, Total=342 [2022-04-28 07:15:46,989 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 13 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 07:15:46,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 116 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 07:15:46,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-28 07:15:47,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-04-28 07:15:47,057 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:15:47,057 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 74 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 54 states have internal predecessors, (61), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 07:15:47,057 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 74 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 54 states have internal predecessors, (61), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 07:15:47,057 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 74 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 54 states have internal predecessors, (61), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 07:15:47,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:15:47,059 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2022-04-28 07:15:47,059 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2022-04-28 07:15:47,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:15:47,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:15:47,059 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 54 states have internal predecessors, (61), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 74 states. [2022-04-28 07:15:47,059 INFO L87 Difference]: Start difference. First operand has 74 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 54 states have internal predecessors, (61), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 74 states. [2022-04-28 07:15:47,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:15:47,061 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2022-04-28 07:15:47,061 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2022-04-28 07:15:47,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:15:47,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:15:47,061 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:15:47,061 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:15:47,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 54 states have internal predecessors, (61), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 07:15:47,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2022-04-28 07:15:47,063 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 68 [2022-04-28 07:15:47,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:15:47,063 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2022-04-28 07:15:47,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 8 states have internal predecessors, (47), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 07:15:47,063 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 74 states and 81 transitions. [2022-04-28 07:15:47,137 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:15:47,137 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2022-04-28 07:15:47,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-28 07:15:47,138 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:15:47,138 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:15:47,154 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-28 07:15:47,339 WARN L477 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-28 07:15:47,339 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:15:47,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:15:47,340 INFO L85 PathProgramCache]: Analyzing trace with hash 771706710, now seen corresponding path program 11 times [2022-04-28 07:15:47,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:15:47,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1510715318] [2022-04-28 07:15:47,340 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:15:47,340 INFO L85 PathProgramCache]: Analyzing trace with hash 771706710, now seen corresponding path program 12 times [2022-04-28 07:15:47,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:15:47,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752199507] [2022-04-28 07:15:47,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:15:47,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:15:47,350 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:15:47,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1868712708] [2022-04-28 07:15:47,350 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 07:15:47,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:15:47,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:15:47,351 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:15:47,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-28 07:15:47,398 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 07:15:47,399 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:15:47,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 07:15:47,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:15:47,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:15:47,806 INFO L272 TraceCheckUtils]: 0: Hoare triple {4496#true} call ULTIMATE.init(); {4496#true} is VALID [2022-04-28 07:15:47,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {4496#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4504#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:47,807 INFO L290 TraceCheckUtils]: 2: Hoare triple {4504#(<= ~counter~0 0)} assume true; {4504#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:47,807 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4504#(<= ~counter~0 0)} {4496#true} #67#return; {4504#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:47,807 INFO L272 TraceCheckUtils]: 4: Hoare triple {4504#(<= ~counter~0 0)} call #t~ret7 := main(); {4504#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:47,808 INFO L290 TraceCheckUtils]: 5: Hoare triple {4504#(<= ~counter~0 0)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {4504#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:47,808 INFO L272 TraceCheckUtils]: 6: Hoare triple {4504#(<= ~counter~0 0)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {4504#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:47,808 INFO L290 TraceCheckUtils]: 7: Hoare triple {4504#(<= ~counter~0 0)} ~cond := #in~cond; {4504#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:47,809 INFO L290 TraceCheckUtils]: 8: Hoare triple {4504#(<= ~counter~0 0)} assume !(0 == ~cond); {4504#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:47,809 INFO L290 TraceCheckUtils]: 9: Hoare triple {4504#(<= ~counter~0 0)} assume true; {4504#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:47,809 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4504#(<= ~counter~0 0)} {4504#(<= ~counter~0 0)} #59#return; {4504#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:47,815 INFO L272 TraceCheckUtils]: 11: Hoare triple {4504#(<= ~counter~0 0)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {4504#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:47,831 INFO L290 TraceCheckUtils]: 12: Hoare triple {4504#(<= ~counter~0 0)} ~cond := #in~cond; {4504#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:47,831 INFO L290 TraceCheckUtils]: 13: Hoare triple {4504#(<= ~counter~0 0)} assume !(0 == ~cond); {4504#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:47,831 INFO L290 TraceCheckUtils]: 14: Hoare triple {4504#(<= ~counter~0 0)} assume true; {4504#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:47,832 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4504#(<= ~counter~0 0)} {4504#(<= ~counter~0 0)} #61#return; {4504#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:47,832 INFO L290 TraceCheckUtils]: 16: Hoare triple {4504#(<= ~counter~0 0)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {4504#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:47,832 INFO L290 TraceCheckUtils]: 17: Hoare triple {4504#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4553#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:47,833 INFO L290 TraceCheckUtils]: 18: Hoare triple {4553#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {4553#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:47,833 INFO L272 TraceCheckUtils]: 19: Hoare triple {4553#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {4553#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:47,833 INFO L290 TraceCheckUtils]: 20: Hoare triple {4553#(<= ~counter~0 1)} ~cond := #in~cond; {4553#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:47,833 INFO L290 TraceCheckUtils]: 21: Hoare triple {4553#(<= ~counter~0 1)} assume !(0 == ~cond); {4553#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:47,834 INFO L290 TraceCheckUtils]: 22: Hoare triple {4553#(<= ~counter~0 1)} assume true; {4553#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:47,834 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4553#(<= ~counter~0 1)} {4553#(<= ~counter~0 1)} #63#return; {4553#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:47,834 INFO L290 TraceCheckUtils]: 24: Hoare triple {4553#(<= ~counter~0 1)} assume !!(0 != ~y3~0); {4553#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:47,835 INFO L290 TraceCheckUtils]: 25: Hoare triple {4553#(<= ~counter~0 1)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {4553#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:47,835 INFO L290 TraceCheckUtils]: 26: Hoare triple {4553#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4581#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:47,835 INFO L290 TraceCheckUtils]: 27: Hoare triple {4581#(<= ~counter~0 2)} assume !!(#t~post6 < 10);havoc #t~post6; {4581#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:47,836 INFO L272 TraceCheckUtils]: 28: Hoare triple {4581#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {4581#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:47,836 INFO L290 TraceCheckUtils]: 29: Hoare triple {4581#(<= ~counter~0 2)} ~cond := #in~cond; {4581#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:47,836 INFO L290 TraceCheckUtils]: 30: Hoare triple {4581#(<= ~counter~0 2)} assume !(0 == ~cond); {4581#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:47,836 INFO L290 TraceCheckUtils]: 31: Hoare triple {4581#(<= ~counter~0 2)} assume true; {4581#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:47,837 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4581#(<= ~counter~0 2)} {4581#(<= ~counter~0 2)} #63#return; {4581#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:47,837 INFO L290 TraceCheckUtils]: 33: Hoare triple {4581#(<= ~counter~0 2)} assume !!(0 != ~y3~0); {4581#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:47,837 INFO L290 TraceCheckUtils]: 34: Hoare triple {4581#(<= ~counter~0 2)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {4581#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:47,838 INFO L290 TraceCheckUtils]: 35: Hoare triple {4581#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4609#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:47,838 INFO L290 TraceCheckUtils]: 36: Hoare triple {4609#(<= ~counter~0 3)} assume !!(#t~post6 < 10);havoc #t~post6; {4609#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:47,838 INFO L272 TraceCheckUtils]: 37: Hoare triple {4609#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {4609#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:47,839 INFO L290 TraceCheckUtils]: 38: Hoare triple {4609#(<= ~counter~0 3)} ~cond := #in~cond; {4609#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:47,839 INFO L290 TraceCheckUtils]: 39: Hoare triple {4609#(<= ~counter~0 3)} assume !(0 == ~cond); {4609#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:47,839 INFO L290 TraceCheckUtils]: 40: Hoare triple {4609#(<= ~counter~0 3)} assume true; {4609#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:47,840 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4609#(<= ~counter~0 3)} {4609#(<= ~counter~0 3)} #63#return; {4609#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:47,840 INFO L290 TraceCheckUtils]: 42: Hoare triple {4609#(<= ~counter~0 3)} assume !!(0 != ~y3~0); {4609#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:47,840 INFO L290 TraceCheckUtils]: 43: Hoare triple {4609#(<= ~counter~0 3)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {4609#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:47,841 INFO L290 TraceCheckUtils]: 44: Hoare triple {4609#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4637#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:47,841 INFO L290 TraceCheckUtils]: 45: Hoare triple {4637#(<= ~counter~0 4)} assume !!(#t~post6 < 10);havoc #t~post6; {4637#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:47,841 INFO L272 TraceCheckUtils]: 46: Hoare triple {4637#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {4637#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:47,842 INFO L290 TraceCheckUtils]: 47: Hoare triple {4637#(<= ~counter~0 4)} ~cond := #in~cond; {4637#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:47,842 INFO L290 TraceCheckUtils]: 48: Hoare triple {4637#(<= ~counter~0 4)} assume !(0 == ~cond); {4637#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:47,842 INFO L290 TraceCheckUtils]: 49: Hoare triple {4637#(<= ~counter~0 4)} assume true; {4637#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:47,842 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4637#(<= ~counter~0 4)} {4637#(<= ~counter~0 4)} #63#return; {4637#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:47,843 INFO L290 TraceCheckUtils]: 51: Hoare triple {4637#(<= ~counter~0 4)} assume !!(0 != ~y3~0); {4637#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:47,843 INFO L290 TraceCheckUtils]: 52: Hoare triple {4637#(<= ~counter~0 4)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {4637#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:47,843 INFO L290 TraceCheckUtils]: 53: Hoare triple {4637#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4665#(<= ~counter~0 5)} is VALID [2022-04-28 07:15:47,843 INFO L290 TraceCheckUtils]: 54: Hoare triple {4665#(<= ~counter~0 5)} assume !!(#t~post6 < 10);havoc #t~post6; {4665#(<= ~counter~0 5)} is VALID [2022-04-28 07:15:47,844 INFO L272 TraceCheckUtils]: 55: Hoare triple {4665#(<= ~counter~0 5)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {4665#(<= ~counter~0 5)} is VALID [2022-04-28 07:15:47,844 INFO L290 TraceCheckUtils]: 56: Hoare triple {4665#(<= ~counter~0 5)} ~cond := #in~cond; {4665#(<= ~counter~0 5)} is VALID [2022-04-28 07:15:47,844 INFO L290 TraceCheckUtils]: 57: Hoare triple {4665#(<= ~counter~0 5)} assume !(0 == ~cond); {4665#(<= ~counter~0 5)} is VALID [2022-04-28 07:15:47,844 INFO L290 TraceCheckUtils]: 58: Hoare triple {4665#(<= ~counter~0 5)} assume true; {4665#(<= ~counter~0 5)} is VALID [2022-04-28 07:15:47,845 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {4665#(<= ~counter~0 5)} {4665#(<= ~counter~0 5)} #63#return; {4665#(<= ~counter~0 5)} is VALID [2022-04-28 07:15:47,845 INFO L290 TraceCheckUtils]: 60: Hoare triple {4665#(<= ~counter~0 5)} assume !!(0 != ~y3~0); {4665#(<= ~counter~0 5)} is VALID [2022-04-28 07:15:47,845 INFO L290 TraceCheckUtils]: 61: Hoare triple {4665#(<= ~counter~0 5)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {4665#(<= ~counter~0 5)} is VALID [2022-04-28 07:15:47,846 INFO L290 TraceCheckUtils]: 62: Hoare triple {4665#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4693#(<= ~counter~0 6)} is VALID [2022-04-28 07:15:47,846 INFO L290 TraceCheckUtils]: 63: Hoare triple {4693#(<= ~counter~0 6)} assume !!(#t~post6 < 10);havoc #t~post6; {4693#(<= ~counter~0 6)} is VALID [2022-04-28 07:15:47,846 INFO L272 TraceCheckUtils]: 64: Hoare triple {4693#(<= ~counter~0 6)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {4693#(<= ~counter~0 6)} is VALID [2022-04-28 07:15:47,847 INFO L290 TraceCheckUtils]: 65: Hoare triple {4693#(<= ~counter~0 6)} ~cond := #in~cond; {4693#(<= ~counter~0 6)} is VALID [2022-04-28 07:15:47,847 INFO L290 TraceCheckUtils]: 66: Hoare triple {4693#(<= ~counter~0 6)} assume !(0 == ~cond); {4693#(<= ~counter~0 6)} is VALID [2022-04-28 07:15:47,847 INFO L290 TraceCheckUtils]: 67: Hoare triple {4693#(<= ~counter~0 6)} assume true; {4693#(<= ~counter~0 6)} is VALID [2022-04-28 07:15:47,847 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {4693#(<= ~counter~0 6)} {4693#(<= ~counter~0 6)} #63#return; {4693#(<= ~counter~0 6)} is VALID [2022-04-28 07:15:47,848 INFO L290 TraceCheckUtils]: 69: Hoare triple {4693#(<= ~counter~0 6)} assume !!(0 != ~y3~0); {4693#(<= ~counter~0 6)} is VALID [2022-04-28 07:15:47,848 INFO L290 TraceCheckUtils]: 70: Hoare triple {4693#(<= ~counter~0 6)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {4693#(<= ~counter~0 6)} is VALID [2022-04-28 07:15:47,848 INFO L290 TraceCheckUtils]: 71: Hoare triple {4693#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4721#(<= |main_#t~post6| 6)} is VALID [2022-04-28 07:15:47,848 INFO L290 TraceCheckUtils]: 72: Hoare triple {4721#(<= |main_#t~post6| 6)} assume !(#t~post6 < 10);havoc #t~post6; {4497#false} is VALID [2022-04-28 07:15:47,848 INFO L272 TraceCheckUtils]: 73: Hoare triple {4497#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {4497#false} is VALID [2022-04-28 07:15:47,848 INFO L290 TraceCheckUtils]: 74: Hoare triple {4497#false} ~cond := #in~cond; {4497#false} is VALID [2022-04-28 07:15:47,849 INFO L290 TraceCheckUtils]: 75: Hoare triple {4497#false} assume 0 == ~cond; {4497#false} is VALID [2022-04-28 07:15:47,849 INFO L290 TraceCheckUtils]: 76: Hoare triple {4497#false} assume !false; {4497#false} is VALID [2022-04-28 07:15:47,849 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 12 proven. 147 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 07:15:47,849 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:15:48,197 INFO L290 TraceCheckUtils]: 76: Hoare triple {4497#false} assume !false; {4497#false} is VALID [2022-04-28 07:15:48,197 INFO L290 TraceCheckUtils]: 75: Hoare triple {4497#false} assume 0 == ~cond; {4497#false} is VALID [2022-04-28 07:15:48,197 INFO L290 TraceCheckUtils]: 74: Hoare triple {4497#false} ~cond := #in~cond; {4497#false} is VALID [2022-04-28 07:15:48,197 INFO L272 TraceCheckUtils]: 73: Hoare triple {4497#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {4497#false} is VALID [2022-04-28 07:15:48,198 INFO L290 TraceCheckUtils]: 72: Hoare triple {4749#(< |main_#t~post6| 10)} assume !(#t~post6 < 10);havoc #t~post6; {4497#false} is VALID [2022-04-28 07:15:48,198 INFO L290 TraceCheckUtils]: 71: Hoare triple {4753#(< ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4749#(< |main_#t~post6| 10)} is VALID [2022-04-28 07:15:48,198 INFO L290 TraceCheckUtils]: 70: Hoare triple {4753#(< ~counter~0 10)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {4753#(< ~counter~0 10)} is VALID [2022-04-28 07:15:48,199 INFO L290 TraceCheckUtils]: 69: Hoare triple {4753#(< ~counter~0 10)} assume !!(0 != ~y3~0); {4753#(< ~counter~0 10)} is VALID [2022-04-28 07:15:48,199 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {4496#true} {4753#(< ~counter~0 10)} #63#return; {4753#(< ~counter~0 10)} is VALID [2022-04-28 07:15:48,199 INFO L290 TraceCheckUtils]: 67: Hoare triple {4496#true} assume true; {4496#true} is VALID [2022-04-28 07:15:48,199 INFO L290 TraceCheckUtils]: 66: Hoare triple {4496#true} assume !(0 == ~cond); {4496#true} is VALID [2022-04-28 07:15:48,199 INFO L290 TraceCheckUtils]: 65: Hoare triple {4496#true} ~cond := #in~cond; {4496#true} is VALID [2022-04-28 07:15:48,199 INFO L272 TraceCheckUtils]: 64: Hoare triple {4753#(< ~counter~0 10)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {4496#true} is VALID [2022-04-28 07:15:48,200 INFO L290 TraceCheckUtils]: 63: Hoare triple {4753#(< ~counter~0 10)} assume !!(#t~post6 < 10);havoc #t~post6; {4753#(< ~counter~0 10)} is VALID [2022-04-28 07:15:48,200 INFO L290 TraceCheckUtils]: 62: Hoare triple {4781#(< ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4753#(< ~counter~0 10)} is VALID [2022-04-28 07:15:48,201 INFO L290 TraceCheckUtils]: 61: Hoare triple {4781#(< ~counter~0 9)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {4781#(< ~counter~0 9)} is VALID [2022-04-28 07:15:48,201 INFO L290 TraceCheckUtils]: 60: Hoare triple {4781#(< ~counter~0 9)} assume !!(0 != ~y3~0); {4781#(< ~counter~0 9)} is VALID [2022-04-28 07:15:48,202 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {4496#true} {4781#(< ~counter~0 9)} #63#return; {4781#(< ~counter~0 9)} is VALID [2022-04-28 07:15:48,202 INFO L290 TraceCheckUtils]: 58: Hoare triple {4496#true} assume true; {4496#true} is VALID [2022-04-28 07:15:48,202 INFO L290 TraceCheckUtils]: 57: Hoare triple {4496#true} assume !(0 == ~cond); {4496#true} is VALID [2022-04-28 07:15:48,202 INFO L290 TraceCheckUtils]: 56: Hoare triple {4496#true} ~cond := #in~cond; {4496#true} is VALID [2022-04-28 07:15:48,202 INFO L272 TraceCheckUtils]: 55: Hoare triple {4781#(< ~counter~0 9)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {4496#true} is VALID [2022-04-28 07:15:48,202 INFO L290 TraceCheckUtils]: 54: Hoare triple {4781#(< ~counter~0 9)} assume !!(#t~post6 < 10);havoc #t~post6; {4781#(< ~counter~0 9)} is VALID [2022-04-28 07:15:48,203 INFO L290 TraceCheckUtils]: 53: Hoare triple {4809#(< ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4781#(< ~counter~0 9)} is VALID [2022-04-28 07:15:48,203 INFO L290 TraceCheckUtils]: 52: Hoare triple {4809#(< ~counter~0 8)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {4809#(< ~counter~0 8)} is VALID [2022-04-28 07:15:48,203 INFO L290 TraceCheckUtils]: 51: Hoare triple {4809#(< ~counter~0 8)} assume !!(0 != ~y3~0); {4809#(< ~counter~0 8)} is VALID [2022-04-28 07:15:48,204 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4496#true} {4809#(< ~counter~0 8)} #63#return; {4809#(< ~counter~0 8)} is VALID [2022-04-28 07:15:48,204 INFO L290 TraceCheckUtils]: 49: Hoare triple {4496#true} assume true; {4496#true} is VALID [2022-04-28 07:15:48,204 INFO L290 TraceCheckUtils]: 48: Hoare triple {4496#true} assume !(0 == ~cond); {4496#true} is VALID [2022-04-28 07:15:48,204 INFO L290 TraceCheckUtils]: 47: Hoare triple {4496#true} ~cond := #in~cond; {4496#true} is VALID [2022-04-28 07:15:48,204 INFO L272 TraceCheckUtils]: 46: Hoare triple {4809#(< ~counter~0 8)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {4496#true} is VALID [2022-04-28 07:15:48,204 INFO L290 TraceCheckUtils]: 45: Hoare triple {4809#(< ~counter~0 8)} assume !!(#t~post6 < 10);havoc #t~post6; {4809#(< ~counter~0 8)} is VALID [2022-04-28 07:15:48,205 INFO L290 TraceCheckUtils]: 44: Hoare triple {4693#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4809#(< ~counter~0 8)} is VALID [2022-04-28 07:15:48,205 INFO L290 TraceCheckUtils]: 43: Hoare triple {4693#(<= ~counter~0 6)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {4693#(<= ~counter~0 6)} is VALID [2022-04-28 07:15:48,205 INFO L290 TraceCheckUtils]: 42: Hoare triple {4693#(<= ~counter~0 6)} assume !!(0 != ~y3~0); {4693#(<= ~counter~0 6)} is VALID [2022-04-28 07:15:48,206 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4496#true} {4693#(<= ~counter~0 6)} #63#return; {4693#(<= ~counter~0 6)} is VALID [2022-04-28 07:15:48,206 INFO L290 TraceCheckUtils]: 40: Hoare triple {4496#true} assume true; {4496#true} is VALID [2022-04-28 07:15:48,206 INFO L290 TraceCheckUtils]: 39: Hoare triple {4496#true} assume !(0 == ~cond); {4496#true} is VALID [2022-04-28 07:15:48,206 INFO L290 TraceCheckUtils]: 38: Hoare triple {4496#true} ~cond := #in~cond; {4496#true} is VALID [2022-04-28 07:15:48,206 INFO L272 TraceCheckUtils]: 37: Hoare triple {4693#(<= ~counter~0 6)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {4496#true} is VALID [2022-04-28 07:15:48,206 INFO L290 TraceCheckUtils]: 36: Hoare triple {4693#(<= ~counter~0 6)} assume !!(#t~post6 < 10);havoc #t~post6; {4693#(<= ~counter~0 6)} is VALID [2022-04-28 07:15:48,207 INFO L290 TraceCheckUtils]: 35: Hoare triple {4665#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4693#(<= ~counter~0 6)} is VALID [2022-04-28 07:15:48,207 INFO L290 TraceCheckUtils]: 34: Hoare triple {4665#(<= ~counter~0 5)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {4665#(<= ~counter~0 5)} is VALID [2022-04-28 07:15:48,207 INFO L290 TraceCheckUtils]: 33: Hoare triple {4665#(<= ~counter~0 5)} assume !!(0 != ~y3~0); {4665#(<= ~counter~0 5)} is VALID [2022-04-28 07:15:48,208 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4496#true} {4665#(<= ~counter~0 5)} #63#return; {4665#(<= ~counter~0 5)} is VALID [2022-04-28 07:15:48,208 INFO L290 TraceCheckUtils]: 31: Hoare triple {4496#true} assume true; {4496#true} is VALID [2022-04-28 07:15:48,208 INFO L290 TraceCheckUtils]: 30: Hoare triple {4496#true} assume !(0 == ~cond); {4496#true} is VALID [2022-04-28 07:15:48,208 INFO L290 TraceCheckUtils]: 29: Hoare triple {4496#true} ~cond := #in~cond; {4496#true} is VALID [2022-04-28 07:15:48,208 INFO L272 TraceCheckUtils]: 28: Hoare triple {4665#(<= ~counter~0 5)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {4496#true} is VALID [2022-04-28 07:15:48,209 INFO L290 TraceCheckUtils]: 27: Hoare triple {4665#(<= ~counter~0 5)} assume !!(#t~post6 < 10);havoc #t~post6; {4665#(<= ~counter~0 5)} is VALID [2022-04-28 07:15:48,209 INFO L290 TraceCheckUtils]: 26: Hoare triple {4637#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4665#(<= ~counter~0 5)} is VALID [2022-04-28 07:15:48,209 INFO L290 TraceCheckUtils]: 25: Hoare triple {4637#(<= ~counter~0 4)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {4637#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:48,210 INFO L290 TraceCheckUtils]: 24: Hoare triple {4637#(<= ~counter~0 4)} assume !!(0 != ~y3~0); {4637#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:48,210 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4496#true} {4637#(<= ~counter~0 4)} #63#return; {4637#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:48,210 INFO L290 TraceCheckUtils]: 22: Hoare triple {4496#true} assume true; {4496#true} is VALID [2022-04-28 07:15:48,210 INFO L290 TraceCheckUtils]: 21: Hoare triple {4496#true} assume !(0 == ~cond); {4496#true} is VALID [2022-04-28 07:15:48,210 INFO L290 TraceCheckUtils]: 20: Hoare triple {4496#true} ~cond := #in~cond; {4496#true} is VALID [2022-04-28 07:15:48,210 INFO L272 TraceCheckUtils]: 19: Hoare triple {4637#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {4496#true} is VALID [2022-04-28 07:15:48,211 INFO L290 TraceCheckUtils]: 18: Hoare triple {4637#(<= ~counter~0 4)} assume !!(#t~post6 < 10);havoc #t~post6; {4637#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:48,211 INFO L290 TraceCheckUtils]: 17: Hoare triple {4609#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4637#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:48,211 INFO L290 TraceCheckUtils]: 16: Hoare triple {4609#(<= ~counter~0 3)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {4609#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:48,212 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4496#true} {4609#(<= ~counter~0 3)} #61#return; {4609#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:48,212 INFO L290 TraceCheckUtils]: 14: Hoare triple {4496#true} assume true; {4496#true} is VALID [2022-04-28 07:15:48,212 INFO L290 TraceCheckUtils]: 13: Hoare triple {4496#true} assume !(0 == ~cond); {4496#true} is VALID [2022-04-28 07:15:48,212 INFO L290 TraceCheckUtils]: 12: Hoare triple {4496#true} ~cond := #in~cond; {4496#true} is VALID [2022-04-28 07:15:48,212 INFO L272 TraceCheckUtils]: 11: Hoare triple {4609#(<= ~counter~0 3)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {4496#true} is VALID [2022-04-28 07:15:48,212 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4496#true} {4609#(<= ~counter~0 3)} #59#return; {4609#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:48,212 INFO L290 TraceCheckUtils]: 9: Hoare triple {4496#true} assume true; {4496#true} is VALID [2022-04-28 07:15:48,212 INFO L290 TraceCheckUtils]: 8: Hoare triple {4496#true} assume !(0 == ~cond); {4496#true} is VALID [2022-04-28 07:15:48,213 INFO L290 TraceCheckUtils]: 7: Hoare triple {4496#true} ~cond := #in~cond; {4496#true} is VALID [2022-04-28 07:15:48,213 INFO L272 TraceCheckUtils]: 6: Hoare triple {4609#(<= ~counter~0 3)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {4496#true} is VALID [2022-04-28 07:15:48,213 INFO L290 TraceCheckUtils]: 5: Hoare triple {4609#(<= ~counter~0 3)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {4609#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:48,213 INFO L272 TraceCheckUtils]: 4: Hoare triple {4609#(<= ~counter~0 3)} call #t~ret7 := main(); {4609#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:48,213 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4609#(<= ~counter~0 3)} {4496#true} #67#return; {4609#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:48,214 INFO L290 TraceCheckUtils]: 2: Hoare triple {4609#(<= ~counter~0 3)} assume true; {4609#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:48,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {4496#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4609#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:48,214 INFO L272 TraceCheckUtils]: 0: Hoare triple {4496#true} call ULTIMATE.init(); {4496#true} is VALID [2022-04-28 07:15:48,214 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 12 proven. 87 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-28 07:15:48,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:15:48,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752199507] [2022-04-28 07:15:48,215 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:15:48,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868712708] [2022-04-28 07:15:48,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868712708] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:15:48,215 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:15:48,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2022-04-28 07:15:48,215 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:15:48,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1510715318] [2022-04-28 07:15:48,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1510715318] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:15:48,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:15:48,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 07:15:48,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166495603] [2022-04-28 07:15:48,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:15:48,216 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) Word has length 77 [2022-04-28 07:15:48,216 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:15:48,216 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 07:15:48,267 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:15:48,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 07:15:48,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:15:48,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 07:15:48,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 07:15:48,268 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 07:15:48,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:15:48,511 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2022-04-28 07:15:48,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 07:15:48,511 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) Word has length 77 [2022-04-28 07:15:48,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:15:48,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 07:15:48,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 95 transitions. [2022-04-28 07:15:48,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 07:15:48,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 95 transitions. [2022-04-28 07:15:48,515 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 95 transitions. [2022-04-28 07:15:48,576 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:15:48,577 INFO L225 Difference]: With dead ends: 88 [2022-04-28 07:15:48,577 INFO L226 Difference]: Without dead ends: 83 [2022-04-28 07:15:48,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 140 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=149, Invalid=231, Unknown=0, NotChecked=0, Total=380 [2022-04-28 07:15:48,578 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 29 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 07:15:48,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 124 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 07:15:48,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-04-28 07:15:48,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-04-28 07:15:48,642 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:15:48,643 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand has 83 states, 61 states have (on average 1.1311475409836065) internal successors, (69), 61 states have internal predecessors, (69), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 07:15:48,643 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand has 83 states, 61 states have (on average 1.1311475409836065) internal successors, (69), 61 states have internal predecessors, (69), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 07:15:48,643 INFO L87 Difference]: Start difference. First operand 83 states. Second operand has 83 states, 61 states have (on average 1.1311475409836065) internal successors, (69), 61 states have internal predecessors, (69), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 07:15:48,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:15:48,645 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2022-04-28 07:15:48,645 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2022-04-28 07:15:48,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:15:48,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:15:48,645 INFO L74 IsIncluded]: Start isIncluded. First operand has 83 states, 61 states have (on average 1.1311475409836065) internal successors, (69), 61 states have internal predecessors, (69), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 83 states. [2022-04-28 07:15:48,645 INFO L87 Difference]: Start difference. First operand has 83 states, 61 states have (on average 1.1311475409836065) internal successors, (69), 61 states have internal predecessors, (69), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 83 states. [2022-04-28 07:15:48,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:15:48,651 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2022-04-28 07:15:48,651 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2022-04-28 07:15:48,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:15:48,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:15:48,651 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:15:48,651 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:15:48,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 61 states have (on average 1.1311475409836065) internal successors, (69), 61 states have internal predecessors, (69), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 07:15:48,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2022-04-28 07:15:48,653 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 91 transitions. Word has length 77 [2022-04-28 07:15:48,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:15:48,653 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 91 transitions. [2022-04-28 07:15:48,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 07:15:48,653 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 83 states and 91 transitions. [2022-04-28 07:15:48,730 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:15:48,730 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2022-04-28 07:15:48,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-28 07:15:48,730 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:15:48,730 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:15:48,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-28 07:15:48,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-28 07:15:48,940 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:15:48,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:15:48,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1848611036, now seen corresponding path program 13 times [2022-04-28 07:15:48,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:15:48,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1521736410] [2022-04-28 07:15:48,942 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:15:48,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1848611036, now seen corresponding path program 14 times [2022-04-28 07:15:48,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:15:48,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849768223] [2022-04-28 07:15:48,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:15:48,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:15:48,973 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:15:48,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1244865996] [2022-04-28 07:15:48,974 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:15:48,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:15:48,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:15:48,975 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:15:48,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-28 07:15:49,019 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:15:49,019 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:15:49,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 07:15:49,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:15:49,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:15:49,410 INFO L272 TraceCheckUtils]: 0: Hoare triple {5491#true} call ULTIMATE.init(); {5491#true} is VALID [2022-04-28 07:15:49,410 INFO L290 TraceCheckUtils]: 1: Hoare triple {5491#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5499#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:49,410 INFO L290 TraceCheckUtils]: 2: Hoare triple {5499#(<= ~counter~0 0)} assume true; {5499#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:49,411 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5499#(<= ~counter~0 0)} {5491#true} #67#return; {5499#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:49,411 INFO L272 TraceCheckUtils]: 4: Hoare triple {5499#(<= ~counter~0 0)} call #t~ret7 := main(); {5499#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:49,411 INFO L290 TraceCheckUtils]: 5: Hoare triple {5499#(<= ~counter~0 0)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {5499#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:49,412 INFO L272 TraceCheckUtils]: 6: Hoare triple {5499#(<= ~counter~0 0)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {5499#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:49,412 INFO L290 TraceCheckUtils]: 7: Hoare triple {5499#(<= ~counter~0 0)} ~cond := #in~cond; {5499#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:49,412 INFO L290 TraceCheckUtils]: 8: Hoare triple {5499#(<= ~counter~0 0)} assume !(0 == ~cond); {5499#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:49,412 INFO L290 TraceCheckUtils]: 9: Hoare triple {5499#(<= ~counter~0 0)} assume true; {5499#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:49,413 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5499#(<= ~counter~0 0)} {5499#(<= ~counter~0 0)} #59#return; {5499#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:49,413 INFO L272 TraceCheckUtils]: 11: Hoare triple {5499#(<= ~counter~0 0)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {5499#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:49,413 INFO L290 TraceCheckUtils]: 12: Hoare triple {5499#(<= ~counter~0 0)} ~cond := #in~cond; {5499#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:49,413 INFO L290 TraceCheckUtils]: 13: Hoare triple {5499#(<= ~counter~0 0)} assume !(0 == ~cond); {5499#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:49,414 INFO L290 TraceCheckUtils]: 14: Hoare triple {5499#(<= ~counter~0 0)} assume true; {5499#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:49,414 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5499#(<= ~counter~0 0)} {5499#(<= ~counter~0 0)} #61#return; {5499#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:49,414 INFO L290 TraceCheckUtils]: 16: Hoare triple {5499#(<= ~counter~0 0)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {5499#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:49,415 INFO L290 TraceCheckUtils]: 17: Hoare triple {5499#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5548#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:49,415 INFO L290 TraceCheckUtils]: 18: Hoare triple {5548#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {5548#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:49,415 INFO L272 TraceCheckUtils]: 19: Hoare triple {5548#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {5548#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:49,416 INFO L290 TraceCheckUtils]: 20: Hoare triple {5548#(<= ~counter~0 1)} ~cond := #in~cond; {5548#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:49,416 INFO L290 TraceCheckUtils]: 21: Hoare triple {5548#(<= ~counter~0 1)} assume !(0 == ~cond); {5548#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:49,416 INFO L290 TraceCheckUtils]: 22: Hoare triple {5548#(<= ~counter~0 1)} assume true; {5548#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:49,417 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5548#(<= ~counter~0 1)} {5548#(<= ~counter~0 1)} #63#return; {5548#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:49,417 INFO L290 TraceCheckUtils]: 24: Hoare triple {5548#(<= ~counter~0 1)} assume !!(0 != ~y3~0); {5548#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:49,417 INFO L290 TraceCheckUtils]: 25: Hoare triple {5548#(<= ~counter~0 1)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {5548#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:49,417 INFO L290 TraceCheckUtils]: 26: Hoare triple {5548#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5576#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:49,418 INFO L290 TraceCheckUtils]: 27: Hoare triple {5576#(<= ~counter~0 2)} assume !!(#t~post6 < 10);havoc #t~post6; {5576#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:49,418 INFO L272 TraceCheckUtils]: 28: Hoare triple {5576#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {5576#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:49,418 INFO L290 TraceCheckUtils]: 29: Hoare triple {5576#(<= ~counter~0 2)} ~cond := #in~cond; {5576#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:49,419 INFO L290 TraceCheckUtils]: 30: Hoare triple {5576#(<= ~counter~0 2)} assume !(0 == ~cond); {5576#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:49,419 INFO L290 TraceCheckUtils]: 31: Hoare triple {5576#(<= ~counter~0 2)} assume true; {5576#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:49,419 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5576#(<= ~counter~0 2)} {5576#(<= ~counter~0 2)} #63#return; {5576#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:49,420 INFO L290 TraceCheckUtils]: 33: Hoare triple {5576#(<= ~counter~0 2)} assume !!(0 != ~y3~0); {5576#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:49,420 INFO L290 TraceCheckUtils]: 34: Hoare triple {5576#(<= ~counter~0 2)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {5576#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:49,420 INFO L290 TraceCheckUtils]: 35: Hoare triple {5576#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5604#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:49,420 INFO L290 TraceCheckUtils]: 36: Hoare triple {5604#(<= ~counter~0 3)} assume !!(#t~post6 < 10);havoc #t~post6; {5604#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:49,423 INFO L272 TraceCheckUtils]: 37: Hoare triple {5604#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {5604#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:49,423 INFO L290 TraceCheckUtils]: 38: Hoare triple {5604#(<= ~counter~0 3)} ~cond := #in~cond; {5604#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:49,424 INFO L290 TraceCheckUtils]: 39: Hoare triple {5604#(<= ~counter~0 3)} assume !(0 == ~cond); {5604#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:49,424 INFO L290 TraceCheckUtils]: 40: Hoare triple {5604#(<= ~counter~0 3)} assume true; {5604#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:49,440 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {5604#(<= ~counter~0 3)} {5604#(<= ~counter~0 3)} #63#return; {5604#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:49,440 INFO L290 TraceCheckUtils]: 42: Hoare triple {5604#(<= ~counter~0 3)} assume !!(0 != ~y3~0); {5604#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:49,440 INFO L290 TraceCheckUtils]: 43: Hoare triple {5604#(<= ~counter~0 3)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {5604#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:49,441 INFO L290 TraceCheckUtils]: 44: Hoare triple {5604#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5632#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:49,441 INFO L290 TraceCheckUtils]: 45: Hoare triple {5632#(<= ~counter~0 4)} assume !!(#t~post6 < 10);havoc #t~post6; {5632#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:49,442 INFO L272 TraceCheckUtils]: 46: Hoare triple {5632#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {5632#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:49,442 INFO L290 TraceCheckUtils]: 47: Hoare triple {5632#(<= ~counter~0 4)} ~cond := #in~cond; {5632#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:49,442 INFO L290 TraceCheckUtils]: 48: Hoare triple {5632#(<= ~counter~0 4)} assume !(0 == ~cond); {5632#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:49,442 INFO L290 TraceCheckUtils]: 49: Hoare triple {5632#(<= ~counter~0 4)} assume true; {5632#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:49,443 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5632#(<= ~counter~0 4)} {5632#(<= ~counter~0 4)} #63#return; {5632#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:49,443 INFO L290 TraceCheckUtils]: 51: Hoare triple {5632#(<= ~counter~0 4)} assume !!(0 != ~y3~0); {5632#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:49,443 INFO L290 TraceCheckUtils]: 52: Hoare triple {5632#(<= ~counter~0 4)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {5632#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:49,444 INFO L290 TraceCheckUtils]: 53: Hoare triple {5632#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5660#(<= ~counter~0 5)} is VALID [2022-04-28 07:15:49,444 INFO L290 TraceCheckUtils]: 54: Hoare triple {5660#(<= ~counter~0 5)} assume !!(#t~post6 < 10);havoc #t~post6; {5660#(<= ~counter~0 5)} is VALID [2022-04-28 07:15:49,445 INFO L272 TraceCheckUtils]: 55: Hoare triple {5660#(<= ~counter~0 5)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {5660#(<= ~counter~0 5)} is VALID [2022-04-28 07:15:49,445 INFO L290 TraceCheckUtils]: 56: Hoare triple {5660#(<= ~counter~0 5)} ~cond := #in~cond; {5660#(<= ~counter~0 5)} is VALID [2022-04-28 07:15:49,445 INFO L290 TraceCheckUtils]: 57: Hoare triple {5660#(<= ~counter~0 5)} assume !(0 == ~cond); {5660#(<= ~counter~0 5)} is VALID [2022-04-28 07:15:49,445 INFO L290 TraceCheckUtils]: 58: Hoare triple {5660#(<= ~counter~0 5)} assume true; {5660#(<= ~counter~0 5)} is VALID [2022-04-28 07:15:49,446 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {5660#(<= ~counter~0 5)} {5660#(<= ~counter~0 5)} #63#return; {5660#(<= ~counter~0 5)} is VALID [2022-04-28 07:15:49,446 INFO L290 TraceCheckUtils]: 60: Hoare triple {5660#(<= ~counter~0 5)} assume !!(0 != ~y3~0); {5660#(<= ~counter~0 5)} is VALID [2022-04-28 07:15:49,446 INFO L290 TraceCheckUtils]: 61: Hoare triple {5660#(<= ~counter~0 5)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {5660#(<= ~counter~0 5)} is VALID [2022-04-28 07:15:49,447 INFO L290 TraceCheckUtils]: 62: Hoare triple {5660#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5688#(<= ~counter~0 6)} is VALID [2022-04-28 07:15:49,447 INFO L290 TraceCheckUtils]: 63: Hoare triple {5688#(<= ~counter~0 6)} assume !!(#t~post6 < 10);havoc #t~post6; {5688#(<= ~counter~0 6)} is VALID [2022-04-28 07:15:49,447 INFO L272 TraceCheckUtils]: 64: Hoare triple {5688#(<= ~counter~0 6)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {5688#(<= ~counter~0 6)} is VALID [2022-04-28 07:15:49,448 INFO L290 TraceCheckUtils]: 65: Hoare triple {5688#(<= ~counter~0 6)} ~cond := #in~cond; {5688#(<= ~counter~0 6)} is VALID [2022-04-28 07:15:49,448 INFO L290 TraceCheckUtils]: 66: Hoare triple {5688#(<= ~counter~0 6)} assume !(0 == ~cond); {5688#(<= ~counter~0 6)} is VALID [2022-04-28 07:15:49,448 INFO L290 TraceCheckUtils]: 67: Hoare triple {5688#(<= ~counter~0 6)} assume true; {5688#(<= ~counter~0 6)} is VALID [2022-04-28 07:15:49,449 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {5688#(<= ~counter~0 6)} {5688#(<= ~counter~0 6)} #63#return; {5688#(<= ~counter~0 6)} is VALID [2022-04-28 07:15:49,449 INFO L290 TraceCheckUtils]: 69: Hoare triple {5688#(<= ~counter~0 6)} assume !!(0 != ~y3~0); {5688#(<= ~counter~0 6)} is VALID [2022-04-28 07:15:49,449 INFO L290 TraceCheckUtils]: 70: Hoare triple {5688#(<= ~counter~0 6)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {5688#(<= ~counter~0 6)} is VALID [2022-04-28 07:15:49,450 INFO L290 TraceCheckUtils]: 71: Hoare triple {5688#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5716#(<= ~counter~0 7)} is VALID [2022-04-28 07:15:49,450 INFO L290 TraceCheckUtils]: 72: Hoare triple {5716#(<= ~counter~0 7)} assume !!(#t~post6 < 10);havoc #t~post6; {5716#(<= ~counter~0 7)} is VALID [2022-04-28 07:15:49,450 INFO L272 TraceCheckUtils]: 73: Hoare triple {5716#(<= ~counter~0 7)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {5716#(<= ~counter~0 7)} is VALID [2022-04-28 07:15:49,450 INFO L290 TraceCheckUtils]: 74: Hoare triple {5716#(<= ~counter~0 7)} ~cond := #in~cond; {5716#(<= ~counter~0 7)} is VALID [2022-04-28 07:15:49,451 INFO L290 TraceCheckUtils]: 75: Hoare triple {5716#(<= ~counter~0 7)} assume !(0 == ~cond); {5716#(<= ~counter~0 7)} is VALID [2022-04-28 07:15:49,451 INFO L290 TraceCheckUtils]: 76: Hoare triple {5716#(<= ~counter~0 7)} assume true; {5716#(<= ~counter~0 7)} is VALID [2022-04-28 07:15:49,451 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {5716#(<= ~counter~0 7)} {5716#(<= ~counter~0 7)} #63#return; {5716#(<= ~counter~0 7)} is VALID [2022-04-28 07:15:49,452 INFO L290 TraceCheckUtils]: 78: Hoare triple {5716#(<= ~counter~0 7)} assume !!(0 != ~y3~0); {5716#(<= ~counter~0 7)} is VALID [2022-04-28 07:15:49,452 INFO L290 TraceCheckUtils]: 79: Hoare triple {5716#(<= ~counter~0 7)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {5716#(<= ~counter~0 7)} is VALID [2022-04-28 07:15:49,452 INFO L290 TraceCheckUtils]: 80: Hoare triple {5716#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5744#(<= |main_#t~post6| 7)} is VALID [2022-04-28 07:15:49,453 INFO L290 TraceCheckUtils]: 81: Hoare triple {5744#(<= |main_#t~post6| 7)} assume !(#t~post6 < 10);havoc #t~post6; {5492#false} is VALID [2022-04-28 07:15:49,453 INFO L272 TraceCheckUtils]: 82: Hoare triple {5492#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {5492#false} is VALID [2022-04-28 07:15:49,453 INFO L290 TraceCheckUtils]: 83: Hoare triple {5492#false} ~cond := #in~cond; {5492#false} is VALID [2022-04-28 07:15:49,453 INFO L290 TraceCheckUtils]: 84: Hoare triple {5492#false} assume 0 == ~cond; {5492#false} is VALID [2022-04-28 07:15:49,453 INFO L290 TraceCheckUtils]: 85: Hoare triple {5492#false} assume !false; {5492#false} is VALID [2022-04-28 07:15:49,453 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 14 proven. 203 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 07:15:49,453 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:15:49,795 INFO L290 TraceCheckUtils]: 85: Hoare triple {5492#false} assume !false; {5492#false} is VALID [2022-04-28 07:15:49,795 INFO L290 TraceCheckUtils]: 84: Hoare triple {5492#false} assume 0 == ~cond; {5492#false} is VALID [2022-04-28 07:15:49,795 INFO L290 TraceCheckUtils]: 83: Hoare triple {5492#false} ~cond := #in~cond; {5492#false} is VALID [2022-04-28 07:15:49,795 INFO L272 TraceCheckUtils]: 82: Hoare triple {5492#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {5492#false} is VALID [2022-04-28 07:15:49,796 INFO L290 TraceCheckUtils]: 81: Hoare triple {5772#(< |main_#t~post6| 10)} assume !(#t~post6 < 10);havoc #t~post6; {5492#false} is VALID [2022-04-28 07:15:49,796 INFO L290 TraceCheckUtils]: 80: Hoare triple {5776#(< ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5772#(< |main_#t~post6| 10)} is VALID [2022-04-28 07:15:49,796 INFO L290 TraceCheckUtils]: 79: Hoare triple {5776#(< ~counter~0 10)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {5776#(< ~counter~0 10)} is VALID [2022-04-28 07:15:49,797 INFO L290 TraceCheckUtils]: 78: Hoare triple {5776#(< ~counter~0 10)} assume !!(0 != ~y3~0); {5776#(< ~counter~0 10)} is VALID [2022-04-28 07:15:49,797 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {5491#true} {5776#(< ~counter~0 10)} #63#return; {5776#(< ~counter~0 10)} is VALID [2022-04-28 07:15:49,797 INFO L290 TraceCheckUtils]: 76: Hoare triple {5491#true} assume true; {5491#true} is VALID [2022-04-28 07:15:49,797 INFO L290 TraceCheckUtils]: 75: Hoare triple {5491#true} assume !(0 == ~cond); {5491#true} is VALID [2022-04-28 07:15:49,797 INFO L290 TraceCheckUtils]: 74: Hoare triple {5491#true} ~cond := #in~cond; {5491#true} is VALID [2022-04-28 07:15:49,798 INFO L272 TraceCheckUtils]: 73: Hoare triple {5776#(< ~counter~0 10)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {5491#true} is VALID [2022-04-28 07:15:49,798 INFO L290 TraceCheckUtils]: 72: Hoare triple {5776#(< ~counter~0 10)} assume !!(#t~post6 < 10);havoc #t~post6; {5776#(< ~counter~0 10)} is VALID [2022-04-28 07:15:49,798 INFO L290 TraceCheckUtils]: 71: Hoare triple {5804#(< ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5776#(< ~counter~0 10)} is VALID [2022-04-28 07:15:49,799 INFO L290 TraceCheckUtils]: 70: Hoare triple {5804#(< ~counter~0 9)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {5804#(< ~counter~0 9)} is VALID [2022-04-28 07:15:49,799 INFO L290 TraceCheckUtils]: 69: Hoare triple {5804#(< ~counter~0 9)} assume !!(0 != ~y3~0); {5804#(< ~counter~0 9)} is VALID [2022-04-28 07:15:49,799 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {5491#true} {5804#(< ~counter~0 9)} #63#return; {5804#(< ~counter~0 9)} is VALID [2022-04-28 07:15:49,799 INFO L290 TraceCheckUtils]: 67: Hoare triple {5491#true} assume true; {5491#true} is VALID [2022-04-28 07:15:49,799 INFO L290 TraceCheckUtils]: 66: Hoare triple {5491#true} assume !(0 == ~cond); {5491#true} is VALID [2022-04-28 07:15:49,800 INFO L290 TraceCheckUtils]: 65: Hoare triple {5491#true} ~cond := #in~cond; {5491#true} is VALID [2022-04-28 07:15:49,800 INFO L272 TraceCheckUtils]: 64: Hoare triple {5804#(< ~counter~0 9)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {5491#true} is VALID [2022-04-28 07:15:49,800 INFO L290 TraceCheckUtils]: 63: Hoare triple {5804#(< ~counter~0 9)} assume !!(#t~post6 < 10);havoc #t~post6; {5804#(< ~counter~0 9)} is VALID [2022-04-28 07:15:49,800 INFO L290 TraceCheckUtils]: 62: Hoare triple {5716#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5804#(< ~counter~0 9)} is VALID [2022-04-28 07:15:49,801 INFO L290 TraceCheckUtils]: 61: Hoare triple {5716#(<= ~counter~0 7)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {5716#(<= ~counter~0 7)} is VALID [2022-04-28 07:15:49,801 INFO L290 TraceCheckUtils]: 60: Hoare triple {5716#(<= ~counter~0 7)} assume !!(0 != ~y3~0); {5716#(<= ~counter~0 7)} is VALID [2022-04-28 07:15:49,801 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {5491#true} {5716#(<= ~counter~0 7)} #63#return; {5716#(<= ~counter~0 7)} is VALID [2022-04-28 07:15:49,801 INFO L290 TraceCheckUtils]: 58: Hoare triple {5491#true} assume true; {5491#true} is VALID [2022-04-28 07:15:49,801 INFO L290 TraceCheckUtils]: 57: Hoare triple {5491#true} assume !(0 == ~cond); {5491#true} is VALID [2022-04-28 07:15:49,802 INFO L290 TraceCheckUtils]: 56: Hoare triple {5491#true} ~cond := #in~cond; {5491#true} is VALID [2022-04-28 07:15:49,802 INFO L272 TraceCheckUtils]: 55: Hoare triple {5716#(<= ~counter~0 7)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {5491#true} is VALID [2022-04-28 07:15:49,802 INFO L290 TraceCheckUtils]: 54: Hoare triple {5716#(<= ~counter~0 7)} assume !!(#t~post6 < 10);havoc #t~post6; {5716#(<= ~counter~0 7)} is VALID [2022-04-28 07:15:49,802 INFO L290 TraceCheckUtils]: 53: Hoare triple {5688#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5716#(<= ~counter~0 7)} is VALID [2022-04-28 07:15:49,803 INFO L290 TraceCheckUtils]: 52: Hoare triple {5688#(<= ~counter~0 6)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {5688#(<= ~counter~0 6)} is VALID [2022-04-28 07:15:49,803 INFO L290 TraceCheckUtils]: 51: Hoare triple {5688#(<= ~counter~0 6)} assume !!(0 != ~y3~0); {5688#(<= ~counter~0 6)} is VALID [2022-04-28 07:15:49,803 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5491#true} {5688#(<= ~counter~0 6)} #63#return; {5688#(<= ~counter~0 6)} is VALID [2022-04-28 07:15:49,803 INFO L290 TraceCheckUtils]: 49: Hoare triple {5491#true} assume true; {5491#true} is VALID [2022-04-28 07:15:49,803 INFO L290 TraceCheckUtils]: 48: Hoare triple {5491#true} assume !(0 == ~cond); {5491#true} is VALID [2022-04-28 07:15:49,804 INFO L290 TraceCheckUtils]: 47: Hoare triple {5491#true} ~cond := #in~cond; {5491#true} is VALID [2022-04-28 07:15:49,804 INFO L272 TraceCheckUtils]: 46: Hoare triple {5688#(<= ~counter~0 6)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {5491#true} is VALID [2022-04-28 07:15:49,804 INFO L290 TraceCheckUtils]: 45: Hoare triple {5688#(<= ~counter~0 6)} assume !!(#t~post6 < 10);havoc #t~post6; {5688#(<= ~counter~0 6)} is VALID [2022-04-28 07:15:49,804 INFO L290 TraceCheckUtils]: 44: Hoare triple {5660#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5688#(<= ~counter~0 6)} is VALID [2022-04-28 07:15:49,805 INFO L290 TraceCheckUtils]: 43: Hoare triple {5660#(<= ~counter~0 5)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {5660#(<= ~counter~0 5)} is VALID [2022-04-28 07:15:49,805 INFO L290 TraceCheckUtils]: 42: Hoare triple {5660#(<= ~counter~0 5)} assume !!(0 != ~y3~0); {5660#(<= ~counter~0 5)} is VALID [2022-04-28 07:15:49,805 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {5491#true} {5660#(<= ~counter~0 5)} #63#return; {5660#(<= ~counter~0 5)} is VALID [2022-04-28 07:15:49,805 INFO L290 TraceCheckUtils]: 40: Hoare triple {5491#true} assume true; {5491#true} is VALID [2022-04-28 07:15:49,806 INFO L290 TraceCheckUtils]: 39: Hoare triple {5491#true} assume !(0 == ~cond); {5491#true} is VALID [2022-04-28 07:15:49,806 INFO L290 TraceCheckUtils]: 38: Hoare triple {5491#true} ~cond := #in~cond; {5491#true} is VALID [2022-04-28 07:15:49,806 INFO L272 TraceCheckUtils]: 37: Hoare triple {5660#(<= ~counter~0 5)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {5491#true} is VALID [2022-04-28 07:15:49,806 INFO L290 TraceCheckUtils]: 36: Hoare triple {5660#(<= ~counter~0 5)} assume !!(#t~post6 < 10);havoc #t~post6; {5660#(<= ~counter~0 5)} is VALID [2022-04-28 07:15:49,806 INFO L290 TraceCheckUtils]: 35: Hoare triple {5632#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5660#(<= ~counter~0 5)} is VALID [2022-04-28 07:15:49,809 INFO L290 TraceCheckUtils]: 34: Hoare triple {5632#(<= ~counter~0 4)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {5632#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:49,809 INFO L290 TraceCheckUtils]: 33: Hoare triple {5632#(<= ~counter~0 4)} assume !!(0 != ~y3~0); {5632#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:49,809 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5491#true} {5632#(<= ~counter~0 4)} #63#return; {5632#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:49,809 INFO L290 TraceCheckUtils]: 31: Hoare triple {5491#true} assume true; {5491#true} is VALID [2022-04-28 07:15:49,810 INFO L290 TraceCheckUtils]: 30: Hoare triple {5491#true} assume !(0 == ~cond); {5491#true} is VALID [2022-04-28 07:15:49,810 INFO L290 TraceCheckUtils]: 29: Hoare triple {5491#true} ~cond := #in~cond; {5491#true} is VALID [2022-04-28 07:15:49,810 INFO L272 TraceCheckUtils]: 28: Hoare triple {5632#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {5491#true} is VALID [2022-04-28 07:15:49,810 INFO L290 TraceCheckUtils]: 27: Hoare triple {5632#(<= ~counter~0 4)} assume !!(#t~post6 < 10);havoc #t~post6; {5632#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:49,810 INFO L290 TraceCheckUtils]: 26: Hoare triple {5604#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5632#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:49,811 INFO L290 TraceCheckUtils]: 25: Hoare triple {5604#(<= ~counter~0 3)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {5604#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:49,811 INFO L290 TraceCheckUtils]: 24: Hoare triple {5604#(<= ~counter~0 3)} assume !!(0 != ~y3~0); {5604#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:49,811 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5491#true} {5604#(<= ~counter~0 3)} #63#return; {5604#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:49,811 INFO L290 TraceCheckUtils]: 22: Hoare triple {5491#true} assume true; {5491#true} is VALID [2022-04-28 07:15:49,812 INFO L290 TraceCheckUtils]: 21: Hoare triple {5491#true} assume !(0 == ~cond); {5491#true} is VALID [2022-04-28 07:15:49,812 INFO L290 TraceCheckUtils]: 20: Hoare triple {5491#true} ~cond := #in~cond; {5491#true} is VALID [2022-04-28 07:15:49,812 INFO L272 TraceCheckUtils]: 19: Hoare triple {5604#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {5491#true} is VALID [2022-04-28 07:15:49,812 INFO L290 TraceCheckUtils]: 18: Hoare triple {5604#(<= ~counter~0 3)} assume !!(#t~post6 < 10);havoc #t~post6; {5604#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:49,812 INFO L290 TraceCheckUtils]: 17: Hoare triple {5576#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5604#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:49,812 INFO L290 TraceCheckUtils]: 16: Hoare triple {5576#(<= ~counter~0 2)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {5576#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:49,813 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5491#true} {5576#(<= ~counter~0 2)} #61#return; {5576#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:49,813 INFO L290 TraceCheckUtils]: 14: Hoare triple {5491#true} assume true; {5491#true} is VALID [2022-04-28 07:15:49,813 INFO L290 TraceCheckUtils]: 13: Hoare triple {5491#true} assume !(0 == ~cond); {5491#true} is VALID [2022-04-28 07:15:49,813 INFO L290 TraceCheckUtils]: 12: Hoare triple {5491#true} ~cond := #in~cond; {5491#true} is VALID [2022-04-28 07:15:49,813 INFO L272 TraceCheckUtils]: 11: Hoare triple {5576#(<= ~counter~0 2)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {5491#true} is VALID [2022-04-28 07:15:49,813 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5491#true} {5576#(<= ~counter~0 2)} #59#return; {5576#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:49,813 INFO L290 TraceCheckUtils]: 9: Hoare triple {5491#true} assume true; {5491#true} is VALID [2022-04-28 07:15:49,813 INFO L290 TraceCheckUtils]: 8: Hoare triple {5491#true} assume !(0 == ~cond); {5491#true} is VALID [2022-04-28 07:15:49,813 INFO L290 TraceCheckUtils]: 7: Hoare triple {5491#true} ~cond := #in~cond; {5491#true} is VALID [2022-04-28 07:15:49,813 INFO L272 TraceCheckUtils]: 6: Hoare triple {5576#(<= ~counter~0 2)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {5491#true} is VALID [2022-04-28 07:15:49,814 INFO L290 TraceCheckUtils]: 5: Hoare triple {5576#(<= ~counter~0 2)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {5576#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:49,814 INFO L272 TraceCheckUtils]: 4: Hoare triple {5576#(<= ~counter~0 2)} call #t~ret7 := main(); {5576#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:49,814 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5576#(<= ~counter~0 2)} {5491#true} #67#return; {5576#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:49,814 INFO L290 TraceCheckUtils]: 2: Hoare triple {5576#(<= ~counter~0 2)} assume true; {5576#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:49,815 INFO L290 TraceCheckUtils]: 1: Hoare triple {5491#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5576#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:49,815 INFO L272 TraceCheckUtils]: 0: Hoare triple {5491#true} call ULTIMATE.init(); {5491#true} is VALID [2022-04-28 07:15:49,815 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 14 proven. 119 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-04-28 07:15:49,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:15:49,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849768223] [2022-04-28 07:15:49,815 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:15:49,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244865996] [2022-04-28 07:15:49,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1244865996] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:15:49,816 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:15:49,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2022-04-28 07:15:49,816 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:15:49,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1521736410] [2022-04-28 07:15:49,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1521736410] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:15:49,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:15:49,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 07:15:49,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743564913] [2022-04-28 07:15:49,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:15:49,819 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 10 states have internal predecessors, (61), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) Word has length 86 [2022-04-28 07:15:49,820 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:15:49,820 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 10 states have internal predecessors, (61), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 07:15:49,867 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:15:49,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 07:15:49,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:15:49,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 07:15:49,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 07:15:49,868 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. Second operand has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 10 states have internal predecessors, (61), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 07:15:50,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:15:50,140 INFO L93 Difference]: Finished difference Result 97 states and 106 transitions. [2022-04-28 07:15:50,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 07:15:50,140 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 10 states have internal predecessors, (61), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) Word has length 86 [2022-04-28 07:15:50,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:15:50,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 10 states have internal predecessors, (61), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 07:15:50,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 105 transitions. [2022-04-28 07:15:50,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 10 states have internal predecessors, (61), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 07:15:50,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 105 transitions. [2022-04-28 07:15:50,145 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 105 transitions. [2022-04-28 07:15:50,206 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-28 07:15:50,207 INFO L225 Difference]: With dead ends: 97 [2022-04-28 07:15:50,208 INFO L226 Difference]: Without dead ends: 92 [2022-04-28 07:15:50,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 158 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=162, Invalid=258, Unknown=0, NotChecked=0, Total=420 [2022-04-28 07:15:50,208 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 23 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 07:15:50,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 132 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 07:15:50,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-04-28 07:15:50,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-04-28 07:15:50,284 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:15:50,284 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand has 92 states, 68 states have (on average 1.1323529411764706) internal successors, (77), 68 states have internal predecessors, (77), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 07:15:50,284 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand has 92 states, 68 states have (on average 1.1323529411764706) internal successors, (77), 68 states have internal predecessors, (77), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 07:15:50,284 INFO L87 Difference]: Start difference. First operand 92 states. Second operand has 92 states, 68 states have (on average 1.1323529411764706) internal successors, (77), 68 states have internal predecessors, (77), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 07:15:50,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:15:50,285 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2022-04-28 07:15:50,285 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2022-04-28 07:15:50,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:15:50,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:15:50,286 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 68 states have (on average 1.1323529411764706) internal successors, (77), 68 states have internal predecessors, (77), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 92 states. [2022-04-28 07:15:50,286 INFO L87 Difference]: Start difference. First operand has 92 states, 68 states have (on average 1.1323529411764706) internal successors, (77), 68 states have internal predecessors, (77), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 92 states. [2022-04-28 07:15:50,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:15:50,287 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2022-04-28 07:15:50,287 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2022-04-28 07:15:50,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:15:50,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:15:50,288 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:15:50,288 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:15:50,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 68 states have (on average 1.1323529411764706) internal successors, (77), 68 states have internal predecessors, (77), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 07:15:50,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2022-04-28 07:15:50,289 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 86 [2022-04-28 07:15:50,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:15:50,289 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2022-04-28 07:15:50,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 10 states have internal predecessors, (61), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 07:15:50,289 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 92 states and 101 transitions. [2022-04-28 07:15:50,403 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-28 07:15:50,404 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2022-04-28 07:15:50,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-04-28 07:15:50,404 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:15:50,404 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:15:50,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-28 07:15:50,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-28 07:15:50,611 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:15:50,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:15:50,612 INFO L85 PathProgramCache]: Analyzing trace with hash -399923690, now seen corresponding path program 15 times [2022-04-28 07:15:50,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:15:50,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1379940946] [2022-04-28 07:15:50,612 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:15:50,612 INFO L85 PathProgramCache]: Analyzing trace with hash -399923690, now seen corresponding path program 16 times [2022-04-28 07:15:50,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:15:50,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121809827] [2022-04-28 07:15:50,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:15:50,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:15:50,637 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:15:50,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1021926038] [2022-04-28 07:15:50,637 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:15:50,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:15:50,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:15:50,641 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:15:50,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-28 07:15:50,690 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:15:50,691 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:15:50,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 07:15:50,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:15:50,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:15:51,101 INFO L272 TraceCheckUtils]: 0: Hoare triple {6596#true} call ULTIMATE.init(); {6596#true} is VALID [2022-04-28 07:15:51,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {6596#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6604#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:51,102 INFO L290 TraceCheckUtils]: 2: Hoare triple {6604#(<= ~counter~0 0)} assume true; {6604#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:51,102 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6604#(<= ~counter~0 0)} {6596#true} #67#return; {6604#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:51,102 INFO L272 TraceCheckUtils]: 4: Hoare triple {6604#(<= ~counter~0 0)} call #t~ret7 := main(); {6604#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:51,102 INFO L290 TraceCheckUtils]: 5: Hoare triple {6604#(<= ~counter~0 0)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {6604#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:51,103 INFO L272 TraceCheckUtils]: 6: Hoare triple {6604#(<= ~counter~0 0)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {6604#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:51,103 INFO L290 TraceCheckUtils]: 7: Hoare triple {6604#(<= ~counter~0 0)} ~cond := #in~cond; {6604#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:51,103 INFO L290 TraceCheckUtils]: 8: Hoare triple {6604#(<= ~counter~0 0)} assume !(0 == ~cond); {6604#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:51,103 INFO L290 TraceCheckUtils]: 9: Hoare triple {6604#(<= ~counter~0 0)} assume true; {6604#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:51,104 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6604#(<= ~counter~0 0)} {6604#(<= ~counter~0 0)} #59#return; {6604#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:51,104 INFO L272 TraceCheckUtils]: 11: Hoare triple {6604#(<= ~counter~0 0)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {6604#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:51,104 INFO L290 TraceCheckUtils]: 12: Hoare triple {6604#(<= ~counter~0 0)} ~cond := #in~cond; {6604#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:51,105 INFO L290 TraceCheckUtils]: 13: Hoare triple {6604#(<= ~counter~0 0)} assume !(0 == ~cond); {6604#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:51,105 INFO L290 TraceCheckUtils]: 14: Hoare triple {6604#(<= ~counter~0 0)} assume true; {6604#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:51,105 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6604#(<= ~counter~0 0)} {6604#(<= ~counter~0 0)} #61#return; {6604#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:51,105 INFO L290 TraceCheckUtils]: 16: Hoare triple {6604#(<= ~counter~0 0)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {6604#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:51,106 INFO L290 TraceCheckUtils]: 17: Hoare triple {6604#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6653#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:51,106 INFO L290 TraceCheckUtils]: 18: Hoare triple {6653#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {6653#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:51,107 INFO L272 TraceCheckUtils]: 19: Hoare triple {6653#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {6653#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:51,107 INFO L290 TraceCheckUtils]: 20: Hoare triple {6653#(<= ~counter~0 1)} ~cond := #in~cond; {6653#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:51,107 INFO L290 TraceCheckUtils]: 21: Hoare triple {6653#(<= ~counter~0 1)} assume !(0 == ~cond); {6653#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:51,107 INFO L290 TraceCheckUtils]: 22: Hoare triple {6653#(<= ~counter~0 1)} assume true; {6653#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:51,108 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6653#(<= ~counter~0 1)} {6653#(<= ~counter~0 1)} #63#return; {6653#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:51,108 INFO L290 TraceCheckUtils]: 24: Hoare triple {6653#(<= ~counter~0 1)} assume !!(0 != ~y3~0); {6653#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:51,108 INFO L290 TraceCheckUtils]: 25: Hoare triple {6653#(<= ~counter~0 1)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {6653#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:51,109 INFO L290 TraceCheckUtils]: 26: Hoare triple {6653#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6681#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:51,109 INFO L290 TraceCheckUtils]: 27: Hoare triple {6681#(<= ~counter~0 2)} assume !!(#t~post6 < 10);havoc #t~post6; {6681#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:51,109 INFO L272 TraceCheckUtils]: 28: Hoare triple {6681#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {6681#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:51,110 INFO L290 TraceCheckUtils]: 29: Hoare triple {6681#(<= ~counter~0 2)} ~cond := #in~cond; {6681#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:51,110 INFO L290 TraceCheckUtils]: 30: Hoare triple {6681#(<= ~counter~0 2)} assume !(0 == ~cond); {6681#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:51,110 INFO L290 TraceCheckUtils]: 31: Hoare triple {6681#(<= ~counter~0 2)} assume true; {6681#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:51,110 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6681#(<= ~counter~0 2)} {6681#(<= ~counter~0 2)} #63#return; {6681#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:51,111 INFO L290 TraceCheckUtils]: 33: Hoare triple {6681#(<= ~counter~0 2)} assume !!(0 != ~y3~0); {6681#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:51,111 INFO L290 TraceCheckUtils]: 34: Hoare triple {6681#(<= ~counter~0 2)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {6681#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:51,111 INFO L290 TraceCheckUtils]: 35: Hoare triple {6681#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6709#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:51,112 INFO L290 TraceCheckUtils]: 36: Hoare triple {6709#(<= ~counter~0 3)} assume !!(#t~post6 < 10);havoc #t~post6; {6709#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:51,112 INFO L272 TraceCheckUtils]: 37: Hoare triple {6709#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {6709#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:51,112 INFO L290 TraceCheckUtils]: 38: Hoare triple {6709#(<= ~counter~0 3)} ~cond := #in~cond; {6709#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:51,113 INFO L290 TraceCheckUtils]: 39: Hoare triple {6709#(<= ~counter~0 3)} assume !(0 == ~cond); {6709#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:51,113 INFO L290 TraceCheckUtils]: 40: Hoare triple {6709#(<= ~counter~0 3)} assume true; {6709#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:51,113 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {6709#(<= ~counter~0 3)} {6709#(<= ~counter~0 3)} #63#return; {6709#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:51,113 INFO L290 TraceCheckUtils]: 42: Hoare triple {6709#(<= ~counter~0 3)} assume !!(0 != ~y3~0); {6709#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:51,114 INFO L290 TraceCheckUtils]: 43: Hoare triple {6709#(<= ~counter~0 3)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {6709#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:51,114 INFO L290 TraceCheckUtils]: 44: Hoare triple {6709#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6737#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:51,114 INFO L290 TraceCheckUtils]: 45: Hoare triple {6737#(<= ~counter~0 4)} assume !!(#t~post6 < 10);havoc #t~post6; {6737#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:51,115 INFO L272 TraceCheckUtils]: 46: Hoare triple {6737#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {6737#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:51,115 INFO L290 TraceCheckUtils]: 47: Hoare triple {6737#(<= ~counter~0 4)} ~cond := #in~cond; {6737#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:51,115 INFO L290 TraceCheckUtils]: 48: Hoare triple {6737#(<= ~counter~0 4)} assume !(0 == ~cond); {6737#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:51,115 INFO L290 TraceCheckUtils]: 49: Hoare triple {6737#(<= ~counter~0 4)} assume true; {6737#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:51,116 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6737#(<= ~counter~0 4)} {6737#(<= ~counter~0 4)} #63#return; {6737#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:51,116 INFO L290 TraceCheckUtils]: 51: Hoare triple {6737#(<= ~counter~0 4)} assume !!(0 != ~y3~0); {6737#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:51,116 INFO L290 TraceCheckUtils]: 52: Hoare triple {6737#(<= ~counter~0 4)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {6737#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:51,117 INFO L290 TraceCheckUtils]: 53: Hoare triple {6737#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6765#(<= ~counter~0 5)} is VALID [2022-04-28 07:15:51,117 INFO L290 TraceCheckUtils]: 54: Hoare triple {6765#(<= ~counter~0 5)} assume !!(#t~post6 < 10);havoc #t~post6; {6765#(<= ~counter~0 5)} is VALID [2022-04-28 07:15:51,118 INFO L272 TraceCheckUtils]: 55: Hoare triple {6765#(<= ~counter~0 5)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {6765#(<= ~counter~0 5)} is VALID [2022-04-28 07:15:51,118 INFO L290 TraceCheckUtils]: 56: Hoare triple {6765#(<= ~counter~0 5)} ~cond := #in~cond; {6765#(<= ~counter~0 5)} is VALID [2022-04-28 07:15:51,118 INFO L290 TraceCheckUtils]: 57: Hoare triple {6765#(<= ~counter~0 5)} assume !(0 == ~cond); {6765#(<= ~counter~0 5)} is VALID [2022-04-28 07:15:51,119 INFO L290 TraceCheckUtils]: 58: Hoare triple {6765#(<= ~counter~0 5)} assume true; {6765#(<= ~counter~0 5)} is VALID [2022-04-28 07:15:51,119 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {6765#(<= ~counter~0 5)} {6765#(<= ~counter~0 5)} #63#return; {6765#(<= ~counter~0 5)} is VALID [2022-04-28 07:15:51,120 INFO L290 TraceCheckUtils]: 60: Hoare triple {6765#(<= ~counter~0 5)} assume !!(0 != ~y3~0); {6765#(<= ~counter~0 5)} is VALID [2022-04-28 07:15:51,120 INFO L290 TraceCheckUtils]: 61: Hoare triple {6765#(<= ~counter~0 5)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {6765#(<= ~counter~0 5)} is VALID [2022-04-28 07:15:51,120 INFO L290 TraceCheckUtils]: 62: Hoare triple {6765#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6793#(<= ~counter~0 6)} is VALID [2022-04-28 07:15:51,120 INFO L290 TraceCheckUtils]: 63: Hoare triple {6793#(<= ~counter~0 6)} assume !!(#t~post6 < 10);havoc #t~post6; {6793#(<= ~counter~0 6)} is VALID [2022-04-28 07:15:51,121 INFO L272 TraceCheckUtils]: 64: Hoare triple {6793#(<= ~counter~0 6)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {6793#(<= ~counter~0 6)} is VALID [2022-04-28 07:15:51,121 INFO L290 TraceCheckUtils]: 65: Hoare triple {6793#(<= ~counter~0 6)} ~cond := #in~cond; {6793#(<= ~counter~0 6)} is VALID [2022-04-28 07:15:51,121 INFO L290 TraceCheckUtils]: 66: Hoare triple {6793#(<= ~counter~0 6)} assume !(0 == ~cond); {6793#(<= ~counter~0 6)} is VALID [2022-04-28 07:15:51,122 INFO L290 TraceCheckUtils]: 67: Hoare triple {6793#(<= ~counter~0 6)} assume true; {6793#(<= ~counter~0 6)} is VALID [2022-04-28 07:15:51,122 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {6793#(<= ~counter~0 6)} {6793#(<= ~counter~0 6)} #63#return; {6793#(<= ~counter~0 6)} is VALID [2022-04-28 07:15:51,122 INFO L290 TraceCheckUtils]: 69: Hoare triple {6793#(<= ~counter~0 6)} assume !!(0 != ~y3~0); {6793#(<= ~counter~0 6)} is VALID [2022-04-28 07:15:51,122 INFO L290 TraceCheckUtils]: 70: Hoare triple {6793#(<= ~counter~0 6)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {6793#(<= ~counter~0 6)} is VALID [2022-04-28 07:15:51,123 INFO L290 TraceCheckUtils]: 71: Hoare triple {6793#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6821#(<= ~counter~0 7)} is VALID [2022-04-28 07:15:51,123 INFO L290 TraceCheckUtils]: 72: Hoare triple {6821#(<= ~counter~0 7)} assume !!(#t~post6 < 10);havoc #t~post6; {6821#(<= ~counter~0 7)} is VALID [2022-04-28 07:15:51,124 INFO L272 TraceCheckUtils]: 73: Hoare triple {6821#(<= ~counter~0 7)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {6821#(<= ~counter~0 7)} is VALID [2022-04-28 07:15:51,124 INFO L290 TraceCheckUtils]: 74: Hoare triple {6821#(<= ~counter~0 7)} ~cond := #in~cond; {6821#(<= ~counter~0 7)} is VALID [2022-04-28 07:15:51,124 INFO L290 TraceCheckUtils]: 75: Hoare triple {6821#(<= ~counter~0 7)} assume !(0 == ~cond); {6821#(<= ~counter~0 7)} is VALID [2022-04-28 07:15:51,124 INFO L290 TraceCheckUtils]: 76: Hoare triple {6821#(<= ~counter~0 7)} assume true; {6821#(<= ~counter~0 7)} is VALID [2022-04-28 07:15:51,125 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {6821#(<= ~counter~0 7)} {6821#(<= ~counter~0 7)} #63#return; {6821#(<= ~counter~0 7)} is VALID [2022-04-28 07:15:51,125 INFO L290 TraceCheckUtils]: 78: Hoare triple {6821#(<= ~counter~0 7)} assume !!(0 != ~y3~0); {6821#(<= ~counter~0 7)} is VALID [2022-04-28 07:15:51,125 INFO L290 TraceCheckUtils]: 79: Hoare triple {6821#(<= ~counter~0 7)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {6821#(<= ~counter~0 7)} is VALID [2022-04-28 07:15:51,126 INFO L290 TraceCheckUtils]: 80: Hoare triple {6821#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6849#(<= ~counter~0 8)} is VALID [2022-04-28 07:15:51,126 INFO L290 TraceCheckUtils]: 81: Hoare triple {6849#(<= ~counter~0 8)} assume !!(#t~post6 < 10);havoc #t~post6; {6849#(<= ~counter~0 8)} is VALID [2022-04-28 07:15:51,126 INFO L272 TraceCheckUtils]: 82: Hoare triple {6849#(<= ~counter~0 8)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {6849#(<= ~counter~0 8)} is VALID [2022-04-28 07:15:51,127 INFO L290 TraceCheckUtils]: 83: Hoare triple {6849#(<= ~counter~0 8)} ~cond := #in~cond; {6849#(<= ~counter~0 8)} is VALID [2022-04-28 07:15:51,127 INFO L290 TraceCheckUtils]: 84: Hoare triple {6849#(<= ~counter~0 8)} assume !(0 == ~cond); {6849#(<= ~counter~0 8)} is VALID [2022-04-28 07:15:51,127 INFO L290 TraceCheckUtils]: 85: Hoare triple {6849#(<= ~counter~0 8)} assume true; {6849#(<= ~counter~0 8)} is VALID [2022-04-28 07:15:51,127 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {6849#(<= ~counter~0 8)} {6849#(<= ~counter~0 8)} #63#return; {6849#(<= ~counter~0 8)} is VALID [2022-04-28 07:15:51,128 INFO L290 TraceCheckUtils]: 87: Hoare triple {6849#(<= ~counter~0 8)} assume !!(0 != ~y3~0); {6849#(<= ~counter~0 8)} is VALID [2022-04-28 07:15:51,128 INFO L290 TraceCheckUtils]: 88: Hoare triple {6849#(<= ~counter~0 8)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {6849#(<= ~counter~0 8)} is VALID [2022-04-28 07:15:51,128 INFO L290 TraceCheckUtils]: 89: Hoare triple {6849#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6877#(<= |main_#t~post6| 8)} is VALID [2022-04-28 07:15:51,129 INFO L290 TraceCheckUtils]: 90: Hoare triple {6877#(<= |main_#t~post6| 8)} assume !(#t~post6 < 10);havoc #t~post6; {6597#false} is VALID [2022-04-28 07:15:51,129 INFO L272 TraceCheckUtils]: 91: Hoare triple {6597#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {6597#false} is VALID [2022-04-28 07:15:51,129 INFO L290 TraceCheckUtils]: 92: Hoare triple {6597#false} ~cond := #in~cond; {6597#false} is VALID [2022-04-28 07:15:51,129 INFO L290 TraceCheckUtils]: 93: Hoare triple {6597#false} assume 0 == ~cond; {6597#false} is VALID [2022-04-28 07:15:51,129 INFO L290 TraceCheckUtils]: 94: Hoare triple {6597#false} assume !false; {6597#false} is VALID [2022-04-28 07:15:51,129 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 16 proven. 268 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 07:15:51,129 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:15:51,519 INFO L290 TraceCheckUtils]: 94: Hoare triple {6597#false} assume !false; {6597#false} is VALID [2022-04-28 07:15:51,519 INFO L290 TraceCheckUtils]: 93: Hoare triple {6597#false} assume 0 == ~cond; {6597#false} is VALID [2022-04-28 07:15:51,519 INFO L290 TraceCheckUtils]: 92: Hoare triple {6597#false} ~cond := #in~cond; {6597#false} is VALID [2022-04-28 07:15:51,519 INFO L272 TraceCheckUtils]: 91: Hoare triple {6597#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {6597#false} is VALID [2022-04-28 07:15:51,519 INFO L290 TraceCheckUtils]: 90: Hoare triple {6905#(< |main_#t~post6| 10)} assume !(#t~post6 < 10);havoc #t~post6; {6597#false} is VALID [2022-04-28 07:15:51,520 INFO L290 TraceCheckUtils]: 89: Hoare triple {6909#(< ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6905#(< |main_#t~post6| 10)} is VALID [2022-04-28 07:15:51,520 INFO L290 TraceCheckUtils]: 88: Hoare triple {6909#(< ~counter~0 10)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {6909#(< ~counter~0 10)} is VALID [2022-04-28 07:15:51,520 INFO L290 TraceCheckUtils]: 87: Hoare triple {6909#(< ~counter~0 10)} assume !!(0 != ~y3~0); {6909#(< ~counter~0 10)} is VALID [2022-04-28 07:15:51,521 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {6596#true} {6909#(< ~counter~0 10)} #63#return; {6909#(< ~counter~0 10)} is VALID [2022-04-28 07:15:51,521 INFO L290 TraceCheckUtils]: 85: Hoare triple {6596#true} assume true; {6596#true} is VALID [2022-04-28 07:15:51,521 INFO L290 TraceCheckUtils]: 84: Hoare triple {6596#true} assume !(0 == ~cond); {6596#true} is VALID [2022-04-28 07:15:51,521 INFO L290 TraceCheckUtils]: 83: Hoare triple {6596#true} ~cond := #in~cond; {6596#true} is VALID [2022-04-28 07:15:51,521 INFO L272 TraceCheckUtils]: 82: Hoare triple {6909#(< ~counter~0 10)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {6596#true} is VALID [2022-04-28 07:15:51,521 INFO L290 TraceCheckUtils]: 81: Hoare triple {6909#(< ~counter~0 10)} assume !!(#t~post6 < 10);havoc #t~post6; {6909#(< ~counter~0 10)} is VALID [2022-04-28 07:15:51,522 INFO L290 TraceCheckUtils]: 80: Hoare triple {6849#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6909#(< ~counter~0 10)} is VALID [2022-04-28 07:15:51,522 INFO L290 TraceCheckUtils]: 79: Hoare triple {6849#(<= ~counter~0 8)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {6849#(<= ~counter~0 8)} is VALID [2022-04-28 07:15:51,522 INFO L290 TraceCheckUtils]: 78: Hoare triple {6849#(<= ~counter~0 8)} assume !!(0 != ~y3~0); {6849#(<= ~counter~0 8)} is VALID [2022-04-28 07:15:51,522 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {6596#true} {6849#(<= ~counter~0 8)} #63#return; {6849#(<= ~counter~0 8)} is VALID [2022-04-28 07:15:51,523 INFO L290 TraceCheckUtils]: 76: Hoare triple {6596#true} assume true; {6596#true} is VALID [2022-04-28 07:15:51,523 INFO L290 TraceCheckUtils]: 75: Hoare triple {6596#true} assume !(0 == ~cond); {6596#true} is VALID [2022-04-28 07:15:51,523 INFO L290 TraceCheckUtils]: 74: Hoare triple {6596#true} ~cond := #in~cond; {6596#true} is VALID [2022-04-28 07:15:51,523 INFO L272 TraceCheckUtils]: 73: Hoare triple {6849#(<= ~counter~0 8)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {6596#true} is VALID [2022-04-28 07:15:51,523 INFO L290 TraceCheckUtils]: 72: Hoare triple {6849#(<= ~counter~0 8)} assume !!(#t~post6 < 10);havoc #t~post6; {6849#(<= ~counter~0 8)} is VALID [2022-04-28 07:15:51,523 INFO L290 TraceCheckUtils]: 71: Hoare triple {6821#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6849#(<= ~counter~0 8)} is VALID [2022-04-28 07:15:51,524 INFO L290 TraceCheckUtils]: 70: Hoare triple {6821#(<= ~counter~0 7)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {6821#(<= ~counter~0 7)} is VALID [2022-04-28 07:15:51,524 INFO L290 TraceCheckUtils]: 69: Hoare triple {6821#(<= ~counter~0 7)} assume !!(0 != ~y3~0); {6821#(<= ~counter~0 7)} is VALID [2022-04-28 07:15:51,524 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {6596#true} {6821#(<= ~counter~0 7)} #63#return; {6821#(<= ~counter~0 7)} is VALID [2022-04-28 07:15:51,524 INFO L290 TraceCheckUtils]: 67: Hoare triple {6596#true} assume true; {6596#true} is VALID [2022-04-28 07:15:51,524 INFO L290 TraceCheckUtils]: 66: Hoare triple {6596#true} assume !(0 == ~cond); {6596#true} is VALID [2022-04-28 07:15:51,524 INFO L290 TraceCheckUtils]: 65: Hoare triple {6596#true} ~cond := #in~cond; {6596#true} is VALID [2022-04-28 07:15:51,525 INFO L272 TraceCheckUtils]: 64: Hoare triple {6821#(<= ~counter~0 7)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {6596#true} is VALID [2022-04-28 07:15:51,525 INFO L290 TraceCheckUtils]: 63: Hoare triple {6821#(<= ~counter~0 7)} assume !!(#t~post6 < 10);havoc #t~post6; {6821#(<= ~counter~0 7)} is VALID [2022-04-28 07:15:51,525 INFO L290 TraceCheckUtils]: 62: Hoare triple {6793#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6821#(<= ~counter~0 7)} is VALID [2022-04-28 07:15:51,525 INFO L290 TraceCheckUtils]: 61: Hoare triple {6793#(<= ~counter~0 6)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {6793#(<= ~counter~0 6)} is VALID [2022-04-28 07:15:51,526 INFO L290 TraceCheckUtils]: 60: Hoare triple {6793#(<= ~counter~0 6)} assume !!(0 != ~y3~0); {6793#(<= ~counter~0 6)} is VALID [2022-04-28 07:15:51,526 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {6596#true} {6793#(<= ~counter~0 6)} #63#return; {6793#(<= ~counter~0 6)} is VALID [2022-04-28 07:15:51,526 INFO L290 TraceCheckUtils]: 58: Hoare triple {6596#true} assume true; {6596#true} is VALID [2022-04-28 07:15:51,526 INFO L290 TraceCheckUtils]: 57: Hoare triple {6596#true} assume !(0 == ~cond); {6596#true} is VALID [2022-04-28 07:15:51,526 INFO L290 TraceCheckUtils]: 56: Hoare triple {6596#true} ~cond := #in~cond; {6596#true} is VALID [2022-04-28 07:15:51,526 INFO L272 TraceCheckUtils]: 55: Hoare triple {6793#(<= ~counter~0 6)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {6596#true} is VALID [2022-04-28 07:15:51,535 INFO L290 TraceCheckUtils]: 54: Hoare triple {6793#(<= ~counter~0 6)} assume !!(#t~post6 < 10);havoc #t~post6; {6793#(<= ~counter~0 6)} is VALID [2022-04-28 07:15:51,536 INFO L290 TraceCheckUtils]: 53: Hoare triple {6765#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6793#(<= ~counter~0 6)} is VALID [2022-04-28 07:15:51,536 INFO L290 TraceCheckUtils]: 52: Hoare triple {6765#(<= ~counter~0 5)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {6765#(<= ~counter~0 5)} is VALID [2022-04-28 07:15:51,536 INFO L290 TraceCheckUtils]: 51: Hoare triple {6765#(<= ~counter~0 5)} assume !!(0 != ~y3~0); {6765#(<= ~counter~0 5)} is VALID [2022-04-28 07:15:51,537 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6596#true} {6765#(<= ~counter~0 5)} #63#return; {6765#(<= ~counter~0 5)} is VALID [2022-04-28 07:15:51,537 INFO L290 TraceCheckUtils]: 49: Hoare triple {6596#true} assume true; {6596#true} is VALID [2022-04-28 07:15:51,537 INFO L290 TraceCheckUtils]: 48: Hoare triple {6596#true} assume !(0 == ~cond); {6596#true} is VALID [2022-04-28 07:15:51,537 INFO L290 TraceCheckUtils]: 47: Hoare triple {6596#true} ~cond := #in~cond; {6596#true} is VALID [2022-04-28 07:15:51,537 INFO L272 TraceCheckUtils]: 46: Hoare triple {6765#(<= ~counter~0 5)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {6596#true} is VALID [2022-04-28 07:15:51,538 INFO L290 TraceCheckUtils]: 45: Hoare triple {6765#(<= ~counter~0 5)} assume !!(#t~post6 < 10);havoc #t~post6; {6765#(<= ~counter~0 5)} is VALID [2022-04-28 07:15:51,538 INFO L290 TraceCheckUtils]: 44: Hoare triple {6737#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6765#(<= ~counter~0 5)} is VALID [2022-04-28 07:15:51,538 INFO L290 TraceCheckUtils]: 43: Hoare triple {6737#(<= ~counter~0 4)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {6737#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:51,539 INFO L290 TraceCheckUtils]: 42: Hoare triple {6737#(<= ~counter~0 4)} assume !!(0 != ~y3~0); {6737#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:51,539 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {6596#true} {6737#(<= ~counter~0 4)} #63#return; {6737#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:51,539 INFO L290 TraceCheckUtils]: 40: Hoare triple {6596#true} assume true; {6596#true} is VALID [2022-04-28 07:15:51,539 INFO L290 TraceCheckUtils]: 39: Hoare triple {6596#true} assume !(0 == ~cond); {6596#true} is VALID [2022-04-28 07:15:51,540 INFO L290 TraceCheckUtils]: 38: Hoare triple {6596#true} ~cond := #in~cond; {6596#true} is VALID [2022-04-28 07:15:51,540 INFO L272 TraceCheckUtils]: 37: Hoare triple {6737#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {6596#true} is VALID [2022-04-28 07:15:51,540 INFO L290 TraceCheckUtils]: 36: Hoare triple {6737#(<= ~counter~0 4)} assume !!(#t~post6 < 10);havoc #t~post6; {6737#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:51,540 INFO L290 TraceCheckUtils]: 35: Hoare triple {6709#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6737#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:51,541 INFO L290 TraceCheckUtils]: 34: Hoare triple {6709#(<= ~counter~0 3)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {6709#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:51,541 INFO L290 TraceCheckUtils]: 33: Hoare triple {6709#(<= ~counter~0 3)} assume !!(0 != ~y3~0); {6709#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:51,542 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6596#true} {6709#(<= ~counter~0 3)} #63#return; {6709#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:51,542 INFO L290 TraceCheckUtils]: 31: Hoare triple {6596#true} assume true; {6596#true} is VALID [2022-04-28 07:15:51,542 INFO L290 TraceCheckUtils]: 30: Hoare triple {6596#true} assume !(0 == ~cond); {6596#true} is VALID [2022-04-28 07:15:51,542 INFO L290 TraceCheckUtils]: 29: Hoare triple {6596#true} ~cond := #in~cond; {6596#true} is VALID [2022-04-28 07:15:51,542 INFO L272 TraceCheckUtils]: 28: Hoare triple {6709#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {6596#true} is VALID [2022-04-28 07:15:51,542 INFO L290 TraceCheckUtils]: 27: Hoare triple {6709#(<= ~counter~0 3)} assume !!(#t~post6 < 10);havoc #t~post6; {6709#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:51,542 INFO L290 TraceCheckUtils]: 26: Hoare triple {6681#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6709#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:51,543 INFO L290 TraceCheckUtils]: 25: Hoare triple {6681#(<= ~counter~0 2)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {6681#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:51,543 INFO L290 TraceCheckUtils]: 24: Hoare triple {6681#(<= ~counter~0 2)} assume !!(0 != ~y3~0); {6681#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:51,544 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6596#true} {6681#(<= ~counter~0 2)} #63#return; {6681#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:51,544 INFO L290 TraceCheckUtils]: 22: Hoare triple {6596#true} assume true; {6596#true} is VALID [2022-04-28 07:15:51,544 INFO L290 TraceCheckUtils]: 21: Hoare triple {6596#true} assume !(0 == ~cond); {6596#true} is VALID [2022-04-28 07:15:51,544 INFO L290 TraceCheckUtils]: 20: Hoare triple {6596#true} ~cond := #in~cond; {6596#true} is VALID [2022-04-28 07:15:51,544 INFO L272 TraceCheckUtils]: 19: Hoare triple {6681#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {6596#true} is VALID [2022-04-28 07:15:51,544 INFO L290 TraceCheckUtils]: 18: Hoare triple {6681#(<= ~counter~0 2)} assume !!(#t~post6 < 10);havoc #t~post6; {6681#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:51,545 INFO L290 TraceCheckUtils]: 17: Hoare triple {6653#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6681#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:51,545 INFO L290 TraceCheckUtils]: 16: Hoare triple {6653#(<= ~counter~0 1)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {6653#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:51,545 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6596#true} {6653#(<= ~counter~0 1)} #61#return; {6653#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:51,545 INFO L290 TraceCheckUtils]: 14: Hoare triple {6596#true} assume true; {6596#true} is VALID [2022-04-28 07:15:51,546 INFO L290 TraceCheckUtils]: 13: Hoare triple {6596#true} assume !(0 == ~cond); {6596#true} is VALID [2022-04-28 07:15:51,546 INFO L290 TraceCheckUtils]: 12: Hoare triple {6596#true} ~cond := #in~cond; {6596#true} is VALID [2022-04-28 07:15:51,546 INFO L272 TraceCheckUtils]: 11: Hoare triple {6653#(<= ~counter~0 1)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {6596#true} is VALID [2022-04-28 07:15:51,546 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6596#true} {6653#(<= ~counter~0 1)} #59#return; {6653#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:51,546 INFO L290 TraceCheckUtils]: 9: Hoare triple {6596#true} assume true; {6596#true} is VALID [2022-04-28 07:15:51,546 INFO L290 TraceCheckUtils]: 8: Hoare triple {6596#true} assume !(0 == ~cond); {6596#true} is VALID [2022-04-28 07:15:51,546 INFO L290 TraceCheckUtils]: 7: Hoare triple {6596#true} ~cond := #in~cond; {6596#true} is VALID [2022-04-28 07:15:51,546 INFO L272 TraceCheckUtils]: 6: Hoare triple {6653#(<= ~counter~0 1)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {6596#true} is VALID [2022-04-28 07:15:51,547 INFO L290 TraceCheckUtils]: 5: Hoare triple {6653#(<= ~counter~0 1)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {6653#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:51,547 INFO L272 TraceCheckUtils]: 4: Hoare triple {6653#(<= ~counter~0 1)} call #t~ret7 := main(); {6653#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:51,547 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6653#(<= ~counter~0 1)} {6596#true} #67#return; {6653#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:51,548 INFO L290 TraceCheckUtils]: 2: Hoare triple {6653#(<= ~counter~0 1)} assume true; {6653#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:51,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {6596#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6653#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:51,548 INFO L272 TraceCheckUtils]: 0: Hoare triple {6596#true} call ULTIMATE.init(); {6596#true} is VALID [2022-04-28 07:15:51,548 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 16 proven. 156 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-04-28 07:15:51,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:15:51,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121809827] [2022-04-28 07:15:51,549 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:15:51,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1021926038] [2022-04-28 07:15:51,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1021926038] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:15:51,549 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:15:51,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 14 [2022-04-28 07:15:51,549 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:15:51,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1379940946] [2022-04-28 07:15:51,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1379940946] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:15:51,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:15:51,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 07:15:51,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974542179] [2022-04-28 07:15:51,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:15:51,550 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 states have internal predecessors, (68), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) Word has length 95 [2022-04-28 07:15:51,550 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:15:51,550 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 states have internal predecessors, (68), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-28 07:15:51,608 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:15:51,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 07:15:51,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:15:51,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 07:15:51,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 07:15:51,609 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 states have internal predecessors, (68), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-28 07:15:51,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:15:51,902 INFO L93 Difference]: Finished difference Result 106 states and 116 transitions. [2022-04-28 07:15:51,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 07:15:51,902 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 states have internal predecessors, (68), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) Word has length 95 [2022-04-28 07:15:51,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:15:51,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 states have internal predecessors, (68), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-28 07:15:51,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 115 transitions. [2022-04-28 07:15:51,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 states have internal predecessors, (68), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-28 07:15:51,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 115 transitions. [2022-04-28 07:15:51,919 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 115 transitions. [2022-04-28 07:15:51,994 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:15:51,999 INFO L225 Difference]: With dead ends: 106 [2022-04-28 07:15:51,999 INFO L226 Difference]: Without dead ends: 101 [2022-04-28 07:15:51,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 176 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=175, Invalid=287, Unknown=0, NotChecked=0, Total=462 [2022-04-28 07:15:52,000 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 34 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 07:15:52,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 140 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 07:15:52,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-04-28 07:15:52,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-04-28 07:15:52,091 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:15:52,091 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand has 101 states, 75 states have (on average 1.1333333333333333) internal successors, (85), 75 states have internal predecessors, (85), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 07:15:52,102 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand has 101 states, 75 states have (on average 1.1333333333333333) internal successors, (85), 75 states have internal predecessors, (85), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 07:15:52,103 INFO L87 Difference]: Start difference. First operand 101 states. Second operand has 101 states, 75 states have (on average 1.1333333333333333) internal successors, (85), 75 states have internal predecessors, (85), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 07:15:52,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:15:52,104 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2022-04-28 07:15:52,104 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2022-04-28 07:15:52,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:15:52,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:15:52,105 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 75 states have (on average 1.1333333333333333) internal successors, (85), 75 states have internal predecessors, (85), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 101 states. [2022-04-28 07:15:52,105 INFO L87 Difference]: Start difference. First operand has 101 states, 75 states have (on average 1.1333333333333333) internal successors, (85), 75 states have internal predecessors, (85), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 101 states. [2022-04-28 07:15:52,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:15:52,106 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2022-04-28 07:15:52,106 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2022-04-28 07:15:52,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:15:52,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:15:52,107 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:15:52,107 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:15:52,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 75 states have (on average 1.1333333333333333) internal successors, (85), 75 states have internal predecessors, (85), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 07:15:52,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2022-04-28 07:15:52,108 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 95 [2022-04-28 07:15:52,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:15:52,108 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2022-04-28 07:15:52,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 states have internal predecessors, (68), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-28 07:15:52,108 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 101 states and 111 transitions. [2022-04-28 07:15:52,207 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:15:52,207 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2022-04-28 07:15:52,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-04-28 07:15:52,208 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:15:52,208 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:15:52,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-28 07:15:52,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-28 07:15:52,415 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:15:52,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:15:52,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1717228060, now seen corresponding path program 17 times [2022-04-28 07:15:52,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:15:52,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [268475758] [2022-04-28 07:15:52,416 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:15:52,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1717228060, now seen corresponding path program 18 times [2022-04-28 07:15:52,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:15:52,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154101044] [2022-04-28 07:15:52,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:15:52,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:15:52,426 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:15:52,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1653742570] [2022-04-28 07:15:52,426 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 07:15:52,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:15:52,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:15:52,427 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:15:52,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-28 07:15:52,486 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-28 07:15:52,486 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:15:52,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 07:15:52,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:15:52,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:15:52,941 INFO L272 TraceCheckUtils]: 0: Hoare triple {7811#true} call ULTIMATE.init(); {7811#true} is VALID [2022-04-28 07:15:52,941 INFO L290 TraceCheckUtils]: 1: Hoare triple {7811#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7819#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:52,942 INFO L290 TraceCheckUtils]: 2: Hoare triple {7819#(<= ~counter~0 0)} assume true; {7819#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:52,942 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7819#(<= ~counter~0 0)} {7811#true} #67#return; {7819#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:52,942 INFO L272 TraceCheckUtils]: 4: Hoare triple {7819#(<= ~counter~0 0)} call #t~ret7 := main(); {7819#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:52,942 INFO L290 TraceCheckUtils]: 5: Hoare triple {7819#(<= ~counter~0 0)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {7819#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:52,943 INFO L272 TraceCheckUtils]: 6: Hoare triple {7819#(<= ~counter~0 0)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {7819#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:52,943 INFO L290 TraceCheckUtils]: 7: Hoare triple {7819#(<= ~counter~0 0)} ~cond := #in~cond; {7819#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:52,943 INFO L290 TraceCheckUtils]: 8: Hoare triple {7819#(<= ~counter~0 0)} assume !(0 == ~cond); {7819#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:52,943 INFO L290 TraceCheckUtils]: 9: Hoare triple {7819#(<= ~counter~0 0)} assume true; {7819#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:52,944 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7819#(<= ~counter~0 0)} {7819#(<= ~counter~0 0)} #59#return; {7819#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:52,944 INFO L272 TraceCheckUtils]: 11: Hoare triple {7819#(<= ~counter~0 0)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {7819#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:52,944 INFO L290 TraceCheckUtils]: 12: Hoare triple {7819#(<= ~counter~0 0)} ~cond := #in~cond; {7819#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:52,945 INFO L290 TraceCheckUtils]: 13: Hoare triple {7819#(<= ~counter~0 0)} assume !(0 == ~cond); {7819#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:52,945 INFO L290 TraceCheckUtils]: 14: Hoare triple {7819#(<= ~counter~0 0)} assume true; {7819#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:52,945 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7819#(<= ~counter~0 0)} {7819#(<= ~counter~0 0)} #61#return; {7819#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:52,945 INFO L290 TraceCheckUtils]: 16: Hoare triple {7819#(<= ~counter~0 0)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {7819#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:52,946 INFO L290 TraceCheckUtils]: 17: Hoare triple {7819#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7868#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:52,946 INFO L290 TraceCheckUtils]: 18: Hoare triple {7868#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {7868#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:52,947 INFO L272 TraceCheckUtils]: 19: Hoare triple {7868#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7868#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:52,947 INFO L290 TraceCheckUtils]: 20: Hoare triple {7868#(<= ~counter~0 1)} ~cond := #in~cond; {7868#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:52,947 INFO L290 TraceCheckUtils]: 21: Hoare triple {7868#(<= ~counter~0 1)} assume !(0 == ~cond); {7868#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:52,947 INFO L290 TraceCheckUtils]: 22: Hoare triple {7868#(<= ~counter~0 1)} assume true; {7868#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:52,948 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7868#(<= ~counter~0 1)} {7868#(<= ~counter~0 1)} #63#return; {7868#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:52,948 INFO L290 TraceCheckUtils]: 24: Hoare triple {7868#(<= ~counter~0 1)} assume !!(0 != ~y3~0); {7868#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:52,948 INFO L290 TraceCheckUtils]: 25: Hoare triple {7868#(<= ~counter~0 1)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {7868#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:52,949 INFO L290 TraceCheckUtils]: 26: Hoare triple {7868#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7896#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:52,949 INFO L290 TraceCheckUtils]: 27: Hoare triple {7896#(<= ~counter~0 2)} assume !!(#t~post6 < 10);havoc #t~post6; {7896#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:52,949 INFO L272 TraceCheckUtils]: 28: Hoare triple {7896#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7896#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:52,950 INFO L290 TraceCheckUtils]: 29: Hoare triple {7896#(<= ~counter~0 2)} ~cond := #in~cond; {7896#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:52,950 INFO L290 TraceCheckUtils]: 30: Hoare triple {7896#(<= ~counter~0 2)} assume !(0 == ~cond); {7896#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:52,950 INFO L290 TraceCheckUtils]: 31: Hoare triple {7896#(<= ~counter~0 2)} assume true; {7896#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:52,951 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7896#(<= ~counter~0 2)} {7896#(<= ~counter~0 2)} #63#return; {7896#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:52,951 INFO L290 TraceCheckUtils]: 33: Hoare triple {7896#(<= ~counter~0 2)} assume !!(0 != ~y3~0); {7896#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:52,951 INFO L290 TraceCheckUtils]: 34: Hoare triple {7896#(<= ~counter~0 2)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {7896#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:52,951 INFO L290 TraceCheckUtils]: 35: Hoare triple {7896#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7924#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:52,952 INFO L290 TraceCheckUtils]: 36: Hoare triple {7924#(<= ~counter~0 3)} assume !!(#t~post6 < 10);havoc #t~post6; {7924#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:52,952 INFO L272 TraceCheckUtils]: 37: Hoare triple {7924#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7924#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:52,952 INFO L290 TraceCheckUtils]: 38: Hoare triple {7924#(<= ~counter~0 3)} ~cond := #in~cond; {7924#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:52,953 INFO L290 TraceCheckUtils]: 39: Hoare triple {7924#(<= ~counter~0 3)} assume !(0 == ~cond); {7924#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:52,953 INFO L290 TraceCheckUtils]: 40: Hoare triple {7924#(<= ~counter~0 3)} assume true; {7924#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:52,953 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {7924#(<= ~counter~0 3)} {7924#(<= ~counter~0 3)} #63#return; {7924#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:52,953 INFO L290 TraceCheckUtils]: 42: Hoare triple {7924#(<= ~counter~0 3)} assume !!(0 != ~y3~0); {7924#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:52,954 INFO L290 TraceCheckUtils]: 43: Hoare triple {7924#(<= ~counter~0 3)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {7924#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:52,954 INFO L290 TraceCheckUtils]: 44: Hoare triple {7924#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7952#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:52,954 INFO L290 TraceCheckUtils]: 45: Hoare triple {7952#(<= ~counter~0 4)} assume !!(#t~post6 < 10);havoc #t~post6; {7952#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:52,955 INFO L272 TraceCheckUtils]: 46: Hoare triple {7952#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7952#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:52,961 INFO L290 TraceCheckUtils]: 47: Hoare triple {7952#(<= ~counter~0 4)} ~cond := #in~cond; {7952#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:52,961 INFO L290 TraceCheckUtils]: 48: Hoare triple {7952#(<= ~counter~0 4)} assume !(0 == ~cond); {7952#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:52,961 INFO L290 TraceCheckUtils]: 49: Hoare triple {7952#(<= ~counter~0 4)} assume true; {7952#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:52,962 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7952#(<= ~counter~0 4)} {7952#(<= ~counter~0 4)} #63#return; {7952#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:52,962 INFO L290 TraceCheckUtils]: 51: Hoare triple {7952#(<= ~counter~0 4)} assume !!(0 != ~y3~0); {7952#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:52,962 INFO L290 TraceCheckUtils]: 52: Hoare triple {7952#(<= ~counter~0 4)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {7952#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:52,963 INFO L290 TraceCheckUtils]: 53: Hoare triple {7952#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7980#(<= ~counter~0 5)} is VALID [2022-04-28 07:15:52,963 INFO L290 TraceCheckUtils]: 54: Hoare triple {7980#(<= ~counter~0 5)} assume !!(#t~post6 < 10);havoc #t~post6; {7980#(<= ~counter~0 5)} is VALID [2022-04-28 07:15:52,964 INFO L272 TraceCheckUtils]: 55: Hoare triple {7980#(<= ~counter~0 5)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7980#(<= ~counter~0 5)} is VALID [2022-04-28 07:15:52,964 INFO L290 TraceCheckUtils]: 56: Hoare triple {7980#(<= ~counter~0 5)} ~cond := #in~cond; {7980#(<= ~counter~0 5)} is VALID [2022-04-28 07:15:52,964 INFO L290 TraceCheckUtils]: 57: Hoare triple {7980#(<= ~counter~0 5)} assume !(0 == ~cond); {7980#(<= ~counter~0 5)} is VALID [2022-04-28 07:15:52,964 INFO L290 TraceCheckUtils]: 58: Hoare triple {7980#(<= ~counter~0 5)} assume true; {7980#(<= ~counter~0 5)} is VALID [2022-04-28 07:15:52,965 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {7980#(<= ~counter~0 5)} {7980#(<= ~counter~0 5)} #63#return; {7980#(<= ~counter~0 5)} is VALID [2022-04-28 07:15:52,965 INFO L290 TraceCheckUtils]: 60: Hoare triple {7980#(<= ~counter~0 5)} assume !!(0 != ~y3~0); {7980#(<= ~counter~0 5)} is VALID [2022-04-28 07:15:52,965 INFO L290 TraceCheckUtils]: 61: Hoare triple {7980#(<= ~counter~0 5)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {7980#(<= ~counter~0 5)} is VALID [2022-04-28 07:15:52,966 INFO L290 TraceCheckUtils]: 62: Hoare triple {7980#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8008#(<= ~counter~0 6)} is VALID [2022-04-28 07:15:52,966 INFO L290 TraceCheckUtils]: 63: Hoare triple {8008#(<= ~counter~0 6)} assume !!(#t~post6 < 10);havoc #t~post6; {8008#(<= ~counter~0 6)} is VALID [2022-04-28 07:15:52,966 INFO L272 TraceCheckUtils]: 64: Hoare triple {8008#(<= ~counter~0 6)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {8008#(<= ~counter~0 6)} is VALID [2022-04-28 07:15:52,967 INFO L290 TraceCheckUtils]: 65: Hoare triple {8008#(<= ~counter~0 6)} ~cond := #in~cond; {8008#(<= ~counter~0 6)} is VALID [2022-04-28 07:15:52,967 INFO L290 TraceCheckUtils]: 66: Hoare triple {8008#(<= ~counter~0 6)} assume !(0 == ~cond); {8008#(<= ~counter~0 6)} is VALID [2022-04-28 07:15:52,967 INFO L290 TraceCheckUtils]: 67: Hoare triple {8008#(<= ~counter~0 6)} assume true; {8008#(<= ~counter~0 6)} is VALID [2022-04-28 07:15:52,968 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {8008#(<= ~counter~0 6)} {8008#(<= ~counter~0 6)} #63#return; {8008#(<= ~counter~0 6)} is VALID [2022-04-28 07:15:52,968 INFO L290 TraceCheckUtils]: 69: Hoare triple {8008#(<= ~counter~0 6)} assume !!(0 != ~y3~0); {8008#(<= ~counter~0 6)} is VALID [2022-04-28 07:15:52,968 INFO L290 TraceCheckUtils]: 70: Hoare triple {8008#(<= ~counter~0 6)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8008#(<= ~counter~0 6)} is VALID [2022-04-28 07:15:52,968 INFO L290 TraceCheckUtils]: 71: Hoare triple {8008#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8036#(<= ~counter~0 7)} is VALID [2022-04-28 07:15:52,969 INFO L290 TraceCheckUtils]: 72: Hoare triple {8036#(<= ~counter~0 7)} assume !!(#t~post6 < 10);havoc #t~post6; {8036#(<= ~counter~0 7)} is VALID [2022-04-28 07:15:52,969 INFO L272 TraceCheckUtils]: 73: Hoare triple {8036#(<= ~counter~0 7)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {8036#(<= ~counter~0 7)} is VALID [2022-04-28 07:15:52,969 INFO L290 TraceCheckUtils]: 74: Hoare triple {8036#(<= ~counter~0 7)} ~cond := #in~cond; {8036#(<= ~counter~0 7)} is VALID [2022-04-28 07:15:52,970 INFO L290 TraceCheckUtils]: 75: Hoare triple {8036#(<= ~counter~0 7)} assume !(0 == ~cond); {8036#(<= ~counter~0 7)} is VALID [2022-04-28 07:15:52,970 INFO L290 TraceCheckUtils]: 76: Hoare triple {8036#(<= ~counter~0 7)} assume true; {8036#(<= ~counter~0 7)} is VALID [2022-04-28 07:15:52,970 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {8036#(<= ~counter~0 7)} {8036#(<= ~counter~0 7)} #63#return; {8036#(<= ~counter~0 7)} is VALID [2022-04-28 07:15:52,971 INFO L290 TraceCheckUtils]: 78: Hoare triple {8036#(<= ~counter~0 7)} assume !!(0 != ~y3~0); {8036#(<= ~counter~0 7)} is VALID [2022-04-28 07:15:52,971 INFO L290 TraceCheckUtils]: 79: Hoare triple {8036#(<= ~counter~0 7)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8036#(<= ~counter~0 7)} is VALID [2022-04-28 07:15:52,971 INFO L290 TraceCheckUtils]: 80: Hoare triple {8036#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8064#(<= ~counter~0 8)} is VALID [2022-04-28 07:15:52,971 INFO L290 TraceCheckUtils]: 81: Hoare triple {8064#(<= ~counter~0 8)} assume !!(#t~post6 < 10);havoc #t~post6; {8064#(<= ~counter~0 8)} is VALID [2022-04-28 07:15:52,972 INFO L272 TraceCheckUtils]: 82: Hoare triple {8064#(<= ~counter~0 8)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {8064#(<= ~counter~0 8)} is VALID [2022-04-28 07:15:52,974 INFO L290 TraceCheckUtils]: 83: Hoare triple {8064#(<= ~counter~0 8)} ~cond := #in~cond; {8064#(<= ~counter~0 8)} is VALID [2022-04-28 07:15:52,975 INFO L290 TraceCheckUtils]: 84: Hoare triple {8064#(<= ~counter~0 8)} assume !(0 == ~cond); {8064#(<= ~counter~0 8)} is VALID [2022-04-28 07:15:52,975 INFO L290 TraceCheckUtils]: 85: Hoare triple {8064#(<= ~counter~0 8)} assume true; {8064#(<= ~counter~0 8)} is VALID [2022-04-28 07:15:52,975 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {8064#(<= ~counter~0 8)} {8064#(<= ~counter~0 8)} #63#return; {8064#(<= ~counter~0 8)} is VALID [2022-04-28 07:15:52,976 INFO L290 TraceCheckUtils]: 87: Hoare triple {8064#(<= ~counter~0 8)} assume !!(0 != ~y3~0); {8064#(<= ~counter~0 8)} is VALID [2022-04-28 07:15:52,976 INFO L290 TraceCheckUtils]: 88: Hoare triple {8064#(<= ~counter~0 8)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8064#(<= ~counter~0 8)} is VALID [2022-04-28 07:15:52,976 INFO L290 TraceCheckUtils]: 89: Hoare triple {8064#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8092#(<= ~counter~0 9)} is VALID [2022-04-28 07:15:52,976 INFO L290 TraceCheckUtils]: 90: Hoare triple {8092#(<= ~counter~0 9)} assume !!(#t~post6 < 10);havoc #t~post6; {8092#(<= ~counter~0 9)} is VALID [2022-04-28 07:15:52,977 INFO L272 TraceCheckUtils]: 91: Hoare triple {8092#(<= ~counter~0 9)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {8092#(<= ~counter~0 9)} is VALID [2022-04-28 07:15:52,977 INFO L290 TraceCheckUtils]: 92: Hoare triple {8092#(<= ~counter~0 9)} ~cond := #in~cond; {8092#(<= ~counter~0 9)} is VALID [2022-04-28 07:15:52,977 INFO L290 TraceCheckUtils]: 93: Hoare triple {8092#(<= ~counter~0 9)} assume !(0 == ~cond); {8092#(<= ~counter~0 9)} is VALID [2022-04-28 07:15:52,978 INFO L290 TraceCheckUtils]: 94: Hoare triple {8092#(<= ~counter~0 9)} assume true; {8092#(<= ~counter~0 9)} is VALID [2022-04-28 07:15:52,978 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {8092#(<= ~counter~0 9)} {8092#(<= ~counter~0 9)} #63#return; {8092#(<= ~counter~0 9)} is VALID [2022-04-28 07:15:52,978 INFO L290 TraceCheckUtils]: 96: Hoare triple {8092#(<= ~counter~0 9)} assume !!(0 != ~y3~0); {8092#(<= ~counter~0 9)} is VALID [2022-04-28 07:15:52,979 INFO L290 TraceCheckUtils]: 97: Hoare triple {8092#(<= ~counter~0 9)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8092#(<= ~counter~0 9)} is VALID [2022-04-28 07:15:52,979 INFO L290 TraceCheckUtils]: 98: Hoare triple {8092#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8120#(<= |main_#t~post6| 9)} is VALID [2022-04-28 07:15:52,979 INFO L290 TraceCheckUtils]: 99: Hoare triple {8120#(<= |main_#t~post6| 9)} assume !(#t~post6 < 10);havoc #t~post6; {7812#false} is VALID [2022-04-28 07:15:52,979 INFO L272 TraceCheckUtils]: 100: Hoare triple {7812#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {7812#false} is VALID [2022-04-28 07:15:52,979 INFO L290 TraceCheckUtils]: 101: Hoare triple {7812#false} ~cond := #in~cond; {7812#false} is VALID [2022-04-28 07:15:52,979 INFO L290 TraceCheckUtils]: 102: Hoare triple {7812#false} assume 0 == ~cond; {7812#false} is VALID [2022-04-28 07:15:52,979 INFO L290 TraceCheckUtils]: 103: Hoare triple {7812#false} assume !false; {7812#false} is VALID [2022-04-28 07:15:52,980 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 18 proven. 342 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 07:15:52,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:15:53,356 INFO L290 TraceCheckUtils]: 103: Hoare triple {7812#false} assume !false; {7812#false} is VALID [2022-04-28 07:15:53,356 INFO L290 TraceCheckUtils]: 102: Hoare triple {7812#false} assume 0 == ~cond; {7812#false} is VALID [2022-04-28 07:15:53,356 INFO L290 TraceCheckUtils]: 101: Hoare triple {7812#false} ~cond := #in~cond; {7812#false} is VALID [2022-04-28 07:15:53,356 INFO L272 TraceCheckUtils]: 100: Hoare triple {7812#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {7812#false} is VALID [2022-04-28 07:15:53,357 INFO L290 TraceCheckUtils]: 99: Hoare triple {8120#(<= |main_#t~post6| 9)} assume !(#t~post6 < 10);havoc #t~post6; {7812#false} is VALID [2022-04-28 07:15:53,357 INFO L290 TraceCheckUtils]: 98: Hoare triple {8092#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8120#(<= |main_#t~post6| 9)} is VALID [2022-04-28 07:15:53,357 INFO L290 TraceCheckUtils]: 97: Hoare triple {8092#(<= ~counter~0 9)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8092#(<= ~counter~0 9)} is VALID [2022-04-28 07:15:53,357 INFO L290 TraceCheckUtils]: 96: Hoare triple {8092#(<= ~counter~0 9)} assume !!(0 != ~y3~0); {8092#(<= ~counter~0 9)} is VALID [2022-04-28 07:15:53,358 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {7811#true} {8092#(<= ~counter~0 9)} #63#return; {8092#(<= ~counter~0 9)} is VALID [2022-04-28 07:15:53,358 INFO L290 TraceCheckUtils]: 94: Hoare triple {7811#true} assume true; {7811#true} is VALID [2022-04-28 07:15:53,358 INFO L290 TraceCheckUtils]: 93: Hoare triple {7811#true} assume !(0 == ~cond); {7811#true} is VALID [2022-04-28 07:15:53,358 INFO L290 TraceCheckUtils]: 92: Hoare triple {7811#true} ~cond := #in~cond; {7811#true} is VALID [2022-04-28 07:15:53,358 INFO L272 TraceCheckUtils]: 91: Hoare triple {8092#(<= ~counter~0 9)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7811#true} is VALID [2022-04-28 07:15:53,358 INFO L290 TraceCheckUtils]: 90: Hoare triple {8092#(<= ~counter~0 9)} assume !!(#t~post6 < 10);havoc #t~post6; {8092#(<= ~counter~0 9)} is VALID [2022-04-28 07:15:53,359 INFO L290 TraceCheckUtils]: 89: Hoare triple {8064#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8092#(<= ~counter~0 9)} is VALID [2022-04-28 07:15:53,359 INFO L290 TraceCheckUtils]: 88: Hoare triple {8064#(<= ~counter~0 8)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8064#(<= ~counter~0 8)} is VALID [2022-04-28 07:15:53,359 INFO L290 TraceCheckUtils]: 87: Hoare triple {8064#(<= ~counter~0 8)} assume !!(0 != ~y3~0); {8064#(<= ~counter~0 8)} is VALID [2022-04-28 07:15:53,360 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {7811#true} {8064#(<= ~counter~0 8)} #63#return; {8064#(<= ~counter~0 8)} is VALID [2022-04-28 07:15:53,360 INFO L290 TraceCheckUtils]: 85: Hoare triple {7811#true} assume true; {7811#true} is VALID [2022-04-28 07:15:53,360 INFO L290 TraceCheckUtils]: 84: Hoare triple {7811#true} assume !(0 == ~cond); {7811#true} is VALID [2022-04-28 07:15:53,360 INFO L290 TraceCheckUtils]: 83: Hoare triple {7811#true} ~cond := #in~cond; {7811#true} is VALID [2022-04-28 07:15:53,360 INFO L272 TraceCheckUtils]: 82: Hoare triple {8064#(<= ~counter~0 8)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7811#true} is VALID [2022-04-28 07:15:53,360 INFO L290 TraceCheckUtils]: 81: Hoare triple {8064#(<= ~counter~0 8)} assume !!(#t~post6 < 10);havoc #t~post6; {8064#(<= ~counter~0 8)} is VALID [2022-04-28 07:15:53,361 INFO L290 TraceCheckUtils]: 80: Hoare triple {8036#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8064#(<= ~counter~0 8)} is VALID [2022-04-28 07:15:53,361 INFO L290 TraceCheckUtils]: 79: Hoare triple {8036#(<= ~counter~0 7)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8036#(<= ~counter~0 7)} is VALID [2022-04-28 07:15:53,361 INFO L290 TraceCheckUtils]: 78: Hoare triple {8036#(<= ~counter~0 7)} assume !!(0 != ~y3~0); {8036#(<= ~counter~0 7)} is VALID [2022-04-28 07:15:53,362 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {7811#true} {8036#(<= ~counter~0 7)} #63#return; {8036#(<= ~counter~0 7)} is VALID [2022-04-28 07:15:53,362 INFO L290 TraceCheckUtils]: 76: Hoare triple {7811#true} assume true; {7811#true} is VALID [2022-04-28 07:15:53,362 INFO L290 TraceCheckUtils]: 75: Hoare triple {7811#true} assume !(0 == ~cond); {7811#true} is VALID [2022-04-28 07:15:53,362 INFO L290 TraceCheckUtils]: 74: Hoare triple {7811#true} ~cond := #in~cond; {7811#true} is VALID [2022-04-28 07:15:53,362 INFO L272 TraceCheckUtils]: 73: Hoare triple {8036#(<= ~counter~0 7)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7811#true} is VALID [2022-04-28 07:15:53,362 INFO L290 TraceCheckUtils]: 72: Hoare triple {8036#(<= ~counter~0 7)} assume !!(#t~post6 < 10);havoc #t~post6; {8036#(<= ~counter~0 7)} is VALID [2022-04-28 07:15:53,363 INFO L290 TraceCheckUtils]: 71: Hoare triple {8008#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8036#(<= ~counter~0 7)} is VALID [2022-04-28 07:15:53,363 INFO L290 TraceCheckUtils]: 70: Hoare triple {8008#(<= ~counter~0 6)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8008#(<= ~counter~0 6)} is VALID [2022-04-28 07:15:53,363 INFO L290 TraceCheckUtils]: 69: Hoare triple {8008#(<= ~counter~0 6)} assume !!(0 != ~y3~0); {8008#(<= ~counter~0 6)} is VALID [2022-04-28 07:15:53,364 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {7811#true} {8008#(<= ~counter~0 6)} #63#return; {8008#(<= ~counter~0 6)} is VALID [2022-04-28 07:15:53,364 INFO L290 TraceCheckUtils]: 67: Hoare triple {7811#true} assume true; {7811#true} is VALID [2022-04-28 07:15:53,364 INFO L290 TraceCheckUtils]: 66: Hoare triple {7811#true} assume !(0 == ~cond); {7811#true} is VALID [2022-04-28 07:15:53,364 INFO L290 TraceCheckUtils]: 65: Hoare triple {7811#true} ~cond := #in~cond; {7811#true} is VALID [2022-04-28 07:15:53,364 INFO L272 TraceCheckUtils]: 64: Hoare triple {8008#(<= ~counter~0 6)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7811#true} is VALID [2022-04-28 07:15:53,364 INFO L290 TraceCheckUtils]: 63: Hoare triple {8008#(<= ~counter~0 6)} assume !!(#t~post6 < 10);havoc #t~post6; {8008#(<= ~counter~0 6)} is VALID [2022-04-28 07:15:53,368 INFO L290 TraceCheckUtils]: 62: Hoare triple {7980#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8008#(<= ~counter~0 6)} is VALID [2022-04-28 07:15:53,368 INFO L290 TraceCheckUtils]: 61: Hoare triple {7980#(<= ~counter~0 5)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {7980#(<= ~counter~0 5)} is VALID [2022-04-28 07:15:53,368 INFO L290 TraceCheckUtils]: 60: Hoare triple {7980#(<= ~counter~0 5)} assume !!(0 != ~y3~0); {7980#(<= ~counter~0 5)} is VALID [2022-04-28 07:15:53,369 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {7811#true} {7980#(<= ~counter~0 5)} #63#return; {7980#(<= ~counter~0 5)} is VALID [2022-04-28 07:15:53,369 INFO L290 TraceCheckUtils]: 58: Hoare triple {7811#true} assume true; {7811#true} is VALID [2022-04-28 07:15:53,369 INFO L290 TraceCheckUtils]: 57: Hoare triple {7811#true} assume !(0 == ~cond); {7811#true} is VALID [2022-04-28 07:15:53,369 INFO L290 TraceCheckUtils]: 56: Hoare triple {7811#true} ~cond := #in~cond; {7811#true} is VALID [2022-04-28 07:15:53,369 INFO L272 TraceCheckUtils]: 55: Hoare triple {7980#(<= ~counter~0 5)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7811#true} is VALID [2022-04-28 07:15:53,369 INFO L290 TraceCheckUtils]: 54: Hoare triple {7980#(<= ~counter~0 5)} assume !!(#t~post6 < 10);havoc #t~post6; {7980#(<= ~counter~0 5)} is VALID [2022-04-28 07:15:53,370 INFO L290 TraceCheckUtils]: 53: Hoare triple {7952#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7980#(<= ~counter~0 5)} is VALID [2022-04-28 07:15:53,370 INFO L290 TraceCheckUtils]: 52: Hoare triple {7952#(<= ~counter~0 4)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {7952#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:53,370 INFO L290 TraceCheckUtils]: 51: Hoare triple {7952#(<= ~counter~0 4)} assume !!(0 != ~y3~0); {7952#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:53,371 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7811#true} {7952#(<= ~counter~0 4)} #63#return; {7952#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:53,371 INFO L290 TraceCheckUtils]: 49: Hoare triple {7811#true} assume true; {7811#true} is VALID [2022-04-28 07:15:53,371 INFO L290 TraceCheckUtils]: 48: Hoare triple {7811#true} assume !(0 == ~cond); {7811#true} is VALID [2022-04-28 07:15:53,371 INFO L290 TraceCheckUtils]: 47: Hoare triple {7811#true} ~cond := #in~cond; {7811#true} is VALID [2022-04-28 07:15:53,371 INFO L272 TraceCheckUtils]: 46: Hoare triple {7952#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7811#true} is VALID [2022-04-28 07:15:53,371 INFO L290 TraceCheckUtils]: 45: Hoare triple {7952#(<= ~counter~0 4)} assume !!(#t~post6 < 10);havoc #t~post6; {7952#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:53,372 INFO L290 TraceCheckUtils]: 44: Hoare triple {7924#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7952#(<= ~counter~0 4)} is VALID [2022-04-28 07:15:53,372 INFO L290 TraceCheckUtils]: 43: Hoare triple {7924#(<= ~counter~0 3)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {7924#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:53,372 INFO L290 TraceCheckUtils]: 42: Hoare triple {7924#(<= ~counter~0 3)} assume !!(0 != ~y3~0); {7924#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:53,372 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {7811#true} {7924#(<= ~counter~0 3)} #63#return; {7924#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:53,373 INFO L290 TraceCheckUtils]: 40: Hoare triple {7811#true} assume true; {7811#true} is VALID [2022-04-28 07:15:53,373 INFO L290 TraceCheckUtils]: 39: Hoare triple {7811#true} assume !(0 == ~cond); {7811#true} is VALID [2022-04-28 07:15:53,373 INFO L290 TraceCheckUtils]: 38: Hoare triple {7811#true} ~cond := #in~cond; {7811#true} is VALID [2022-04-28 07:15:53,373 INFO L272 TraceCheckUtils]: 37: Hoare triple {7924#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7811#true} is VALID [2022-04-28 07:15:53,373 INFO L290 TraceCheckUtils]: 36: Hoare triple {7924#(<= ~counter~0 3)} assume !!(#t~post6 < 10);havoc #t~post6; {7924#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:53,373 INFO L290 TraceCheckUtils]: 35: Hoare triple {7896#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7924#(<= ~counter~0 3)} is VALID [2022-04-28 07:15:53,375 INFO L290 TraceCheckUtils]: 34: Hoare triple {7896#(<= ~counter~0 2)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {7896#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:53,375 INFO L290 TraceCheckUtils]: 33: Hoare triple {7896#(<= ~counter~0 2)} assume !!(0 != ~y3~0); {7896#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:53,376 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7811#true} {7896#(<= ~counter~0 2)} #63#return; {7896#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:53,376 INFO L290 TraceCheckUtils]: 31: Hoare triple {7811#true} assume true; {7811#true} is VALID [2022-04-28 07:15:53,376 INFO L290 TraceCheckUtils]: 30: Hoare triple {7811#true} assume !(0 == ~cond); {7811#true} is VALID [2022-04-28 07:15:53,376 INFO L290 TraceCheckUtils]: 29: Hoare triple {7811#true} ~cond := #in~cond; {7811#true} is VALID [2022-04-28 07:15:53,376 INFO L272 TraceCheckUtils]: 28: Hoare triple {7896#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7811#true} is VALID [2022-04-28 07:15:53,379 INFO L290 TraceCheckUtils]: 27: Hoare triple {7896#(<= ~counter~0 2)} assume !!(#t~post6 < 10);havoc #t~post6; {7896#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:53,379 INFO L290 TraceCheckUtils]: 26: Hoare triple {7868#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7896#(<= ~counter~0 2)} is VALID [2022-04-28 07:15:53,379 INFO L290 TraceCheckUtils]: 25: Hoare triple {7868#(<= ~counter~0 1)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {7868#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:53,380 INFO L290 TraceCheckUtils]: 24: Hoare triple {7868#(<= ~counter~0 1)} assume !!(0 != ~y3~0); {7868#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:53,380 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7811#true} {7868#(<= ~counter~0 1)} #63#return; {7868#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:53,380 INFO L290 TraceCheckUtils]: 22: Hoare triple {7811#true} assume true; {7811#true} is VALID [2022-04-28 07:15:53,380 INFO L290 TraceCheckUtils]: 21: Hoare triple {7811#true} assume !(0 == ~cond); {7811#true} is VALID [2022-04-28 07:15:53,380 INFO L290 TraceCheckUtils]: 20: Hoare triple {7811#true} ~cond := #in~cond; {7811#true} is VALID [2022-04-28 07:15:53,380 INFO L272 TraceCheckUtils]: 19: Hoare triple {7868#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7811#true} is VALID [2022-04-28 07:15:53,381 INFO L290 TraceCheckUtils]: 18: Hoare triple {7868#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {7868#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:53,381 INFO L290 TraceCheckUtils]: 17: Hoare triple {7819#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7868#(<= ~counter~0 1)} is VALID [2022-04-28 07:15:53,381 INFO L290 TraceCheckUtils]: 16: Hoare triple {7819#(<= ~counter~0 0)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {7819#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:53,382 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7811#true} {7819#(<= ~counter~0 0)} #61#return; {7819#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:53,382 INFO L290 TraceCheckUtils]: 14: Hoare triple {7811#true} assume true; {7811#true} is VALID [2022-04-28 07:15:53,382 INFO L290 TraceCheckUtils]: 13: Hoare triple {7811#true} assume !(0 == ~cond); {7811#true} is VALID [2022-04-28 07:15:53,382 INFO L290 TraceCheckUtils]: 12: Hoare triple {7811#true} ~cond := #in~cond; {7811#true} is VALID [2022-04-28 07:15:53,382 INFO L272 TraceCheckUtils]: 11: Hoare triple {7819#(<= ~counter~0 0)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {7811#true} is VALID [2022-04-28 07:15:53,382 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7811#true} {7819#(<= ~counter~0 0)} #59#return; {7819#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:53,382 INFO L290 TraceCheckUtils]: 9: Hoare triple {7811#true} assume true; {7811#true} is VALID [2022-04-28 07:15:53,382 INFO L290 TraceCheckUtils]: 8: Hoare triple {7811#true} assume !(0 == ~cond); {7811#true} is VALID [2022-04-28 07:15:53,382 INFO L290 TraceCheckUtils]: 7: Hoare triple {7811#true} ~cond := #in~cond; {7811#true} is VALID [2022-04-28 07:15:53,382 INFO L272 TraceCheckUtils]: 6: Hoare triple {7819#(<= ~counter~0 0)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {7811#true} is VALID [2022-04-28 07:15:53,383 INFO L290 TraceCheckUtils]: 5: Hoare triple {7819#(<= ~counter~0 0)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {7819#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:53,383 INFO L272 TraceCheckUtils]: 4: Hoare triple {7819#(<= ~counter~0 0)} call #t~ret7 := main(); {7819#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:53,383 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7819#(<= ~counter~0 0)} {7811#true} #67#return; {7819#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:53,383 INFO L290 TraceCheckUtils]: 2: Hoare triple {7819#(<= ~counter~0 0)} assume true; {7819#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:53,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {7811#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7819#(<= ~counter~0 0)} is VALID [2022-04-28 07:15:53,384 INFO L272 TraceCheckUtils]: 0: Hoare triple {7811#true} call ULTIMATE.init(); {7811#true} is VALID [2022-04-28 07:15:53,384 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 18 proven. 198 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-04-28 07:15:53,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:15:53,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154101044] [2022-04-28 07:15:53,384 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:15:53,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1653742570] [2022-04-28 07:15:53,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1653742570] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:15:53,384 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:15:53,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2022-04-28 07:15:53,385 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:15:53,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [268475758] [2022-04-28 07:15:53,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [268475758] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:15:53,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:15:53,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 07:15:53,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6791288] [2022-04-28 07:15:53,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:15:53,385 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 12 states have internal predecessors, (75), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) Word has length 104 [2022-04-28 07:15:53,399 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:15:53,400 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 12 states have internal predecessors, (75), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-28 07:15:53,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-28 07:15:53,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 07:15:53,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:15:53,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 07:15:53,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2022-04-28 07:15:53,459 INFO L87 Difference]: Start difference. First operand 101 states and 111 transitions. Second operand has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 12 states have internal predecessors, (75), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-28 07:15:53,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:15:53,758 INFO L93 Difference]: Finished difference Result 115 states and 126 transitions. [2022-04-28 07:15:53,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 07:15:53,758 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 12 states have internal predecessors, (75), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) Word has length 104 [2022-04-28 07:15:53,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:15:53,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 12 states have internal predecessors, (75), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-28 07:15:53,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 125 transitions. [2022-04-28 07:15:53,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 12 states have internal predecessors, (75), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-28 07:15:53,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 125 transitions. [2022-04-28 07:15:53,762 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 125 transitions. [2022-04-28 07:15:53,850 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:15:53,852 INFO L225 Difference]: With dead ends: 115 [2022-04-28 07:15:53,852 INFO L226 Difference]: Without dead ends: 110 [2022-04-28 07:15:53,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 195 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=176, Invalid=286, Unknown=0, NotChecked=0, Total=462 [2022-04-28 07:15:53,852 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 30 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 07:15:53,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 148 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 07:15:53,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-04-28 07:15:53,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2022-04-28 07:15:53,944 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:15:53,944 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 07:15:53,945 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 07:15:53,945 INFO L87 Difference]: Start difference. First operand 110 states. Second operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 07:15:53,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:15:53,946 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2022-04-28 07:15:53,946 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2022-04-28 07:15:53,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:15:53,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:15:53,947 INFO L74 IsIncluded]: Start isIncluded. First operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 110 states. [2022-04-28 07:15:53,947 INFO L87 Difference]: Start difference. First operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 110 states. [2022-04-28 07:15:53,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:15:53,948 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2022-04-28 07:15:53,948 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2022-04-28 07:15:53,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:15:53,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:15:53,949 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:15:53,949 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:15:53,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 07:15:53,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2022-04-28 07:15:53,950 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 104 [2022-04-28 07:15:53,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:15:53,950 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2022-04-28 07:15:53,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 12 states have internal predecessors, (75), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-28 07:15:53,951 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 110 states and 121 transitions. [2022-04-28 07:15:54,059 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:15:54,059 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2022-04-28 07:15:54,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-04-28 07:15:54,060 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:15:54,060 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:15:54,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-28 07:15:54,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-28 07:15:54,267 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:15:54,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:15:54,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1468805930, now seen corresponding path program 19 times [2022-04-28 07:15:54,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:15:54,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [976330065] [2022-04-28 07:15:54,268 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:15:54,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1468805930, now seen corresponding path program 20 times [2022-04-28 07:15:54,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:15:54,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692484030] [2022-04-28 07:15:54,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:15:54,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:15:54,284 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:15:54,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [702179305] [2022-04-28 07:15:54,284 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:15:54,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:15:54,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:15:54,285 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:15:54,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-28 07:15:54,338 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:15:54,338 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-28 07:15:54,338 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 07:15:54,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 07:15:54,397 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 07:15:54,398 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-28 07:15:54,398 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-28 07:15:54,400 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 07:15:54,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-28 07:15:54,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-28 07:15:54,621 INFO L356 BasicCegarLoop]: Path program histogram: [20, 2, 2, 2, 2] [2022-04-28 07:15:54,623 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 07:15:54,635 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 07:15:54,635 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-28 07:15:54,635 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 07:15:54,635 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 07:15:54,635 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-28 07:15:54,635 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-28 07:15:54,635 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-28 07:15:54,635 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 07:15:54,635 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-28 07:15:54,635 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 07:15:54,635 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 07:15:54,635 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-28 07:15:54,635 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-28 07:15:54,635 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-28 07:15:54,635 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-28 07:15:54,635 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-28 07:15:54,635 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-28 07:15:54,635 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-28 07:15:54,635 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-28 07:15:54,635 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2022-04-28 07:15:54,635 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-04-28 07:15:54,635 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-04-28 07:15:54,635 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-04-28 07:15:54,635 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-04-28 07:15:54,635 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-04-28 07:15:54,635 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-28 07:15:54,635 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-28 07:15:54,635 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-04-28 07:15:54,635 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 07:15:54,636 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 07:15:54,636 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2022-04-28 07:15:54,636 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2022-04-28 07:15:54,636 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2022-04-28 07:15:54,636 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2022-04-28 07:15:54,636 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-28 07:15:54,636 WARN L170 areAnnotationChecker]: L36-3 has no Hoare annotation [2022-04-28 07:15:54,636 WARN L170 areAnnotationChecker]: L36-3 has no Hoare annotation [2022-04-28 07:15:54,636 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-04-28 07:15:54,636 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-04-28 07:15:54,636 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-04-28 07:15:54,636 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-04-28 07:15:54,636 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-28 07:15:54,636 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-28 07:15:54,636 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-28 07:15:54,636 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-28 07:15:54,636 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 07:15:54,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 07:15:54 BoogieIcfgContainer [2022-04-28 07:15:54,637 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 07:15:54,637 INFO L158 Benchmark]: Toolchain (without parser) took 23901.19ms. Allocated memory was 177.2MB in the beginning and 275.8MB in the end (delta: 98.6MB). Free memory was 122.4MB in the beginning and 151.3MB in the end (delta: -28.9MB). Peak memory consumption was 70.2MB. Max. memory is 8.0GB. [2022-04-28 07:15:54,638 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 177.2MB. Free memory is still 139.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 07:15:54,638 INFO L158 Benchmark]: CACSL2BoogieTranslator took 227.96ms. Allocated memory is still 177.2MB. Free memory was 122.2MB in the beginning and 152.9MB in the end (delta: -30.6MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2022-04-28 07:15:54,638 INFO L158 Benchmark]: Boogie Preprocessor took 19.08ms. Allocated memory is still 177.2MB. Free memory was 152.9MB in the beginning and 151.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 07:15:54,638 INFO L158 Benchmark]: RCFGBuilder took 267.79ms. Allocated memory is still 177.2MB. Free memory was 151.3MB in the beginning and 140.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 07:15:54,638 INFO L158 Benchmark]: TraceAbstraction took 23367.00ms. Allocated memory was 177.2MB in the beginning and 275.8MB in the end (delta: 98.6MB). Free memory was 139.8MB in the beginning and 151.3MB in the end (delta: -11.5MB). Peak memory consumption was 89.1MB. Max. memory is 8.0GB. [2022-04-28 07:15:54,639 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.10ms. Allocated memory is still 177.2MB. Free memory is still 139.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 227.96ms. Allocated memory is still 177.2MB. Free memory was 122.2MB in the beginning and 152.9MB in the end (delta: -30.6MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.08ms. Allocated memory is still 177.2MB. Free memory was 152.9MB in the beginning and 151.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 267.79ms. Allocated memory is still 177.2MB. Free memory was 151.3MB in the beginning and 140.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 23367.00ms. Allocated memory was 177.2MB in the beginning and 275.8MB in the end (delta: 98.6MB). Free memory was 139.8MB in the beginning and 151.3MB in the end (delta: -11.5MB). Peak memory consumption was 89.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; [L24] int x1, x2; [L25] int y1, y2, y3; [L26] x1 = __VERIFIER_nondet_int() [L27] x2 = __VERIFIER_nondet_int() [L29] CALL assume_abort_if_not(x1 >= 0) [L13] COND FALSE !(!cond) [L29] RET assume_abort_if_not(x1 >= 0) [L30] CALL assume_abort_if_not(x2 != 0) [L13] COND FALSE !(!cond) [L30] RET assume_abort_if_not(x2 != 0) [L32] y1 = 0 [L33] y2 = 0 [L34] y3 = x1 [L36] EXPR counter++ [L36] COND TRUE counter++<10 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L16] COND FALSE !(!(cond)) [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 [L36] EXPR counter++ [L36] COND TRUE counter++<10 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L16] COND FALSE !(!(cond)) [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 [L36] EXPR counter++ [L36] COND TRUE counter++<10 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L16] COND FALSE !(!(cond)) [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 [L36] EXPR counter++ [L36] COND TRUE counter++<10 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L16] COND FALSE !(!(cond)) [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 [L36] EXPR counter++ [L36] COND TRUE counter++<10 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L16] COND FALSE !(!(cond)) [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 [L36] EXPR counter++ [L36] COND TRUE counter++<10 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L16] COND FALSE !(!(cond)) [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 [L36] EXPR counter++ [L36] COND TRUE counter++<10 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L16] COND FALSE !(!(cond)) [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 [L36] EXPR counter++ [L36] COND TRUE counter++<10 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L16] COND FALSE !(!(cond)) [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 [L36] EXPR counter++ [L36] COND TRUE counter++<10 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L16] COND FALSE !(!(cond)) [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 [L36] EXPR counter++ [L36] COND TRUE counter++<10 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L16] COND FALSE !(!(cond)) [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 [L36] EXPR counter++ [L36] COND FALSE !(counter++<10) [L50] CALL __VERIFIER_assert(y1*x2 + y2 == x1) [L16] COND TRUE !(cond) [L18] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.3s, OverallIterations: 14, TraceHistogramMax: 11, PathProgramHistogramMax: 20, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 223 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 220 mSDsluCounter, 1308 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 927 mSDsCounter, 137 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 398 IncrementalHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 137 mSolverCounterUnsat, 381 mSDtfsCounter, 398 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1375 GetRequests, 1211 SyntacticMatches, 6 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=110occurred in iteration=13, InterpolantAutomatonStates: 146, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 13 MinimizatonAttempts, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-28 07:15:54,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...