/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_valuebound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 11:02:46,138 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 11:02:46,139 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 11:02:46,171 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 11:02:46,171 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 11:02:46,172 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 11:02:46,176 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 11:02:46,177 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 11:02:46,178 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 11:02:46,178 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 11:02:46,179 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 11:02:46,179 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 11:02:46,180 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 11:02:46,180 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 11:02:46,181 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 11:02:46,181 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 11:02:46,182 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 11:02:46,182 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 11:02:46,183 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 11:02:46,184 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 11:02:46,185 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 11:02:46,187 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 11:02:46,188 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 11:02:46,189 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 11:02:46,190 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 11:02:46,193 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 11:02:46,193 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 11:02:46,193 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 11:02:46,194 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 11:02:46,194 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 11:02:46,195 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 11:02:46,195 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 11:02:46,195 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 11:02:46,196 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 11:02:46,196 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 11:02:46,197 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 11:02:46,197 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 11:02:46,197 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 11:02:46,197 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 11:02:46,198 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 11:02:46,198 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 11:02:46,202 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 11:02:46,203 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 11:02:46,211 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 11:02:46,212 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 11:02:46,212 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 11:02:46,212 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 11:02:46,212 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 11:02:46,213 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 11:02:46,213 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 11:02:46,213 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 11:02:46,213 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 11:02:46,213 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 11:02:46,214 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 11:02:46,214 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 11:02:46,214 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 11:02:46,214 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 11:02:46,214 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 11:02:46,214 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 11:02:46,214 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 11:02:46,214 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 11:02:46,214 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 11:02:46,215 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 11:02:46,215 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 11:02:46,215 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 11:02:46,215 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 11:02:46,402 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 11:02:46,429 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 11:02:46,431 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 11:02:46,432 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 11:02:46,432 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 11:02:46,433 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_valuebound1.c [2022-04-28 11:02:46,473 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16b6716ef/1c6d97baa54f4c1083752d762513a52e/FLAGdb69da969 [2022-04-28 11:02:46,798 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 11:02:46,798 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_valuebound1.c [2022-04-28 11:02:46,801 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16b6716ef/1c6d97baa54f4c1083752d762513a52e/FLAGdb69da969 [2022-04-28 11:02:47,243 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16b6716ef/1c6d97baa54f4c1083752d762513a52e [2022-04-28 11:02:47,244 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 11:02:47,245 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 11:02:47,248 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 11:02:47,248 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 11:02:47,250 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 11:02:47,250 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 11:02:47" (1/1) ... [2022-04-28 11:02:47,251 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79456869 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:02:47, skipping insertion in model container [2022-04-28 11:02:47,251 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 11:02:47" (1/1) ... [2022-04-28 11:02:47,255 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 11:02:47,264 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 11:02:47,375 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/bresenham-ll_valuebound1.c[597,610] [2022-04-28 11:02:47,386 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 11:02:47,391 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 11:02:47,399 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/bresenham-ll_valuebound1.c[597,610] [2022-04-28 11:02:47,406 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 11:02:47,413 INFO L208 MainTranslator]: Completed translation [2022-04-28 11:02:47,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:02:47 WrapperNode [2022-04-28 11:02:47,414 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 11:02:47,414 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 11:02:47,414 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 11:02:47,414 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 11:02:47,420 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:02:47" (1/1) ... [2022-04-28 11:02:47,420 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:02:47" (1/1) ... [2022-04-28 11:02:47,424 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:02:47" (1/1) ... [2022-04-28 11:02:47,424 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:02:47" (1/1) ... [2022-04-28 11:02:47,427 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:02:47" (1/1) ... [2022-04-28 11:02:47,429 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:02:47" (1/1) ... [2022-04-28 11:02:47,431 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:02:47" (1/1) ... [2022-04-28 11:02:47,432 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 11:02:47,432 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 11:02:47,433 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 11:02:47,433 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 11:02:47,433 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:02:47" (1/1) ... [2022-04-28 11:02:47,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 11:02:47,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:02:47,462 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 11:02:47,463 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 11:02:47,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 11:02:47,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 11:02:47,499 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 11:02:47,500 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 11:02:47,500 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 11:02:47,500 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 11:02:47,500 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 11:02:47,500 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 11:02:47,500 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 11:02:47,500 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 11:02:47,500 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 11:02:47,500 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 11:02:47,500 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 11:02:47,500 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 11:02:47,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 11:02:47,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 11:02:47,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 11:02:47,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 11:02:47,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 11:02:47,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 11:02:47,540 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 11:02:47,541 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 11:02:47,656 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 11:02:47,661 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 11:02:47,661 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 11:02:47,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 11:02:47 BoogieIcfgContainer [2022-04-28 11:02:47,662 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 11:02:47,663 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 11:02:47,663 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 11:02:47,665 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 11:02:47,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 11:02:47" (1/3) ... [2022-04-28 11:02:47,666 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b18a3e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 11:02:47, skipping insertion in model container [2022-04-28 11:02:47,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:02:47" (2/3) ... [2022-04-28 11:02:47,666 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b18a3e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 11:02:47, skipping insertion in model container [2022-04-28 11:02:47,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 11:02:47" (3/3) ... [2022-04-28 11:02:47,667 INFO L111 eAbstractionObserver]: Analyzing ICFG bresenham-ll_valuebound1.c [2022-04-28 11:02:47,675 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 11:02:47,676 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 11:02:47,703 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 11:02:47,708 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@132574a5, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@74289bb2 [2022-04-28 11:02:47,708 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 11:02:47,715 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 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 11:02:47,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 11:02:47,731 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:02:47,731 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 11:02:47,732 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:02:47,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:02:47,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1867489771, now seen corresponding path program 1 times [2022-04-28 11:02:47,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:02:47,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1820359246] [2022-04-28 11:02:47,752 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:02:47,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1867489771, now seen corresponding path program 2 times [2022-04-28 11:02:47,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:02:47,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942756852] [2022-04-28 11:02:47,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:02:47,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:02:47,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:02:47,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 11:02:47,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:02:47,884 INFO L290 TraceCheckUtils]: 0: Hoare triple {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {35#true} is VALID [2022-04-28 11:02:47,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-28 11:02:47,885 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35#true} {35#true} #69#return; {35#true} is VALID [2022-04-28 11:02:47,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 11:02:47,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:02:47,891 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-28 11:02:47,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-28 11:02:47,892 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-28 11:02:47,892 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {35#true} #61#return; {36#false} is VALID [2022-04-28 11:02:47,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 11:02:47,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:02:47,901 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-28 11:02:47,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-28 11:02:47,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-28 11:02:47,902 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} #63#return; {36#false} is VALID [2022-04-28 11:02:47,902 INFO L272 TraceCheckUtils]: 0: Hoare triple {35#true} call ULTIMATE.init(); {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 11:02:47,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {35#true} is VALID [2022-04-28 11:02:47,903 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-28 11:02:47,903 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #69#return; {35#true} is VALID [2022-04-28 11:02:47,903 INFO L272 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret8 := main(); {35#true} is VALID [2022-04-28 11:02:47,903 INFO L290 TraceCheckUtils]: 5: Hoare triple {35#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {35#true} is VALID [2022-04-28 11:02:47,904 INFO L272 TraceCheckUtils]: 6: Hoare triple {35#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 1 then 1 else 0)); {35#true} is VALID [2022-04-28 11:02:47,904 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-28 11:02:47,904 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-28 11:02:47,904 INFO L290 TraceCheckUtils]: 9: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-28 11:02:47,904 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {36#false} {35#true} #61#return; {36#false} is VALID [2022-04-28 11:02:47,905 INFO L290 TraceCheckUtils]: 11: Hoare triple {36#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {36#false} is VALID [2022-04-28 11:02:47,905 INFO L272 TraceCheckUtils]: 12: Hoare triple {36#false} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 1 then 1 else 0)); {35#true} is VALID [2022-04-28 11:02:47,905 INFO L290 TraceCheckUtils]: 13: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-28 11:02:47,905 INFO L290 TraceCheckUtils]: 14: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-28 11:02:47,906 INFO L290 TraceCheckUtils]: 15: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-28 11:02:47,906 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {36#false} {36#false} #63#return; {36#false} is VALID [2022-04-28 11:02:47,906 INFO L290 TraceCheckUtils]: 17: Hoare triple {36#false} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {36#false} is VALID [2022-04-28 11:02:47,906 INFO L290 TraceCheckUtils]: 18: Hoare triple {36#false} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {36#false} is VALID [2022-04-28 11:02:47,906 INFO L272 TraceCheckUtils]: 19: Hoare triple {36#false} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {36#false} is VALID [2022-04-28 11:02:47,906 INFO L290 TraceCheckUtils]: 20: Hoare triple {36#false} ~cond := #in~cond; {36#false} is VALID [2022-04-28 11:02:47,907 INFO L290 TraceCheckUtils]: 21: Hoare triple {36#false} assume 0 == ~cond; {36#false} is VALID [2022-04-28 11:02:47,907 INFO L290 TraceCheckUtils]: 22: Hoare triple {36#false} assume !false; {36#false} is VALID [2022-04-28 11:02:47,907 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 11:02:47,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:02:47,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942756852] [2022-04-28 11:02:47,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942756852] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:02:47,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:02:47,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 11:02:47,910 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:02:47,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1820359246] [2022-04-28 11:02:47,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1820359246] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:02:47,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:02:47,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 11:02:47,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269081825] [2022-04-28 11:02:47,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:02:47,914 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (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 23 [2022-04-28 11:02:47,915 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:02:47,917 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (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 11:02:47,938 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 11:02:47,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 11:02:47,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:02:47,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 11:02:47,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 11:02:47,954 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 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 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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 11:02:48,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:02:48,056 INFO L93 Difference]: Finished difference Result 57 states and 74 transitions. [2022-04-28 11:02:48,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 11:02:48,056 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (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 23 [2022-04-28 11:02:48,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:02:48,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (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 11:02:48,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2022-04-28 11:02:48,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (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 11:02:48,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2022-04-28 11:02:48,069 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 74 transitions. [2022-04-28 11:02:48,136 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 11:02:48,145 INFO L225 Difference]: With dead ends: 57 [2022-04-28 11:02:48,145 INFO L226 Difference]: Without dead ends: 27 [2022-04-28 11:02:48,148 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 11:02:48,152 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:02:48,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 34 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:02:48,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-28 11:02:48,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-28 11:02:48,174 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:02:48,174 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 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 11:02:48,175 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 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 11:02:48,175 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 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 11:02:48,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:02:48,178 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-28 11:02:48,178 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-28 11:02:48,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:02:48,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:02:48,179 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 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 11:02:48,179 INFO L87 Difference]: Start difference. First operand has 27 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 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 11:02:48,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:02:48,183 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-28 11:02:48,183 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-28 11:02:48,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:02:48,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:02:48,184 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:02:48,184 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:02:48,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 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 11:02:48,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-04-28 11:02:48,186 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 23 [2022-04-28 11:02:48,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:02:48,187 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-04-28 11:02:48,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (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 11:02:48,187 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 30 transitions. [2022-04-28 11:02:48,217 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:02:48,218 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-28 11:02:48,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 11:02:48,219 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:02:48,220 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 11:02:48,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 11:02:48,221 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:02:48,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:02:48,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1827672217, now seen corresponding path program 1 times [2022-04-28 11:02:48,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:02:48,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [915399150] [2022-04-28 11:02:48,224 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:02:48,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1827672217, now seen corresponding path program 2 times [2022-04-28 11:02:48,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:02:48,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339527374] [2022-04-28 11:02:48,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:02:48,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:02:48,264 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:02:48,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2080812657] [2022-04-28 11:02:48,264 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:02:48,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:02:48,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:02:48,268 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 11:02:48,268 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 11:02:48,312 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 11:02:48,313 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:02:48,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 11:02:48,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:02:48,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:02:48,494 INFO L272 TraceCheckUtils]: 0: Hoare triple {273#true} call ULTIMATE.init(); {273#true} is VALID [2022-04-28 11:02:48,495 INFO L290 TraceCheckUtils]: 1: Hoare triple {273#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(15, 2);call #Ultimate.allocInit(12, 3); {273#true} is VALID [2022-04-28 11:02:48,495 INFO L290 TraceCheckUtils]: 2: Hoare triple {273#true} assume true; {273#true} is VALID [2022-04-28 11:02:48,495 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {273#true} {273#true} #69#return; {273#true} is VALID [2022-04-28 11:02:48,495 INFO L272 TraceCheckUtils]: 4: Hoare triple {273#true} call #t~ret8 := main(); {273#true} is VALID [2022-04-28 11:02:48,495 INFO L290 TraceCheckUtils]: 5: Hoare triple {273#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {273#true} is VALID [2022-04-28 11:02:48,496 INFO L272 TraceCheckUtils]: 6: Hoare triple {273#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 1 then 1 else 0)); {273#true} is VALID [2022-04-28 11:02:48,496 INFO L290 TraceCheckUtils]: 7: Hoare triple {273#true} ~cond := #in~cond; {273#true} is VALID [2022-04-28 11:02:48,496 INFO L290 TraceCheckUtils]: 8: Hoare triple {273#true} assume !(0 == ~cond); {273#true} is VALID [2022-04-28 11:02:48,496 INFO L290 TraceCheckUtils]: 9: Hoare triple {273#true} assume true; {273#true} is VALID [2022-04-28 11:02:48,497 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {273#true} {273#true} #61#return; {273#true} is VALID [2022-04-28 11:02:48,497 INFO L290 TraceCheckUtils]: 11: Hoare triple {273#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {273#true} is VALID [2022-04-28 11:02:48,497 INFO L272 TraceCheckUtils]: 12: Hoare triple {273#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 1 then 1 else 0)); {273#true} is VALID [2022-04-28 11:02:48,497 INFO L290 TraceCheckUtils]: 13: Hoare triple {273#true} ~cond := #in~cond; {273#true} is VALID [2022-04-28 11:02:48,500 INFO L290 TraceCheckUtils]: 14: Hoare triple {273#true} assume !(0 == ~cond); {273#true} is VALID [2022-04-28 11:02:48,501 INFO L290 TraceCheckUtils]: 15: Hoare triple {273#true} assume true; {273#true} is VALID [2022-04-28 11:02:48,501 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {273#true} {273#true} #63#return; {273#true} is VALID [2022-04-28 11:02:48,502 INFO L290 TraceCheckUtils]: 17: Hoare triple {273#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {329#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-28 11:02:48,503 INFO L290 TraceCheckUtils]: 18: Hoare triple {329#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {333#(and (= main_~xy~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~yx~0 0))} is VALID [2022-04-28 11:02:48,504 INFO L272 TraceCheckUtils]: 19: Hoare triple {333#(and (= main_~xy~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~yx~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {337#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:02:48,505 INFO L290 TraceCheckUtils]: 20: Hoare triple {337#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {341#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:02:48,506 INFO L290 TraceCheckUtils]: 21: Hoare triple {341#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {274#false} is VALID [2022-04-28 11:02:48,507 INFO L290 TraceCheckUtils]: 22: Hoare triple {274#false} assume !false; {274#false} is VALID [2022-04-28 11:02:48,507 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 11:02:48,507 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:02:48,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:02:48,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339527374] [2022-04-28 11:02:48,508 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:02:48,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080812657] [2022-04-28 11:02:48,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2080812657] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:02:48,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:02:48,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 11:02:48,510 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:02:48,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [915399150] [2022-04-28 11:02:48,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [915399150] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:02:48,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:02:48,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 11:02:48,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526066972] [2022-04-28 11:02:48,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:02:48,511 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 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 11:02:48,512 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:02:48,512 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 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 11:02:48,533 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 11:02:48,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 11:02:48,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:02:48,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 11:02:48,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 11:02:48,540 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 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 11:02:48,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:02:48,717 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-04-28 11:02:48,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 11:02:48,717 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 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 11:02:48,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:02:48,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 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 11:02:48,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-04-28 11:02:48,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 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 11:02:48,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-04-28 11:02:48,721 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 44 transitions. [2022-04-28 11:02:48,760 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:02:48,762 INFO L225 Difference]: With dead ends: 39 [2022-04-28 11:02:48,762 INFO L226 Difference]: Without dead ends: 35 [2022-04-28 11:02:48,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-28 11:02:48,763 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 10 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:02:48,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 91 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:02:48,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-28 11:02:48,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-04-28 11:02:48,774 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:02:48,775 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 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 11:02:48,775 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 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 11:02:48,779 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 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 11:02:48,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:02:48,783 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-04-28 11:02:48,783 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-28 11:02:48,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:02:48,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:02:48,784 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 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 35 states. [2022-04-28 11:02:48,785 INFO L87 Difference]: Start difference. First operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 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 35 states. [2022-04-28 11:02:48,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:02:48,794 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-04-28 11:02:48,794 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-28 11:02:48,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:02:48,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:02:48,795 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:02:48,795 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:02:48,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 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 11:02:48,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2022-04-28 11:02:48,797 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 23 [2022-04-28 11:02:48,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:02:48,797 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2022-04-28 11:02:48,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 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 11:02:48,797 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 37 transitions. [2022-04-28 11:02:48,844 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:02:48,845 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-28 11:02:48,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 11:02:48,847 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:02:48,847 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:02:48,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-28 11:02:49,065 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 11:02:49,065 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:02:49,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:02:49,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1419291471, now seen corresponding path program 1 times [2022-04-28 11:02:49,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:02:49,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2128433983] [2022-04-28 11:02:49,066 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:02:49,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1419291471, now seen corresponding path program 2 times [2022-04-28 11:02:49,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:02:49,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809185526] [2022-04-28 11:02:49,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:02:49,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:02:49,084 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:02:49,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2086059521] [2022-04-28 11:02:49,084 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:02:49,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:02:49,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:02:49,085 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 11:02:49,086 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 11:02:49,149 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:02:49,149 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:02:49,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 11:02:49,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:02:49,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:02:54,599 INFO L272 TraceCheckUtils]: 0: Hoare triple {567#true} call ULTIMATE.init(); {567#true} is VALID [2022-04-28 11:02:54,600 INFO L290 TraceCheckUtils]: 1: Hoare triple {567#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(15, 2);call #Ultimate.allocInit(12, 3); {567#true} is VALID [2022-04-28 11:02:54,600 INFO L290 TraceCheckUtils]: 2: Hoare triple {567#true} assume true; {567#true} is VALID [2022-04-28 11:02:54,600 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {567#true} {567#true} #69#return; {567#true} is VALID [2022-04-28 11:02:54,600 INFO L272 TraceCheckUtils]: 4: Hoare triple {567#true} call #t~ret8 := main(); {567#true} is VALID [2022-04-28 11:02:54,600 INFO L290 TraceCheckUtils]: 5: Hoare triple {567#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {567#true} is VALID [2022-04-28 11:02:54,601 INFO L272 TraceCheckUtils]: 6: Hoare triple {567#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 1 then 1 else 0)); {567#true} is VALID [2022-04-28 11:02:54,601 INFO L290 TraceCheckUtils]: 7: Hoare triple {567#true} ~cond := #in~cond; {593#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 11:02:54,602 INFO L290 TraceCheckUtils]: 8: Hoare triple {593#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {597#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:02:54,602 INFO L290 TraceCheckUtils]: 9: Hoare triple {597#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {597#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:02:54,603 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {597#(not (= |assume_abort_if_not_#in~cond| 0))} {567#true} #61#return; {604#(and (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-28 11:02:54,603 INFO L290 TraceCheckUtils]: 11: Hoare triple {604#(and (<= 0 main_~X~0) (<= main_~X~0 1))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {604#(and (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-28 11:02:54,604 INFO L272 TraceCheckUtils]: 12: Hoare triple {604#(and (<= 0 main_~X~0) (<= main_~X~0 1))} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 1 then 1 else 0)); {567#true} is VALID [2022-04-28 11:02:54,604 INFO L290 TraceCheckUtils]: 13: Hoare triple {567#true} ~cond := #in~cond; {593#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 11:02:54,604 INFO L290 TraceCheckUtils]: 14: Hoare triple {593#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {597#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:02:54,605 INFO L290 TraceCheckUtils]: 15: Hoare triple {597#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {597#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:02:54,605 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {597#(not (= |assume_abort_if_not_#in~cond| 0))} {604#(and (<= 0 main_~X~0) (<= main_~X~0 1))} #63#return; {623#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-28 11:02:54,606 INFO L290 TraceCheckUtils]: 17: Hoare triple {623#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {627#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)) (= main_~y~0 0))} is VALID [2022-04-28 11:02:54,606 INFO L290 TraceCheckUtils]: 18: Hoare triple {627#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {627#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)) (= main_~y~0 0))} is VALID [2022-04-28 11:02:54,607 INFO L272 TraceCheckUtils]: 19: Hoare triple {627#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {567#true} is VALID [2022-04-28 11:02:54,607 INFO L290 TraceCheckUtils]: 20: Hoare triple {567#true} ~cond := #in~cond; {567#true} is VALID [2022-04-28 11:02:54,607 INFO L290 TraceCheckUtils]: 21: Hoare triple {567#true} assume !(0 == ~cond); {567#true} is VALID [2022-04-28 11:02:54,607 INFO L290 TraceCheckUtils]: 22: Hoare triple {567#true} assume true; {567#true} is VALID [2022-04-28 11:02:54,609 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {567#true} {627#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)) (= main_~y~0 0))} #65#return; {627#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)) (= main_~y~0 0))} is VALID [2022-04-28 11:02:54,610 INFO L290 TraceCheckUtils]: 24: Hoare triple {627#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {627#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)) (= main_~y~0 0))} is VALID [2022-04-28 11:02:54,610 INFO L290 TraceCheckUtils]: 25: Hoare triple {627#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)) (= main_~y~0 0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {652#(and (<= (* main_~Y~0 4) (+ main_~X~0 main_~v~0)) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~Y~0) (<= main_~X~0 1) (= main_~y~0 0))} is VALID [2022-04-28 11:02:54,611 INFO L290 TraceCheckUtils]: 26: Hoare triple {652#(and (<= (* main_~Y~0 4) (+ main_~X~0 main_~v~0)) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~Y~0) (<= main_~X~0 1) (= main_~y~0 0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {652#(and (<= (* main_~Y~0 4) (+ main_~X~0 main_~v~0)) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~Y~0) (<= main_~X~0 1) (= main_~y~0 0))} is VALID [2022-04-28 11:02:54,612 INFO L290 TraceCheckUtils]: 27: Hoare triple {652#(and (<= (* main_~Y~0 4) (+ main_~X~0 main_~v~0)) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~Y~0) (<= main_~X~0 1) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {659#(and (= main_~xy~0 0) (<= (* main_~Y~0 4) (+ main_~X~0 main_~v~0)) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~Y~0) (<= main_~X~0 1) (= main_~yx~0 0))} is VALID [2022-04-28 11:02:54,613 INFO L272 TraceCheckUtils]: 28: Hoare triple {659#(and (= main_~xy~0 0) (<= (* main_~Y~0 4) (+ main_~X~0 main_~v~0)) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~Y~0) (<= main_~X~0 1) (= main_~yx~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {663#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:02:54,613 INFO L290 TraceCheckUtils]: 29: Hoare triple {663#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {667#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:02:54,613 INFO L290 TraceCheckUtils]: 30: Hoare triple {667#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {568#false} is VALID [2022-04-28 11:02:54,614 INFO L290 TraceCheckUtils]: 31: Hoare triple {568#false} assume !false; {568#false} is VALID [2022-04-28 11:02:54,614 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 11:02:54,614 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:04:41,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:04:41,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809185526] [2022-04-28 11:04:41,847 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:04:41,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086059521] [2022-04-28 11:04:41,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086059521] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 11:04:41,847 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 11:04:41,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-28 11:04:41,847 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:04:41,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2128433983] [2022-04-28 11:04:41,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2128433983] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:04:41,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:04:41,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 11:04:41,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789589859] [2022-04-28 11:04:41,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:04:41,848 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 32 [2022-04-28 11:04:41,848 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:04:41,849 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 11:04:41,869 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 11:04:41,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 11:04:41,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:04:41,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 11:04:41,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-04-28 11:04:41,870 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 11:04:42,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:04:42,225 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2022-04-28 11:04:42,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 11:04:42,225 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 32 [2022-04-28 11:04:42,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:04:42,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 11:04:42,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 67 transitions. [2022-04-28 11:04:42,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 11:04:42,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 67 transitions. [2022-04-28 11:04:42,230 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 67 transitions. [2022-04-28 11:04:42,278 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:04:42,279 INFO L225 Difference]: With dead ends: 61 [2022-04-28 11:04:42,279 INFO L226 Difference]: Without dead ends: 35 [2022-04-28 11:04:42,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2022-04-28 11:04:42,280 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 27 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:04:42,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 123 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:04:42,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-28 11:04:42,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-28 11:04:42,312 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:04:42,312 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 7 states have call successors, (7), 5 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 11:04:42,312 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 7 states have call successors, (7), 5 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 11:04:42,312 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 7 states have call successors, (7), 5 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 11:04:42,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:04:42,314 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2022-04-28 11:04:42,314 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-04-28 11:04:42,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:04:42,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:04:42,314 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 7 states have call successors, (7), 5 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 35 states. [2022-04-28 11:04:42,314 INFO L87 Difference]: Start difference. First operand has 35 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 7 states have call successors, (7), 5 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 35 states. [2022-04-28 11:04:42,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:04:42,316 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2022-04-28 11:04:42,316 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-04-28 11:04:42,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:04:42,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:04:42,316 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:04:42,316 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:04:42,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 7 states have call successors, (7), 5 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 11:04:42,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2022-04-28 11:04:42,330 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 32 [2022-04-28 11:04:42,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:04:42,330 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2022-04-28 11:04:42,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 11:04:42,331 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 38 transitions. [2022-04-28 11:04:42,365 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 11:04:42,365 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-04-28 11:04:42,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 11:04:42,365 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:04:42,366 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:04:42,381 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 11:04:42,581 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 11:04:42,582 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:04:42,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:04:42,582 INFO L85 PathProgramCache]: Analyzing trace with hash 355715891, now seen corresponding path program 1 times [2022-04-28 11:04:42,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:04:42,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [403113921] [2022-04-28 11:04:42,582 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:04:42,583 INFO L85 PathProgramCache]: Analyzing trace with hash 355715891, now seen corresponding path program 2 times [2022-04-28 11:04:42,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:04:42,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326762736] [2022-04-28 11:04:42,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:04:42,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:04:42,594 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:04:42,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [925530761] [2022-04-28 11:04:42,595 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:04:42,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:04:42,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:04:42,596 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 11:04:42,596 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 11:04:42,641 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:04:42,641 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:04:42,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 11:04:42,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:04:42,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:04:43,087 INFO L272 TraceCheckUtils]: 0: Hoare triple {971#true} call ULTIMATE.init(); {971#true} is VALID [2022-04-28 11:04:43,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {971#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(15, 2);call #Ultimate.allocInit(12, 3); {971#true} is VALID [2022-04-28 11:04:43,087 INFO L290 TraceCheckUtils]: 2: Hoare triple {971#true} assume true; {971#true} is VALID [2022-04-28 11:04:43,087 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {971#true} {971#true} #69#return; {971#true} is VALID [2022-04-28 11:04:43,087 INFO L272 TraceCheckUtils]: 4: Hoare triple {971#true} call #t~ret8 := main(); {971#true} is VALID [2022-04-28 11:04:43,087 INFO L290 TraceCheckUtils]: 5: Hoare triple {971#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {971#true} is VALID [2022-04-28 11:04:43,088 INFO L272 TraceCheckUtils]: 6: Hoare triple {971#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 1 then 1 else 0)); {971#true} is VALID [2022-04-28 11:04:43,088 INFO L290 TraceCheckUtils]: 7: Hoare triple {971#true} ~cond := #in~cond; {997#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 11:04:43,088 INFO L290 TraceCheckUtils]: 8: Hoare triple {997#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1001#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:04:43,089 INFO L290 TraceCheckUtils]: 9: Hoare triple {1001#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1001#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:04:43,089 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1001#(not (= |assume_abort_if_not_#in~cond| 0))} {971#true} #61#return; {1008#(and (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-28 11:04:43,089 INFO L290 TraceCheckUtils]: 11: Hoare triple {1008#(and (<= 0 main_~X~0) (<= main_~X~0 1))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {1008#(and (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-28 11:04:43,090 INFO L272 TraceCheckUtils]: 12: Hoare triple {1008#(and (<= 0 main_~X~0) (<= main_~X~0 1))} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 1 then 1 else 0)); {971#true} is VALID [2022-04-28 11:04:43,092 INFO L290 TraceCheckUtils]: 13: Hoare triple {971#true} ~cond := #in~cond; {997#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 11:04:43,092 INFO L290 TraceCheckUtils]: 14: Hoare triple {997#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1001#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:04:43,092 INFO L290 TraceCheckUtils]: 15: Hoare triple {1001#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1001#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:04:43,093 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1001#(not (= |assume_abort_if_not_#in~cond| 0))} {1008#(and (<= 0 main_~X~0) (<= main_~X~0 1))} #63#return; {1027#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-28 11:04:43,093 INFO L290 TraceCheckUtils]: 17: Hoare triple {1027#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {1031#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (= main_~y~0 0))} is VALID [2022-04-28 11:04:43,094 INFO L290 TraceCheckUtils]: 18: Hoare triple {1031#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1031#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (= main_~y~0 0))} is VALID [2022-04-28 11:04:43,094 INFO L272 TraceCheckUtils]: 19: Hoare triple {1031#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {971#true} is VALID [2022-04-28 11:04:43,094 INFO L290 TraceCheckUtils]: 20: Hoare triple {971#true} ~cond := #in~cond; {971#true} is VALID [2022-04-28 11:04:43,094 INFO L290 TraceCheckUtils]: 21: Hoare triple {971#true} assume !(0 == ~cond); {971#true} is VALID [2022-04-28 11:04:43,094 INFO L290 TraceCheckUtils]: 22: Hoare triple {971#true} assume true; {971#true} is VALID [2022-04-28 11:04:43,095 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {971#true} {1031#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (= main_~y~0 0))} #65#return; {1031#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (= main_~y~0 0))} is VALID [2022-04-28 11:04:43,095 INFO L290 TraceCheckUtils]: 24: Hoare triple {1031#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {1031#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (= main_~y~0 0))} is VALID [2022-04-28 11:04:43,096 INFO L290 TraceCheckUtils]: 25: Hoare triple {1031#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (= main_~y~0 0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1056#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 4)) (= main_~x~0 0) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 2)) (<= main_~Y~0 1) (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-28 11:04:43,097 INFO L290 TraceCheckUtils]: 26: Hoare triple {1056#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 4)) (= main_~x~0 0) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 2)) (<= main_~Y~0 1) (<= 0 main_~X~0) (<= main_~X~0 1))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {1060#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 4)) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 2)) (= main_~x~0 1) (<= main_~Y~0 1) (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-28 11:04:43,098 INFO L290 TraceCheckUtils]: 27: Hoare triple {1060#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 4)) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 2)) (= main_~x~0 1) (<= main_~Y~0 1) (<= 0 main_~X~0) (<= main_~X~0 1))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1064#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 4)) (<= main_~X~0 (* main_~Y~0 2)) (<= main_~Y~0 1) (= main_~X~0 main_~xy~0) (<= 0 main_~X~0) (<= main_~X~0 1) (= main_~Y~0 main_~yx~0))} is VALID [2022-04-28 11:04:43,098 INFO L272 TraceCheckUtils]: 28: Hoare triple {1064#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 4)) (<= main_~X~0 (* main_~Y~0 2)) (<= main_~Y~0 1) (= main_~X~0 main_~xy~0) (<= 0 main_~X~0) (<= main_~X~0 1) (= main_~Y~0 main_~yx~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1068#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:04:43,099 INFO L290 TraceCheckUtils]: 29: Hoare triple {1068#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1072#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:04:43,100 INFO L290 TraceCheckUtils]: 30: Hoare triple {1072#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {972#false} is VALID [2022-04-28 11:04:43,100 INFO L290 TraceCheckUtils]: 31: Hoare triple {972#false} assume !false; {972#false} is VALID [2022-04-28 11:04:43,100 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 11:04:43,100 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:04:43,413 INFO L290 TraceCheckUtils]: 31: Hoare triple {972#false} assume !false; {972#false} is VALID [2022-04-28 11:04:43,414 INFO L290 TraceCheckUtils]: 30: Hoare triple {1072#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {972#false} is VALID [2022-04-28 11:04:43,414 INFO L290 TraceCheckUtils]: 29: Hoare triple {1068#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1072#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:04:43,415 INFO L272 TraceCheckUtils]: 28: Hoare triple {1088#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1068#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:04:43,416 INFO L290 TraceCheckUtils]: 27: Hoare triple {1092#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1088#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-28 11:04:43,419 INFO L290 TraceCheckUtils]: 26: Hoare triple {1096#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {1092#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-28 11:04:43,420 INFO L290 TraceCheckUtils]: 25: Hoare triple {1100#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1096#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-28 11:04:43,421 INFO L290 TraceCheckUtils]: 24: Hoare triple {1104#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= main_~x~0 main_~X~0)))} assume !!(~x~0 <= ~X~0); {1100#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} is VALID [2022-04-28 11:04:43,422 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {971#true} {1104#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= main_~x~0 main_~X~0)))} #65#return; {1104#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= main_~x~0 main_~X~0)))} is VALID [2022-04-28 11:04:43,422 INFO L290 TraceCheckUtils]: 22: Hoare triple {971#true} assume true; {971#true} is VALID [2022-04-28 11:04:43,422 INFO L290 TraceCheckUtils]: 21: Hoare triple {971#true} assume !(0 == ~cond); {971#true} is VALID [2022-04-28 11:04:43,422 INFO L290 TraceCheckUtils]: 20: Hoare triple {971#true} ~cond := #in~cond; {971#true} is VALID [2022-04-28 11:04:43,422 INFO L272 TraceCheckUtils]: 19: Hoare triple {1104#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= main_~x~0 main_~X~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {971#true} is VALID [2022-04-28 11:04:43,423 INFO L290 TraceCheckUtils]: 18: Hoare triple {1104#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= main_~x~0 main_~X~0)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1104#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= main_~x~0 main_~X~0)))} is VALID [2022-04-28 11:04:43,423 INFO L290 TraceCheckUtils]: 17: Hoare triple {971#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {1104#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= main_~x~0 main_~X~0)))} is VALID [2022-04-28 11:04:43,423 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {971#true} {971#true} #63#return; {971#true} is VALID [2022-04-28 11:04:43,424 INFO L290 TraceCheckUtils]: 15: Hoare triple {971#true} assume true; {971#true} is VALID [2022-04-28 11:04:43,424 INFO L290 TraceCheckUtils]: 14: Hoare triple {971#true} assume !(0 == ~cond); {971#true} is VALID [2022-04-28 11:04:43,424 INFO L290 TraceCheckUtils]: 13: Hoare triple {971#true} ~cond := #in~cond; {971#true} is VALID [2022-04-28 11:04:43,424 INFO L272 TraceCheckUtils]: 12: Hoare triple {971#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 1 then 1 else 0)); {971#true} is VALID [2022-04-28 11:04:43,424 INFO L290 TraceCheckUtils]: 11: Hoare triple {971#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {971#true} is VALID [2022-04-28 11:04:43,424 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {971#true} {971#true} #61#return; {971#true} is VALID [2022-04-28 11:04:43,424 INFO L290 TraceCheckUtils]: 9: Hoare triple {971#true} assume true; {971#true} is VALID [2022-04-28 11:04:43,424 INFO L290 TraceCheckUtils]: 8: Hoare triple {971#true} assume !(0 == ~cond); {971#true} is VALID [2022-04-28 11:04:43,424 INFO L290 TraceCheckUtils]: 7: Hoare triple {971#true} ~cond := #in~cond; {971#true} is VALID [2022-04-28 11:04:43,425 INFO L272 TraceCheckUtils]: 6: Hoare triple {971#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 1 then 1 else 0)); {971#true} is VALID [2022-04-28 11:04:43,425 INFO L290 TraceCheckUtils]: 5: Hoare triple {971#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {971#true} is VALID [2022-04-28 11:04:43,425 INFO L272 TraceCheckUtils]: 4: Hoare triple {971#true} call #t~ret8 := main(); {971#true} is VALID [2022-04-28 11:04:43,425 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {971#true} {971#true} #69#return; {971#true} is VALID [2022-04-28 11:04:43,425 INFO L290 TraceCheckUtils]: 2: Hoare triple {971#true} assume true; {971#true} is VALID [2022-04-28 11:04:43,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {971#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(15, 2);call #Ultimate.allocInit(12, 3); {971#true} is VALID [2022-04-28 11:04:43,425 INFO L272 TraceCheckUtils]: 0: Hoare triple {971#true} call ULTIMATE.init(); {971#true} is VALID [2022-04-28 11:04:43,425 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 11:04:43,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:04:43,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326762736] [2022-04-28 11:04:43,426 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:04:43,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925530761] [2022-04-28 11:04:43,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [925530761] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:04:43,426 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:04:43,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 17 [2022-04-28 11:04:43,426 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:04:43,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [403113921] [2022-04-28 11:04:43,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [403113921] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:04:43,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:04:43,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 11:04:43,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007732421] [2022-04-28 11:04:43,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:04:43,427 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 32 [2022-04-28 11:04:43,427 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:04:43,427 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 11:04:43,448 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 11:04:43,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 11:04:43,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:04:43,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 11:04:43,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2022-04-28 11:04:43,449 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 11:04:43,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:04:43,863 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2022-04-28 11:04:43,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 11:04:43,863 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 32 [2022-04-28 11:04:43,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:04:43,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 11:04:43,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 64 transitions. [2022-04-28 11:04:43,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 11:04:43,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 64 transitions. [2022-04-28 11:04:43,867 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 64 transitions. [2022-04-28 11:04:43,912 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:04:43,913 INFO L225 Difference]: With dead ends: 59 [2022-04-28 11:04:43,913 INFO L226 Difference]: Without dead ends: 46 [2022-04-28 11:04:43,913 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2022-04-28 11:04:43,914 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 23 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:04:43,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 124 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:04:43,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-28 11:04:43,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2022-04-28 11:04:43,961 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:04:43,962 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 44 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 31 states have internal predecessors, (34), 8 states have call successors, (8), 6 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 11:04:43,962 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 44 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 31 states have internal predecessors, (34), 8 states have call successors, (8), 6 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 11:04:43,962 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 44 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 31 states have internal predecessors, (34), 8 states have call successors, (8), 6 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 11:04:43,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:04:43,965 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2022-04-28 11:04:43,965 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2022-04-28 11:04:43,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:04:43,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:04:43,965 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 31 states have internal predecessors, (34), 8 states have call successors, (8), 6 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 46 states. [2022-04-28 11:04:43,965 INFO L87 Difference]: Start difference. First operand has 44 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 31 states have internal predecessors, (34), 8 states have call successors, (8), 6 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 46 states. [2022-04-28 11:04:43,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:04:43,967 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2022-04-28 11:04:43,967 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2022-04-28 11:04:43,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:04:43,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:04:43,967 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:04:43,967 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:04:43,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 31 states have internal predecessors, (34), 8 states have call successors, (8), 6 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 11:04:43,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2022-04-28 11:04:43,969 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 32 [2022-04-28 11:04:43,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:04:43,969 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2022-04-28 11:04:43,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 11:04:43,969 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 48 transitions. [2022-04-28 11:04:44,022 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:04:44,022 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2022-04-28 11:04:44,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 11:04:44,022 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:04:44,023 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:04:44,039 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 11:04:44,233 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 11:04:44,234 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:04:44,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:04:44,234 INFO L85 PathProgramCache]: Analyzing trace with hash 125050924, now seen corresponding path program 1 times [2022-04-28 11:04:44,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:04:44,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2125244406] [2022-04-28 11:04:44,235 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:04:44,235 INFO L85 PathProgramCache]: Analyzing trace with hash 125050924, now seen corresponding path program 2 times [2022-04-28 11:04:44,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:04:44,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751596991] [2022-04-28 11:04:44,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:04:44,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:04:44,257 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:04:44,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1507063451] [2022-04-28 11:04:44,257 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:04:44,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:04:44,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:04:44,259 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 11:04:44,261 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 11:04:44,303 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:04:44,303 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:04:44,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-28 11:04:44,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:04:44,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:05:00,831 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 11:05:06,629 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 11:05:12,661 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 11:05:15,060 INFO L272 TraceCheckUtils]: 0: Hoare triple {1483#true} call ULTIMATE.init(); {1483#true} is VALID [2022-04-28 11:05:15,060 INFO L290 TraceCheckUtils]: 1: Hoare triple {1483#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(15, 2);call #Ultimate.allocInit(12, 3); {1483#true} is VALID [2022-04-28 11:05:15,060 INFO L290 TraceCheckUtils]: 2: Hoare triple {1483#true} assume true; {1483#true} is VALID [2022-04-28 11:05:15,060 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1483#true} {1483#true} #69#return; {1483#true} is VALID [2022-04-28 11:05:15,060 INFO L272 TraceCheckUtils]: 4: Hoare triple {1483#true} call #t~ret8 := main(); {1483#true} is VALID [2022-04-28 11:05:15,060 INFO L290 TraceCheckUtils]: 5: Hoare triple {1483#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {1483#true} is VALID [2022-04-28 11:05:15,060 INFO L272 TraceCheckUtils]: 6: Hoare triple {1483#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 1 then 1 else 0)); {1483#true} is VALID [2022-04-28 11:05:15,061 INFO L290 TraceCheckUtils]: 7: Hoare triple {1483#true} ~cond := #in~cond; {1483#true} is VALID [2022-04-28 11:05:15,061 INFO L290 TraceCheckUtils]: 8: Hoare triple {1483#true} assume !(0 == ~cond); {1483#true} is VALID [2022-04-28 11:05:15,061 INFO L290 TraceCheckUtils]: 9: Hoare triple {1483#true} assume true; {1483#true} is VALID [2022-04-28 11:05:15,061 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1483#true} {1483#true} #61#return; {1483#true} is VALID [2022-04-28 11:05:15,061 INFO L290 TraceCheckUtils]: 11: Hoare triple {1483#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {1483#true} is VALID [2022-04-28 11:05:15,061 INFO L272 TraceCheckUtils]: 12: Hoare triple {1483#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 1 then 1 else 0)); {1483#true} is VALID [2022-04-28 11:05:15,061 INFO L290 TraceCheckUtils]: 13: Hoare triple {1483#true} ~cond := #in~cond; {1483#true} is VALID [2022-04-28 11:05:15,061 INFO L290 TraceCheckUtils]: 14: Hoare triple {1483#true} assume !(0 == ~cond); {1483#true} is VALID [2022-04-28 11:05:15,061 INFO L290 TraceCheckUtils]: 15: Hoare triple {1483#true} assume true; {1483#true} is VALID [2022-04-28 11:05:15,061 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1483#true} {1483#true} #63#return; {1483#true} is VALID [2022-04-28 11:05:15,062 INFO L290 TraceCheckUtils]: 17: Hoare triple {1483#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {1539#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 11:05:15,062 INFO L290 TraceCheckUtils]: 18: Hoare triple {1539#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1539#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 11:05:15,062 INFO L272 TraceCheckUtils]: 19: Hoare triple {1539#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1483#true} is VALID [2022-04-28 11:05:15,063 INFO L290 TraceCheckUtils]: 20: Hoare triple {1483#true} ~cond := #in~cond; {1549#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:05:15,064 INFO L290 TraceCheckUtils]: 21: Hoare triple {1549#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1553#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:05:15,064 INFO L290 TraceCheckUtils]: 22: Hoare triple {1553#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1553#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:05:15,065 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1553#(not (= |__VERIFIER_assert_#in~cond| 0))} {1539#(and (= main_~x~0 0) (= main_~y~0 0))} #65#return; {1539#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 11:05:15,065 INFO L290 TraceCheckUtils]: 24: Hoare triple {1539#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {1563#(and (<= main_~x~0 main_~X~0) (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 11:05:15,065 INFO L290 TraceCheckUtils]: 25: Hoare triple {1563#(and (<= main_~x~0 main_~X~0) (= main_~x~0 0) (= main_~y~0 0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1567#(and (<= main_~x~0 main_~X~0) (= main_~x~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:05:15,066 INFO L290 TraceCheckUtils]: 26: Hoare triple {1567#(and (<= main_~x~0 main_~X~0) (= main_~x~0 0) (= main_~y~0 1))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {1571#(and (= main_~y~0 1) (<= main_~x~0 1) (<= 0 main_~X~0))} is VALID [2022-04-28 11:05:15,067 INFO L290 TraceCheckUtils]: 27: Hoare triple {1571#(and (= main_~y~0 1) (<= main_~x~0 1) (<= 0 main_~X~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1575#(and (= main_~y~0 1) (<= main_~x~0 1) (<= 0 main_~X~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} is VALID [2022-04-28 11:05:15,067 INFO L272 TraceCheckUtils]: 28: Hoare triple {1575#(and (= main_~y~0 1) (<= main_~x~0 1) (<= 0 main_~X~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1483#true} is VALID [2022-04-28 11:05:15,067 INFO L290 TraceCheckUtils]: 29: Hoare triple {1483#true} ~cond := #in~cond; {1549#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:05:15,068 INFO L290 TraceCheckUtils]: 30: Hoare triple {1549#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1553#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:05:15,068 INFO L290 TraceCheckUtils]: 31: Hoare triple {1553#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1553#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:05:15,072 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1553#(not (= |__VERIFIER_assert_#in~cond| 0))} {1575#(and (= main_~y~0 1) (<= main_~x~0 1) (<= 0 main_~X~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} #65#return; {1591#(and (= main_~y~0 1) (<= main_~x~0 1) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 0 main_~X~0))} is VALID [2022-04-28 11:05:15,072 INFO L290 TraceCheckUtils]: 33: Hoare triple {1591#(and (= main_~y~0 1) (<= main_~x~0 1) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 0 main_~X~0))} assume !(~x~0 <= ~X~0); {1595#(and (= main_~y~0 1) (<= main_~x~0 1) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 0 main_~X~0) (not (<= main_~x~0 main_~X~0)))} is VALID [2022-04-28 11:05:15,079 INFO L290 TraceCheckUtils]: 34: Hoare triple {1595#(and (= main_~y~0 1) (<= main_~x~0 1) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 0 main_~X~0) (not (<= main_~x~0 main_~X~0)))} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {1599#(and (= main_~y~0 1) (<= 0 main_~X~0) (or (and (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0) (< main_~X~0 (div main_~xy~0 main_~y~0)) (= main_~yx~0 0) (= 0 (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0))) (<= (div main_~xy~0 main_~y~0) 1) (= main_~Y~0 0)) (and (= (* main_~y~0 (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0)) main_~xy~0) (= (mod (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) 0) (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0) (<= (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) 1) (not (<= (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) main_~X~0)) (not (= main_~Y~0 0)) (= main_~yx~0 (* main_~Y~0 (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0))))))} is VALID [2022-04-28 11:05:15,080 INFO L272 TraceCheckUtils]: 35: Hoare triple {1599#(and (= main_~y~0 1) (<= 0 main_~X~0) (or (and (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0) (< main_~X~0 (div main_~xy~0 main_~y~0)) (= main_~yx~0 0) (= 0 (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0))) (<= (div main_~xy~0 main_~y~0) 1) (= main_~Y~0 0)) (and (= (* main_~y~0 (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0)) main_~xy~0) (= (mod (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) 0) (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0) (<= (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) 1) (not (<= (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) main_~X~0)) (not (= main_~Y~0 0)) (= main_~yx~0 (* main_~Y~0 (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0))))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {1603#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:05:15,081 INFO L290 TraceCheckUtils]: 36: Hoare triple {1603#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1607#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:05:15,081 INFO L290 TraceCheckUtils]: 37: Hoare triple {1607#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1484#false} is VALID [2022-04-28 11:05:15,081 INFO L290 TraceCheckUtils]: 38: Hoare triple {1484#false} assume !false; {1484#false} is VALID [2022-04-28 11:05:15,082 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-28 11:05:15,082 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:05:25,608 INFO L290 TraceCheckUtils]: 38: Hoare triple {1484#false} assume !false; {1484#false} is VALID [2022-04-28 11:05:25,609 INFO L290 TraceCheckUtils]: 37: Hoare triple {1607#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1484#false} is VALID [2022-04-28 11:05:25,609 INFO L290 TraceCheckUtils]: 36: Hoare triple {1603#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1607#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:05:25,610 INFO L272 TraceCheckUtils]: 35: Hoare triple {1623#(= (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* 2 main_~xy~0) main_~X~0 main_~v~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {1603#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:05:25,611 INFO L290 TraceCheckUtils]: 34: Hoare triple {1627#(= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {1623#(= (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* 2 main_~xy~0) main_~X~0 main_~v~0))} is VALID [2022-04-28 11:05:25,611 INFO L290 TraceCheckUtils]: 33: Hoare triple {1631#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} assume !(~x~0 <= ~X~0); {1627#(= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} is VALID [2022-04-28 11:05:25,612 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1553#(not (= |__VERIFIER_assert_#in~cond| 0))} {1635#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* (- 2) main_~xy~0) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} #65#return; {1631#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} is VALID [2022-04-28 11:05:25,616 INFO L290 TraceCheckUtils]: 31: Hoare triple {1553#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1553#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:05:25,616 INFO L290 TraceCheckUtils]: 30: Hoare triple {1645#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1553#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:05:25,616 INFO L290 TraceCheckUtils]: 29: Hoare triple {1483#true} ~cond := #in~cond; {1645#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:05:25,617 INFO L272 TraceCheckUtils]: 28: Hoare triple {1635#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* (- 2) main_~xy~0) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1483#true} is VALID [2022-04-28 11:05:25,617 INFO L290 TraceCheckUtils]: 27: Hoare triple {1652#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* main_~Y~0 2) (* (* main_~X~0 main_~y~0) (- 2)) (* 2 (* main_~Y~0 main_~x~0))) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1635#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* (- 2) main_~xy~0) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} is VALID [2022-04-28 11:05:25,618 INFO L290 TraceCheckUtils]: 26: Hoare triple {1656#(forall ((v_main_~x~0_14 Int)) (or (<= v_main_~x~0_14 main_~X~0) (not (<= v_main_~x~0_14 (+ main_~x~0 1))) (= (+ (* 2 (* v_main_~x~0_14 main_~Y~0)) (* main_~y~0 2) (* main_~Y~0 2)) (+ (* 2 (* v_main_~x~0_14 main_~Y~0)) (* main_~Y~0 2) (* (* main_~X~0 main_~y~0) (- 2)) (* 2 (* v_main_~x~0_14 main_~y~0))))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {1652#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* main_~Y~0 2) (* (* main_~X~0 main_~y~0) (- 2)) (* 2 (* main_~Y~0 main_~x~0))) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} is VALID [2022-04-28 11:05:25,620 INFO L290 TraceCheckUtils]: 25: Hoare triple {1660#(forall ((v_main_~x~0_14 Int)) (or (= (+ (* 2 (* v_main_~x~0_14 main_~Y~0)) 2 (* main_~y~0 2) (* main_~Y~0 2)) (+ (* 2 (* v_main_~x~0_14 main_~Y~0)) (* main_~Y~0 2) (* (* v_main_~x~0_14 (+ main_~y~0 1)) 2) (* (* main_~X~0 (+ main_~y~0 1)) (- 2)))) (<= v_main_~x~0_14 main_~X~0) (not (<= v_main_~x~0_14 (+ main_~x~0 1)))))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1656#(forall ((v_main_~x~0_14 Int)) (or (<= v_main_~x~0_14 main_~X~0) (not (<= v_main_~x~0_14 (+ main_~x~0 1))) (= (+ (* 2 (* v_main_~x~0_14 main_~Y~0)) (* main_~y~0 2) (* main_~Y~0 2)) (+ (* 2 (* v_main_~x~0_14 main_~Y~0)) (* main_~Y~0 2) (* (* main_~X~0 main_~y~0) (- 2)) (* 2 (* v_main_~x~0_14 main_~y~0))))))} is VALID [2022-04-28 11:05:25,622 INFO L290 TraceCheckUtils]: 24: Hoare triple {1483#true} assume !!(~x~0 <= ~X~0); {1660#(forall ((v_main_~x~0_14 Int)) (or (= (+ (* 2 (* v_main_~x~0_14 main_~Y~0)) 2 (* main_~y~0 2) (* main_~Y~0 2)) (+ (* 2 (* v_main_~x~0_14 main_~Y~0)) (* main_~Y~0 2) (* (* v_main_~x~0_14 (+ main_~y~0 1)) 2) (* (* main_~X~0 (+ main_~y~0 1)) (- 2)))) (<= v_main_~x~0_14 main_~X~0) (not (<= v_main_~x~0_14 (+ main_~x~0 1)))))} is VALID [2022-04-28 11:05:25,622 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1483#true} {1483#true} #65#return; {1483#true} is VALID [2022-04-28 11:05:25,622 INFO L290 TraceCheckUtils]: 22: Hoare triple {1483#true} assume true; {1483#true} is VALID [2022-04-28 11:05:25,622 INFO L290 TraceCheckUtils]: 21: Hoare triple {1483#true} assume !(0 == ~cond); {1483#true} is VALID [2022-04-28 11:05:25,622 INFO L290 TraceCheckUtils]: 20: Hoare triple {1483#true} ~cond := #in~cond; {1483#true} is VALID [2022-04-28 11:05:25,622 INFO L272 TraceCheckUtils]: 19: Hoare triple {1483#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1483#true} is VALID [2022-04-28 11:05:25,622 INFO L290 TraceCheckUtils]: 18: Hoare triple {1483#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1483#true} is VALID [2022-04-28 11:05:25,622 INFO L290 TraceCheckUtils]: 17: Hoare triple {1483#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {1483#true} is VALID [2022-04-28 11:05:25,622 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1483#true} {1483#true} #63#return; {1483#true} is VALID [2022-04-28 11:05:25,623 INFO L290 TraceCheckUtils]: 15: Hoare triple {1483#true} assume true; {1483#true} is VALID [2022-04-28 11:05:25,623 INFO L290 TraceCheckUtils]: 14: Hoare triple {1483#true} assume !(0 == ~cond); {1483#true} is VALID [2022-04-28 11:05:25,623 INFO L290 TraceCheckUtils]: 13: Hoare triple {1483#true} ~cond := #in~cond; {1483#true} is VALID [2022-04-28 11:05:25,623 INFO L272 TraceCheckUtils]: 12: Hoare triple {1483#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 1 then 1 else 0)); {1483#true} is VALID [2022-04-28 11:05:25,623 INFO L290 TraceCheckUtils]: 11: Hoare triple {1483#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {1483#true} is VALID [2022-04-28 11:05:25,623 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1483#true} {1483#true} #61#return; {1483#true} is VALID [2022-04-28 11:05:25,623 INFO L290 TraceCheckUtils]: 9: Hoare triple {1483#true} assume true; {1483#true} is VALID [2022-04-28 11:05:25,623 INFO L290 TraceCheckUtils]: 8: Hoare triple {1483#true} assume !(0 == ~cond); {1483#true} is VALID [2022-04-28 11:05:25,623 INFO L290 TraceCheckUtils]: 7: Hoare triple {1483#true} ~cond := #in~cond; {1483#true} is VALID [2022-04-28 11:05:25,623 INFO L272 TraceCheckUtils]: 6: Hoare triple {1483#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 1 then 1 else 0)); {1483#true} is VALID [2022-04-28 11:05:25,623 INFO L290 TraceCheckUtils]: 5: Hoare triple {1483#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {1483#true} is VALID [2022-04-28 11:05:25,624 INFO L272 TraceCheckUtils]: 4: Hoare triple {1483#true} call #t~ret8 := main(); {1483#true} is VALID [2022-04-28 11:05:25,624 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1483#true} {1483#true} #69#return; {1483#true} is VALID [2022-04-28 11:05:25,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {1483#true} assume true; {1483#true} is VALID [2022-04-28 11:05:25,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {1483#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(15, 2);call #Ultimate.allocInit(12, 3); {1483#true} is VALID [2022-04-28 11:05:25,624 INFO L272 TraceCheckUtils]: 0: Hoare triple {1483#true} call ULTIMATE.init(); {1483#true} is VALID [2022-04-28 11:05:25,624 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-28 11:05:25,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:05:25,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751596991] [2022-04-28 11:05:25,624 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:05:25,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507063451] [2022-04-28 11:05:25,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1507063451] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:05:25,625 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:05:25,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 22 [2022-04-28 11:05:25,625 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:05:25,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2125244406] [2022-04-28 11:05:25,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2125244406] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:05:25,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:05:25,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 11:05:25,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039647007] [2022-04-28 11:05:25,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:05:25,626 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 39 [2022-04-28 11:05:25,626 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:05:25,626 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 11:05:25,655 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:05:25,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 11:05:25,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:05:25,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 11:05:25,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2022-04-28 11:05:25,656 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand has 14 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 11:05:28,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:05:28,870 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2022-04-28 11:05:28,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 11:05:28,871 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 39 [2022-04-28 11:05:28,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:05:28,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 11:05:28,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 49 transitions. [2022-04-28 11:05:28,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 11:05:28,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 49 transitions. [2022-04-28 11:05:28,873 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 49 transitions. [2022-04-28 11:05:28,918 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:05:28,919 INFO L225 Difference]: With dead ends: 52 [2022-04-28 11:05:28,919 INFO L226 Difference]: Without dead ends: 44 [2022-04-28 11:05:28,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2022-04-28 11:05:28,920 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 16 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 11:05:28,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 185 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 11:05:28,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-28 11:05:28,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-28 11:05:28,968 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:05:28,968 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 8 states have call successors, (8), 6 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 11:05:28,968 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 8 states have call successors, (8), 6 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 11:05:28,968 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 8 states have call successors, (8), 6 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 11:05:28,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:05:28,970 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2022-04-28 11:05:28,970 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2022-04-28 11:05:28,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:05:28,970 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:05:28,970 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 8 states have call successors, (8), 6 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 44 states. [2022-04-28 11:05:28,970 INFO L87 Difference]: Start difference. First operand has 44 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 8 states have call successors, (8), 6 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 44 states. [2022-04-28 11:05:28,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:05:28,971 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2022-04-28 11:05:28,972 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2022-04-28 11:05:28,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:05:28,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:05:28,972 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:05:28,972 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:05:28,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 8 states have call successors, (8), 6 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 11:05:28,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2022-04-28 11:05:28,973 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 39 [2022-04-28 11:05:28,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:05:28,973 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2022-04-28 11:05:28,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 11:05:28,974 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 47 transitions. [2022-04-28 11:05:29,024 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 11:05:29,024 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2022-04-28 11:05:29,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 11:05:29,024 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:05:29,025 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:05:29,041 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 11:05:29,229 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 11:05:29,229 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:05:29,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:05:29,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1487887833, now seen corresponding path program 3 times [2022-04-28 11:05:29,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:05:29,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [868973836] [2022-04-28 11:05:29,230 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:05:29,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1487887833, now seen corresponding path program 4 times [2022-04-28 11:05:29,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:05:29,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620003755] [2022-04-28 11:05:29,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:05:29,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:05:29,248 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:05:29,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [299906398] [2022-04-28 11:05:29,248 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:05:29,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:05:29,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:05:29,253 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 11:05:29,254 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 11:05:29,289 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:05:29,289 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:05:29,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-28 11:05:29,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:05:29,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:05:39,187 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 11:05:39,417 INFO L272 TraceCheckUtils]: 0: Hoare triple {2028#true} call ULTIMATE.init(); {2028#true} is VALID [2022-04-28 11:05:39,417 INFO L290 TraceCheckUtils]: 1: Hoare triple {2028#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(15, 2);call #Ultimate.allocInit(12, 3); {2028#true} is VALID [2022-04-28 11:05:39,417 INFO L290 TraceCheckUtils]: 2: Hoare triple {2028#true} assume true; {2028#true} is VALID [2022-04-28 11:05:39,417 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2028#true} {2028#true} #69#return; {2028#true} is VALID [2022-04-28 11:05:39,418 INFO L272 TraceCheckUtils]: 4: Hoare triple {2028#true} call #t~ret8 := main(); {2028#true} is VALID [2022-04-28 11:05:39,418 INFO L290 TraceCheckUtils]: 5: Hoare triple {2028#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {2028#true} is VALID [2022-04-28 11:05:39,418 INFO L272 TraceCheckUtils]: 6: Hoare triple {2028#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 1 then 1 else 0)); {2028#true} is VALID [2022-04-28 11:05:39,418 INFO L290 TraceCheckUtils]: 7: Hoare triple {2028#true} ~cond := #in~cond; {2028#true} is VALID [2022-04-28 11:05:39,418 INFO L290 TraceCheckUtils]: 8: Hoare triple {2028#true} assume !(0 == ~cond); {2028#true} is VALID [2022-04-28 11:05:39,418 INFO L290 TraceCheckUtils]: 9: Hoare triple {2028#true} assume true; {2028#true} is VALID [2022-04-28 11:05:39,418 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2028#true} {2028#true} #61#return; {2028#true} is VALID [2022-04-28 11:05:39,418 INFO L290 TraceCheckUtils]: 11: Hoare triple {2028#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {2028#true} is VALID [2022-04-28 11:05:39,418 INFO L272 TraceCheckUtils]: 12: Hoare triple {2028#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 1 then 1 else 0)); {2028#true} is VALID [2022-04-28 11:05:39,425 INFO L290 TraceCheckUtils]: 13: Hoare triple {2028#true} ~cond := #in~cond; {2072#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 11:05:39,426 INFO L290 TraceCheckUtils]: 14: Hoare triple {2072#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2076#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:05:39,426 INFO L290 TraceCheckUtils]: 15: Hoare triple {2076#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2076#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:05:39,427 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2076#(not (= |assume_abort_if_not_#in~cond| 0))} {2028#true} #63#return; {2083#(and (<= main_~Y~0 1) (<= 0 main_~Y~0))} is VALID [2022-04-28 11:05:39,429 INFO L290 TraceCheckUtils]: 17: Hoare triple {2083#(and (<= main_~Y~0 1) (<= 0 main_~Y~0))} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {2087#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (= main_~y~0 0))} is VALID [2022-04-28 11:05:39,430 INFO L290 TraceCheckUtils]: 18: Hoare triple {2087#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2087#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (= main_~y~0 0))} is VALID [2022-04-28 11:05:39,430 INFO L272 TraceCheckUtils]: 19: Hoare triple {2087#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2028#true} is VALID [2022-04-28 11:05:39,430 INFO L290 TraceCheckUtils]: 20: Hoare triple {2028#true} ~cond := #in~cond; {2028#true} is VALID [2022-04-28 11:05:39,430 INFO L290 TraceCheckUtils]: 21: Hoare triple {2028#true} assume !(0 == ~cond); {2028#true} is VALID [2022-04-28 11:05:39,430 INFO L290 TraceCheckUtils]: 22: Hoare triple {2028#true} assume true; {2028#true} is VALID [2022-04-28 11:05:39,431 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2028#true} {2087#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (= main_~y~0 0))} #65#return; {2087#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (= main_~y~0 0))} is VALID [2022-04-28 11:05:39,433 INFO L290 TraceCheckUtils]: 24: Hoare triple {2087#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {2087#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (= main_~y~0 0))} is VALID [2022-04-28 11:05:39,434 INFO L290 TraceCheckUtils]: 25: Hoare triple {2087#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (= main_~y~0 0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2112#(and (= main_~x~0 0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (<= 1 main_~y~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} is VALID [2022-04-28 11:05:39,435 INFO L290 TraceCheckUtils]: 26: Hoare triple {2112#(and (= main_~x~0 0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (<= 1 main_~y~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2116#(and (= main_~x~0 1) (<= main_~Y~0 1) (<= 0 main_~Y~0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (<= 1 main_~y~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} is VALID [2022-04-28 11:05:39,435 INFO L290 TraceCheckUtils]: 27: Hoare triple {2116#(and (= main_~x~0 1) (<= main_~Y~0 1) (<= 0 main_~Y~0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (<= 1 main_~y~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2120#(and (= main_~x~0 1) (<= main_~Y~0 1) (<= 0 main_~Y~0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= 1 main_~y~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} is VALID [2022-04-28 11:05:39,435 INFO L272 TraceCheckUtils]: 28: Hoare triple {2120#(and (= main_~x~0 1) (<= main_~Y~0 1) (<= 0 main_~Y~0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= 1 main_~y~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2028#true} is VALID [2022-04-28 11:05:39,436 INFO L290 TraceCheckUtils]: 29: Hoare triple {2028#true} ~cond := #in~cond; {2127#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:05:39,436 INFO L290 TraceCheckUtils]: 30: Hoare triple {2127#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2131#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:05:39,436 INFO L290 TraceCheckUtils]: 31: Hoare triple {2131#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2131#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:05:39,437 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2131#(not (= |__VERIFIER_assert_#in~cond| 0))} {2120#(and (= main_~x~0 1) (<= main_~Y~0 1) (<= 0 main_~Y~0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= 1 main_~y~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} #65#return; {2138#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (= main_~x~0 1) (<= main_~Y~0 1) (<= 0 main_~Y~0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (<= 1 main_~y~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} is VALID [2022-04-28 11:05:39,438 INFO L290 TraceCheckUtils]: 33: Hoare triple {2138#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (= main_~x~0 1) (<= main_~Y~0 1) (<= 0 main_~Y~0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (<= 1 main_~y~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} assume !!(~x~0 <= ~X~0); {2142#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 4)) (<= main_~x~0 main_~X~0) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (= main_~x~0 1) (<= main_~Y~0 1) (<= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 2))))} is VALID [2022-04-28 11:05:39,440 INFO L290 TraceCheckUtils]: 34: Hoare triple {2142#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 4)) (<= main_~x~0 main_~X~0) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (= main_~x~0 1) (<= main_~Y~0 1) (<= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 2))))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2146#(and (<= main_~x~0 main_~X~0) (<= (* main_~X~0 3) (* main_~Y~0 4)) (= (+ (* main_~X~0 4) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) (* main_~Y~0 2))) (= main_~x~0 1) (<= main_~Y~0 1) (= (+ main_~v~0 (* 5 main_~X~0)) (* main_~Y~0 6)))} is VALID [2022-04-28 11:05:39,440 INFO L290 TraceCheckUtils]: 35: Hoare triple {2146#(and (<= main_~x~0 main_~X~0) (<= (* main_~X~0 3) (* main_~Y~0 4)) (= (+ (* main_~X~0 4) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) (* main_~Y~0 2))) (= main_~x~0 1) (<= main_~Y~0 1) (= (+ main_~v~0 (* 5 main_~X~0)) (* main_~Y~0 6)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2150#(and (= (+ (- 1) main_~x~0) 1) (= (+ (* main_~X~0 4) (* 2 (* (+ (- 1) main_~x~0) main_~Y~0))) (+ (* (* main_~X~0 main_~y~0) 2) (* main_~Y~0 2))) (<= (* main_~X~0 3) (* main_~Y~0 4)) (<= main_~Y~0 1) (<= main_~x~0 (+ main_~X~0 1)) (= (+ main_~v~0 (* 5 main_~X~0)) (* main_~Y~0 6)))} is VALID [2022-04-28 11:05:39,442 INFO L290 TraceCheckUtils]: 36: Hoare triple {2150#(and (= (+ (- 1) main_~x~0) 1) (= (+ (* main_~X~0 4) (* 2 (* (+ (- 1) main_~x~0) main_~Y~0))) (+ (* (* main_~X~0 main_~y~0) 2) (* main_~Y~0 2))) (<= (* main_~X~0 3) (* main_~Y~0 4)) (<= main_~Y~0 1) (<= main_~x~0 (+ main_~X~0 1)) (= (+ main_~v~0 (* 5 main_~X~0)) (* main_~Y~0 6)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2154#(and (= (* (div (* main_~X~0 2) main_~X~0) main_~X~0) main_~xy~0) (= (* main_~Y~0 2) main_~yx~0) (<= (* main_~X~0 3) (* main_~Y~0 4)) (<= main_~Y~0 1) (<= 1 main_~X~0) (= (+ main_~v~0 (* 5 main_~X~0)) (* main_~Y~0 6)))} is VALID [2022-04-28 11:05:39,443 INFO L272 TraceCheckUtils]: 37: Hoare triple {2154#(and (= (* (div (* main_~X~0 2) main_~X~0) main_~X~0) main_~xy~0) (= (* main_~Y~0 2) main_~yx~0) (<= (* main_~X~0 3) (* main_~Y~0 4)) (<= main_~Y~0 1) (<= 1 main_~X~0) (= (+ main_~v~0 (* 5 main_~X~0)) (* main_~Y~0 6)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2158#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:05:39,444 INFO L290 TraceCheckUtils]: 38: Hoare triple {2158#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2162#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:05:39,444 INFO L290 TraceCheckUtils]: 39: Hoare triple {2162#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2029#false} is VALID [2022-04-28 11:05:39,444 INFO L290 TraceCheckUtils]: 40: Hoare triple {2029#false} assume !false; {2029#false} is VALID [2022-04-28 11:05:39,444 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 11:05:39,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:05:42,502 INFO L290 TraceCheckUtils]: 40: Hoare triple {2029#false} assume !false; {2029#false} is VALID [2022-04-28 11:05:42,502 INFO L290 TraceCheckUtils]: 39: Hoare triple {2162#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2029#false} is VALID [2022-04-28 11:05:42,502 INFO L290 TraceCheckUtils]: 38: Hoare triple {2158#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2162#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:05:42,503 INFO L272 TraceCheckUtils]: 37: Hoare triple {2178#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2158#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:05:42,504 INFO L290 TraceCheckUtils]: 36: Hoare triple {2182#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2178#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-28 11:05:42,505 INFO L290 TraceCheckUtils]: 35: Hoare triple {2186#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2182#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-28 11:05:42,507 INFO L290 TraceCheckUtils]: 34: Hoare triple {2190#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2186#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-28 11:05:42,507 INFO L290 TraceCheckUtils]: 33: Hoare triple {2194#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= main_~x~0 main_~X~0)))} assume !!(~x~0 <= ~X~0); {2190#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} is VALID [2022-04-28 11:05:42,508 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2131#(not (= |__VERIFIER_assert_#in~cond| 0))} {2198#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))) (not (<= main_~x~0 main_~X~0)))} #65#return; {2194#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= main_~x~0 main_~X~0)))} is VALID [2022-04-28 11:05:42,508 INFO L290 TraceCheckUtils]: 31: Hoare triple {2131#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2131#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:05:42,509 INFO L290 TraceCheckUtils]: 30: Hoare triple {2208#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2131#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:05:42,509 INFO L290 TraceCheckUtils]: 29: Hoare triple {2028#true} ~cond := #in~cond; {2208#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:05:42,509 INFO L272 TraceCheckUtils]: 28: Hoare triple {2198#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))) (not (<= main_~x~0 main_~X~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2028#true} is VALID [2022-04-28 11:05:42,510 INFO L290 TraceCheckUtils]: 27: Hoare triple {2028#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2198#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))) (not (<= main_~x~0 main_~X~0)))} is VALID [2022-04-28 11:05:42,510 INFO L290 TraceCheckUtils]: 26: Hoare triple {2028#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2028#true} is VALID [2022-04-28 11:05:42,510 INFO L290 TraceCheckUtils]: 25: Hoare triple {2028#true} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2028#true} is VALID [2022-04-28 11:05:42,510 INFO L290 TraceCheckUtils]: 24: Hoare triple {2028#true} assume !!(~x~0 <= ~X~0); {2028#true} is VALID [2022-04-28 11:05:42,511 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2028#true} {2028#true} #65#return; {2028#true} is VALID [2022-04-28 11:05:42,511 INFO L290 TraceCheckUtils]: 22: Hoare triple {2028#true} assume true; {2028#true} is VALID [2022-04-28 11:05:42,511 INFO L290 TraceCheckUtils]: 21: Hoare triple {2028#true} assume !(0 == ~cond); {2028#true} is VALID [2022-04-28 11:05:42,511 INFO L290 TraceCheckUtils]: 20: Hoare triple {2028#true} ~cond := #in~cond; {2028#true} is VALID [2022-04-28 11:05:42,511 INFO L272 TraceCheckUtils]: 19: Hoare triple {2028#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2028#true} is VALID [2022-04-28 11:05:42,511 INFO L290 TraceCheckUtils]: 18: Hoare triple {2028#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2028#true} is VALID [2022-04-28 11:05:42,511 INFO L290 TraceCheckUtils]: 17: Hoare triple {2028#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {2028#true} is VALID [2022-04-28 11:05:42,511 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2028#true} {2028#true} #63#return; {2028#true} is VALID [2022-04-28 11:05:42,511 INFO L290 TraceCheckUtils]: 15: Hoare triple {2028#true} assume true; {2028#true} is VALID [2022-04-28 11:05:42,512 INFO L290 TraceCheckUtils]: 14: Hoare triple {2028#true} assume !(0 == ~cond); {2028#true} is VALID [2022-04-28 11:05:42,512 INFO L290 TraceCheckUtils]: 13: Hoare triple {2028#true} ~cond := #in~cond; {2028#true} is VALID [2022-04-28 11:05:42,512 INFO L272 TraceCheckUtils]: 12: Hoare triple {2028#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 1 then 1 else 0)); {2028#true} is VALID [2022-04-28 11:05:42,512 INFO L290 TraceCheckUtils]: 11: Hoare triple {2028#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {2028#true} is VALID [2022-04-28 11:05:42,512 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2028#true} {2028#true} #61#return; {2028#true} is VALID [2022-04-28 11:05:42,513 INFO L290 TraceCheckUtils]: 9: Hoare triple {2028#true} assume true; {2028#true} is VALID [2022-04-28 11:05:42,513 INFO L290 TraceCheckUtils]: 8: Hoare triple {2028#true} assume !(0 == ~cond); {2028#true} is VALID [2022-04-28 11:05:42,513 INFO L290 TraceCheckUtils]: 7: Hoare triple {2028#true} ~cond := #in~cond; {2028#true} is VALID [2022-04-28 11:05:42,513 INFO L272 TraceCheckUtils]: 6: Hoare triple {2028#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 1 then 1 else 0)); {2028#true} is VALID [2022-04-28 11:05:42,513 INFO L290 TraceCheckUtils]: 5: Hoare triple {2028#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {2028#true} is VALID [2022-04-28 11:05:42,513 INFO L272 TraceCheckUtils]: 4: Hoare triple {2028#true} call #t~ret8 := main(); {2028#true} is VALID [2022-04-28 11:05:42,513 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2028#true} {2028#true} #69#return; {2028#true} is VALID [2022-04-28 11:05:42,513 INFO L290 TraceCheckUtils]: 2: Hoare triple {2028#true} assume true; {2028#true} is VALID [2022-04-28 11:05:42,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {2028#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(15, 2);call #Ultimate.allocInit(12, 3); {2028#true} is VALID [2022-04-28 11:05:42,514 INFO L272 TraceCheckUtils]: 0: Hoare triple {2028#true} call ULTIMATE.init(); {2028#true} is VALID [2022-04-28 11:05:42,514 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 11:05:42,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:05:42,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620003755] [2022-04-28 11:05:42,515 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:05:42,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299906398] [2022-04-28 11:05:42,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299906398] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:05:42,515 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:05:42,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12] total 25 [2022-04-28 11:05:42,515 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:05:42,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [868973836] [2022-04-28 11:05:42,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [868973836] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:05:42,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:05:42,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 11:05:42,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446423863] [2022-04-28 11:05:42,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:05:42,517 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 1.8125) internal successors, (29), 15 states have internal predecessors, (29), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 41 [2022-04-28 11:05:42,518 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:05:42,518 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 16 states have (on average 1.8125) internal successors, (29), 15 states have internal predecessors, (29), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 11:05:42,551 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 11:05:42,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 11:05:42,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:05:42,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 11:05:42,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2022-04-28 11:05:42,552 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand has 18 states, 16 states have (on average 1.8125) internal successors, (29), 15 states have internal predecessors, (29), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 11:05:43,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:05:43,690 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2022-04-28 11:05:43,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 11:05:43,691 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 1.8125) internal successors, (29), 15 states have internal predecessors, (29), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 41 [2022-04-28 11:05:43,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:05:43,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 1.8125) internal successors, (29), 15 states have internal predecessors, (29), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 11:05:43,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 58 transitions. [2022-04-28 11:05:43,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 1.8125) internal successors, (29), 15 states have internal predecessors, (29), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 11:05:43,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 58 transitions. [2022-04-28 11:05:43,695 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 58 transitions. [2022-04-28 11:05:43,748 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:05:43,749 INFO L225 Difference]: With dead ends: 60 [2022-04-28 11:05:43,749 INFO L226 Difference]: Without dead ends: 45 [2022-04-28 11:05:43,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=141, Invalid=789, Unknown=0, NotChecked=0, Total=930 [2022-04-28 11:05:43,750 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 21 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 11:05:43,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 167 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 11:05:43,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-28 11:05:43,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-28 11:05:43,811 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:05:43,812 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 31 states have (on average 1.0) internal successors, (31), 31 states have internal predecessors, (31), 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 11:05:43,812 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 31 states have (on average 1.0) internal successors, (31), 31 states have internal predecessors, (31), 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 11:05:43,812 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 31 states have (on average 1.0) internal successors, (31), 31 states have internal predecessors, (31), 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 11:05:43,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:05:43,813 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2022-04-28 11:05:43,813 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2022-04-28 11:05:43,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:05:43,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:05:43,814 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 31 states have (on average 1.0) internal successors, (31), 31 states have internal predecessors, (31), 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 45 states. [2022-04-28 11:05:43,814 INFO L87 Difference]: Start difference. First operand has 45 states, 31 states have (on average 1.0) internal successors, (31), 31 states have internal predecessors, (31), 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 45 states. [2022-04-28 11:05:43,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:05:43,815 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2022-04-28 11:05:43,815 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2022-04-28 11:05:43,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:05:43,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:05:43,816 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:05:43,816 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:05:43,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 31 states have (on average 1.0) internal successors, (31), 31 states have internal predecessors, (31), 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 11:05:43,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2022-04-28 11:05:43,818 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 41 [2022-04-28 11:05:43,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:05:43,819 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2022-04-28 11:05:43,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 1.8125) internal successors, (29), 15 states have internal predecessors, (29), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 11:05:43,819 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 45 transitions. [2022-04-28 11:05:43,867 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 11:05:43,867 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2022-04-28 11:05:43,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-28 11:05:43,868 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:05:43,868 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:05:43,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 11:05:44,073 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 11:05:44,073 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:05:44,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:05:44,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1154259258, now seen corresponding path program 3 times [2022-04-28 11:05:44,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:05:44,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [8022190] [2022-04-28 11:05:44,074 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:05:44,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1154259258, now seen corresponding path program 4 times [2022-04-28 11:05:44,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:05:44,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223017896] [2022-04-28 11:05:44,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:05:44,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:05:44,088 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:05:44,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [461719511] [2022-04-28 11:05:44,088 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:05:44,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:05:44,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:05:44,089 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 11:05:44,089 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 11:05:44,132 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:05:44,132 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:05:44,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 11:05:44,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:05:44,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:05:44,862 INFO L272 TraceCheckUtils]: 0: Hoare triple {2610#true} call ULTIMATE.init(); {2610#true} is VALID [2022-04-28 11:05:44,862 INFO L290 TraceCheckUtils]: 1: Hoare triple {2610#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(15, 2);call #Ultimate.allocInit(12, 3); {2610#true} is VALID [2022-04-28 11:05:44,862 INFO L290 TraceCheckUtils]: 2: Hoare triple {2610#true} assume true; {2610#true} is VALID [2022-04-28 11:05:44,862 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2610#true} {2610#true} #69#return; {2610#true} is VALID [2022-04-28 11:05:44,862 INFO L272 TraceCheckUtils]: 4: Hoare triple {2610#true} call #t~ret8 := main(); {2610#true} is VALID [2022-04-28 11:05:44,862 INFO L290 TraceCheckUtils]: 5: Hoare triple {2610#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {2610#true} is VALID [2022-04-28 11:05:44,862 INFO L272 TraceCheckUtils]: 6: Hoare triple {2610#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 1 then 1 else 0)); {2610#true} is VALID [2022-04-28 11:05:44,862 INFO L290 TraceCheckUtils]: 7: Hoare triple {2610#true} ~cond := #in~cond; {2610#true} is VALID [2022-04-28 11:05:44,862 INFO L290 TraceCheckUtils]: 8: Hoare triple {2610#true} assume !(0 == ~cond); {2610#true} is VALID [2022-04-28 11:05:44,863 INFO L290 TraceCheckUtils]: 9: Hoare triple {2610#true} assume true; {2610#true} is VALID [2022-04-28 11:05:44,863 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2610#true} {2610#true} #61#return; {2610#true} is VALID [2022-04-28 11:05:44,863 INFO L290 TraceCheckUtils]: 11: Hoare triple {2610#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {2610#true} is VALID [2022-04-28 11:05:44,863 INFO L272 TraceCheckUtils]: 12: Hoare triple {2610#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 1 then 1 else 0)); {2610#true} is VALID [2022-04-28 11:05:44,863 INFO L290 TraceCheckUtils]: 13: Hoare triple {2610#true} ~cond := #in~cond; {2654#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 11:05:44,864 INFO L290 TraceCheckUtils]: 14: Hoare triple {2654#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2658#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:05:44,864 INFO L290 TraceCheckUtils]: 15: Hoare triple {2658#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2658#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:05:44,864 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2658#(not (= |assume_abort_if_not_#in~cond| 0))} {2610#true} #63#return; {2665#(and (<= main_~Y~0 1) (<= 0 main_~Y~0))} is VALID [2022-04-28 11:05:44,879 INFO L290 TraceCheckUtils]: 17: Hoare triple {2665#(and (<= main_~Y~0 1) (<= 0 main_~Y~0))} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {2669#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (= main_~y~0 0))} is VALID [2022-04-28 11:05:44,879 INFO L290 TraceCheckUtils]: 18: Hoare triple {2669#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2669#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (= main_~y~0 0))} is VALID [2022-04-28 11:05:44,880 INFO L272 TraceCheckUtils]: 19: Hoare triple {2669#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2610#true} is VALID [2022-04-28 11:05:44,880 INFO L290 TraceCheckUtils]: 20: Hoare triple {2610#true} ~cond := #in~cond; {2610#true} is VALID [2022-04-28 11:05:44,880 INFO L290 TraceCheckUtils]: 21: Hoare triple {2610#true} assume !(0 == ~cond); {2610#true} is VALID [2022-04-28 11:05:44,880 INFO L290 TraceCheckUtils]: 22: Hoare triple {2610#true} assume true; {2610#true} is VALID [2022-04-28 11:05:44,880 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2610#true} {2669#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (= main_~y~0 0))} #65#return; {2669#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (= main_~y~0 0))} is VALID [2022-04-28 11:05:44,881 INFO L290 TraceCheckUtils]: 24: Hoare triple {2669#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {2669#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (= main_~y~0 0))} is VALID [2022-04-28 11:05:44,882 INFO L290 TraceCheckUtils]: 25: Hoare triple {2669#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (= main_~y~0 0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2694#(and (= main_~x~0 0) (= (+ (- 1) main_~y~0) 0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} is VALID [2022-04-28 11:05:44,882 INFO L290 TraceCheckUtils]: 26: Hoare triple {2694#(and (= main_~x~0 0) (= (+ (- 1) main_~y~0) 0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2698#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 1) (<= main_~Y~0 1) (<= 0 main_~Y~0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} is VALID [2022-04-28 11:05:44,883 INFO L290 TraceCheckUtils]: 27: Hoare triple {2698#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 1) (<= main_~Y~0 1) (<= 0 main_~Y~0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2698#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 1) (<= main_~Y~0 1) (<= 0 main_~Y~0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} is VALID [2022-04-28 11:05:44,883 INFO L272 TraceCheckUtils]: 28: Hoare triple {2698#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 1) (<= main_~Y~0 1) (<= 0 main_~Y~0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2610#true} is VALID [2022-04-28 11:05:44,883 INFO L290 TraceCheckUtils]: 29: Hoare triple {2610#true} ~cond := #in~cond; {2610#true} is VALID [2022-04-28 11:05:44,883 INFO L290 TraceCheckUtils]: 30: Hoare triple {2610#true} assume !(0 == ~cond); {2610#true} is VALID [2022-04-28 11:05:44,883 INFO L290 TraceCheckUtils]: 31: Hoare triple {2610#true} assume true; {2610#true} is VALID [2022-04-28 11:05:44,884 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2610#true} {2698#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 1) (<= main_~Y~0 1) (<= 0 main_~Y~0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} #65#return; {2698#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 1) (<= main_~Y~0 1) (<= 0 main_~Y~0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} is VALID [2022-04-28 11:05:44,884 INFO L290 TraceCheckUtils]: 33: Hoare triple {2698#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 1) (<= main_~Y~0 1) (<= 0 main_~Y~0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} assume !!(~x~0 <= ~X~0); {2720#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 4)) (<= main_~x~0 main_~X~0) (= main_~y~0 1) (= main_~x~0 1) (<= main_~Y~0 1) (<= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 2))))} is VALID [2022-04-28 11:05:44,885 INFO L290 TraceCheckUtils]: 34: Hoare triple {2720#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 4)) (<= main_~x~0 main_~X~0) (= main_~y~0 1) (= main_~x~0 1) (<= main_~Y~0 1) (<= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 2))))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2724#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (<= main_~x~0 main_~X~0) (= (+ (- 1) main_~y~0) 1) (<= main_~X~0 (* main_~Y~0 2)) (= main_~x~0 1) (<= main_~Y~0 1))} is VALID [2022-04-28 11:05:44,885 INFO L290 TraceCheckUtils]: 35: Hoare triple {2724#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (<= main_~x~0 main_~X~0) (= (+ (- 1) main_~y~0) 1) (<= main_~X~0 (* main_~Y~0 2)) (= main_~x~0 1) (<= main_~Y~0 1))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2728#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (+ (- 1) main_~y~0) 1) (<= main_~X~0 (* main_~Y~0 2)) (<= main_~Y~0 1) (= main_~x~0 2) (<= 1 main_~X~0))} is VALID [2022-04-28 11:05:44,886 INFO L290 TraceCheckUtils]: 36: Hoare triple {2728#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (+ (- 1) main_~y~0) 1) (<= main_~X~0 (* main_~Y~0 2)) (<= main_~Y~0 1) (= main_~x~0 2) (<= 1 main_~X~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2728#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (+ (- 1) main_~y~0) 1) (<= main_~X~0 (* main_~Y~0 2)) (<= main_~Y~0 1) (= main_~x~0 2) (<= 1 main_~X~0))} is VALID [2022-04-28 11:05:44,886 INFO L272 TraceCheckUtils]: 37: Hoare triple {2728#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (+ (- 1) main_~y~0) 1) (<= main_~X~0 (* main_~Y~0 2)) (<= main_~Y~0 1) (= main_~x~0 2) (<= 1 main_~X~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2610#true} is VALID [2022-04-28 11:05:44,886 INFO L290 TraceCheckUtils]: 38: Hoare triple {2610#true} ~cond := #in~cond; {2610#true} is VALID [2022-04-28 11:05:44,886 INFO L290 TraceCheckUtils]: 39: Hoare triple {2610#true} assume !(0 == ~cond); {2610#true} is VALID [2022-04-28 11:05:44,886 INFO L290 TraceCheckUtils]: 40: Hoare triple {2610#true} assume true; {2610#true} is VALID [2022-04-28 11:05:44,887 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2610#true} {2728#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (+ (- 1) main_~y~0) 1) (<= main_~X~0 (* main_~Y~0 2)) (<= main_~Y~0 1) (= main_~x~0 2) (<= 1 main_~X~0))} #65#return; {2728#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (+ (- 1) main_~y~0) 1) (<= main_~X~0 (* main_~Y~0 2)) (<= main_~Y~0 1) (= main_~x~0 2) (<= 1 main_~X~0))} is VALID [2022-04-28 11:05:44,887 INFO L290 TraceCheckUtils]: 42: Hoare triple {2728#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (+ (- 1) main_~y~0) 1) (<= main_~X~0 (* main_~Y~0 2)) (<= main_~Y~0 1) (= main_~x~0 2) (<= 1 main_~X~0))} assume !(~x~0 <= ~X~0); {2750#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (+ (- 1) main_~y~0) 1) (<= main_~X~0 (* main_~Y~0 2)) (<= main_~Y~0 1) (not (<= main_~x~0 main_~X~0)) (= main_~x~0 2) (<= 1 main_~X~0))} is VALID [2022-04-28 11:05:44,888 INFO L290 TraceCheckUtils]: 43: Hoare triple {2750#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (+ (- 1) main_~y~0) 1) (<= main_~X~0 (* main_~Y~0 2)) (<= main_~Y~0 1) (not (<= main_~x~0 main_~X~0)) (= main_~x~0 2) (<= 1 main_~X~0))} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {2754#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (* main_~y~0 2) main_~xy~0) (= (+ (- 1) main_~y~0) 1) (= (* main_~Y~0 2) main_~yx~0) (<= main_~X~0 (* main_~Y~0 2)) (<= main_~Y~0 1) (<= 1 main_~X~0) (not (<= 2 main_~X~0)))} is VALID [2022-04-28 11:05:44,889 INFO L272 TraceCheckUtils]: 44: Hoare triple {2754#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (* main_~y~0 2) main_~xy~0) (= (+ (- 1) main_~y~0) 1) (= (* main_~Y~0 2) main_~yx~0) (<= main_~X~0 (* main_~Y~0 2)) (<= main_~Y~0 1) (<= 1 main_~X~0) (not (<= 2 main_~X~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {2758#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:05:44,889 INFO L290 TraceCheckUtils]: 45: Hoare triple {2758#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2762#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:05:44,890 INFO L290 TraceCheckUtils]: 46: Hoare triple {2762#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2611#false} is VALID [2022-04-28 11:05:44,890 INFO L290 TraceCheckUtils]: 47: Hoare triple {2611#false} assume !false; {2611#false} is VALID [2022-04-28 11:05:44,890 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-28 11:05:44,890 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:05:45,405 INFO L290 TraceCheckUtils]: 47: Hoare triple {2611#false} assume !false; {2611#false} is VALID [2022-04-28 11:05:45,405 INFO L290 TraceCheckUtils]: 46: Hoare triple {2762#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2611#false} is VALID [2022-04-28 11:05:45,406 INFO L290 TraceCheckUtils]: 45: Hoare triple {2758#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2762#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:05:45,406 INFO L272 TraceCheckUtils]: 44: Hoare triple {2778#(= (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* 2 main_~xy~0) main_~X~0 main_~v~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {2758#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:05:45,407 INFO L290 TraceCheckUtils]: 43: Hoare triple {2782#(= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {2778#(= (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* 2 main_~xy~0) main_~X~0 main_~v~0))} is VALID [2022-04-28 11:05:45,408 INFO L290 TraceCheckUtils]: 42: Hoare triple {2786#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} assume !(~x~0 <= ~X~0); {2782#(= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} is VALID [2022-04-28 11:05:45,408 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2610#true} {2786#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} #65#return; {2786#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} is VALID [2022-04-28 11:05:45,408 INFO L290 TraceCheckUtils]: 40: Hoare triple {2610#true} assume true; {2610#true} is VALID [2022-04-28 11:05:45,408 INFO L290 TraceCheckUtils]: 39: Hoare triple {2610#true} assume !(0 == ~cond); {2610#true} is VALID [2022-04-28 11:05:45,408 INFO L290 TraceCheckUtils]: 38: Hoare triple {2610#true} ~cond := #in~cond; {2610#true} is VALID [2022-04-28 11:05:45,409 INFO L272 TraceCheckUtils]: 37: Hoare triple {2786#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2610#true} is VALID [2022-04-28 11:05:45,410 INFO L290 TraceCheckUtils]: 36: Hoare triple {2786#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2786#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} is VALID [2022-04-28 11:05:45,413 INFO L290 TraceCheckUtils]: 35: Hoare triple {2808#(or (= (+ (* (* (+ main_~x~0 1) main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (<= (+ main_~x~0 1) main_~X~0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2786#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} is VALID [2022-04-28 11:05:45,415 INFO L290 TraceCheckUtils]: 34: Hoare triple {2812#(or (<= (+ main_~x~0 1) main_~X~0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) (+ main_~y~0 1)))) (+ 2 (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2808#(or (= (+ (* (* (+ main_~x~0 1) main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (<= (+ main_~x~0 1) main_~X~0))} is VALID [2022-04-28 11:05:45,419 INFO L290 TraceCheckUtils]: 33: Hoare triple {2816#(or (<= (+ main_~x~0 1) main_~X~0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) (+ main_~y~0 1)))) (+ 2 (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= main_~x~0 main_~X~0)))} assume !!(~x~0 <= ~X~0); {2812#(or (<= (+ main_~x~0 1) main_~X~0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) (+ main_~y~0 1)))) (+ 2 (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} is VALID [2022-04-28 11:05:45,420 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2610#true} {2816#(or (<= (+ main_~x~0 1) main_~X~0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) (+ main_~y~0 1)))) (+ 2 (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= main_~x~0 main_~X~0)))} #65#return; {2816#(or (<= (+ main_~x~0 1) main_~X~0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) (+ main_~y~0 1)))) (+ 2 (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= main_~x~0 main_~X~0)))} is VALID [2022-04-28 11:05:45,420 INFO L290 TraceCheckUtils]: 31: Hoare triple {2610#true} assume true; {2610#true} is VALID [2022-04-28 11:05:45,420 INFO L290 TraceCheckUtils]: 30: Hoare triple {2610#true} assume !(0 == ~cond); {2610#true} is VALID [2022-04-28 11:05:45,420 INFO L290 TraceCheckUtils]: 29: Hoare triple {2610#true} ~cond := #in~cond; {2610#true} is VALID [2022-04-28 11:05:45,420 INFO L272 TraceCheckUtils]: 28: Hoare triple {2816#(or (<= (+ main_~x~0 1) main_~X~0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) (+ main_~y~0 1)))) (+ 2 (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= main_~x~0 main_~X~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2610#true} is VALID [2022-04-28 11:05:45,425 INFO L290 TraceCheckUtils]: 27: Hoare triple {2816#(or (<= (+ main_~x~0 1) main_~X~0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) (+ main_~y~0 1)))) (+ 2 (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= main_~x~0 main_~X~0)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2816#(or (<= (+ main_~x~0 1) main_~X~0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) (+ main_~y~0 1)))) (+ 2 (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= main_~x~0 main_~X~0)))} is VALID [2022-04-28 11:05:45,428 INFO L290 TraceCheckUtils]: 26: Hoare triple {2838#(or (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* (+ main_~x~0 2) (+ main_~y~0 1)) 2)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) 2 (* main_~y~0 2) (* main_~Y~0 2))) (<= (+ main_~x~0 2) main_~X~0) (not (<= (+ main_~x~0 1) main_~X~0)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2816#(or (<= (+ main_~x~0 1) main_~X~0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) (+ main_~y~0 1)))) (+ 2 (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= main_~x~0 main_~X~0)))} is VALID [2022-04-28 11:05:45,429 INFO L290 TraceCheckUtils]: 25: Hoare triple {2842#(or (<= (+ main_~x~0 2) main_~X~0) (= (+ (* main_~X~0 (- 3)) main_~v~0 (* main_~Y~0 4) (* (* (+ main_~y~0 2) (+ main_~x~0 2)) 2)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~y~0 2) (* main_~Y~0 2) 4)) (< main_~v~0 0) (not (<= (+ main_~x~0 1) main_~X~0)))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2838#(or (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* (+ main_~x~0 2) (+ main_~y~0 1)) 2)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) 2 (* main_~y~0 2) (* main_~Y~0 2))) (<= (+ main_~x~0 2) main_~X~0) (not (<= (+ main_~x~0 1) main_~X~0)))} is VALID [2022-04-28 11:05:45,430 INFO L290 TraceCheckUtils]: 24: Hoare triple {2842#(or (<= (+ main_~x~0 2) main_~X~0) (= (+ (* main_~X~0 (- 3)) main_~v~0 (* main_~Y~0 4) (* (* (+ main_~y~0 2) (+ main_~x~0 2)) 2)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~y~0 2) (* main_~Y~0 2) 4)) (< main_~v~0 0) (not (<= (+ main_~x~0 1) main_~X~0)))} assume !!(~x~0 <= ~X~0); {2842#(or (<= (+ main_~x~0 2) main_~X~0) (= (+ (* main_~X~0 (- 3)) main_~v~0 (* main_~Y~0 4) (* (* (+ main_~y~0 2) (+ main_~x~0 2)) 2)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~y~0 2) (* main_~Y~0 2) 4)) (< main_~v~0 0) (not (<= (+ main_~x~0 1) main_~X~0)))} is VALID [2022-04-28 11:05:45,430 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2610#true} {2842#(or (<= (+ main_~x~0 2) main_~X~0) (= (+ (* main_~X~0 (- 3)) main_~v~0 (* main_~Y~0 4) (* (* (+ main_~y~0 2) (+ main_~x~0 2)) 2)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~y~0 2) (* main_~Y~0 2) 4)) (< main_~v~0 0) (not (<= (+ main_~x~0 1) main_~X~0)))} #65#return; {2842#(or (<= (+ main_~x~0 2) main_~X~0) (= (+ (* main_~X~0 (- 3)) main_~v~0 (* main_~Y~0 4) (* (* (+ main_~y~0 2) (+ main_~x~0 2)) 2)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~y~0 2) (* main_~Y~0 2) 4)) (< main_~v~0 0) (not (<= (+ main_~x~0 1) main_~X~0)))} is VALID [2022-04-28 11:05:45,431 INFO L290 TraceCheckUtils]: 22: Hoare triple {2610#true} assume true; {2610#true} is VALID [2022-04-28 11:05:45,431 INFO L290 TraceCheckUtils]: 21: Hoare triple {2610#true} assume !(0 == ~cond); {2610#true} is VALID [2022-04-28 11:05:45,431 INFO L290 TraceCheckUtils]: 20: Hoare triple {2610#true} ~cond := #in~cond; {2610#true} is VALID [2022-04-28 11:05:45,431 INFO L272 TraceCheckUtils]: 19: Hoare triple {2842#(or (<= (+ main_~x~0 2) main_~X~0) (= (+ (* main_~X~0 (- 3)) main_~v~0 (* main_~Y~0 4) (* (* (+ main_~y~0 2) (+ main_~x~0 2)) 2)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~y~0 2) (* main_~Y~0 2) 4)) (< main_~v~0 0) (not (<= (+ main_~x~0 1) main_~X~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2610#true} is VALID [2022-04-28 11:05:45,431 INFO L290 TraceCheckUtils]: 18: Hoare triple {2842#(or (<= (+ main_~x~0 2) main_~X~0) (= (+ (* main_~X~0 (- 3)) main_~v~0 (* main_~Y~0 4) (* (* (+ main_~y~0 2) (+ main_~x~0 2)) 2)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~y~0 2) (* main_~Y~0 2) 4)) (< main_~v~0 0) (not (<= (+ main_~x~0 1) main_~X~0)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2842#(or (<= (+ main_~x~0 2) main_~X~0) (= (+ (* main_~X~0 (- 3)) main_~v~0 (* main_~Y~0 4) (* (* (+ main_~y~0 2) (+ main_~x~0 2)) 2)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~y~0 2) (* main_~Y~0 2) 4)) (< main_~v~0 0) (not (<= (+ main_~x~0 1) main_~X~0)))} is VALID [2022-04-28 11:05:45,432 INFO L290 TraceCheckUtils]: 17: Hoare triple {2610#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {2842#(or (<= (+ main_~x~0 2) main_~X~0) (= (+ (* main_~X~0 (- 3)) main_~v~0 (* main_~Y~0 4) (* (* (+ main_~y~0 2) (+ main_~x~0 2)) 2)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~y~0 2) (* main_~Y~0 2) 4)) (< main_~v~0 0) (not (<= (+ main_~x~0 1) main_~X~0)))} is VALID [2022-04-28 11:05:45,432 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2610#true} {2610#true} #63#return; {2610#true} is VALID [2022-04-28 11:05:45,432 INFO L290 TraceCheckUtils]: 15: Hoare triple {2610#true} assume true; {2610#true} is VALID [2022-04-28 11:05:45,432 INFO L290 TraceCheckUtils]: 14: Hoare triple {2610#true} assume !(0 == ~cond); {2610#true} is VALID [2022-04-28 11:05:45,432 INFO L290 TraceCheckUtils]: 13: Hoare triple {2610#true} ~cond := #in~cond; {2610#true} is VALID [2022-04-28 11:05:45,432 INFO L272 TraceCheckUtils]: 12: Hoare triple {2610#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 1 then 1 else 0)); {2610#true} is VALID [2022-04-28 11:05:45,432 INFO L290 TraceCheckUtils]: 11: Hoare triple {2610#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {2610#true} is VALID [2022-04-28 11:05:45,433 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2610#true} {2610#true} #61#return; {2610#true} is VALID [2022-04-28 11:05:45,433 INFO L290 TraceCheckUtils]: 9: Hoare triple {2610#true} assume true; {2610#true} is VALID [2022-04-28 11:05:45,433 INFO L290 TraceCheckUtils]: 8: Hoare triple {2610#true} assume !(0 == ~cond); {2610#true} is VALID [2022-04-28 11:05:45,433 INFO L290 TraceCheckUtils]: 7: Hoare triple {2610#true} ~cond := #in~cond; {2610#true} is VALID [2022-04-28 11:05:45,433 INFO L272 TraceCheckUtils]: 6: Hoare triple {2610#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 1 then 1 else 0)); {2610#true} is VALID [2022-04-28 11:05:45,433 INFO L290 TraceCheckUtils]: 5: Hoare triple {2610#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {2610#true} is VALID [2022-04-28 11:05:45,433 INFO L272 TraceCheckUtils]: 4: Hoare triple {2610#true} call #t~ret8 := main(); {2610#true} is VALID [2022-04-28 11:05:45,433 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2610#true} {2610#true} #69#return; {2610#true} is VALID [2022-04-28 11:05:45,433 INFO L290 TraceCheckUtils]: 2: Hoare triple {2610#true} assume true; {2610#true} is VALID [2022-04-28 11:05:45,433 INFO L290 TraceCheckUtils]: 1: Hoare triple {2610#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(15, 2);call #Ultimate.allocInit(12, 3); {2610#true} is VALID [2022-04-28 11:05:45,433 INFO L272 TraceCheckUtils]: 0: Hoare triple {2610#true} call ULTIMATE.init(); {2610#true} is VALID [2022-04-28 11:05:45,434 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 11:05:45,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:05:45,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223017896] [2022-04-28 11:05:45,434 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:05:45,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [461719511] [2022-04-28 11:05:45,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [461719511] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:05:45,434 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:05:45,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 23 [2022-04-28 11:05:45,434 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:05:45,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [8022190] [2022-04-28 11:05:45,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [8022190] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:05:45,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:05:45,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 11:05:45,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418202249] [2022-04-28 11:05:45,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:05:45,435 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 48 [2022-04-28 11:05:45,435 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:05:45,435 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 11:05:45,466 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:05:45,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 11:05:45,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:05:45,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 11:05:45,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2022-04-28 11:05:45,467 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand has 15 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 11:05:46,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:05:46,070 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2022-04-28 11:05:46,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 11:05:46,070 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 48 [2022-04-28 11:05:46,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:05:46,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 11:05:46,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 39 transitions. [2022-04-28 11:05:46,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 11:05:46,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 39 transitions. [2022-04-28 11:05:46,073 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 39 transitions. [2022-04-28 11:05:46,102 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:05:46,102 INFO L225 Difference]: With dead ends: 45 [2022-04-28 11:05:46,102 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 11:05:46,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2022-04-28 11:05:46,103 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 12 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 11:05:46,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 149 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 11:05:46,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 11:05:46,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 11:05:46,103 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:05:46,104 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 11:05:46,104 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 11:05:46,104 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 11:05:46,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:05:46,104 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 11:05:46,104 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 11:05:46,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:05:46,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:05:46,104 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 11:05:46,104 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 11:05:46,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:05:46,104 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 11:05:46,104 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 11:05:46,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:05:46,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:05:46,104 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:05:46,104 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:05:46,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 11:05:46,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 11:05:46,105 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2022-04-28 11:05:46,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:05:46,105 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 11:05:46,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 11:05:46,105 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 11:05:46,105 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:05:46,105 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 11:05:46,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:05:46,107 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 11:05:46,123 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 11:05:46,307 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 11:05:46,309 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 11:05:47,576 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 7) no Hoare annotation was computed. [2022-04-28 11:05:47,576 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 7) no Hoare annotation was computed. [2022-04-28 11:05:47,576 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 7) no Hoare annotation was computed. [2022-04-28 11:05:47,576 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 10 12) the Hoare annotation is: true [2022-04-28 11:05:47,576 INFO L895 garLoopResultBuilder]: At program point L11(line 11) the Hoare annotation is: (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|) [2022-04-28 11:05:47,576 INFO L895 garLoopResultBuilder]: At program point L11-2(lines 10 12) the Hoare annotation is: (and (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)) [2022-04-28 11:05:47,576 INFO L895 garLoopResultBuilder]: At program point assume_abort_if_notEXIT(lines 10 12) the Hoare annotation is: (and (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)) [2022-04-28 11:05:47,577 INFO L895 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: (and (<= 0 main_~X~0) (<= main_~X~0 1)) [2022-04-28 11:05:47,577 INFO L895 garLoopResultBuilder]: At program point L27-1(line 27) the Hoare annotation is: (and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1)) [2022-04-28 11:05:47,577 INFO L902 garLoopResultBuilder]: At program point L25(line 25) the Hoare annotation is: true [2022-04-28 11:05:47,577 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 21 53) the Hoare annotation is: true [2022-04-28 11:05:47,577 INFO L895 garLoopResultBuilder]: At program point L25-1(line 25) the Hoare annotation is: (and (<= 0 main_~X~0) (<= main_~X~0 1)) [2022-04-28 11:05:47,577 INFO L895 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: (let ((.cse2 (<= main_~Y~0 1)) (.cse4 (<= 0 main_~X~0)) (.cse14 (= main_~xy~0 0)) (.cse1 (* main_~Y~0 4)) (.cse13 (+ main_~X~0 main_~v~0)) (.cse0 (* main_~Y~0 2)) (.cse3 (<= 0 main_~Y~0)) (.cse5 (<= main_~X~0 1)) (.cse15 (= main_~y~0 0)) (.cse12 (= main_~yx~0 0))) (or (and (= main_~y~0 2) (= (* main_~y~0 2) main_~xy~0) (= .cse0 main_~yx~0) (<= (* main_~X~0 3) .cse1) .cse2 .cse3 .cse4 .cse5 (= main_~x~0 2) (<= main_~x~0 (+ main_~X~0 1)) (= (+ main_~v~0 (* 5 main_~X~0)) (* main_~Y~0 6))) (and (= main_~y~0 1) (<= main_~x~0 1) .cse2 .cse3 .cse4 .cse5 (let ((.cse7 (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0)) (.cse9 (* main_~X~0 main_~y~0)) (.cse10 (div .cse13 2)) (.cse8 (= main_~Y~0 0))) (or (let ((.cse6 (div (+ .cse9 .cse10 (* (- 1) main_~Y~0)) main_~Y~0))) (and (= (* main_~y~0 .cse6) main_~xy~0) .cse7 (<= .cse6 1) (not (<= .cse6 main_~X~0)) (not .cse8) (= main_~yx~0 (* main_~Y~0 .cse6)))) (let ((.cse11 (div main_~xy~0 main_~y~0))) (and .cse7 (= (+ .cse9 .cse10) main_~Y~0) (< main_~X~0 .cse11) .cse12 (<= .cse11 1) .cse8)))) (not (<= main_~x~0 main_~X~0))) (and (= main_~x~0 0) .cse14 (= .cse13 .cse0) .cse15 .cse12) (and .cse14 (<= .cse1 .cse13) (< main_~v~0 .cse0) .cse3 .cse5 .cse15 .cse12))) [2022-04-28 11:05:47,577 INFO L902 garLoopResultBuilder]: At program point L50-1(line 50) the Hoare annotation is: true [2022-04-28 11:05:47,577 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 21 53) the Hoare annotation is: true [2022-04-28 11:05:47,577 INFO L895 garLoopResultBuilder]: At program point L40(lines 40 45) the Hoare annotation is: (let ((.cse3 (<= main_~Y~0 1)) (.cse6 (+ main_~X~0 main_~v~0)) (.cse0 (* main_~Y~0 2)) (.cse5 (<= 0 main_~Y~0)) (.cse4 (<= main_~X~0 1)) (.cse7 (= main_~y~0 0))) (or (let ((.cse2 (* main_~X~0 main_~y~0)) (.cse1 (* main_~Y~0 main_~x~0))) (and (<= main_~x~0 main_~X~0) (= (+ .cse0 (* 2 .cse1)) (+ (* .cse2 2) main_~X~0 main_~v~0)) (= main_~x~0 1) .cse3 (= main_~X~0 main_~xy~0) .cse4 (<= .cse0 (+ main_~v~0 (* main_~X~0 2))) (= .cse2 main_~xy~0) (= main_~yx~0 .cse1))) (and (= main_~x~0 0) .cse3 .cse5 (<= 0 main_~X~0) .cse4 (= .cse6 .cse0) .cse7) (and (= main_~xy~0 0) (<= (* main_~Y~0 4) .cse6) (< main_~v~0 .cse0) .cse5 .cse4 .cse7 (= main_~yx~0 0)))) [2022-04-28 11:05:47,577 INFO L895 garLoopResultBuilder]: At program point L40-2(lines 40 45) the Hoare annotation is: (let ((.cse3 (* main_~X~0 3)) (.cse0 (* main_~Y~0 4)) (.cse4 (<= main_~Y~0 1)) (.cse2 (<= main_~X~0 1)) (.cse1 (* main_~Y~0 2))) (or (and (<= .cse0 (+ main_~X~0 main_~v~0)) (< main_~v~0 .cse1) (<= 0 main_~Y~0) .cse2 (= main_~y~0 0)) (and (<= main_~x~0 main_~X~0) (<= .cse3 .cse0) (= (+ (* main_~X~0 4) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) .cse1)) (= main_~x~0 1) .cse4 (= (+ main_~v~0 (* 5 main_~X~0)) (* main_~Y~0 6))) (and (= (+ main_~v~0 .cse3) .cse0) (= main_~x~0 0) (= main_~y~0 1) .cse4 (<= 0 main_~X~0) .cse2 (<= .cse1 (+ main_~v~0 (* main_~X~0 2)))))) [2022-04-28 11:05:47,577 INFO L895 garLoopResultBuilder]: At program point L32-2(lines 32 47) the Hoare annotation is: (let ((.cse3 (<= 0 main_~Y~0)) (.cse1 (+ main_~X~0 main_~v~0)) (.cse5 (= main_~y~0 0)) (.cse8 (* main_~X~0 3)) (.cse0 (* main_~Y~0 4)) (.cse6 (<= main_~Y~0 1)) (.cse7 (<= 0 main_~X~0)) (.cse4 (<= main_~X~0 1)) (.cse2 (* main_~Y~0 2))) (or (and (<= .cse0 .cse1) (< main_~v~0 .cse2) .cse3 .cse4 .cse5) (and (= main_~x~0 0) .cse6 .cse3 .cse7 .cse4 (= .cse1 .cse2) .cse5) (and (= main_~y~0 2) (<= .cse8 .cse0) .cse6 (= main_~x~0 2) (<= main_~x~0 (+ main_~X~0 1)) (= (+ main_~v~0 (* 5 main_~X~0)) (* main_~Y~0 6))) (and (= (+ main_~v~0 .cse8) .cse0) (= main_~y~0 1) (= main_~x~0 1) .cse6 .cse7 .cse4 (<= .cse2 (+ main_~v~0 (* main_~X~0 2)))))) [2022-04-28 11:05:47,577 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 21 53) the Hoare annotation is: true [2022-04-28 11:05:47,578 INFO L895 garLoopResultBuilder]: At program point L32-3(lines 32 47) the Hoare annotation is: (let ((.cse2 (<= main_~Y~0 1)) (.cse6 (= main_~xy~0 0)) (.cse1 (* main_~Y~0 4)) (.cse7 (+ main_~X~0 main_~v~0)) (.cse0 (* main_~Y~0 2)) (.cse5 (<= 0 main_~Y~0)) (.cse8 (= main_~y~0 0)) (.cse9 (= main_~yx~0 0))) (or (and (= main_~y~0 2) (= (* (div (* main_~X~0 2) main_~X~0) main_~X~0) main_~xy~0) (= .cse0 main_~yx~0) (<= (* main_~X~0 3) .cse1) .cse2 (= main_~x~0 2) (<= main_~x~0 (+ main_~X~0 1)) (= (+ main_~v~0 (* 5 main_~X~0)) (* main_~Y~0 6))) (let ((.cse4 (* main_~X~0 main_~y~0)) (.cse3 (* main_~Y~0 main_~x~0))) (and (= main_~y~0 1) (<= main_~x~0 1) (= (+ .cse0 (* 2 .cse3)) (+ (* .cse4 2) main_~X~0 main_~v~0)) .cse2 .cse5 (<= 0 main_~X~0) (= .cse4 main_~xy~0) (not (<= main_~x~0 main_~X~0)) (= main_~yx~0 .cse3))) (and (= main_~x~0 0) .cse6 (= .cse7 .cse0) .cse8 .cse9) (and .cse6 (<= .cse1 .cse7) (< main_~v~0 .cse0) .cse5 (<= main_~X~0 1) .cse8 .cse9))) [2022-04-28 11:05:47,578 INFO L895 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (let ((.cse6 (* main_~X~0 2)) (.cse0 (* main_~X~0 3)) (.cse2 (<= main_~Y~0 1)) (.cse3 (<= 0 main_~X~0)) (.cse7 (= main_~xy~0 0)) (.cse1 (* main_~Y~0 4)) (.cse9 (+ main_~X~0 main_~v~0)) (.cse5 (* main_~Y~0 2)) (.cse8 (<= 0 main_~Y~0)) (.cse4 (<= main_~X~0 1)) (.cse10 (= main_~y~0 0)) (.cse11 (= main_~yx~0 0))) (or (and (= (+ main_~v~0 .cse0) .cse1) (= main_~y~0 1) (= main_~x~0 1) .cse2 .cse3 .cse4 (<= .cse5 (+ main_~v~0 .cse6)) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0))) (and (= main_~y~0 2) (= (* (div .cse6 main_~X~0) main_~X~0) main_~xy~0) (= .cse5 main_~yx~0) (<= .cse0 .cse1) .cse2 (= main_~x~0 2) (<= main_~x~0 (+ main_~X~0 1)) (= (+ main_~v~0 (* 5 main_~X~0)) (* main_~Y~0 6))) (and (= main_~x~0 0) .cse7 .cse2 .cse8 .cse3 .cse4 (= .cse9 .cse5) .cse10 .cse11) (and .cse7 (<= .cse1 .cse9) (< main_~v~0 .cse5) .cse8 .cse4 .cse10 .cse11))) [2022-04-28 11:05:47,578 INFO L895 garLoopResultBuilder]: At program point L35-1(lines 32 47) the Hoare annotation is: (let ((.cse4 (= main_~xy~0 0)) (.cse2 (* main_~Y~0 4)) (.cse8 (+ main_~X~0 main_~v~0)) (.cse5 (<= 0 main_~Y~0)) (.cse9 (= main_~y~0 0)) (.cse10 (= main_~yx~0 0)) (.cse3 (<= main_~Y~0 1)) (.cse6 (<= 0 main_~X~0)) (.cse7 (<= main_~X~0 1)) (.cse1 (* main_~Y~0 2)) (.cse0 (* main_~X~0 2))) (or (and (= main_~y~0 2) (= (* (div .cse0 main_~X~0) main_~X~0) main_~xy~0) (= .cse1 main_~yx~0) (<= (* main_~X~0 3) .cse2) .cse3 (= main_~x~0 2) (<= main_~x~0 (+ main_~X~0 1)) (= (+ main_~v~0 (* 5 main_~X~0)) (* main_~Y~0 6))) (and (= main_~x~0 0) .cse4 .cse3 .cse5 .cse6 .cse7 (= .cse8 .cse1) .cse9 .cse10) (and .cse4 (<= .cse2 .cse8) (< main_~v~0 .cse1) .cse5 .cse7 .cse9 .cse10) (let ((.cse12 (* main_~X~0 main_~y~0)) (.cse11 (* main_~Y~0 main_~x~0))) (and (= main_~y~0 1) (= (+ .cse1 (* 2 .cse11)) (+ (* .cse12 2) main_~X~0 main_~v~0)) (= main_~x~0 1) .cse3 .cse6 .cse7 (<= .cse1 (+ main_~v~0 .cse0)) (= .cse12 main_~xy~0) (= main_~yx~0 .cse11))))) [2022-04-28 11:05:47,578 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 11:05:47,578 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 11:05:47,578 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 11:05:47,578 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 11:05:47,578 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 11:05:47,578 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 11:05:47,578 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 11:05:47,578 INFO L895 garLoopResultBuilder]: At program point L15(lines 15 16) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 11:05:47,578 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 13 19) the Hoare annotation is: true [2022-04-28 11:05:47,578 INFO L895 garLoopResultBuilder]: At program point L14(lines 14 17) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-28 11:05:47,578 INFO L895 garLoopResultBuilder]: At program point L14-2(lines 13 19) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-28 11:05:47,578 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 13 19) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-28 11:05:47,579 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 11:05:47,580 INFO L356 BasicCegarLoop]: Path program histogram: [4, 4, 2, 2, 2] [2022-04-28 11:05:47,581 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 11:05:47,585 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 11:05:47,587 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 11:05:47,648 INFO L163 areAnnotationChecker]: CFG has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 11:05:47,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 11:05:47 BoogieIcfgContainer [2022-04-28 11:05:47,656 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 11:05:47,657 INFO L158 Benchmark]: Toolchain (without parser) took 180412.15ms. Allocated memory was 179.3MB in the beginning and 216.0MB in the end (delta: 36.7MB). Free memory was 129.7MB in the beginning and 160.1MB in the end (delta: -30.4MB). Peak memory consumption was 100.5MB. Max. memory is 8.0GB. [2022-04-28 11:05:47,657 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 179.3MB. Free memory was 145.8MB in the beginning and 145.7MB in the end (delta: 85.7kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 11:05:47,657 INFO L158 Benchmark]: CACSL2BoogieTranslator took 166.01ms. Allocated memory is still 179.3MB. Free memory was 129.5MB in the beginning and 154.4MB in the end (delta: -25.0MB). Peak memory consumption was 13.3MB. Max. memory is 8.0GB. [2022-04-28 11:05:47,658 INFO L158 Benchmark]: Boogie Preprocessor took 18.00ms. Allocated memory is still 179.3MB. Free memory was 154.4MB in the beginning and 152.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 11:05:47,658 INFO L158 Benchmark]: RCFGBuilder took 229.61ms. Allocated memory is still 179.3MB. Free memory was 152.9MB in the beginning and 141.1MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-28 11:05:47,658 INFO L158 Benchmark]: TraceAbstraction took 179993.29ms. Allocated memory was 179.3MB in the beginning and 216.0MB in the end (delta: 36.7MB). Free memory was 140.6MB in the beginning and 160.1MB in the end (delta: -19.5MB). Peak memory consumption was 111.3MB. Max. memory is 8.0GB. [2022-04-28 11:05:47,665 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.11ms. Allocated memory is still 179.3MB. Free memory was 145.8MB in the beginning and 145.7MB in the end (delta: 85.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 166.01ms. Allocated memory is still 179.3MB. Free memory was 129.5MB in the beginning and 154.4MB in the end (delta: -25.0MB). Peak memory consumption was 13.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 18.00ms. Allocated memory is still 179.3MB. Free memory was 154.4MB in the beginning and 152.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 229.61ms. Allocated memory is still 179.3MB. Free memory was 152.9MB in the beginning and 141.1MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 179993.29ms. Allocated memory was 179.3MB in the beginning and 216.0MB in the end (delta: 36.7MB). Free memory was 140.6MB in the beginning and 160.1MB in the end (delta: -19.5MB). Peak memory consumption was 111.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 16]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 35 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 179.9s, OverallIterations: 7, TraceHistogramMax: 4, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 139 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 129 mSDsluCounter, 873 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 711 mSDsCounter, 53 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1218 IncrementalHoareTripleChecker+Invalid, 1271 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 53 mSolverCounterUnsat, 162 mSDtfsCounter, 1218 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 410 GetRequests, 286 SyntacticMatches, 6 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=6, InterpolantAutomatonStates: 79, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 32 LocationsWithAnnotation, 130 PreInvPairs, 202 NumberOfFragments, 1120 HoareAnnotationTreeSize, 130 FomulaSimplifications, 254 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 32 FomulaSimplificationsInter, 613 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: ((((((Y * 4 <= X + v && v < Y * 2) && 0 <= Y) && X <= 1) && y == 0) || ((((((x == 0 && Y <= 1) && 0 <= Y) && 0 <= X) && X <= 1) && X + v == Y * 2) && y == 0)) || (((((y == 2 && X * 3 <= Y * 4) && Y <= 1) && x == 2) && x <= X + 1) && v + 5 * X == Y * 6)) || ((((((v + X * 3 == Y * 4 && y == 1) && x == 1) && Y <= 1) && 0 <= X) && X <= 1) && Y * 2 <= v + X * 2) - ProcedureContractResult [Line: 10]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not: !(\old(cond) == 0) && cond == \old(cond) - ProcedureContractResult [Line: 21]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 13]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == cond || !(1 <= \old(cond)) RESULT: Ultimate proved your program to be correct! [2022-04-28 11:05:47,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...