/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/prod4br-ll_unwindbound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 13:58:39,297 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 13:58:39,298 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 13:58:39,352 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 13:58:39,352 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 13:58:39,354 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 13:58:39,359 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 13:58:39,360 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 13:58:39,360 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 13:58:39,361 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 13:58:39,361 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 13:58:39,362 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 13:58:39,362 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 13:58:39,365 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 13:58:39,366 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 13:58:39,367 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 13:58:39,368 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 13:58:39,372 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 13:58:39,375 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 13:58:39,376 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 13:58:39,376 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 13:58:39,380 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 13:58:39,381 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 13:58:39,381 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 13:58:39,382 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 13:58:39,383 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 13:58:39,384 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 13:58:39,384 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 13:58:39,384 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 13:58:39,384 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 13:58:39,385 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 13:58:39,385 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 13:58:39,386 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 13:58:39,386 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 13:58:39,386 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 13:58:39,387 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 13:58:39,387 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 13:58:39,387 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 13:58:39,388 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 13:58:39,388 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 13:58:39,388 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 13:58:39,389 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 13:58:39,389 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 13:58:39,395 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 13:58:39,395 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 13:58:39,395 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 13:58:39,395 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 13:58:39,396 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 13:58:39,396 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 13:58:39,396 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 13:58:39,396 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 13:58:39,396 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 13:58:39,396 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 13:58:39,396 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 13:58:39,396 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 13:58:39,396 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 13:58:39,396 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 13:58:39,397 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 13:58:39,397 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 13:58:39,397 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 13:58:39,397 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 13:58:39,397 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 13:58:39,397 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 13:58:39,397 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 13:58:39,397 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 13:58:39,397 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 13:58:39,578 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 13:58:39,593 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 13:58:39,594 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 13:58:39,596 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 13:58:39,596 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 13:58:39,597 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/prod4br-ll_unwindbound2.c [2022-04-28 13:58:39,638 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6867fa42a/32253a31aa954e11af09c1794c76bf5a/FLAG3595ee42a [2022-04-28 13:58:39,981 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 13:58:39,982 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/prod4br-ll_unwindbound2.c [2022-04-28 13:58:39,985 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6867fa42a/32253a31aa954e11af09c1794c76bf5a/FLAG3595ee42a [2022-04-28 13:58:39,993 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6867fa42a/32253a31aa954e11af09c1794c76bf5a [2022-04-28 13:58:39,994 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 13:58:39,995 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 13:58:39,996 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 13:58:39,996 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 13:58:39,998 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 13:58:39,999 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 01:58:39" (1/1) ... [2022-04-28 13:58:39,999 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@866e332 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:58:39, skipping insertion in model container [2022-04-28 13:58:39,999 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 01:58:39" (1/1) ... [2022-04-28 13:58:40,004 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 13:58:40,012 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 13:58:40,139 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/prod4br-ll_unwindbound2.c[524,537] [2022-04-28 13:58:40,171 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 13:58:40,176 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 13:58:40,185 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/prod4br-ll_unwindbound2.c[524,537] [2022-04-28 13:58:40,204 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 13:58:40,212 INFO L208 MainTranslator]: Completed translation [2022-04-28 13:58:40,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:58:40 WrapperNode [2022-04-28 13:58:40,213 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 13:58:40,213 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 13:58:40,214 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 13:58:40,214 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 13:58:40,221 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:58:40" (1/1) ... [2022-04-28 13:58:40,221 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:58:40" (1/1) ... [2022-04-28 13:58:40,232 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:58:40" (1/1) ... [2022-04-28 13:58:40,232 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:58:40" (1/1) ... [2022-04-28 13:58:40,241 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:58:40" (1/1) ... [2022-04-28 13:58:40,243 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:58:40" (1/1) ... [2022-04-28 13:58:40,244 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:58:40" (1/1) ... [2022-04-28 13:58:40,245 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 13:58:40,246 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 13:58:40,246 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 13:58:40,246 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 13:58:40,249 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:58:40" (1/1) ... [2022-04-28 13:58:40,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 13:58:40,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:58:40,269 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 13:58:40,304 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 13:58:40,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 13:58:40,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 13:58:40,315 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 13:58:40,315 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 13:58:40,316 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 13:58:40,316 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 13:58:40,316 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 13:58:40,316 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 13:58:40,316 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 13:58:40,316 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 13:58:40,317 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 13:58:40,317 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 13:58:40,317 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 13:58:40,317 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 13:58:40,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 13:58:40,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 13:58:40,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 13:58:40,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 13:58:40,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 13:58:40,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 13:58:40,358 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 13:58:40,359 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 13:58:40,487 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 13:58:40,492 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 13:58:40,492 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 13:58:40,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 01:58:40 BoogieIcfgContainer [2022-04-28 13:58:40,493 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 13:58:40,494 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 13:58:40,494 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 13:58:40,507 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 13:58:40,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 01:58:39" (1/3) ... [2022-04-28 13:58:40,507 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32053e92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 01:58:40, skipping insertion in model container [2022-04-28 13:58:40,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:58:40" (2/3) ... [2022-04-28 13:58:40,508 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32053e92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 01:58:40, skipping insertion in model container [2022-04-28 13:58:40,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 01:58:40" (3/3) ... [2022-04-28 13:58:40,508 INFO L111 eAbstractionObserver]: Analyzing ICFG prod4br-ll_unwindbound2.c [2022-04-28 13:58:40,517 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 13:58:40,517 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 13:58:40,542 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 13:58:40,546 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@2779ad43, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2a29ed34 [2022-04-28 13:58:40,546 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 13:58:40,551 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 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 13:58:40,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 13:58:40,555 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:58:40,556 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:58:40,556 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:58:40,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:58:40,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1717894843, now seen corresponding path program 1 times [2022-04-28 13:58:40,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:58:40,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [666110858] [2022-04-28 13:58:40,572 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 13:58:40,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1717894843, now seen corresponding path program 2 times [2022-04-28 13:58:40,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:58:40,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134825150] [2022-04-28 13:58:40,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:58:40,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:58:40,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:58:40,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 13:58:40,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:58:40,734 INFO L290 TraceCheckUtils]: 0: Hoare triple {44#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {35#true} is VALID [2022-04-28 13:58:40,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-28 13:58:40,735 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35#true} {35#true} #77#return; {35#true} is VALID [2022-04-28 13:58:40,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 13:58:40,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:58:40,748 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-28 13:58:40,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-28 13:58:40,748 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-28 13:58:40,749 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {35#true} #69#return; {36#false} is VALID [2022-04-28 13:58:40,750 INFO L272 TraceCheckUtils]: 0: Hoare triple {35#true} call ULTIMATE.init(); {44#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 13:58:40,750 INFO L290 TraceCheckUtils]: 1: Hoare triple {44#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {35#true} is VALID [2022-04-28 13:58:40,750 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-28 13:58:40,750 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #77#return; {35#true} is VALID [2022-04-28 13:58:40,750 INFO L272 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret7 := main(); {35#true} is VALID [2022-04-28 13:58:40,751 INFO L290 TraceCheckUtils]: 5: Hoare triple {35#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {35#true} is VALID [2022-04-28 13:58:40,751 INFO L272 TraceCheckUtils]: 6: Hoare triple {35#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {35#true} is VALID [2022-04-28 13:58:40,751 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-28 13:58:40,751 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-28 13:58:40,751 INFO L290 TraceCheckUtils]: 9: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-28 13:58:40,752 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {36#false} {35#true} #69#return; {36#false} is VALID [2022-04-28 13:58:40,752 INFO L290 TraceCheckUtils]: 11: Hoare triple {36#false} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {36#false} is VALID [2022-04-28 13:58:40,752 INFO L290 TraceCheckUtils]: 12: Hoare triple {36#false} assume !true; {36#false} is VALID [2022-04-28 13:58:40,752 INFO L272 TraceCheckUtils]: 13: Hoare triple {36#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {36#false} is VALID [2022-04-28 13:58:40,752 INFO L290 TraceCheckUtils]: 14: Hoare triple {36#false} ~cond := #in~cond; {36#false} is VALID [2022-04-28 13:58:40,753 INFO L290 TraceCheckUtils]: 15: Hoare triple {36#false} assume 0 == ~cond; {36#false} is VALID [2022-04-28 13:58:40,753 INFO L290 TraceCheckUtils]: 16: Hoare triple {36#false} assume !false; {36#false} is VALID [2022-04-28 13:58:40,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 13:58:40,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:58:40,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134825150] [2022-04-28 13:58:40,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134825150] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:58:40,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:58:40,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 13:58:40,756 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:58:40,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [666110858] [2022-04-28 13:58:40,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [666110858] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:58:40,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:58:40,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 13:58:40,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963633827] [2022-04-28 13:58:40,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:58:40,762 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 13:58:40,763 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:58:40,765 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 13:58:40,793 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:58:40,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 13:58:40,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:58:40,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 13:58:40,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 13:58:40,813 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 13:58:40,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:58:40,963 INFO L93 Difference]: Finished difference Result 56 states and 77 transitions. [2022-04-28 13:58:40,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 13:58:40,965 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 13:58:40,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:58:40,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 13:58:40,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2022-04-28 13:58:40,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 13:58:40,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2022-04-28 13:58:40,975 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 77 transitions. [2022-04-28 13:58:41,044 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:58:41,050 INFO L225 Difference]: With dead ends: 56 [2022-04-28 13:58:41,050 INFO L226 Difference]: Without dead ends: 28 [2022-04-28 13:58:41,052 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 13:58:41,054 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 13:58:41,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 40 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 13:58:41,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-28 13:58:41,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2022-04-28 13:58:41,073 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:58:41,073 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 27 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 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 13:58:41,074 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 27 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 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 13:58:41,074 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 27 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 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 13:58:41,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:58:41,077 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-04-28 13:58:41,077 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-04-28 13:58:41,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:58:41,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:58:41,078 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 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 28 states. [2022-04-28 13:58:41,079 INFO L87 Difference]: Start difference. First operand has 27 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 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 28 states. [2022-04-28 13:58:41,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:58:41,081 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-04-28 13:58:41,081 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-04-28 13:58:41,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:58:41,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:58:41,082 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:58:41,082 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:58:41,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 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 13:58:41,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2022-04-28 13:58:41,085 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 17 [2022-04-28 13:58:41,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:58:41,085 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2022-04-28 13:58:41,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 13:58:41,086 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 33 transitions. [2022-04-28 13:58:41,115 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 13:58:41,115 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-04-28 13:58:41,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 13:58:41,116 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:58:41,116 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:58:41,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 13:58:41,117 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:58:41,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:58:41,117 INFO L85 PathProgramCache]: Analyzing trace with hash 444281082, now seen corresponding path program 1 times [2022-04-28 13:58:41,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:58:41,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2147056694] [2022-04-28 13:58:41,118 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 13:58:41,118 INFO L85 PathProgramCache]: Analyzing trace with hash 444281082, now seen corresponding path program 2 times [2022-04-28 13:58:41,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:58:41,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487689451] [2022-04-28 13:58:41,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:58:41,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:58:41,132 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:58:41,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [444326981] [2022-04-28 13:58:41,133 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 13:58:41,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:58:41,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:58:41,157 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 13:58:41,165 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 13:58:41,212 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 13:58:41,213 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:58:41,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 13:58:41,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:58:41,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:58:41,354 INFO L272 TraceCheckUtils]: 0: Hoare triple {269#true} call ULTIMATE.init(); {269#true} is VALID [2022-04-28 13:58:41,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {269#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {277#(<= ~counter~0 0)} is VALID [2022-04-28 13:58:41,356 INFO L290 TraceCheckUtils]: 2: Hoare triple {277#(<= ~counter~0 0)} assume true; {277#(<= ~counter~0 0)} is VALID [2022-04-28 13:58:41,356 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {277#(<= ~counter~0 0)} {269#true} #77#return; {277#(<= ~counter~0 0)} is VALID [2022-04-28 13:58:41,357 INFO L272 TraceCheckUtils]: 4: Hoare triple {277#(<= ~counter~0 0)} call #t~ret7 := main(); {277#(<= ~counter~0 0)} is VALID [2022-04-28 13:58:41,357 INFO L290 TraceCheckUtils]: 5: Hoare triple {277#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {277#(<= ~counter~0 0)} is VALID [2022-04-28 13:58:41,358 INFO L272 TraceCheckUtils]: 6: Hoare triple {277#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {277#(<= ~counter~0 0)} is VALID [2022-04-28 13:58:41,358 INFO L290 TraceCheckUtils]: 7: Hoare triple {277#(<= ~counter~0 0)} ~cond := #in~cond; {277#(<= ~counter~0 0)} is VALID [2022-04-28 13:58:41,358 INFO L290 TraceCheckUtils]: 8: Hoare triple {277#(<= ~counter~0 0)} assume !(0 == ~cond); {277#(<= ~counter~0 0)} is VALID [2022-04-28 13:58:41,359 INFO L290 TraceCheckUtils]: 9: Hoare triple {277#(<= ~counter~0 0)} assume true; {277#(<= ~counter~0 0)} is VALID [2022-04-28 13:58:41,359 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {277#(<= ~counter~0 0)} {277#(<= ~counter~0 0)} #69#return; {277#(<= ~counter~0 0)} is VALID [2022-04-28 13:58:41,360 INFO L290 TraceCheckUtils]: 11: Hoare triple {277#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {277#(<= ~counter~0 0)} is VALID [2022-04-28 13:58:41,360 INFO L290 TraceCheckUtils]: 12: Hoare triple {277#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {311#(<= |main_#t~post6| 0)} is VALID [2022-04-28 13:58:41,361 INFO L290 TraceCheckUtils]: 13: Hoare triple {311#(<= |main_#t~post6| 0)} assume !(#t~post6 < 2);havoc #t~post6; {270#false} is VALID [2022-04-28 13:58:41,361 INFO L272 TraceCheckUtils]: 14: Hoare triple {270#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {270#false} is VALID [2022-04-28 13:58:41,361 INFO L290 TraceCheckUtils]: 15: Hoare triple {270#false} ~cond := #in~cond; {270#false} is VALID [2022-04-28 13:58:41,361 INFO L290 TraceCheckUtils]: 16: Hoare triple {270#false} assume 0 == ~cond; {270#false} is VALID [2022-04-28 13:58:41,362 INFO L290 TraceCheckUtils]: 17: Hoare triple {270#false} assume !false; {270#false} is VALID [2022-04-28 13:58:41,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 13:58:41,362 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 13:58:41,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:58:41,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487689451] [2022-04-28 13:58:41,363 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:58:41,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444326981] [2022-04-28 13:58:41,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444326981] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:58:41,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:58:41,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 13:58:41,365 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:58:41,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2147056694] [2022-04-28 13:58:41,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2147056694] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:58:41,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:58:41,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 13:58:41,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972261273] [2022-04-28 13:58:41,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:58:41,366 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-28 13:58:41,367 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:58:41,367 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 13:58:41,381 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:58:41,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 13:58:41,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:58:41,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 13:58:41,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 13:58:41,383 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 13:58:41,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:58:41,468 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2022-04-28 13:58:41,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 13:58:41,468 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-28 13:58:41,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:58:41,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 13:58:41,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-04-28 13:58:41,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 13:58:41,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-04-28 13:58:41,472 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 44 transitions. [2022-04-28 13:58:41,501 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 13:58:41,502 INFO L225 Difference]: With dead ends: 37 [2022-04-28 13:58:41,502 INFO L226 Difference]: Without dead ends: 29 [2022-04-28 13:58:41,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 13:58:41,503 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 13:58:41,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 13:58:41,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-28 13:58:41,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-28 13:58:41,515 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:58:41,516 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 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 13:58:41,516 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 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 13:58:41,516 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 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 13:58:41,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:58:41,518 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-28 13:58:41,518 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-28 13:58:41,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:58:41,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:58:41,519 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 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 29 states. [2022-04-28 13:58:41,519 INFO L87 Difference]: Start difference. First operand has 29 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 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 29 states. [2022-04-28 13:58:41,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:58:41,521 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-28 13:58:41,521 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-28 13:58:41,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:58:41,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:58:41,521 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:58:41,521 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:58:41,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 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 13:58:41,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2022-04-28 13:58:41,523 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 18 [2022-04-28 13:58:41,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:58:41,523 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-04-28 13:58:41,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 13:58:41,523 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 35 transitions. [2022-04-28 13:58:41,550 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:58:41,550 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-28 13:58:41,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 13:58:41,551 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:58:41,551 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:58:41,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 13:58:41,766 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 13:58:41,766 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:58:41,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:58:41,767 INFO L85 PathProgramCache]: Analyzing trace with hash 446068542, now seen corresponding path program 1 times [2022-04-28 13:58:41,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:58:41,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1762078858] [2022-04-28 13:58:41,767 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 13:58:41,767 INFO L85 PathProgramCache]: Analyzing trace with hash 446068542, now seen corresponding path program 2 times [2022-04-28 13:58:41,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:58:41,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455276668] [2022-04-28 13:58:41,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:58:41,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:58:41,783 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:58:41,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1078461202] [2022-04-28 13:58:41,783 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 13:58:41,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:58:41,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:58:41,804 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 13:58:41,805 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 13:58:41,843 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 13:58:41,844 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:58:41,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 13:58:41,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:58:41,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:58:41,972 INFO L272 TraceCheckUtils]: 0: Hoare triple {516#true} call ULTIMATE.init(); {516#true} is VALID [2022-04-28 13:58:41,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {516#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {516#true} is VALID [2022-04-28 13:58:41,973 INFO L290 TraceCheckUtils]: 2: Hoare triple {516#true} assume true; {516#true} is VALID [2022-04-28 13:58:41,973 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {516#true} {516#true} #77#return; {516#true} is VALID [2022-04-28 13:58:41,974 INFO L272 TraceCheckUtils]: 4: Hoare triple {516#true} call #t~ret7 := main(); {516#true} is VALID [2022-04-28 13:58:41,974 INFO L290 TraceCheckUtils]: 5: Hoare triple {516#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {516#true} is VALID [2022-04-28 13:58:41,974 INFO L272 TraceCheckUtils]: 6: Hoare triple {516#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {516#true} is VALID [2022-04-28 13:58:41,975 INFO L290 TraceCheckUtils]: 7: Hoare triple {516#true} ~cond := #in~cond; {516#true} is VALID [2022-04-28 13:58:41,976 INFO L290 TraceCheckUtils]: 8: Hoare triple {516#true} assume !(0 == ~cond); {516#true} is VALID [2022-04-28 13:58:41,976 INFO L290 TraceCheckUtils]: 9: Hoare triple {516#true} assume true; {516#true} is VALID [2022-04-28 13:58:41,977 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {516#true} {516#true} #69#return; {516#true} is VALID [2022-04-28 13:58:41,977 INFO L290 TraceCheckUtils]: 11: Hoare triple {516#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {554#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 13:58:41,978 INFO L290 TraceCheckUtils]: 12: Hoare triple {554#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {554#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 13:58:41,978 INFO L290 TraceCheckUtils]: 13: Hoare triple {554#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post6 < 2);havoc #t~post6; {554#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 13:58:41,979 INFO L272 TraceCheckUtils]: 14: Hoare triple {554#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {564#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 13:58:41,980 INFO L290 TraceCheckUtils]: 15: Hoare triple {564#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {568#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:58:41,980 INFO L290 TraceCheckUtils]: 16: Hoare triple {568#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {517#false} is VALID [2022-04-28 13:58:41,980 INFO L290 TraceCheckUtils]: 17: Hoare triple {517#false} assume !false; {517#false} is VALID [2022-04-28 13:58:41,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 13:58:41,981 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 13:58:41,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:58:41,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455276668] [2022-04-28 13:58:41,981 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:58:41,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078461202] [2022-04-28 13:58:41,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1078461202] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:58:41,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:58:41,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 13:58:41,982 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:58:41,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1762078858] [2022-04-28 13:58:41,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1762078858] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:58:41,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:58:41,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 13:58:41,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875527076] [2022-04-28 13:58:41,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:58:41,983 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-28 13:58:41,983 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:58:41,983 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 13:58:41,996 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:58:41,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 13:58:41,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:58:41,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 13:58:41,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 13:58:41,997 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 13:58:42,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:58:42,143 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2022-04-28 13:58:42,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 13:58:42,143 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-28 13:58:42,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:58:42,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 13:58:42,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-04-28 13:58:42,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 13:58:42,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-04-28 13:58:42,146 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2022-04-28 13:58:42,199 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:58:42,200 INFO L225 Difference]: With dead ends: 42 [2022-04-28 13:58:42,200 INFO L226 Difference]: Without dead ends: 40 [2022-04-28 13:58:42,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 13:58:42,202 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 9 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 13:58:42,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 83 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 13:58:42,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-28 13:58:42,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 34. [2022-04-28 13:58:42,214 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:58:42,214 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 34 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 24 states have internal predecessors, (28), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 13:58:42,214 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 34 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 24 states have internal predecessors, (28), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 13:58:42,214 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 34 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 24 states have internal predecessors, (28), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 13:58:42,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:58:42,216 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2022-04-28 13:58:42,216 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2022-04-28 13:58:42,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:58:42,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:58:42,217 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 24 states have internal predecessors, (28), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 40 states. [2022-04-28 13:58:42,217 INFO L87 Difference]: Start difference. First operand has 34 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 24 states have internal predecessors, (28), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 40 states. [2022-04-28 13:58:42,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:58:42,219 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2022-04-28 13:58:42,219 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2022-04-28 13:58:42,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:58:42,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:58:42,220 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:58:42,220 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:58:42,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 24 states have internal predecessors, (28), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 13:58:42,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2022-04-28 13:58:42,221 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 18 [2022-04-28 13:58:42,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:58:42,221 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2022-04-28 13:58:42,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 13:58:42,222 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 40 transitions. [2022-04-28 13:58:42,252 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:58:42,253 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2022-04-28 13:58:42,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 13:58:42,253 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:58:42,253 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:58:42,285 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 13:58:42,486 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 13:58:42,487 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:58:42,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:58:42,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1308579644, now seen corresponding path program 1 times [2022-04-28 13:58:42,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:58:42,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1347429747] [2022-04-28 13:58:42,488 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 13:58:42,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1308579644, now seen corresponding path program 2 times [2022-04-28 13:58:42,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:58:42,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333038491] [2022-04-28 13:58:42,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:58:42,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:58:42,499 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:58:42,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1546785816] [2022-04-28 13:58:42,500 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 13:58:42,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:58:42,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:58:42,501 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 13:58:42,502 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 13:58:42,541 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 13:58:42,541 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:58:42,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 13:58:42,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:58:42,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:58:53,125 INFO L272 TraceCheckUtils]: 0: Hoare triple {808#true} call ULTIMATE.init(); {808#true} is VALID [2022-04-28 13:58:53,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {808#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {808#true} is VALID [2022-04-28 13:58:53,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {808#true} assume true; {808#true} is VALID [2022-04-28 13:58:53,126 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {808#true} {808#true} #77#return; {808#true} is VALID [2022-04-28 13:58:53,126 INFO L272 TraceCheckUtils]: 4: Hoare triple {808#true} call #t~ret7 := main(); {808#true} is VALID [2022-04-28 13:58:53,126 INFO L290 TraceCheckUtils]: 5: Hoare triple {808#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {808#true} is VALID [2022-04-28 13:58:53,126 INFO L272 TraceCheckUtils]: 6: Hoare triple {808#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {808#true} is VALID [2022-04-28 13:58:53,127 INFO L290 TraceCheckUtils]: 7: Hoare triple {808#true} ~cond := #in~cond; {834#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 13:58:53,127 INFO L290 TraceCheckUtils]: 8: Hoare triple {834#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {838#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 13:58:53,128 INFO L290 TraceCheckUtils]: 9: Hoare triple {838#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {838#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 13:58:53,128 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {838#(not (= |assume_abort_if_not_#in~cond| 0))} {808#true} #69#return; {845#(<= 1 main_~y~0)} is VALID [2022-04-28 13:58:53,129 INFO L290 TraceCheckUtils]: 11: Hoare triple {845#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {849#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-28 13:58:53,129 INFO L290 TraceCheckUtils]: 12: Hoare triple {849#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {849#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-28 13:58:53,130 INFO L290 TraceCheckUtils]: 13: Hoare triple {849#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} assume !!(#t~post6 < 2);havoc #t~post6; {849#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-28 13:58:53,130 INFO L272 TraceCheckUtils]: 14: Hoare triple {849#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {808#true} is VALID [2022-04-28 13:58:53,130 INFO L290 TraceCheckUtils]: 15: Hoare triple {808#true} ~cond := #in~cond; {862#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:58:53,131 INFO L290 TraceCheckUtils]: 16: Hoare triple {862#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {866#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:58:53,131 INFO L290 TraceCheckUtils]: 17: Hoare triple {866#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {866#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:58:55,133 WARN L284 TraceCheckUtils]: 18: Hoare quadruple {866#(not (= |__VERIFIER_assert_#in~cond| 0))} {849#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} #71#return; {873#(and (or (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~a~0 0))) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0)) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is UNKNOWN [2022-04-28 13:58:55,135 INFO L290 TraceCheckUtils]: 19: Hoare triple {873#(and (or (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~a~0 0))) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0)) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} assume !(0 != ~a~0 && 0 != ~b~0); {877#(and (= main_~q~0 (* main_~y~0 main_~x~0)) (<= 1 main_~y~0))} is VALID [2022-04-28 13:58:55,135 INFO L272 TraceCheckUtils]: 20: Hoare triple {877#(and (= main_~q~0 (* main_~y~0 main_~x~0)) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {881#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 13:58:55,136 INFO L290 TraceCheckUtils]: 21: Hoare triple {881#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {885#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:58:55,136 INFO L290 TraceCheckUtils]: 22: Hoare triple {885#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {809#false} is VALID [2022-04-28 13:58:55,136 INFO L290 TraceCheckUtils]: 23: Hoare triple {809#false} assume !false; {809#false} is VALID [2022-04-28 13:58:55,137 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 13:58:55,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:59:32,202 INFO L290 TraceCheckUtils]: 23: Hoare triple {809#false} assume !false; {809#false} is VALID [2022-04-28 13:59:32,202 INFO L290 TraceCheckUtils]: 22: Hoare triple {885#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {809#false} is VALID [2022-04-28 13:59:32,203 INFO L290 TraceCheckUtils]: 21: Hoare triple {881#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {885#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:59:32,204 INFO L272 TraceCheckUtils]: 20: Hoare triple {901#(= main_~q~0 (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {881#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 13:59:32,204 INFO L290 TraceCheckUtils]: 19: Hoare triple {905#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} assume !(0 != ~a~0 && 0 != ~b~0); {901#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-28 13:59:32,205 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {866#(not (= |__VERIFIER_assert_#in~cond| 0))} {808#true} #71#return; {905#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} is VALID [2022-04-28 13:59:32,206 INFO L290 TraceCheckUtils]: 17: Hoare triple {866#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {866#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:59:32,206 INFO L290 TraceCheckUtils]: 16: Hoare triple {918#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {866#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:59:32,206 INFO L290 TraceCheckUtils]: 15: Hoare triple {808#true} ~cond := #in~cond; {918#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 13:59:32,207 INFO L272 TraceCheckUtils]: 14: Hoare triple {808#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {808#true} is VALID [2022-04-28 13:59:32,207 INFO L290 TraceCheckUtils]: 13: Hoare triple {808#true} assume !!(#t~post6 < 2);havoc #t~post6; {808#true} is VALID [2022-04-28 13:59:32,207 INFO L290 TraceCheckUtils]: 12: Hoare triple {808#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {808#true} is VALID [2022-04-28 13:59:32,207 INFO L290 TraceCheckUtils]: 11: Hoare triple {808#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {808#true} is VALID [2022-04-28 13:59:32,207 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {808#true} {808#true} #69#return; {808#true} is VALID [2022-04-28 13:59:32,207 INFO L290 TraceCheckUtils]: 9: Hoare triple {808#true} assume true; {808#true} is VALID [2022-04-28 13:59:32,207 INFO L290 TraceCheckUtils]: 8: Hoare triple {808#true} assume !(0 == ~cond); {808#true} is VALID [2022-04-28 13:59:32,208 INFO L290 TraceCheckUtils]: 7: Hoare triple {808#true} ~cond := #in~cond; {808#true} is VALID [2022-04-28 13:59:32,208 INFO L272 TraceCheckUtils]: 6: Hoare triple {808#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {808#true} is VALID [2022-04-28 13:59:32,208 INFO L290 TraceCheckUtils]: 5: Hoare triple {808#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {808#true} is VALID [2022-04-28 13:59:32,208 INFO L272 TraceCheckUtils]: 4: Hoare triple {808#true} call #t~ret7 := main(); {808#true} is VALID [2022-04-28 13:59:32,208 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {808#true} {808#true} #77#return; {808#true} is VALID [2022-04-28 13:59:32,208 INFO L290 TraceCheckUtils]: 2: Hoare triple {808#true} assume true; {808#true} is VALID [2022-04-28 13:59:32,208 INFO L290 TraceCheckUtils]: 1: Hoare triple {808#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {808#true} is VALID [2022-04-28 13:59:32,209 INFO L272 TraceCheckUtils]: 0: Hoare triple {808#true} call ULTIMATE.init(); {808#true} is VALID [2022-04-28 13:59:32,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 13:59:32,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:59:32,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333038491] [2022-04-28 13:59:32,209 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:59:32,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1546785816] [2022-04-28 13:59:32,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1546785816] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:59:32,209 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:59:32,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 15 [2022-04-28 13:59:32,210 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:59:32,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1347429747] [2022-04-28 13:59:32,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1347429747] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:59:32,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:59:32,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 13:59:32,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721823374] [2022-04-28 13:59:32,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:59:32,211 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 9 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-04-28 13:59:32,211 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:59:32,211 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 9 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 13:59:34,230 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 23 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 13:59:34,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 13:59:34,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:59:34,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 13:59:34,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-28 13:59:34,231 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 9 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 13:59:40,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:59:40,127 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2022-04-28 13:59:40,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 13:59:40,127 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 9 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-04-28 13:59:40,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:59:40,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 9 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 13:59:40,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 60 transitions. [2022-04-28 13:59:40,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 9 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 13:59:40,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 60 transitions. [2022-04-28 13:59:40,131 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 60 transitions. [2022-04-28 13:59:42,187 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 59 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 13:59:42,189 INFO L225 Difference]: With dead ends: 50 [2022-04-28 13:59:42,189 INFO L226 Difference]: Without dead ends: 48 [2022-04-28 13:59:42,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2022-04-28 13:59:42,190 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 36 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-04-28 13:59:42,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 130 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-04-28 13:59:42,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-28 13:59:42,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2022-04-28 13:59:42,234 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:59:42,234 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 45 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 33 states have internal predecessors, (40), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 13:59:42,235 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 45 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 33 states have internal predecessors, (40), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 13:59:42,235 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 45 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 33 states have internal predecessors, (40), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 13:59:42,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:59:42,237 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2022-04-28 13:59:42,237 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 61 transitions. [2022-04-28 13:59:42,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:59:42,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:59:42,238 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 33 states have internal predecessors, (40), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) Second operand 48 states. [2022-04-28 13:59:42,238 INFO L87 Difference]: Start difference. First operand has 45 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 33 states have internal predecessors, (40), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) Second operand 48 states. [2022-04-28 13:59:42,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:59:42,240 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2022-04-28 13:59:42,240 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 61 transitions. [2022-04-28 13:59:42,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:59:42,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:59:42,240 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:59:42,240 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:59:42,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 33 states have internal predecessors, (40), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 13:59:42,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2022-04-28 13:59:42,242 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 56 transitions. Word has length 24 [2022-04-28 13:59:42,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:59:42,242 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 56 transitions. [2022-04-28 13:59:42,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 9 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 13:59:42,242 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 56 transitions. [2022-04-28 13:59:44,299 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 55 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 13:59:44,300 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2022-04-28 13:59:44,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 13:59:44,300 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:59:44,301 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:59:44,317 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 13:59:44,501 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 13:59:44,501 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:59:44,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:59:44,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1797927234, now seen corresponding path program 1 times [2022-04-28 13:59:44,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:59:44,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1450858527] [2022-04-28 13:59:50,572 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 13:59:50,572 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 13:59:50,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1797927234, now seen corresponding path program 2 times [2022-04-28 13:59:50,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:59:50,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144227755] [2022-04-28 13:59:50,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:59:50,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:59:50,600 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:59:50,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1884193017] [2022-04-28 13:59:50,600 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 13:59:50,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:59:50,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:59:50,612 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 13:59:50,613 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 13:59:50,646 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 13:59:50,647 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:59:50,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 13:59:50,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:59:50,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:59:50,787 INFO L272 TraceCheckUtils]: 0: Hoare triple {1260#true} call ULTIMATE.init(); {1260#true} is VALID [2022-04-28 13:59:50,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {1260#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1268#(<= ~counter~0 0)} is VALID [2022-04-28 13:59:50,788 INFO L290 TraceCheckUtils]: 2: Hoare triple {1268#(<= ~counter~0 0)} assume true; {1268#(<= ~counter~0 0)} is VALID [2022-04-28 13:59:50,788 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1268#(<= ~counter~0 0)} {1260#true} #77#return; {1268#(<= ~counter~0 0)} is VALID [2022-04-28 13:59:50,788 INFO L272 TraceCheckUtils]: 4: Hoare triple {1268#(<= ~counter~0 0)} call #t~ret7 := main(); {1268#(<= ~counter~0 0)} is VALID [2022-04-28 13:59:50,789 INFO L290 TraceCheckUtils]: 5: Hoare triple {1268#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1268#(<= ~counter~0 0)} is VALID [2022-04-28 13:59:50,791 INFO L272 TraceCheckUtils]: 6: Hoare triple {1268#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1268#(<= ~counter~0 0)} is VALID [2022-04-28 13:59:50,791 INFO L290 TraceCheckUtils]: 7: Hoare triple {1268#(<= ~counter~0 0)} ~cond := #in~cond; {1268#(<= ~counter~0 0)} is VALID [2022-04-28 13:59:50,791 INFO L290 TraceCheckUtils]: 8: Hoare triple {1268#(<= ~counter~0 0)} assume !(0 == ~cond); {1268#(<= ~counter~0 0)} is VALID [2022-04-28 13:59:50,793 INFO L290 TraceCheckUtils]: 9: Hoare triple {1268#(<= ~counter~0 0)} assume true; {1268#(<= ~counter~0 0)} is VALID [2022-04-28 13:59:50,793 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1268#(<= ~counter~0 0)} {1268#(<= ~counter~0 0)} #69#return; {1268#(<= ~counter~0 0)} is VALID [2022-04-28 13:59:50,803 INFO L290 TraceCheckUtils]: 11: Hoare triple {1268#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {1268#(<= ~counter~0 0)} is VALID [2022-04-28 13:59:50,804 INFO L290 TraceCheckUtils]: 12: Hoare triple {1268#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1302#(<= ~counter~0 1)} is VALID [2022-04-28 13:59:50,807 INFO L290 TraceCheckUtils]: 13: Hoare triple {1302#(<= ~counter~0 1)} assume !!(#t~post6 < 2);havoc #t~post6; {1302#(<= ~counter~0 1)} is VALID [2022-04-28 13:59:50,807 INFO L272 TraceCheckUtils]: 14: Hoare triple {1302#(<= ~counter~0 1)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1302#(<= ~counter~0 1)} is VALID [2022-04-28 13:59:50,808 INFO L290 TraceCheckUtils]: 15: Hoare triple {1302#(<= ~counter~0 1)} ~cond := #in~cond; {1302#(<= ~counter~0 1)} is VALID [2022-04-28 13:59:50,808 INFO L290 TraceCheckUtils]: 16: Hoare triple {1302#(<= ~counter~0 1)} assume !(0 == ~cond); {1302#(<= ~counter~0 1)} is VALID [2022-04-28 13:59:50,809 INFO L290 TraceCheckUtils]: 17: Hoare triple {1302#(<= ~counter~0 1)} assume true; {1302#(<= ~counter~0 1)} is VALID [2022-04-28 13:59:50,809 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1302#(<= ~counter~0 1)} {1302#(<= ~counter~0 1)} #71#return; {1302#(<= ~counter~0 1)} is VALID [2022-04-28 13:59:50,810 INFO L290 TraceCheckUtils]: 19: Hoare triple {1302#(<= ~counter~0 1)} assume !!(0 != ~a~0 && 0 != ~b~0); {1302#(<= ~counter~0 1)} is VALID [2022-04-28 13:59:50,810 INFO L290 TraceCheckUtils]: 20: Hoare triple {1302#(<= ~counter~0 1)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {1302#(<= ~counter~0 1)} is VALID [2022-04-28 13:59:50,810 INFO L290 TraceCheckUtils]: 21: Hoare triple {1302#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1330#(<= |main_#t~post6| 1)} is VALID [2022-04-28 13:59:50,811 INFO L290 TraceCheckUtils]: 22: Hoare triple {1330#(<= |main_#t~post6| 1)} assume !(#t~post6 < 2);havoc #t~post6; {1261#false} is VALID [2022-04-28 13:59:50,811 INFO L272 TraceCheckUtils]: 23: Hoare triple {1261#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {1261#false} is VALID [2022-04-28 13:59:50,811 INFO L290 TraceCheckUtils]: 24: Hoare triple {1261#false} ~cond := #in~cond; {1261#false} is VALID [2022-04-28 13:59:50,811 INFO L290 TraceCheckUtils]: 25: Hoare triple {1261#false} assume 0 == ~cond; {1261#false} is VALID [2022-04-28 13:59:50,811 INFO L290 TraceCheckUtils]: 26: Hoare triple {1261#false} assume !false; {1261#false} is VALID [2022-04-28 13:59:50,811 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 13:59:50,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:59:50,944 INFO L290 TraceCheckUtils]: 26: Hoare triple {1261#false} assume !false; {1261#false} is VALID [2022-04-28 13:59:50,945 INFO L290 TraceCheckUtils]: 25: Hoare triple {1261#false} assume 0 == ~cond; {1261#false} is VALID [2022-04-28 13:59:50,945 INFO L290 TraceCheckUtils]: 24: Hoare triple {1261#false} ~cond := #in~cond; {1261#false} is VALID [2022-04-28 13:59:50,945 INFO L272 TraceCheckUtils]: 23: Hoare triple {1261#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {1261#false} is VALID [2022-04-28 13:59:50,945 INFO L290 TraceCheckUtils]: 22: Hoare triple {1330#(<= |main_#t~post6| 1)} assume !(#t~post6 < 2);havoc #t~post6; {1261#false} is VALID [2022-04-28 13:59:50,946 INFO L290 TraceCheckUtils]: 21: Hoare triple {1302#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1330#(<= |main_#t~post6| 1)} is VALID [2022-04-28 13:59:50,946 INFO L290 TraceCheckUtils]: 20: Hoare triple {1302#(<= ~counter~0 1)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {1302#(<= ~counter~0 1)} is VALID [2022-04-28 13:59:50,946 INFO L290 TraceCheckUtils]: 19: Hoare triple {1302#(<= ~counter~0 1)} assume !!(0 != ~a~0 && 0 != ~b~0); {1302#(<= ~counter~0 1)} is VALID [2022-04-28 13:59:50,947 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1260#true} {1302#(<= ~counter~0 1)} #71#return; {1302#(<= ~counter~0 1)} is VALID [2022-04-28 13:59:50,947 INFO L290 TraceCheckUtils]: 17: Hoare triple {1260#true} assume true; {1260#true} is VALID [2022-04-28 13:59:50,947 INFO L290 TraceCheckUtils]: 16: Hoare triple {1260#true} assume !(0 == ~cond); {1260#true} is VALID [2022-04-28 13:59:50,948 INFO L290 TraceCheckUtils]: 15: Hoare triple {1260#true} ~cond := #in~cond; {1260#true} is VALID [2022-04-28 13:59:50,948 INFO L272 TraceCheckUtils]: 14: Hoare triple {1302#(<= ~counter~0 1)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1260#true} is VALID [2022-04-28 13:59:50,948 INFO L290 TraceCheckUtils]: 13: Hoare triple {1302#(<= ~counter~0 1)} assume !!(#t~post6 < 2);havoc #t~post6; {1302#(<= ~counter~0 1)} is VALID [2022-04-28 13:59:50,949 INFO L290 TraceCheckUtils]: 12: Hoare triple {1268#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1302#(<= ~counter~0 1)} is VALID [2022-04-28 13:59:50,949 INFO L290 TraceCheckUtils]: 11: Hoare triple {1268#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {1268#(<= ~counter~0 0)} is VALID [2022-04-28 13:59:50,949 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1260#true} {1268#(<= ~counter~0 0)} #69#return; {1268#(<= ~counter~0 0)} is VALID [2022-04-28 13:59:50,950 INFO L290 TraceCheckUtils]: 9: Hoare triple {1260#true} assume true; {1260#true} is VALID [2022-04-28 13:59:50,950 INFO L290 TraceCheckUtils]: 8: Hoare triple {1260#true} assume !(0 == ~cond); {1260#true} is VALID [2022-04-28 13:59:50,950 INFO L290 TraceCheckUtils]: 7: Hoare triple {1260#true} ~cond := #in~cond; {1260#true} is VALID [2022-04-28 13:59:50,950 INFO L272 TraceCheckUtils]: 6: Hoare triple {1268#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1260#true} is VALID [2022-04-28 13:59:50,950 INFO L290 TraceCheckUtils]: 5: Hoare triple {1268#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1268#(<= ~counter~0 0)} is VALID [2022-04-28 13:59:50,951 INFO L272 TraceCheckUtils]: 4: Hoare triple {1268#(<= ~counter~0 0)} call #t~ret7 := main(); {1268#(<= ~counter~0 0)} is VALID [2022-04-28 13:59:50,951 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1268#(<= ~counter~0 0)} {1260#true} #77#return; {1268#(<= ~counter~0 0)} is VALID [2022-04-28 13:59:50,951 INFO L290 TraceCheckUtils]: 2: Hoare triple {1268#(<= ~counter~0 0)} assume true; {1268#(<= ~counter~0 0)} is VALID [2022-04-28 13:59:50,952 INFO L290 TraceCheckUtils]: 1: Hoare triple {1260#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1268#(<= ~counter~0 0)} is VALID [2022-04-28 13:59:50,952 INFO L272 TraceCheckUtils]: 0: Hoare triple {1260#true} call ULTIMATE.init(); {1260#true} is VALID [2022-04-28 13:59:50,952 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 13:59:50,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:59:50,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144227755] [2022-04-28 13:59:50,954 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:59:50,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884193017] [2022-04-28 13:59:50,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884193017] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:59:50,954 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:59:50,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2022-04-28 13:59:50,955 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:59:50,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1450858527] [2022-04-28 13:59:50,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1450858527] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:59:50,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:59:50,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 13:59:50,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098559681] [2022-04-28 13:59:50,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:59:50,956 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 27 [2022-04-28 13:59:50,956 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:59:50,956 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 13:59:50,973 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:59:50,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 13:59:50,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:59:50,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 13:59:50,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 13:59:50,974 INFO L87 Difference]: Start difference. First operand 45 states and 56 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 13:59:51,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:59:51,120 INFO L93 Difference]: Finished difference Result 73 states and 89 transitions. [2022-04-28 13:59:51,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 13:59:51,120 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 27 [2022-04-28 13:59:51,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:59:51,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 13:59:51,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2022-04-28 13:59:51,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 13:59:51,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2022-04-28 13:59:51,123 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 64 transitions. [2022-04-28 13:59:51,164 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 13:59:51,166 INFO L225 Difference]: With dead ends: 73 [2022-04-28 13:59:51,166 INFO L226 Difference]: Without dead ends: 63 [2022-04-28 13:59:51,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-28 13:59:51,167 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 17 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 13:59:51,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 108 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 13:59:51,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-28 13:59:51,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2022-04-28 13:59:51,217 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:59:51,217 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 61 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 45 states have internal predecessors, (57), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 13:59:51,218 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 61 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 45 states have internal predecessors, (57), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 13:59:51,218 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 61 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 45 states have internal predecessors, (57), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 13:59:51,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:59:51,220 INFO L93 Difference]: Finished difference Result 63 states and 77 transitions. [2022-04-28 13:59:51,220 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 77 transitions. [2022-04-28 13:59:51,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:59:51,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:59:51,220 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 45 states have internal predecessors, (57), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 63 states. [2022-04-28 13:59:51,221 INFO L87 Difference]: Start difference. First operand has 61 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 45 states have internal predecessors, (57), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 63 states. [2022-04-28 13:59:51,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:59:51,222 INFO L93 Difference]: Finished difference Result 63 states and 77 transitions. [2022-04-28 13:59:51,222 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 77 transitions. [2022-04-28 13:59:51,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:59:51,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:59:51,223 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:59:51,223 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:59:51,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 45 states have internal predecessors, (57), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 13:59:51,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 76 transitions. [2022-04-28 13:59:51,225 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 76 transitions. Word has length 27 [2022-04-28 13:59:51,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:59:51,225 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 76 transitions. [2022-04-28 13:59:51,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 13:59:51,226 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 76 transitions. [2022-04-28 13:59:53,305 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 75 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 13:59:53,305 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 76 transitions. [2022-04-28 13:59:53,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 13:59:53,306 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:59:53,306 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:59:53,324 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 13:59:53,506 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 13:59:53,507 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:59:53,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:59:53,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1799714694, now seen corresponding path program 1 times [2022-04-28 13:59:53,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:59:53,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1667885233] [2022-04-28 13:59:59,560 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 13:59:59,560 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 13:59:59,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1799714694, now seen corresponding path program 2 times [2022-04-28 13:59:59,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:59:59,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784354958] [2022-04-28 13:59:59,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:59:59,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:59:59,570 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:59:59,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1354966116] [2022-04-28 13:59:59,570 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 13:59:59,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:59:59,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:59:59,592 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 13:59:59,593 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 13:59:59,626 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 13:59:59,626 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:59:59,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-28 13:59:59,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:59:59,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:00:00,087 INFO L272 TraceCheckUtils]: 0: Hoare triple {1822#true} call ULTIMATE.init(); {1822#true} is VALID [2022-04-28 14:00:00,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {1822#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1822#true} is VALID [2022-04-28 14:00:00,087 INFO L290 TraceCheckUtils]: 2: Hoare triple {1822#true} assume true; {1822#true} is VALID [2022-04-28 14:00:00,087 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1822#true} {1822#true} #77#return; {1822#true} is VALID [2022-04-28 14:00:00,087 INFO L272 TraceCheckUtils]: 4: Hoare triple {1822#true} call #t~ret7 := main(); {1822#true} is VALID [2022-04-28 14:00:00,087 INFO L290 TraceCheckUtils]: 5: Hoare triple {1822#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1822#true} is VALID [2022-04-28 14:00:00,087 INFO L272 TraceCheckUtils]: 6: Hoare triple {1822#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1822#true} is VALID [2022-04-28 14:00:00,088 INFO L290 TraceCheckUtils]: 7: Hoare triple {1822#true} ~cond := #in~cond; {1822#true} is VALID [2022-04-28 14:00:00,088 INFO L290 TraceCheckUtils]: 8: Hoare triple {1822#true} assume !(0 == ~cond); {1822#true} is VALID [2022-04-28 14:00:00,088 INFO L290 TraceCheckUtils]: 9: Hoare triple {1822#true} assume true; {1822#true} is VALID [2022-04-28 14:00:00,088 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1822#true} {1822#true} #69#return; {1822#true} is VALID [2022-04-28 14:00:00,088 INFO L290 TraceCheckUtils]: 11: Hoare triple {1822#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {1860#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:00:00,089 INFO L290 TraceCheckUtils]: 12: Hoare triple {1860#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1860#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:00:00,089 INFO L290 TraceCheckUtils]: 13: Hoare triple {1860#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post6 < 2);havoc #t~post6; {1860#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:00:00,089 INFO L272 TraceCheckUtils]: 14: Hoare triple {1860#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1822#true} is VALID [2022-04-28 14:00:00,090 INFO L290 TraceCheckUtils]: 15: Hoare triple {1822#true} ~cond := #in~cond; {1873#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:00:00,090 INFO L290 TraceCheckUtils]: 16: Hoare triple {1873#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1877#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:00:00,090 INFO L290 TraceCheckUtils]: 17: Hoare triple {1877#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1877#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:00:00,091 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1877#(not (= |__VERIFIER_assert_#in~cond| 0))} {1860#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #71#return; {1884#(and (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:00:00,092 INFO L290 TraceCheckUtils]: 19: Hoare triple {1884#(and (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~a~0 && 0 != ~b~0); {1884#(and (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:00:00,093 INFO L290 TraceCheckUtils]: 20: Hoare triple {1884#(and (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {1891#(and (= (+ main_~q~0 (* main_~y~0 main_~x~0 1)) (* main_~y~0 main_~x~0)) (= (div main_~y~0 2) main_~b~0) (= (mod main_~y~0 2) 0) (= main_~p~0 4) (= (div main_~x~0 2) main_~a~0) (= (mod main_~x~0 2) 0))} is VALID [2022-04-28 14:00:00,093 INFO L290 TraceCheckUtils]: 21: Hoare triple {1891#(and (= (+ main_~q~0 (* main_~y~0 main_~x~0 1)) (* main_~y~0 main_~x~0)) (= (div main_~y~0 2) main_~b~0) (= (mod main_~y~0 2) 0) (= main_~p~0 4) (= (div main_~x~0 2) main_~a~0) (= (mod main_~x~0 2) 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1891#(and (= (+ main_~q~0 (* main_~y~0 main_~x~0 1)) (* main_~y~0 main_~x~0)) (= (div main_~y~0 2) main_~b~0) (= (mod main_~y~0 2) 0) (= main_~p~0 4) (= (div main_~x~0 2) main_~a~0) (= (mod main_~x~0 2) 0))} is VALID [2022-04-28 14:00:00,094 INFO L290 TraceCheckUtils]: 22: Hoare triple {1891#(and (= (+ main_~q~0 (* main_~y~0 main_~x~0 1)) (* main_~y~0 main_~x~0)) (= (div main_~y~0 2) main_~b~0) (= (mod main_~y~0 2) 0) (= main_~p~0 4) (= (div main_~x~0 2) main_~a~0) (= (mod main_~x~0 2) 0))} assume !!(#t~post6 < 2);havoc #t~post6; {1891#(and (= (+ main_~q~0 (* main_~y~0 main_~x~0 1)) (* main_~y~0 main_~x~0)) (= (div main_~y~0 2) main_~b~0) (= (mod main_~y~0 2) 0) (= main_~p~0 4) (= (div main_~x~0 2) main_~a~0) (= (mod main_~x~0 2) 0))} is VALID [2022-04-28 14:00:00,097 INFO L272 TraceCheckUtils]: 23: Hoare triple {1891#(and (= (+ main_~q~0 (* main_~y~0 main_~x~0 1)) (* main_~y~0 main_~x~0)) (= (div main_~y~0 2) main_~b~0) (= (mod main_~y~0 2) 0) (= main_~p~0 4) (= (div main_~x~0 2) main_~a~0) (= (mod main_~x~0 2) 0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1901#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:00:00,097 INFO L290 TraceCheckUtils]: 24: Hoare triple {1901#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1905#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:00:00,098 INFO L290 TraceCheckUtils]: 25: Hoare triple {1905#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1823#false} is VALID [2022-04-28 14:00:00,098 INFO L290 TraceCheckUtils]: 26: Hoare triple {1823#false} assume !false; {1823#false} is VALID [2022-04-28 14:00:00,098 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:00:00,098 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:00:56,645 INFO L290 TraceCheckUtils]: 26: Hoare triple {1823#false} assume !false; {1823#false} is VALID [2022-04-28 14:00:56,646 INFO L290 TraceCheckUtils]: 25: Hoare triple {1905#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1823#false} is VALID [2022-04-28 14:00:56,646 INFO L290 TraceCheckUtils]: 24: Hoare triple {1901#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1905#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:00:56,647 INFO L272 TraceCheckUtils]: 23: Hoare triple {1921#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1901#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:00:56,647 INFO L290 TraceCheckUtils]: 22: Hoare triple {1921#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !!(#t~post6 < 2);havoc #t~post6; {1921#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:00:56,648 INFO L290 TraceCheckUtils]: 21: Hoare triple {1921#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1921#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:00:56,655 INFO L290 TraceCheckUtils]: 20: Hoare triple {1931#(or (not (= (mod main_~b~0 2) 0)) (= (+ (* (div main_~b~0 2) (* main_~p~0 4) (div main_~a~0 2)) main_~q~0) (* main_~y~0 main_~x~0)) (not (= (mod main_~a~0 2) 0)))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {1921#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:00:56,655 INFO L290 TraceCheckUtils]: 19: Hoare triple {1931#(or (not (= (mod main_~b~0 2) 0)) (= (+ (* (div main_~b~0 2) (* main_~p~0 4) (div main_~a~0 2)) main_~q~0) (* main_~y~0 main_~x~0)) (not (= (mod main_~a~0 2) 0)))} assume !!(0 != ~a~0 && 0 != ~b~0); {1931#(or (not (= (mod main_~b~0 2) 0)) (= (+ (* (div main_~b~0 2) (* main_~p~0 4) (div main_~a~0 2)) main_~q~0) (* main_~y~0 main_~x~0)) (not (= (mod main_~a~0 2) 0)))} is VALID [2022-04-28 14:00:56,659 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1877#(not (= |__VERIFIER_assert_#in~cond| 0))} {1822#true} #71#return; {1931#(or (not (= (mod main_~b~0 2) 0)) (= (+ (* (div main_~b~0 2) (* main_~p~0 4) (div main_~a~0 2)) main_~q~0) (* main_~y~0 main_~x~0)) (not (= (mod main_~a~0 2) 0)))} is VALID [2022-04-28 14:00:56,660 INFO L290 TraceCheckUtils]: 17: Hoare triple {1877#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1877#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:00:56,660 INFO L290 TraceCheckUtils]: 16: Hoare triple {1947#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1877#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:00:56,661 INFO L290 TraceCheckUtils]: 15: Hoare triple {1822#true} ~cond := #in~cond; {1947#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 14:00:56,661 INFO L272 TraceCheckUtils]: 14: Hoare triple {1822#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1822#true} is VALID [2022-04-28 14:00:56,661 INFO L290 TraceCheckUtils]: 13: Hoare triple {1822#true} assume !!(#t~post6 < 2);havoc #t~post6; {1822#true} is VALID [2022-04-28 14:00:56,661 INFO L290 TraceCheckUtils]: 12: Hoare triple {1822#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1822#true} is VALID [2022-04-28 14:00:56,661 INFO L290 TraceCheckUtils]: 11: Hoare triple {1822#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {1822#true} is VALID [2022-04-28 14:00:56,661 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1822#true} {1822#true} #69#return; {1822#true} is VALID [2022-04-28 14:00:56,661 INFO L290 TraceCheckUtils]: 9: Hoare triple {1822#true} assume true; {1822#true} is VALID [2022-04-28 14:00:56,661 INFO L290 TraceCheckUtils]: 8: Hoare triple {1822#true} assume !(0 == ~cond); {1822#true} is VALID [2022-04-28 14:00:56,662 INFO L290 TraceCheckUtils]: 7: Hoare triple {1822#true} ~cond := #in~cond; {1822#true} is VALID [2022-04-28 14:00:56,662 INFO L272 TraceCheckUtils]: 6: Hoare triple {1822#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1822#true} is VALID [2022-04-28 14:00:56,662 INFO L290 TraceCheckUtils]: 5: Hoare triple {1822#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1822#true} is VALID [2022-04-28 14:00:56,662 INFO L272 TraceCheckUtils]: 4: Hoare triple {1822#true} call #t~ret7 := main(); {1822#true} is VALID [2022-04-28 14:00:56,662 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1822#true} {1822#true} #77#return; {1822#true} is VALID [2022-04-28 14:00:56,662 INFO L290 TraceCheckUtils]: 2: Hoare triple {1822#true} assume true; {1822#true} is VALID [2022-04-28 14:00:56,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {1822#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1822#true} is VALID [2022-04-28 14:00:56,662 INFO L272 TraceCheckUtils]: 0: Hoare triple {1822#true} call ULTIMATE.init(); {1822#true} is VALID [2022-04-28 14:00:56,663 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:00:56,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:00:56,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784354958] [2022-04-28 14:00:56,663 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:00:56,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354966116] [2022-04-28 14:00:56,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354966116] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:00:56,663 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:00:56,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2022-04-28 14:00:56,664 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:00:56,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1667885233] [2022-04-28 14:00:56,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1667885233] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:00:56,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:00:56,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 14:00:56,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501669065] [2022-04-28 14:00:56,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:00:56,664 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (5), 2 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 27 [2022-04-28 14:00:56,664 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:00:56,665 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (5), 2 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 14:00:56,688 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:00:56,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 14:00:56,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:00:56,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 14:00:56,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-04-28 14:00:56,689 INFO L87 Difference]: Start difference. First operand 61 states and 76 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (5), 2 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 14:00:57,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:00:57,188 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2022-04-28 14:00:57,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 14:00:57,189 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (5), 2 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 27 [2022-04-28 14:00:57,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:00:57,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (5), 2 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 14:00:57,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 68 transitions. [2022-04-28 14:00:57,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (5), 2 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 14:00:57,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 68 transitions. [2022-04-28 14:00:57,191 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 68 transitions. [2022-04-28 14:00:57,248 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:00:57,250 INFO L225 Difference]: With dead ends: 76 [2022-04-28 14:00:57,250 INFO L226 Difference]: Without dead ends: 74 [2022-04-28 14:00:57,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-04-28 14:00:57,251 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 25 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 14:00:57,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 108 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 14:00:57,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-28 14:00:57,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 68. [2022-04-28 14:00:57,307 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:00:57,307 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 68 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 51 states have internal predecessors, (62), 12 states have call successors, (12), 9 states have call predecessors, (12), 7 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:00:57,307 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 68 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 51 states have internal predecessors, (62), 12 states have call successors, (12), 9 states have call predecessors, (12), 7 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:00:57,307 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 68 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 51 states have internal predecessors, (62), 12 states have call successors, (12), 9 states have call predecessors, (12), 7 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:00:57,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:00:57,309 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2022-04-28 14:00:57,309 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2022-04-28 14:00:57,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:00:57,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:00:57,310 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 51 states have internal predecessors, (62), 12 states have call successors, (12), 9 states have call predecessors, (12), 7 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) Second operand 74 states. [2022-04-28 14:00:57,310 INFO L87 Difference]: Start difference. First operand has 68 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 51 states have internal predecessors, (62), 12 states have call successors, (12), 9 states have call predecessors, (12), 7 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) Second operand 74 states. [2022-04-28 14:00:57,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:00:57,312 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2022-04-28 14:00:57,312 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2022-04-28 14:00:57,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:00:57,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:00:57,312 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:00:57,313 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:00:57,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 51 states have internal predecessors, (62), 12 states have call successors, (12), 9 states have call predecessors, (12), 7 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:00:57,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 83 transitions. [2022-04-28 14:00:57,314 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 83 transitions. Word has length 27 [2022-04-28 14:00:57,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:00:57,315 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 83 transitions. [2022-04-28 14:00:57,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (5), 2 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 14:00:57,315 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 83 transitions. [2022-04-28 14:00:59,415 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 82 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 14:00:59,416 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 83 transitions. [2022-04-28 14:00:59,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 14:00:59,416 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:00:59,416 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:00:59,432 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 14:00:59,616 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 14:00:59,617 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:00:59,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:00:59,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1613968938, now seen corresponding path program 1 times [2022-04-28 14:00:59,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:00:59,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2053982855] [2022-04-28 14:00:59,618 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:00:59,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1613968938, now seen corresponding path program 2 times [2022-04-28 14:00:59,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:00:59,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825970868] [2022-04-28 14:00:59,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:00:59,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:00:59,637 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:00:59,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [354073518] [2022-04-28 14:00:59,638 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:00:59,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:00:59,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:00:59,645 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 14:00:59,645 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 14:00:59,690 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:00:59,690 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:00:59,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 14:00:59,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:00:59,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:00:59,852 INFO L272 TraceCheckUtils]: 0: Hoare triple {2435#true} call ULTIMATE.init(); {2435#true} is VALID [2022-04-28 14:00:59,852 INFO L290 TraceCheckUtils]: 1: Hoare triple {2435#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2435#true} is VALID [2022-04-28 14:00:59,852 INFO L290 TraceCheckUtils]: 2: Hoare triple {2435#true} assume true; {2435#true} is VALID [2022-04-28 14:00:59,852 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2435#true} {2435#true} #77#return; {2435#true} is VALID [2022-04-28 14:00:59,852 INFO L272 TraceCheckUtils]: 4: Hoare triple {2435#true} call #t~ret7 := main(); {2435#true} is VALID [2022-04-28 14:00:59,853 INFO L290 TraceCheckUtils]: 5: Hoare triple {2435#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2435#true} is VALID [2022-04-28 14:00:59,853 INFO L272 TraceCheckUtils]: 6: Hoare triple {2435#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2435#true} is VALID [2022-04-28 14:00:59,853 INFO L290 TraceCheckUtils]: 7: Hoare triple {2435#true} ~cond := #in~cond; {2461#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 14:00:59,854 INFO L290 TraceCheckUtils]: 8: Hoare triple {2461#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2465#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:00:59,854 INFO L290 TraceCheckUtils]: 9: Hoare triple {2465#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2465#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:00:59,854 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2465#(not (= |assume_abort_if_not_#in~cond| 0))} {2435#true} #69#return; {2472#(<= 1 main_~y~0)} is VALID [2022-04-28 14:00:59,855 INFO L290 TraceCheckUtils]: 11: Hoare triple {2472#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {2476#(<= 1 main_~b~0)} is VALID [2022-04-28 14:00:59,855 INFO L290 TraceCheckUtils]: 12: Hoare triple {2476#(<= 1 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2476#(<= 1 main_~b~0)} is VALID [2022-04-28 14:00:59,856 INFO L290 TraceCheckUtils]: 13: Hoare triple {2476#(<= 1 main_~b~0)} assume !!(#t~post6 < 2);havoc #t~post6; {2476#(<= 1 main_~b~0)} is VALID [2022-04-28 14:00:59,856 INFO L272 TraceCheckUtils]: 14: Hoare triple {2476#(<= 1 main_~b~0)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {2435#true} is VALID [2022-04-28 14:00:59,856 INFO L290 TraceCheckUtils]: 15: Hoare triple {2435#true} ~cond := #in~cond; {2435#true} is VALID [2022-04-28 14:00:59,856 INFO L290 TraceCheckUtils]: 16: Hoare triple {2435#true} assume !(0 == ~cond); {2435#true} is VALID [2022-04-28 14:00:59,857 INFO L290 TraceCheckUtils]: 17: Hoare triple {2435#true} assume true; {2435#true} is VALID [2022-04-28 14:00:59,857 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2435#true} {2476#(<= 1 main_~b~0)} #71#return; {2476#(<= 1 main_~b~0)} is VALID [2022-04-28 14:00:59,858 INFO L290 TraceCheckUtils]: 19: Hoare triple {2476#(<= 1 main_~b~0)} assume !(0 != ~a~0 && 0 != ~b~0); {2501#(and (= main_~a~0 0) (<= 1 main_~b~0))} is VALID [2022-04-28 14:00:59,858 INFO L272 TraceCheckUtils]: 20: Hoare triple {2501#(and (= main_~a~0 0) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {2435#true} is VALID [2022-04-28 14:00:59,858 INFO L290 TraceCheckUtils]: 21: Hoare triple {2435#true} ~cond := #in~cond; {2435#true} is VALID [2022-04-28 14:00:59,858 INFO L290 TraceCheckUtils]: 22: Hoare triple {2435#true} assume !(0 == ~cond); {2435#true} is VALID [2022-04-28 14:00:59,858 INFO L290 TraceCheckUtils]: 23: Hoare triple {2435#true} assume true; {2435#true} is VALID [2022-04-28 14:00:59,859 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2435#true} {2501#(and (= main_~a~0 0) (<= 1 main_~b~0))} #73#return; {2501#(and (= main_~a~0 0) (<= 1 main_~b~0))} is VALID [2022-04-28 14:00:59,859 INFO L272 TraceCheckUtils]: 25: Hoare triple {2501#(and (= main_~a~0 0) (<= 1 main_~b~0))} call __VERIFIER_assert((if 0 == ~a~0 * ~b~0 then 1 else 0)); {2520#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:00:59,860 INFO L290 TraceCheckUtils]: 26: Hoare triple {2520#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2524#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:00:59,860 INFO L290 TraceCheckUtils]: 27: Hoare triple {2524#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2436#false} is VALID [2022-04-28 14:00:59,860 INFO L290 TraceCheckUtils]: 28: Hoare triple {2436#false} assume !false; {2436#false} is VALID [2022-04-28 14:00:59,860 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 14:00:59,860 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 14:00:59,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:00:59,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825970868] [2022-04-28 14:00:59,861 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:00:59,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354073518] [2022-04-28 14:00:59,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354073518] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:00:59,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:00:59,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 14:00:59,861 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:00:59,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2053982855] [2022-04-28 14:00:59,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2053982855] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:00:59,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:00:59,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 14:00:59,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415824891] [2022-04-28 14:00:59,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:00:59,862 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 3 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 29 [2022-04-28 14:00:59,862 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:00:59,862 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 3 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 14:00:59,881 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:00:59,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 14:00:59,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:00:59,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 14:00:59,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-04-28 14:00:59,882 INFO L87 Difference]: Start difference. First operand 68 states and 83 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 3 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 14:01:00,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:01:00,241 INFO L93 Difference]: Finished difference Result 85 states and 107 transitions. [2022-04-28 14:01:00,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 14:01:00,242 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 3 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 29 [2022-04-28 14:01:00,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:01:00,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 3 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 14:01:00,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 57 transitions. [2022-04-28 14:01:00,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 3 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 14:01:00,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 57 transitions. [2022-04-28 14:01:00,244 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 57 transitions. [2022-04-28 14:01:00,285 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:01:00,286 INFO L225 Difference]: With dead ends: 85 [2022-04-28 14:01:00,286 INFO L226 Difference]: Without dead ends: 65 [2022-04-28 14:01:00,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-04-28 14:01:00,287 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 33 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:01:00,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 157 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:01:00,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-28 14:01:00,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2022-04-28 14:01:00,349 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:01:00,349 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 62 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 48 states have internal predecessors, (61), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:01:00,349 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 62 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 48 states have internal predecessors, (61), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:01:00,349 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 62 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 48 states have internal predecessors, (61), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:01:00,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:01:00,351 INFO L93 Difference]: Finished difference Result 65 states and 85 transitions. [2022-04-28 14:01:00,351 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 85 transitions. [2022-04-28 14:01:00,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:01:00,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:01:00,352 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 48 states have internal predecessors, (61), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 65 states. [2022-04-28 14:01:00,352 INFO L87 Difference]: Start difference. First operand has 62 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 48 states have internal predecessors, (61), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 65 states. [2022-04-28 14:01:00,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:01:00,353 INFO L93 Difference]: Finished difference Result 65 states and 85 transitions. [2022-04-28 14:01:00,354 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 85 transitions. [2022-04-28 14:01:00,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:01:00,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:01:00,354 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:01:00,354 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:01:00,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 48 states have internal predecessors, (61), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:01:00,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 80 transitions. [2022-04-28 14:01:00,356 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 80 transitions. Word has length 29 [2022-04-28 14:01:00,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:01:00,356 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 80 transitions. [2022-04-28 14:01:00,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 3 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 14:01:00,356 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 80 transitions. [2022-04-28 14:01:02,450 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 79 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 14:01:02,451 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 80 transitions. [2022-04-28 14:01:02,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 14:01:02,451 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:01:02,451 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:01:02,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-28 14:01:02,663 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 14:01:02,663 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:01:02,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:01:02,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1357155568, now seen corresponding path program 1 times [2022-04-28 14:01:02,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:01:02,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1288634937] [2022-04-28 14:01:08,750 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:01:08,750 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:01:08,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1357155568, now seen corresponding path program 2 times [2022-04-28 14:01:08,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:01:08,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818275771] [2022-04-28 14:01:08,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:01:08,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:01:08,766 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:01:08,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1649697032] [2022-04-28 14:01:08,767 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:01:08,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:01:08,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:01:08,768 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:01:08,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-28 14:01:08,820 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:01:08,820 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:01:08,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 14:01:08,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:01:08,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:01:09,058 INFO L272 TraceCheckUtils]: 0: Hoare triple {2962#true} call ULTIMATE.init(); {2962#true} is VALID [2022-04-28 14:01:09,058 INFO L290 TraceCheckUtils]: 1: Hoare triple {2962#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2962#true} is VALID [2022-04-28 14:01:09,058 INFO L290 TraceCheckUtils]: 2: Hoare triple {2962#true} assume true; {2962#true} is VALID [2022-04-28 14:01:09,059 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2962#true} {2962#true} #77#return; {2962#true} is VALID [2022-04-28 14:01:09,059 INFO L272 TraceCheckUtils]: 4: Hoare triple {2962#true} call #t~ret7 := main(); {2962#true} is VALID [2022-04-28 14:01:09,059 INFO L290 TraceCheckUtils]: 5: Hoare triple {2962#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2962#true} is VALID [2022-04-28 14:01:09,059 INFO L272 TraceCheckUtils]: 6: Hoare triple {2962#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2962#true} is VALID [2022-04-28 14:01:09,059 INFO L290 TraceCheckUtils]: 7: Hoare triple {2962#true} ~cond := #in~cond; {2962#true} is VALID [2022-04-28 14:01:09,059 INFO L290 TraceCheckUtils]: 8: Hoare triple {2962#true} assume !(0 == ~cond); {2962#true} is VALID [2022-04-28 14:01:09,059 INFO L290 TraceCheckUtils]: 9: Hoare triple {2962#true} assume true; {2962#true} is VALID [2022-04-28 14:01:09,059 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2962#true} {2962#true} #69#return; {2962#true} is VALID [2022-04-28 14:01:09,060 INFO L290 TraceCheckUtils]: 11: Hoare triple {2962#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {3000#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:01:09,060 INFO L290 TraceCheckUtils]: 12: Hoare triple {3000#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3000#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:01:09,061 INFO L290 TraceCheckUtils]: 13: Hoare triple {3000#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post6 < 2);havoc #t~post6; {3000#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:01:09,061 INFO L272 TraceCheckUtils]: 14: Hoare triple {3000#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {2962#true} is VALID [2022-04-28 14:01:09,061 INFO L290 TraceCheckUtils]: 15: Hoare triple {2962#true} ~cond := #in~cond; {3013#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:01:09,062 INFO L290 TraceCheckUtils]: 16: Hoare triple {3013#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3017#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:01:09,062 INFO L290 TraceCheckUtils]: 17: Hoare triple {3017#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3017#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:01:09,063 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3017#(not (= |__VERIFIER_assert_#in~cond| 0))} {3000#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #71#return; {3000#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:01:09,063 INFO L290 TraceCheckUtils]: 19: Hoare triple {3000#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~a~0 && 0 != ~b~0); {3000#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:01:09,064 INFO L290 TraceCheckUtils]: 20: Hoare triple {3000#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {3000#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:01:09,065 INFO L290 TraceCheckUtils]: 21: Hoare triple {3000#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume 1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := ~a~0 - 1;~q~0 := ~q~0 + ~b~0 * ~p~0; {3033#(and (= main_~b~0 main_~y~0) (= (+ main_~a~0 1) main_~x~0) (= 0 (+ main_~q~0 (* (- 1) main_~b~0 main_~p~0))) (= main_~p~0 1))} is VALID [2022-04-28 14:01:09,065 INFO L290 TraceCheckUtils]: 22: Hoare triple {3033#(and (= main_~b~0 main_~y~0) (= (+ main_~a~0 1) main_~x~0) (= 0 (+ main_~q~0 (* (- 1) main_~b~0 main_~p~0))) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3033#(and (= main_~b~0 main_~y~0) (= (+ main_~a~0 1) main_~x~0) (= 0 (+ main_~q~0 (* (- 1) main_~b~0 main_~p~0))) (= main_~p~0 1))} is VALID [2022-04-28 14:01:09,066 INFO L290 TraceCheckUtils]: 23: Hoare triple {3033#(and (= main_~b~0 main_~y~0) (= (+ main_~a~0 1) main_~x~0) (= 0 (+ main_~q~0 (* (- 1) main_~b~0 main_~p~0))) (= main_~p~0 1))} assume !!(#t~post6 < 2);havoc #t~post6; {3033#(and (= main_~b~0 main_~y~0) (= (+ main_~a~0 1) main_~x~0) (= 0 (+ main_~q~0 (* (- 1) main_~b~0 main_~p~0))) (= main_~p~0 1))} is VALID [2022-04-28 14:01:09,067 INFO L272 TraceCheckUtils]: 24: Hoare triple {3033#(and (= main_~b~0 main_~y~0) (= (+ main_~a~0 1) main_~x~0) (= 0 (+ main_~q~0 (* (- 1) main_~b~0 main_~p~0))) (= main_~p~0 1))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {3043#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:01:09,068 INFO L290 TraceCheckUtils]: 25: Hoare triple {3043#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3047#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:01:09,068 INFO L290 TraceCheckUtils]: 26: Hoare triple {3047#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2963#false} is VALID [2022-04-28 14:01:09,068 INFO L290 TraceCheckUtils]: 27: Hoare triple {2963#false} assume !false; {2963#false} is VALID [2022-04-28 14:01:09,069 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:01:09,069 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:01:29,974 INFO L290 TraceCheckUtils]: 27: Hoare triple {2963#false} assume !false; {2963#false} is VALID [2022-04-28 14:01:29,974 INFO L290 TraceCheckUtils]: 26: Hoare triple {3047#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2963#false} is VALID [2022-04-28 14:01:29,975 INFO L290 TraceCheckUtils]: 25: Hoare triple {3043#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3047#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:01:29,975 INFO L272 TraceCheckUtils]: 24: Hoare triple {3063#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {3043#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:01:29,976 INFO L290 TraceCheckUtils]: 23: Hoare triple {3063#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !!(#t~post6 < 2);havoc #t~post6; {3063#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:01:29,976 INFO L290 TraceCheckUtils]: 22: Hoare triple {3063#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3063#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:01:29,980 INFO L290 TraceCheckUtils]: 21: Hoare triple {3063#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume 1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := ~a~0 - 1;~q~0 := ~q~0 + ~b~0 * ~p~0; {3063#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:01:29,981 INFO L290 TraceCheckUtils]: 20: Hoare triple {3063#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {3063#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:01:29,981 INFO L290 TraceCheckUtils]: 19: Hoare triple {3063#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !!(0 != ~a~0 && 0 != ~b~0); {3063#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:01:29,982 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3017#(not (= |__VERIFIER_assert_#in~cond| 0))} {2962#true} #71#return; {3063#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:01:29,982 INFO L290 TraceCheckUtils]: 17: Hoare triple {3017#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3017#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:01:29,983 INFO L290 TraceCheckUtils]: 16: Hoare triple {3091#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3017#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:01:29,983 INFO L290 TraceCheckUtils]: 15: Hoare triple {2962#true} ~cond := #in~cond; {3091#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 14:01:29,983 INFO L272 TraceCheckUtils]: 14: Hoare triple {2962#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {2962#true} is VALID [2022-04-28 14:01:29,983 INFO L290 TraceCheckUtils]: 13: Hoare triple {2962#true} assume !!(#t~post6 < 2);havoc #t~post6; {2962#true} is VALID [2022-04-28 14:01:29,983 INFO L290 TraceCheckUtils]: 12: Hoare triple {2962#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2962#true} is VALID [2022-04-28 14:01:29,983 INFO L290 TraceCheckUtils]: 11: Hoare triple {2962#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {2962#true} is VALID [2022-04-28 14:01:29,984 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2962#true} {2962#true} #69#return; {2962#true} is VALID [2022-04-28 14:01:29,984 INFO L290 TraceCheckUtils]: 9: Hoare triple {2962#true} assume true; {2962#true} is VALID [2022-04-28 14:01:29,984 INFO L290 TraceCheckUtils]: 8: Hoare triple {2962#true} assume !(0 == ~cond); {2962#true} is VALID [2022-04-28 14:01:29,984 INFO L290 TraceCheckUtils]: 7: Hoare triple {2962#true} ~cond := #in~cond; {2962#true} is VALID [2022-04-28 14:01:29,984 INFO L272 TraceCheckUtils]: 6: Hoare triple {2962#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2962#true} is VALID [2022-04-28 14:01:29,984 INFO L290 TraceCheckUtils]: 5: Hoare triple {2962#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2962#true} is VALID [2022-04-28 14:01:29,984 INFO L272 TraceCheckUtils]: 4: Hoare triple {2962#true} call #t~ret7 := main(); {2962#true} is VALID [2022-04-28 14:01:29,984 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2962#true} {2962#true} #77#return; {2962#true} is VALID [2022-04-28 14:01:29,984 INFO L290 TraceCheckUtils]: 2: Hoare triple {2962#true} assume true; {2962#true} is VALID [2022-04-28 14:01:29,985 INFO L290 TraceCheckUtils]: 1: Hoare triple {2962#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2962#true} is VALID [2022-04-28 14:01:29,985 INFO L272 TraceCheckUtils]: 0: Hoare triple {2962#true} call ULTIMATE.init(); {2962#true} is VALID [2022-04-28 14:01:29,985 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:01:29,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:01:29,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818275771] [2022-04-28 14:01:29,985 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:01:29,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649697032] [2022-04-28 14:01:29,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649697032] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:01:29,986 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:01:29,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2022-04-28 14:01:29,986 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:01:29,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1288634937] [2022-04-28 14:01:29,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1288634937] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:01:29,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:01:29,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 14:01:29,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809938003] [2022-04-28 14:01:29,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:01:29,987 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (5), 2 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 28 [2022-04-28 14:01:29,987 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:01:29,987 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (5), 2 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 14:01:30,012 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:01:30,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 14:01:30,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:01:30,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 14:01:30,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-28 14:01:30,013 INFO L87 Difference]: Start difference. First operand 62 states and 80 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (5), 2 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 14:01:30,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:01:30,498 INFO L93 Difference]: Finished difference Result 73 states and 94 transitions. [2022-04-28 14:01:30,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 14:01:30,498 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (5), 2 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 28 [2022-04-28 14:01:30,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:01:30,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (5), 2 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 14:01:30,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 60 transitions. [2022-04-28 14:01:30,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (5), 2 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 14:01:30,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 60 transitions. [2022-04-28 14:01:30,500 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 60 transitions. [2022-04-28 14:01:30,551 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:01:30,552 INFO L225 Difference]: With dead ends: 73 [2022-04-28 14:01:30,552 INFO L226 Difference]: Without dead ends: 71 [2022-04-28 14:01:30,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-28 14:01:30,552 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 15 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 14:01:30,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 133 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 14:01:30,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-28 14:01:30,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 67. [2022-04-28 14:01:30,625 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:01:30,625 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 67 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 52 states have internal predecessors, (64), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:01:30,625 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 67 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 52 states have internal predecessors, (64), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:01:30,632 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 67 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 52 states have internal predecessors, (64), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:01:30,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:01:30,634 INFO L93 Difference]: Finished difference Result 71 states and 92 transitions. [2022-04-28 14:01:30,634 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 92 transitions. [2022-04-28 14:01:30,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:01:30,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:01:30,636 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 52 states have internal predecessors, (64), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) Second operand 71 states. [2022-04-28 14:01:30,636 INFO L87 Difference]: Start difference. First operand has 67 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 52 states have internal predecessors, (64), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) Second operand 71 states. [2022-04-28 14:01:30,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:01:30,638 INFO L93 Difference]: Finished difference Result 71 states and 92 transitions. [2022-04-28 14:01:30,638 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 92 transitions. [2022-04-28 14:01:30,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:01:30,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:01:30,638 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:01:30,638 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:01:30,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 52 states have internal predecessors, (64), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:01:30,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 85 transitions. [2022-04-28 14:01:30,640 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 85 transitions. Word has length 28 [2022-04-28 14:01:30,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:01:30,640 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 85 transitions. [2022-04-28 14:01:30,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (5), 2 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 14:01:30,640 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 85 transitions. [2022-04-28 14:01:32,741 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 84 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 14:01:32,741 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 85 transitions. [2022-04-28 14:01:32,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 14:01:32,741 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:01:32,742 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:01:32,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-28 14:01:32,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:01:32,942 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:01:32,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:01:32,943 INFO L85 PathProgramCache]: Analyzing trace with hash -293334773, now seen corresponding path program 1 times [2022-04-28 14:01:32,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:01:32,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [344791131] [2022-04-28 14:01:39,026 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:01:39,026 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:01:39,026 INFO L85 PathProgramCache]: Analyzing trace with hash -293334773, now seen corresponding path program 2 times [2022-04-28 14:01:39,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:01:39,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725853917] [2022-04-28 14:01:39,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:01:39,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:01:39,040 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:01:39,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2054677839] [2022-04-28 14:01:39,041 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:01:39,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:01:39,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:01:39,059 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:01:39,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-28 14:01:39,101 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:01:39,101 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:01:39,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-28 14:01:39,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:01:39,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:01:39,373 INFO L272 TraceCheckUtils]: 0: Hoare triple {3565#true} call ULTIMATE.init(); {3565#true} is VALID [2022-04-28 14:01:39,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {3565#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3565#true} is VALID [2022-04-28 14:01:39,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {3565#true} assume true; {3565#true} is VALID [2022-04-28 14:01:39,374 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3565#true} {3565#true} #77#return; {3565#true} is VALID [2022-04-28 14:01:39,374 INFO L272 TraceCheckUtils]: 4: Hoare triple {3565#true} call #t~ret7 := main(); {3565#true} is VALID [2022-04-28 14:01:39,374 INFO L290 TraceCheckUtils]: 5: Hoare triple {3565#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3565#true} is VALID [2022-04-28 14:01:39,374 INFO L272 TraceCheckUtils]: 6: Hoare triple {3565#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3565#true} is VALID [2022-04-28 14:01:39,374 INFO L290 TraceCheckUtils]: 7: Hoare triple {3565#true} ~cond := #in~cond; {3565#true} is VALID [2022-04-28 14:01:39,374 INFO L290 TraceCheckUtils]: 8: Hoare triple {3565#true} assume !(0 == ~cond); {3565#true} is VALID [2022-04-28 14:01:39,374 INFO L290 TraceCheckUtils]: 9: Hoare triple {3565#true} assume true; {3565#true} is VALID [2022-04-28 14:01:39,374 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3565#true} {3565#true} #69#return; {3565#true} is VALID [2022-04-28 14:01:39,376 INFO L290 TraceCheckUtils]: 11: Hoare triple {3565#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {3603#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:01:39,376 INFO L290 TraceCheckUtils]: 12: Hoare triple {3603#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3603#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:01:39,377 INFO L290 TraceCheckUtils]: 13: Hoare triple {3603#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post6 < 2);havoc #t~post6; {3603#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:01:39,377 INFO L272 TraceCheckUtils]: 14: Hoare triple {3603#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {3565#true} is VALID [2022-04-28 14:01:39,377 INFO L290 TraceCheckUtils]: 15: Hoare triple {3565#true} ~cond := #in~cond; {3616#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:01:39,377 INFO L290 TraceCheckUtils]: 16: Hoare triple {3616#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3620#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:01:39,378 INFO L290 TraceCheckUtils]: 17: Hoare triple {3620#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3620#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:01:39,379 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3620#(not (= |__VERIFIER_assert_#in~cond| 0))} {3603#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #71#return; {3603#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:01:39,379 INFO L290 TraceCheckUtils]: 19: Hoare triple {3603#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~a~0 && 0 != ~b~0); {3603#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:01:39,380 INFO L290 TraceCheckUtils]: 20: Hoare triple {3603#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {3603#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:01:39,380 INFO L290 TraceCheckUtils]: 21: Hoare triple {3603#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {3603#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:01:39,381 INFO L290 TraceCheckUtils]: 22: Hoare triple {3603#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~b~0 := ~b~0 - 1;~q~0 := ~q~0 + ~a~0 * ~p~0; {3639#(and (= main_~b~0 (+ (- 1) main_~y~0)) (= (mod main_~a~0 2) 0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 (* (- 1) main_~a~0 main_~p~0)) 0) (= main_~p~0 1))} is VALID [2022-04-28 14:01:39,381 INFO L290 TraceCheckUtils]: 23: Hoare triple {3639#(and (= main_~b~0 (+ (- 1) main_~y~0)) (= (mod main_~a~0 2) 0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 (* (- 1) main_~a~0 main_~p~0)) 0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3639#(and (= main_~b~0 (+ (- 1) main_~y~0)) (= (mod main_~a~0 2) 0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 (* (- 1) main_~a~0 main_~p~0)) 0) (= main_~p~0 1))} is VALID [2022-04-28 14:01:39,382 INFO L290 TraceCheckUtils]: 24: Hoare triple {3639#(and (= main_~b~0 (+ (- 1) main_~y~0)) (= (mod main_~a~0 2) 0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 (* (- 1) main_~a~0 main_~p~0)) 0) (= main_~p~0 1))} assume !!(#t~post6 < 2);havoc #t~post6; {3639#(and (= main_~b~0 (+ (- 1) main_~y~0)) (= (mod main_~a~0 2) 0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 (* (- 1) main_~a~0 main_~p~0)) 0) (= main_~p~0 1))} is VALID [2022-04-28 14:01:39,384 INFO L272 TraceCheckUtils]: 25: Hoare triple {3639#(and (= main_~b~0 (+ (- 1) main_~y~0)) (= (mod main_~a~0 2) 0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 (* (- 1) main_~a~0 main_~p~0)) 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {3649#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:01:39,384 INFO L290 TraceCheckUtils]: 26: Hoare triple {3649#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3653#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:01:39,384 INFO L290 TraceCheckUtils]: 27: Hoare triple {3653#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3566#false} is VALID [2022-04-28 14:01:39,384 INFO L290 TraceCheckUtils]: 28: Hoare triple {3566#false} assume !false; {3566#false} is VALID [2022-04-28 14:01:39,385 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:01:39,385 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:01:50,623 INFO L290 TraceCheckUtils]: 28: Hoare triple {3566#false} assume !false; {3566#false} is VALID [2022-04-28 14:01:50,624 INFO L290 TraceCheckUtils]: 27: Hoare triple {3653#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3566#false} is VALID [2022-04-28 14:01:50,624 INFO L290 TraceCheckUtils]: 26: Hoare triple {3649#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3653#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:01:50,625 INFO L272 TraceCheckUtils]: 25: Hoare triple {3669#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {3649#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:01:50,625 INFO L290 TraceCheckUtils]: 24: Hoare triple {3669#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !!(#t~post6 < 2);havoc #t~post6; {3669#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:01:50,626 INFO L290 TraceCheckUtils]: 23: Hoare triple {3669#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3669#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:01:50,632 INFO L290 TraceCheckUtils]: 22: Hoare triple {3679#(or (not (= (mod main_~a~0 2) 0)) (= (* main_~y~0 main_~x~0) (+ (* main_~a~0 main_~p~0) main_~q~0 (* main_~a~0 main_~p~0 (+ (- 1) main_~b~0)))))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~b~0 := ~b~0 - 1;~q~0 := ~q~0 + ~a~0 * ~p~0; {3669#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:01:50,632 INFO L290 TraceCheckUtils]: 21: Hoare triple {3679#(or (not (= (mod main_~a~0 2) 0)) (= (* main_~y~0 main_~x~0) (+ (* main_~a~0 main_~p~0) main_~q~0 (* main_~a~0 main_~p~0 (+ (- 1) main_~b~0)))))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {3679#(or (not (= (mod main_~a~0 2) 0)) (= (* main_~y~0 main_~x~0) (+ (* main_~a~0 main_~p~0) main_~q~0 (* main_~a~0 main_~p~0 (+ (- 1) main_~b~0)))))} is VALID [2022-04-28 14:01:50,633 INFO L290 TraceCheckUtils]: 20: Hoare triple {3679#(or (not (= (mod main_~a~0 2) 0)) (= (* main_~y~0 main_~x~0) (+ (* main_~a~0 main_~p~0) main_~q~0 (* main_~a~0 main_~p~0 (+ (- 1) main_~b~0)))))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {3679#(or (not (= (mod main_~a~0 2) 0)) (= (* main_~y~0 main_~x~0) (+ (* main_~a~0 main_~p~0) main_~q~0 (* main_~a~0 main_~p~0 (+ (- 1) main_~b~0)))))} is VALID [2022-04-28 14:01:50,633 INFO L290 TraceCheckUtils]: 19: Hoare triple {3679#(or (not (= (mod main_~a~0 2) 0)) (= (* main_~y~0 main_~x~0) (+ (* main_~a~0 main_~p~0) main_~q~0 (* main_~a~0 main_~p~0 (+ (- 1) main_~b~0)))))} assume !!(0 != ~a~0 && 0 != ~b~0); {3679#(or (not (= (mod main_~a~0 2) 0)) (= (* main_~y~0 main_~x~0) (+ (* main_~a~0 main_~p~0) main_~q~0 (* main_~a~0 main_~p~0 (+ (- 1) main_~b~0)))))} is VALID [2022-04-28 14:01:50,634 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3620#(not (= |__VERIFIER_assert_#in~cond| 0))} {3565#true} #71#return; {3679#(or (not (= (mod main_~a~0 2) 0)) (= (* main_~y~0 main_~x~0) (+ (* main_~a~0 main_~p~0) main_~q~0 (* main_~a~0 main_~p~0 (+ (- 1) main_~b~0)))))} is VALID [2022-04-28 14:01:50,634 INFO L290 TraceCheckUtils]: 17: Hoare triple {3620#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3620#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:01:50,635 INFO L290 TraceCheckUtils]: 16: Hoare triple {3701#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3620#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:01:50,635 INFO L290 TraceCheckUtils]: 15: Hoare triple {3565#true} ~cond := #in~cond; {3701#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 14:01:50,635 INFO L272 TraceCheckUtils]: 14: Hoare triple {3565#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {3565#true} is VALID [2022-04-28 14:01:50,635 INFO L290 TraceCheckUtils]: 13: Hoare triple {3565#true} assume !!(#t~post6 < 2);havoc #t~post6; {3565#true} is VALID [2022-04-28 14:01:50,635 INFO L290 TraceCheckUtils]: 12: Hoare triple {3565#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3565#true} is VALID [2022-04-28 14:01:50,636 INFO L290 TraceCheckUtils]: 11: Hoare triple {3565#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {3565#true} is VALID [2022-04-28 14:01:50,636 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3565#true} {3565#true} #69#return; {3565#true} is VALID [2022-04-28 14:01:50,636 INFO L290 TraceCheckUtils]: 9: Hoare triple {3565#true} assume true; {3565#true} is VALID [2022-04-28 14:01:50,636 INFO L290 TraceCheckUtils]: 8: Hoare triple {3565#true} assume !(0 == ~cond); {3565#true} is VALID [2022-04-28 14:01:50,636 INFO L290 TraceCheckUtils]: 7: Hoare triple {3565#true} ~cond := #in~cond; {3565#true} is VALID [2022-04-28 14:01:50,636 INFO L272 TraceCheckUtils]: 6: Hoare triple {3565#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3565#true} is VALID [2022-04-28 14:01:50,636 INFO L290 TraceCheckUtils]: 5: Hoare triple {3565#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3565#true} is VALID [2022-04-28 14:01:50,636 INFO L272 TraceCheckUtils]: 4: Hoare triple {3565#true} call #t~ret7 := main(); {3565#true} is VALID [2022-04-28 14:01:50,636 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3565#true} {3565#true} #77#return; {3565#true} is VALID [2022-04-28 14:01:50,636 INFO L290 TraceCheckUtils]: 2: Hoare triple {3565#true} assume true; {3565#true} is VALID [2022-04-28 14:01:50,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {3565#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3565#true} is VALID [2022-04-28 14:01:50,637 INFO L272 TraceCheckUtils]: 0: Hoare triple {3565#true} call ULTIMATE.init(); {3565#true} is VALID [2022-04-28 14:01:50,637 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:01:50,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:01:50,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725853917] [2022-04-28 14:01:50,637 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:01:50,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054677839] [2022-04-28 14:01:50,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2054677839] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:01:50,638 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:01:50,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2022-04-28 14:01:50,638 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:01:50,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [344791131] [2022-04-28 14:01:50,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [344791131] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:01:50,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:01:50,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 14:01:50,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827306158] [2022-04-28 14:01:50,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:01:50,639 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (5), 2 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 29 [2022-04-28 14:01:50,639 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:01:50,639 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (5), 2 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 14:01:50,664 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 14:01:50,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 14:01:50,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:01:50,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 14:01:50,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-28 14:01:50,665 INFO L87 Difference]: Start difference. First operand 67 states and 85 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (5), 2 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 14:01:51,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:01:51,538 INFO L93 Difference]: Finished difference Result 95 states and 125 transitions. [2022-04-28 14:01:51,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 14:01:51,538 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (5), 2 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 29 [2022-04-28 14:01:51,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:01:51,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (5), 2 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 14:01:51,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 84 transitions. [2022-04-28 14:01:51,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (5), 2 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 14:01:51,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 84 transitions. [2022-04-28 14:01:51,548 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 84 transitions. [2022-04-28 14:01:51,614 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:01:51,617 INFO L225 Difference]: With dead ends: 95 [2022-04-28 14:01:51,617 INFO L226 Difference]: Without dead ends: 80 [2022-04-28 14:01:51,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-28 14:01:51,619 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 16 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 14:01:51,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 116 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 14:01:51,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-04-28 14:01:51,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2022-04-28 14:01:51,702 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:01:51,702 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand has 77 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 60 states have internal predecessors, (74), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:01:51,702 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand has 77 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 60 states have internal predecessors, (74), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:01:51,703 INFO L87 Difference]: Start difference. First operand 80 states. Second operand has 77 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 60 states have internal predecessors, (74), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:01:51,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:01:51,706 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2022-04-28 14:01:51,706 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 102 transitions. [2022-04-28 14:01:51,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:01:51,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:01:51,706 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 60 states have internal predecessors, (74), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) Second operand 80 states. [2022-04-28 14:01:51,707 INFO L87 Difference]: Start difference. First operand has 77 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 60 states have internal predecessors, (74), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) Second operand 80 states. [2022-04-28 14:01:51,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:01:51,719 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2022-04-28 14:01:51,719 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 102 transitions. [2022-04-28 14:01:51,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:01:51,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:01:51,720 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:01:51,720 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:01:51,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 60 states have internal predecessors, (74), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:01:51,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 97 transitions. [2022-04-28 14:01:51,722 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 97 transitions. Word has length 29 [2022-04-28 14:01:51,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:01:51,722 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 97 transitions. [2022-04-28 14:01:51,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (5), 2 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 14:01:51,722 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 77 states and 97 transitions. [2022-04-28 14:01:53,858 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 96 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 14:01:53,859 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 97 transitions. [2022-04-28 14:01:53,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 14:01:53,859 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:01:53,859 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:01:53,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-28 14:01:54,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-28 14:01:54,060 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:01:54,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:01:54,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1481672589, now seen corresponding path program 1 times [2022-04-28 14:01:54,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:01:54,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [896542349] [2022-04-28 14:02:00,110 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:02:00,110 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:02:00,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1481672589, now seen corresponding path program 2 times [2022-04-28 14:02:00,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:02:00,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771920730] [2022-04-28 14:02:00,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:02:00,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:02:00,123 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:02:00,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [533208349] [2022-04-28 14:02:00,124 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:02:00,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:02:00,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:02:00,125 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:02:00,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-28 14:02:00,163 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:02:00,163 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:02:00,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 14:02:00,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:02:00,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:02:00,423 INFO L272 TraceCheckUtils]: 0: Hoare triple {4257#true} call ULTIMATE.init(); {4257#true} is VALID [2022-04-28 14:02:00,423 INFO L290 TraceCheckUtils]: 1: Hoare triple {4257#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4257#true} is VALID [2022-04-28 14:02:00,423 INFO L290 TraceCheckUtils]: 2: Hoare triple {4257#true} assume true; {4257#true} is VALID [2022-04-28 14:02:00,423 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4257#true} {4257#true} #77#return; {4257#true} is VALID [2022-04-28 14:02:00,423 INFO L272 TraceCheckUtils]: 4: Hoare triple {4257#true} call #t~ret7 := main(); {4257#true} is VALID [2022-04-28 14:02:00,423 INFO L290 TraceCheckUtils]: 5: Hoare triple {4257#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4257#true} is VALID [2022-04-28 14:02:00,424 INFO L272 TraceCheckUtils]: 6: Hoare triple {4257#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4257#true} is VALID [2022-04-28 14:02:00,424 INFO L290 TraceCheckUtils]: 7: Hoare triple {4257#true} ~cond := #in~cond; {4257#true} is VALID [2022-04-28 14:02:00,424 INFO L290 TraceCheckUtils]: 8: Hoare triple {4257#true} assume !(0 == ~cond); {4257#true} is VALID [2022-04-28 14:02:00,424 INFO L290 TraceCheckUtils]: 9: Hoare triple {4257#true} assume true; {4257#true} is VALID [2022-04-28 14:02:00,424 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4257#true} {4257#true} #69#return; {4257#true} is VALID [2022-04-28 14:02:00,425 INFO L290 TraceCheckUtils]: 11: Hoare triple {4257#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {4295#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:02:00,426 INFO L290 TraceCheckUtils]: 12: Hoare triple {4295#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4295#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:02:00,426 INFO L290 TraceCheckUtils]: 13: Hoare triple {4295#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post6 < 2);havoc #t~post6; {4295#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:02:00,427 INFO L272 TraceCheckUtils]: 14: Hoare triple {4295#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {4257#true} is VALID [2022-04-28 14:02:00,427 INFO L290 TraceCheckUtils]: 15: Hoare triple {4257#true} ~cond := #in~cond; {4257#true} is VALID [2022-04-28 14:02:00,427 INFO L290 TraceCheckUtils]: 16: Hoare triple {4257#true} assume !(0 == ~cond); {4257#true} is VALID [2022-04-28 14:02:00,427 INFO L290 TraceCheckUtils]: 17: Hoare triple {4257#true} assume true; {4257#true} is VALID [2022-04-28 14:02:00,430 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4257#true} {4295#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #71#return; {4295#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:02:00,431 INFO L290 TraceCheckUtils]: 19: Hoare triple {4295#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~a~0 && 0 != ~b~0); {4295#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:02:00,431 INFO L290 TraceCheckUtils]: 20: Hoare triple {4295#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {4295#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:02:00,451 INFO L290 TraceCheckUtils]: 21: Hoare triple {4295#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {4295#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:02:00,452 INFO L290 TraceCheckUtils]: 22: Hoare triple {4295#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {4329#(and (= main_~b~0 (+ (- 1) main_~y~0)) (= (+ main_~q~0 (* (- 1) main_~a~0 main_~p~0) (* (- 1) main_~b~0 main_~p~0) (* (- 1) main_~p~0)) 0) (= (+ (- 1) main_~x~0) main_~a~0) (= main_~p~0 1))} is VALID [2022-04-28 14:02:00,453 INFO L290 TraceCheckUtils]: 23: Hoare triple {4329#(and (= main_~b~0 (+ (- 1) main_~y~0)) (= (+ main_~q~0 (* (- 1) main_~a~0 main_~p~0) (* (- 1) main_~b~0 main_~p~0) (* (- 1) main_~p~0)) 0) (= (+ (- 1) main_~x~0) main_~a~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4329#(and (= main_~b~0 (+ (- 1) main_~y~0)) (= (+ main_~q~0 (* (- 1) main_~a~0 main_~p~0) (* (- 1) main_~b~0 main_~p~0) (* (- 1) main_~p~0)) 0) (= (+ (- 1) main_~x~0) main_~a~0) (= main_~p~0 1))} is VALID [2022-04-28 14:02:00,454 INFO L290 TraceCheckUtils]: 24: Hoare triple {4329#(and (= main_~b~0 (+ (- 1) main_~y~0)) (= (+ main_~q~0 (* (- 1) main_~a~0 main_~p~0) (* (- 1) main_~b~0 main_~p~0) (* (- 1) main_~p~0)) 0) (= (+ (- 1) main_~x~0) main_~a~0) (= main_~p~0 1))} assume !!(#t~post6 < 2);havoc #t~post6; {4329#(and (= main_~b~0 (+ (- 1) main_~y~0)) (= (+ main_~q~0 (* (- 1) main_~a~0 main_~p~0) (* (- 1) main_~b~0 main_~p~0) (* (- 1) main_~p~0)) 0) (= (+ (- 1) main_~x~0) main_~a~0) (= main_~p~0 1))} is VALID [2022-04-28 14:02:00,457 INFO L272 TraceCheckUtils]: 25: Hoare triple {4329#(and (= main_~b~0 (+ (- 1) main_~y~0)) (= (+ main_~q~0 (* (- 1) main_~a~0 main_~p~0) (* (- 1) main_~b~0 main_~p~0) (* (- 1) main_~p~0)) 0) (= (+ (- 1) main_~x~0) main_~a~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {4339#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:02:00,457 INFO L290 TraceCheckUtils]: 26: Hoare triple {4339#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4343#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:02:00,458 INFO L290 TraceCheckUtils]: 27: Hoare triple {4343#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4258#false} is VALID [2022-04-28 14:02:00,458 INFO L290 TraceCheckUtils]: 28: Hoare triple {4258#false} assume !false; {4258#false} is VALID [2022-04-28 14:02:00,458 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:02:00,458 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:02:00,581 INFO L290 TraceCheckUtils]: 28: Hoare triple {4258#false} assume !false; {4258#false} is VALID [2022-04-28 14:02:00,581 INFO L290 TraceCheckUtils]: 27: Hoare triple {4343#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4258#false} is VALID [2022-04-28 14:02:00,581 INFO L290 TraceCheckUtils]: 26: Hoare triple {4339#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4343#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:02:00,582 INFO L272 TraceCheckUtils]: 25: Hoare triple {4359#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {4339#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:02:00,582 INFO L290 TraceCheckUtils]: 24: Hoare triple {4359#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !!(#t~post6 < 2);havoc #t~post6; {4359#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:02:00,583 INFO L290 TraceCheckUtils]: 23: Hoare triple {4359#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4359#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:02:00,586 INFO L290 TraceCheckUtils]: 22: Hoare triple {4359#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {4359#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:02:00,587 INFO L290 TraceCheckUtils]: 21: Hoare triple {4359#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {4359#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:02:00,587 INFO L290 TraceCheckUtils]: 20: Hoare triple {4359#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {4359#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:02:00,587 INFO L290 TraceCheckUtils]: 19: Hoare triple {4359#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !!(0 != ~a~0 && 0 != ~b~0); {4359#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:02:00,588 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4257#true} {4359#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} #71#return; {4359#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:02:00,588 INFO L290 TraceCheckUtils]: 17: Hoare triple {4257#true} assume true; {4257#true} is VALID [2022-04-28 14:02:00,588 INFO L290 TraceCheckUtils]: 16: Hoare triple {4257#true} assume !(0 == ~cond); {4257#true} is VALID [2022-04-28 14:02:00,588 INFO L290 TraceCheckUtils]: 15: Hoare triple {4257#true} ~cond := #in~cond; {4257#true} is VALID [2022-04-28 14:02:00,588 INFO L272 TraceCheckUtils]: 14: Hoare triple {4359#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {4257#true} is VALID [2022-04-28 14:02:00,591 INFO L290 TraceCheckUtils]: 13: Hoare triple {4359#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !!(#t~post6 < 2);havoc #t~post6; {4359#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:02:00,591 INFO L290 TraceCheckUtils]: 12: Hoare triple {4359#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4359#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:02:00,592 INFO L290 TraceCheckUtils]: 11: Hoare triple {4257#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {4359#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:02:00,592 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4257#true} {4257#true} #69#return; {4257#true} is VALID [2022-04-28 14:02:00,592 INFO L290 TraceCheckUtils]: 9: Hoare triple {4257#true} assume true; {4257#true} is VALID [2022-04-28 14:02:00,615 INFO L290 TraceCheckUtils]: 8: Hoare triple {4257#true} assume !(0 == ~cond); {4257#true} is VALID [2022-04-28 14:02:00,615 INFO L290 TraceCheckUtils]: 7: Hoare triple {4257#true} ~cond := #in~cond; {4257#true} is VALID [2022-04-28 14:02:00,615 INFO L272 TraceCheckUtils]: 6: Hoare triple {4257#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4257#true} is VALID [2022-04-28 14:02:00,615 INFO L290 TraceCheckUtils]: 5: Hoare triple {4257#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4257#true} is VALID [2022-04-28 14:02:00,616 INFO L272 TraceCheckUtils]: 4: Hoare triple {4257#true} call #t~ret7 := main(); {4257#true} is VALID [2022-04-28 14:02:00,616 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4257#true} {4257#true} #77#return; {4257#true} is VALID [2022-04-28 14:02:00,616 INFO L290 TraceCheckUtils]: 2: Hoare triple {4257#true} assume true; {4257#true} is VALID [2022-04-28 14:02:00,616 INFO L290 TraceCheckUtils]: 1: Hoare triple {4257#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4257#true} is VALID [2022-04-28 14:02:00,616 INFO L272 TraceCheckUtils]: 0: Hoare triple {4257#true} call ULTIMATE.init(); {4257#true} is VALID [2022-04-28 14:02:00,616 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 14:02:00,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:02:00,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771920730] [2022-04-28 14:02:00,617 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:02:00,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533208349] [2022-04-28 14:02:00,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533208349] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 14:02:00,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:02:00,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-28 14:02:00,617 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:02:00,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [896542349] [2022-04-28 14:02:00,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [896542349] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:02:00,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:02:00,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:02:00,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560878009] [2022-04-28 14:02:00,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:02:00,618 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-04-28 14:02:00,618 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:02:00,618 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:02:00,637 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:02:00,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 14:02:00,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:02:00,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 14:02:00,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 14:02:00,638 INFO L87 Difference]: Start difference. First operand 77 states and 97 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:02:00,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:02:00,933 INFO L93 Difference]: Finished difference Result 83 states and 102 transitions. [2022-04-28 14:02:00,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 14:02:00,933 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-04-28 14:02:00,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:02:00,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:02:00,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-04-28 14:02:00,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:02:00,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-04-28 14:02:00,934 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 38 transitions. [2022-04-28 14:02:01,003 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 14:02:01,004 INFO L225 Difference]: With dead ends: 83 [2022-04-28 14:02:01,004 INFO L226 Difference]: Without dead ends: 81 [2022-04-28 14:02:01,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-28 14:02:01,005 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 7 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:02:01,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 72 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:02:01,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-28 14:02:01,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2022-04-28 14:02:01,105 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:02:01,106 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 81 states, 59 states have (on average 1.305084745762712) internal successors, (77), 63 states have internal predecessors, (77), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:02:01,106 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 81 states, 59 states have (on average 1.305084745762712) internal successors, (77), 63 states have internal predecessors, (77), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:02:01,106 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 81 states, 59 states have (on average 1.305084745762712) internal successors, (77), 63 states have internal predecessors, (77), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:02:01,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:02:01,107 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2022-04-28 14:02:01,107 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2022-04-28 14:02:01,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:02:01,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:02:01,108 INFO L74 IsIncluded]: Start isIncluded. First operand has 81 states, 59 states have (on average 1.305084745762712) internal successors, (77), 63 states have internal predecessors, (77), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) Second operand 81 states. [2022-04-28 14:02:01,109 INFO L87 Difference]: Start difference. First operand has 81 states, 59 states have (on average 1.305084745762712) internal successors, (77), 63 states have internal predecessors, (77), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) Second operand 81 states. [2022-04-28 14:02:01,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:02:01,110 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2022-04-28 14:02:01,110 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2022-04-28 14:02:01,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:02:01,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:02:01,113 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:02:01,113 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:02:01,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 59 states have (on average 1.305084745762712) internal successors, (77), 63 states have internal predecessors, (77), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:02:01,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 100 transitions. [2022-04-28 14:02:01,114 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 100 transitions. Word has length 29 [2022-04-28 14:02:01,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:02:01,115 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 100 transitions. [2022-04-28 14:02:01,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:02:01,115 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 81 states and 100 transitions. [2022-04-28 14:02:03,423 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 99 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 14:02:03,423 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2022-04-28 14:02:03,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 14:02:03,424 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:02:03,424 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:02:03,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-04-28 14:02:03,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-28 14:02:03,639 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:02:03,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:02:03,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1680888588, now seen corresponding path program 1 times [2022-04-28 14:02:03,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:02:03,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1035815303] [2022-04-28 14:02:09,697 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:02:09,698 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:02:09,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1680888588, now seen corresponding path program 2 times [2022-04-28 14:02:09,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:02:09,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208212863] [2022-04-28 14:02:09,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:02:09,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:02:09,707 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:02:09,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [647811752] [2022-04-28 14:02:09,707 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:02:09,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:02:09,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:02:09,708 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:02:09,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-28 14:02:09,765 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:02:09,765 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:02:09,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 14:02:09,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:02:09,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:02:10,092 INFO L272 TraceCheckUtils]: 0: Hoare triple {4929#true} call ULTIMATE.init(); {4929#true} is VALID [2022-04-28 14:02:10,092 INFO L290 TraceCheckUtils]: 1: Hoare triple {4929#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4929#true} is VALID [2022-04-28 14:02:10,092 INFO L290 TraceCheckUtils]: 2: Hoare triple {4929#true} assume true; {4929#true} is VALID [2022-04-28 14:02:10,092 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4929#true} {4929#true} #77#return; {4929#true} is VALID [2022-04-28 14:02:10,092 INFO L272 TraceCheckUtils]: 4: Hoare triple {4929#true} call #t~ret7 := main(); {4929#true} is VALID [2022-04-28 14:02:10,093 INFO L290 TraceCheckUtils]: 5: Hoare triple {4929#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4929#true} is VALID [2022-04-28 14:02:10,093 INFO L272 TraceCheckUtils]: 6: Hoare triple {4929#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4929#true} is VALID [2022-04-28 14:02:10,093 INFO L290 TraceCheckUtils]: 7: Hoare triple {4929#true} ~cond := #in~cond; {4955#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 14:02:10,093 INFO L290 TraceCheckUtils]: 8: Hoare triple {4955#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {4959#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:02:10,094 INFO L290 TraceCheckUtils]: 9: Hoare triple {4959#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {4959#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:02:10,094 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4959#(not (= |assume_abort_if_not_#in~cond| 0))} {4929#true} #69#return; {4966#(<= 1 main_~y~0)} is VALID [2022-04-28 14:02:10,094 INFO L290 TraceCheckUtils]: 11: Hoare triple {4966#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {4970#(<= 1 main_~b~0)} is VALID [2022-04-28 14:02:10,095 INFO L290 TraceCheckUtils]: 12: Hoare triple {4970#(<= 1 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4970#(<= 1 main_~b~0)} is VALID [2022-04-28 14:02:10,095 INFO L290 TraceCheckUtils]: 13: Hoare triple {4970#(<= 1 main_~b~0)} assume !!(#t~post6 < 2);havoc #t~post6; {4970#(<= 1 main_~b~0)} is VALID [2022-04-28 14:02:10,095 INFO L272 TraceCheckUtils]: 14: Hoare triple {4970#(<= 1 main_~b~0)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {4929#true} is VALID [2022-04-28 14:02:10,095 INFO L290 TraceCheckUtils]: 15: Hoare triple {4929#true} ~cond := #in~cond; {4929#true} is VALID [2022-04-28 14:02:10,095 INFO L290 TraceCheckUtils]: 16: Hoare triple {4929#true} assume !(0 == ~cond); {4929#true} is VALID [2022-04-28 14:02:10,095 INFO L290 TraceCheckUtils]: 17: Hoare triple {4929#true} assume true; {4929#true} is VALID [2022-04-28 14:02:10,096 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4929#true} {4970#(<= 1 main_~b~0)} #71#return; {4970#(<= 1 main_~b~0)} is VALID [2022-04-28 14:02:10,096 INFO L290 TraceCheckUtils]: 19: Hoare triple {4970#(<= 1 main_~b~0)} assume !!(0 != ~a~0 && 0 != ~b~0); {4995#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} is VALID [2022-04-28 14:02:10,097 INFO L290 TraceCheckUtils]: 20: Hoare triple {4995#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {4995#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} is VALID [2022-04-28 14:02:10,098 INFO L290 TraceCheckUtils]: 21: Hoare triple {4995#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4995#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} is VALID [2022-04-28 14:02:10,098 INFO L290 TraceCheckUtils]: 22: Hoare triple {4995#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} assume !!(#t~post6 < 2);havoc #t~post6; {4995#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} is VALID [2022-04-28 14:02:10,098 INFO L272 TraceCheckUtils]: 23: Hoare triple {4995#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {4929#true} is VALID [2022-04-28 14:02:10,098 INFO L290 TraceCheckUtils]: 24: Hoare triple {4929#true} ~cond := #in~cond; {4929#true} is VALID [2022-04-28 14:02:10,098 INFO L290 TraceCheckUtils]: 25: Hoare triple {4929#true} assume !(0 == ~cond); {4929#true} is VALID [2022-04-28 14:02:10,099 INFO L290 TraceCheckUtils]: 26: Hoare triple {4929#true} assume true; {4929#true} is VALID [2022-04-28 14:02:10,099 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {4929#true} {4995#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} #71#return; {4995#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} is VALID [2022-04-28 14:02:10,100 INFO L290 TraceCheckUtils]: 28: Hoare triple {4995#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} assume !(0 != ~a~0 && 0 != ~b~0); {4930#false} is VALID [2022-04-28 14:02:10,100 INFO L272 TraceCheckUtils]: 29: Hoare triple {4930#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {4930#false} is VALID [2022-04-28 14:02:10,100 INFO L290 TraceCheckUtils]: 30: Hoare triple {4930#false} ~cond := #in~cond; {4930#false} is VALID [2022-04-28 14:02:10,100 INFO L290 TraceCheckUtils]: 31: Hoare triple {4930#false} assume 0 == ~cond; {4930#false} is VALID [2022-04-28 14:02:10,100 INFO L290 TraceCheckUtils]: 32: Hoare triple {4930#false} assume !false; {4930#false} is VALID [2022-04-28 14:02:10,100 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 14:02:10,100 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 14:02:10,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:02:10,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208212863] [2022-04-28 14:02:10,101 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:02:10,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647811752] [2022-04-28 14:02:10,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647811752] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:02:10,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:02:10,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 14:02:10,101 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:02:10,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1035815303] [2022-04-28 14:02:10,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1035815303] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:02:10,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:02:10,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 14:02:10,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734034184] [2022-04-28 14:02:10,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:02:10,102 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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 33 [2022-04-28 14:02:10,102 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:02:10,102 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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 14:02:10,122 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 14:02:10,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 14:02:10,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:02:10,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 14:02:10,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-28 14:02:10,123 INFO L87 Difference]: Start difference. First operand 81 states and 100 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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 14:02:10,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:02:10,433 INFO L93 Difference]: Finished difference Result 97 states and 121 transitions. [2022-04-28 14:02:10,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 14:02:10,434 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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 33 [2022-04-28 14:02:10,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:02:10,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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 14:02:10,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2022-04-28 14:02:10,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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 14:02:10,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2022-04-28 14:02:10,436 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 65 transitions. [2022-04-28 14:02:10,477 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:02:10,478 INFO L225 Difference]: With dead ends: 97 [2022-04-28 14:02:10,479 INFO L226 Difference]: Without dead ends: 90 [2022-04-28 14:02:10,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-04-28 14:02:10,479 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 30 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:02:10,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 115 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:02:10,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-04-28 14:02:10,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 85. [2022-04-28 14:02:10,553 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:02:10,554 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand has 85 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 66 states have internal predecessors, (81), 14 states have call successors, (14), 9 states have call predecessors, (14), 8 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:02:10,554 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand has 85 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 66 states have internal predecessors, (81), 14 states have call successors, (14), 9 states have call predecessors, (14), 8 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:02:10,554 INFO L87 Difference]: Start difference. First operand 90 states. Second operand has 85 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 66 states have internal predecessors, (81), 14 states have call successors, (14), 9 states have call predecessors, (14), 8 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:02:10,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:02:10,556 INFO L93 Difference]: Finished difference Result 90 states and 114 transitions. [2022-04-28 14:02:10,556 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 114 transitions. [2022-04-28 14:02:10,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:02:10,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:02:10,557 INFO L74 IsIncluded]: Start isIncluded. First operand has 85 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 66 states have internal predecessors, (81), 14 states have call successors, (14), 9 states have call predecessors, (14), 8 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) Second operand 90 states. [2022-04-28 14:02:10,557 INFO L87 Difference]: Start difference. First operand has 85 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 66 states have internal predecessors, (81), 14 states have call successors, (14), 9 states have call predecessors, (14), 8 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) Second operand 90 states. [2022-04-28 14:02:10,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:02:10,558 INFO L93 Difference]: Finished difference Result 90 states and 114 transitions. [2022-04-28 14:02:10,558 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 114 transitions. [2022-04-28 14:02:10,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:02:10,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:02:10,559 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:02:10,559 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:02:10,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 66 states have internal predecessors, (81), 14 states have call successors, (14), 9 states have call predecessors, (14), 8 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:02:10,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 106 transitions. [2022-04-28 14:02:10,560 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 106 transitions. Word has length 33 [2022-04-28 14:02:10,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:02:10,560 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 106 transitions. [2022-04-28 14:02:10,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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 14:02:10,561 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 85 states and 106 transitions. [2022-04-28 14:02:12,862 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 105 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 14:02:12,862 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 106 transitions. [2022-04-28 14:02:12,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 14:02:12,862 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:02:12,862 INFO L195 NwaCegarLoop]: trace histogram [3, 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 14:02:12,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-28 14:02:13,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-28 14:02:13,063 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:02:13,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:02:13,063 INFO L85 PathProgramCache]: Analyzing trace with hash 368374993, now seen corresponding path program 1 times [2022-04-28 14:02:13,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:02:13,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1057726800] [2022-04-28 14:02:19,114 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:02:19,114 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:02:19,114 INFO L85 PathProgramCache]: Analyzing trace with hash 368374993, now seen corresponding path program 2 times [2022-04-28 14:02:19,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:02:19,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834079206] [2022-04-28 14:02:19,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:02:19,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:02:19,125 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:02:19,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [951014662] [2022-04-28 14:02:19,126 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:02:19,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:02:19,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:02:19,130 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:02:19,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-28 14:02:19,167 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:02:19,167 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:02:19,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 14:02:19,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:02:19,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:02:29,364 INFO L272 TraceCheckUtils]: 0: Hoare triple {5584#true} call ULTIMATE.init(); {5584#true} is VALID [2022-04-28 14:02:29,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {5584#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5584#true} is VALID [2022-04-28 14:02:29,365 INFO L290 TraceCheckUtils]: 2: Hoare triple {5584#true} assume true; {5584#true} is VALID [2022-04-28 14:02:29,365 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5584#true} {5584#true} #77#return; {5584#true} is VALID [2022-04-28 14:02:29,365 INFO L272 TraceCheckUtils]: 4: Hoare triple {5584#true} call #t~ret7 := main(); {5584#true} is VALID [2022-04-28 14:02:29,365 INFO L290 TraceCheckUtils]: 5: Hoare triple {5584#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {5584#true} is VALID [2022-04-28 14:02:29,365 INFO L272 TraceCheckUtils]: 6: Hoare triple {5584#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {5584#true} is VALID [2022-04-28 14:02:29,365 INFO L290 TraceCheckUtils]: 7: Hoare triple {5584#true} ~cond := #in~cond; {5584#true} is VALID [2022-04-28 14:02:29,365 INFO L290 TraceCheckUtils]: 8: Hoare triple {5584#true} assume !(0 == ~cond); {5584#true} is VALID [2022-04-28 14:02:29,366 INFO L290 TraceCheckUtils]: 9: Hoare triple {5584#true} assume true; {5584#true} is VALID [2022-04-28 14:02:29,366 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5584#true} {5584#true} #69#return; {5584#true} is VALID [2022-04-28 14:02:29,366 INFO L290 TraceCheckUtils]: 11: Hoare triple {5584#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {5584#true} is VALID [2022-04-28 14:02:29,366 INFO L290 TraceCheckUtils]: 12: Hoare triple {5584#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5584#true} is VALID [2022-04-28 14:02:29,366 INFO L290 TraceCheckUtils]: 13: Hoare triple {5584#true} assume !!(#t~post6 < 2);havoc #t~post6; {5584#true} is VALID [2022-04-28 14:02:29,366 INFO L272 TraceCheckUtils]: 14: Hoare triple {5584#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {5584#true} is VALID [2022-04-28 14:02:29,366 INFO L290 TraceCheckUtils]: 15: Hoare triple {5584#true} ~cond := #in~cond; {5584#true} is VALID [2022-04-28 14:02:29,366 INFO L290 TraceCheckUtils]: 16: Hoare triple {5584#true} assume !(0 == ~cond); {5584#true} is VALID [2022-04-28 14:02:29,366 INFO L290 TraceCheckUtils]: 17: Hoare triple {5584#true} assume true; {5584#true} is VALID [2022-04-28 14:02:29,366 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5584#true} {5584#true} #71#return; {5584#true} is VALID [2022-04-28 14:02:29,368 INFO L290 TraceCheckUtils]: 19: Hoare triple {5584#true} assume !!(0 != ~a~0 && 0 != ~b~0); {5646#(not (= main_~a~0 0))} is VALID [2022-04-28 14:02:29,368 INFO L290 TraceCheckUtils]: 20: Hoare triple {5646#(not (= main_~a~0 0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {5646#(not (= main_~a~0 0))} is VALID [2022-04-28 14:02:29,368 INFO L290 TraceCheckUtils]: 21: Hoare triple {5646#(not (= main_~a~0 0))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {5646#(not (= main_~a~0 0))} is VALID [2022-04-28 14:02:29,369 INFO L290 TraceCheckUtils]: 22: Hoare triple {5646#(not (= main_~a~0 0))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~b~0 := ~b~0 - 1;~q~0 := ~q~0 + ~a~0 * ~p~0; {5646#(not (= main_~a~0 0))} is VALID [2022-04-28 14:02:29,369 INFO L290 TraceCheckUtils]: 23: Hoare triple {5646#(not (= main_~a~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5646#(not (= main_~a~0 0))} is VALID [2022-04-28 14:02:29,369 INFO L290 TraceCheckUtils]: 24: Hoare triple {5646#(not (= main_~a~0 0))} assume !!(#t~post6 < 2);havoc #t~post6; {5646#(not (= main_~a~0 0))} is VALID [2022-04-28 14:02:29,369 INFO L272 TraceCheckUtils]: 25: Hoare triple {5646#(not (= main_~a~0 0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {5584#true} is VALID [2022-04-28 14:02:29,370 INFO L290 TraceCheckUtils]: 26: Hoare triple {5584#true} ~cond := #in~cond; {5668#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:02:29,370 INFO L290 TraceCheckUtils]: 27: Hoare triple {5668#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {5672#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:02:29,370 INFO L290 TraceCheckUtils]: 28: Hoare triple {5672#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {5672#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:02:31,373 WARN L284 TraceCheckUtils]: 29: Hoare quadruple {5672#(not (= |__VERIFIER_assert_#in~cond| 0))} {5646#(not (= main_~a~0 0))} #71#return; {5679#(and (or (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~b~0 0))) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0)) (not (= main_~a~0 0)))} is UNKNOWN [2022-04-28 14:02:31,373 INFO L290 TraceCheckUtils]: 30: Hoare triple {5679#(and (or (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~b~0 0))) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0)) (not (= main_~a~0 0)))} assume !(0 != ~a~0 && 0 != ~b~0); {5683#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:02:31,374 INFO L272 TraceCheckUtils]: 31: Hoare triple {5683#(= main_~q~0 (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {5687#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:02:31,374 INFO L290 TraceCheckUtils]: 32: Hoare triple {5687#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5691#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:02:31,375 INFO L290 TraceCheckUtils]: 33: Hoare triple {5691#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5585#false} is VALID [2022-04-28 14:02:31,375 INFO L290 TraceCheckUtils]: 34: Hoare triple {5585#false} assume !false; {5585#false} is VALID [2022-04-28 14:02:31,375 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 14:02:31,375 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:02:54,831 INFO L290 TraceCheckUtils]: 34: Hoare triple {5585#false} assume !false; {5585#false} is VALID [2022-04-28 14:02:54,831 INFO L290 TraceCheckUtils]: 33: Hoare triple {5691#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5585#false} is VALID [2022-04-28 14:02:54,832 INFO L290 TraceCheckUtils]: 32: Hoare triple {5687#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5691#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:02:54,832 INFO L272 TraceCheckUtils]: 31: Hoare triple {5683#(= main_~q~0 (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {5687#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:02:54,833 INFO L290 TraceCheckUtils]: 30: Hoare triple {5710#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} assume !(0 != ~a~0 && 0 != ~b~0); {5683#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:02:54,835 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {5672#(not (= |__VERIFIER_assert_#in~cond| 0))} {5584#true} #71#return; {5710#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} is VALID [2022-04-28 14:02:54,835 INFO L290 TraceCheckUtils]: 28: Hoare triple {5672#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {5672#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:02:54,835 INFO L290 TraceCheckUtils]: 27: Hoare triple {5723#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {5672#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:02:54,836 INFO L290 TraceCheckUtils]: 26: Hoare triple {5584#true} ~cond := #in~cond; {5723#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 14:02:54,836 INFO L272 TraceCheckUtils]: 25: Hoare triple {5584#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {5584#true} is VALID [2022-04-28 14:02:54,836 INFO L290 TraceCheckUtils]: 24: Hoare triple {5584#true} assume !!(#t~post6 < 2);havoc #t~post6; {5584#true} is VALID [2022-04-28 14:02:54,836 INFO L290 TraceCheckUtils]: 23: Hoare triple {5584#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5584#true} is VALID [2022-04-28 14:02:54,836 INFO L290 TraceCheckUtils]: 22: Hoare triple {5584#true} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~b~0 := ~b~0 - 1;~q~0 := ~q~0 + ~a~0 * ~p~0; {5584#true} is VALID [2022-04-28 14:02:54,836 INFO L290 TraceCheckUtils]: 21: Hoare triple {5584#true} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {5584#true} is VALID [2022-04-28 14:02:54,836 INFO L290 TraceCheckUtils]: 20: Hoare triple {5584#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {5584#true} is VALID [2022-04-28 14:02:54,836 INFO L290 TraceCheckUtils]: 19: Hoare triple {5584#true} assume !!(0 != ~a~0 && 0 != ~b~0); {5584#true} is VALID [2022-04-28 14:02:54,836 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5584#true} {5584#true} #71#return; {5584#true} is VALID [2022-04-28 14:02:54,836 INFO L290 TraceCheckUtils]: 17: Hoare triple {5584#true} assume true; {5584#true} is VALID [2022-04-28 14:02:54,837 INFO L290 TraceCheckUtils]: 16: Hoare triple {5584#true} assume !(0 == ~cond); {5584#true} is VALID [2022-04-28 14:02:54,837 INFO L290 TraceCheckUtils]: 15: Hoare triple {5584#true} ~cond := #in~cond; {5584#true} is VALID [2022-04-28 14:02:54,837 INFO L272 TraceCheckUtils]: 14: Hoare triple {5584#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {5584#true} is VALID [2022-04-28 14:02:54,837 INFO L290 TraceCheckUtils]: 13: Hoare triple {5584#true} assume !!(#t~post6 < 2);havoc #t~post6; {5584#true} is VALID [2022-04-28 14:02:54,837 INFO L290 TraceCheckUtils]: 12: Hoare triple {5584#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5584#true} is VALID [2022-04-28 14:02:54,837 INFO L290 TraceCheckUtils]: 11: Hoare triple {5584#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {5584#true} is VALID [2022-04-28 14:02:54,837 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5584#true} {5584#true} #69#return; {5584#true} is VALID [2022-04-28 14:02:54,837 INFO L290 TraceCheckUtils]: 9: Hoare triple {5584#true} assume true; {5584#true} is VALID [2022-04-28 14:02:54,837 INFO L290 TraceCheckUtils]: 8: Hoare triple {5584#true} assume !(0 == ~cond); {5584#true} is VALID [2022-04-28 14:02:54,837 INFO L290 TraceCheckUtils]: 7: Hoare triple {5584#true} ~cond := #in~cond; {5584#true} is VALID [2022-04-28 14:02:54,838 INFO L272 TraceCheckUtils]: 6: Hoare triple {5584#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {5584#true} is VALID [2022-04-28 14:02:54,838 INFO L290 TraceCheckUtils]: 5: Hoare triple {5584#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {5584#true} is VALID [2022-04-28 14:02:54,838 INFO L272 TraceCheckUtils]: 4: Hoare triple {5584#true} call #t~ret7 := main(); {5584#true} is VALID [2022-04-28 14:02:54,838 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5584#true} {5584#true} #77#return; {5584#true} is VALID [2022-04-28 14:02:54,838 INFO L290 TraceCheckUtils]: 2: Hoare triple {5584#true} assume true; {5584#true} is VALID [2022-04-28 14:02:54,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {5584#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5584#true} is VALID [2022-04-28 14:02:54,838 INFO L272 TraceCheckUtils]: 0: Hoare triple {5584#true} call ULTIMATE.init(); {5584#true} is VALID [2022-04-28 14:02:54,838 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 14:02:54,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:02:54,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834079206] [2022-04-28 14:02:54,839 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:02:54,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951014662] [2022-04-28 14:02:54,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951014662] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:02:54,842 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:02:54,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2022-04-28 14:02:54,843 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:02:54,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1057726800] [2022-04-28 14:02:54,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1057726800] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:02:54,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:02:54,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 14:02:54,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935558890] [2022-04-28 14:02:54,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:02:54,844 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2022-04-28 14:02:54,844 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:02:54,844 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 14:02:56,869 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 34 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 14:02:56,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 14:02:56,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:02:56,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 14:02:56,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-28 14:02:56,870 INFO L87 Difference]: Start difference. First operand 85 states and 106 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 14:02:59,779 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 14:03:02,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:03:02,538 INFO L93 Difference]: Finished difference Result 103 states and 133 transitions. [2022-04-28 14:03:02,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 14:03:02,538 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2022-04-28 14:03:02,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:03:02,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 14:03:02,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 56 transitions. [2022-04-28 14:03:02,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 14:03:02,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 56 transitions. [2022-04-28 14:03:02,540 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 56 transitions. [2022-04-28 14:03:04,584 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 55 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 14:03:04,585 INFO L225 Difference]: With dead ends: 103 [2022-04-28 14:03:04,586 INFO L226 Difference]: Without dead ends: 101 [2022-04-28 14:03:04,586 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-04-28 14:03:04,586 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 14 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-28 14:03:04,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 159 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 191 Invalid, 1 Unknown, 0 Unchecked, 2.6s Time] [2022-04-28 14:03:04,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-04-28 14:03:04,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 94. [2022-04-28 14:03:04,669 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:03:04,669 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand has 94 states, 68 states have (on average 1.3088235294117647) internal successors, (89), 73 states have internal predecessors, (89), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 14:03:04,669 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand has 94 states, 68 states have (on average 1.3088235294117647) internal successors, (89), 73 states have internal predecessors, (89), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 14:03:04,670 INFO L87 Difference]: Start difference. First operand 101 states. Second operand has 94 states, 68 states have (on average 1.3088235294117647) internal successors, (89), 73 states have internal predecessors, (89), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 14:03:04,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:03:04,671 INFO L93 Difference]: Finished difference Result 101 states and 131 transitions. [2022-04-28 14:03:04,671 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 131 transitions. [2022-04-28 14:03:04,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:03:04,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:03:04,672 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 68 states have (on average 1.3088235294117647) internal successors, (89), 73 states have internal predecessors, (89), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) Second operand 101 states. [2022-04-28 14:03:04,672 INFO L87 Difference]: Start difference. First operand has 94 states, 68 states have (on average 1.3088235294117647) internal successors, (89), 73 states have internal predecessors, (89), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) Second operand 101 states. [2022-04-28 14:03:04,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:03:04,674 INFO L93 Difference]: Finished difference Result 101 states and 131 transitions. [2022-04-28 14:03:04,674 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 131 transitions. [2022-04-28 14:03:04,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:03:04,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:03:04,674 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:03:04,674 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:03:04,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 68 states have (on average 1.3088235294117647) internal successors, (89), 73 states have internal predecessors, (89), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 14:03:04,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 118 transitions. [2022-04-28 14:03:04,676 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 118 transitions. Word has length 35 [2022-04-28 14:03:04,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:03:04,676 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 118 transitions. [2022-04-28 14:03:04,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 14:03:04,676 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 118 transitions. [2022-04-28 14:03:10,988 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 115 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 14:03:10,989 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 118 transitions. [2022-04-28 14:03:10,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 14:03:10,989 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:03:10,989 INFO L195 NwaCegarLoop]: trace histogram [3, 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 14:03:11,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-28 14:03:11,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-28 14:03:11,190 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:03:11,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:03:11,190 INFO L85 PathProgramCache]: Analyzing trace with hash -218431021, now seen corresponding path program 1 times [2022-04-28 14:03:11,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:03:11,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1434651275] [2022-04-28 14:03:17,014 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:03:17,014 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:03:17,014 INFO L85 PathProgramCache]: Analyzing trace with hash -218431021, now seen corresponding path program 2 times [2022-04-28 14:03:17,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:03:17,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545156299] [2022-04-28 14:03:17,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:03:17,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:03:17,025 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:03:17,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2139747397] [2022-04-28 14:03:17,026 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:03:17,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:03:17,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:03:17,027 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:03:17,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-28 14:03:17,064 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:03:17,064 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:03:17,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 14:03:17,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:03:17,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:03:27,239 INFO L272 TraceCheckUtils]: 0: Hoare triple {6406#true} call ULTIMATE.init(); {6406#true} is VALID [2022-04-28 14:03:27,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {6406#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6406#true} is VALID [2022-04-28 14:03:27,239 INFO L290 TraceCheckUtils]: 2: Hoare triple {6406#true} assume true; {6406#true} is VALID [2022-04-28 14:03:27,239 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6406#true} {6406#true} #77#return; {6406#true} is VALID [2022-04-28 14:03:27,239 INFO L272 TraceCheckUtils]: 4: Hoare triple {6406#true} call #t~ret7 := main(); {6406#true} is VALID [2022-04-28 14:03:27,239 INFO L290 TraceCheckUtils]: 5: Hoare triple {6406#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {6406#true} is VALID [2022-04-28 14:03:27,240 INFO L272 TraceCheckUtils]: 6: Hoare triple {6406#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {6406#true} is VALID [2022-04-28 14:03:27,240 INFO L290 TraceCheckUtils]: 7: Hoare triple {6406#true} ~cond := #in~cond; {6406#true} is VALID [2022-04-28 14:03:27,240 INFO L290 TraceCheckUtils]: 8: Hoare triple {6406#true} assume !(0 == ~cond); {6406#true} is VALID [2022-04-28 14:03:27,240 INFO L290 TraceCheckUtils]: 9: Hoare triple {6406#true} assume true; {6406#true} is VALID [2022-04-28 14:03:27,240 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6406#true} {6406#true} #69#return; {6406#true} is VALID [2022-04-28 14:03:27,240 INFO L290 TraceCheckUtils]: 11: Hoare triple {6406#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {6406#true} is VALID [2022-04-28 14:03:27,240 INFO L290 TraceCheckUtils]: 12: Hoare triple {6406#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6406#true} is VALID [2022-04-28 14:03:27,240 INFO L290 TraceCheckUtils]: 13: Hoare triple {6406#true} assume !!(#t~post6 < 2);havoc #t~post6; {6406#true} is VALID [2022-04-28 14:03:27,240 INFO L272 TraceCheckUtils]: 14: Hoare triple {6406#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {6406#true} is VALID [2022-04-28 14:03:27,240 INFO L290 TraceCheckUtils]: 15: Hoare triple {6406#true} ~cond := #in~cond; {6406#true} is VALID [2022-04-28 14:03:27,241 INFO L290 TraceCheckUtils]: 16: Hoare triple {6406#true} assume !(0 == ~cond); {6406#true} is VALID [2022-04-28 14:03:27,241 INFO L290 TraceCheckUtils]: 17: Hoare triple {6406#true} assume true; {6406#true} is VALID [2022-04-28 14:03:27,241 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {6406#true} {6406#true} #71#return; {6406#true} is VALID [2022-04-28 14:03:27,241 INFO L290 TraceCheckUtils]: 19: Hoare triple {6406#true} assume !!(0 != ~a~0 && 0 != ~b~0); {6406#true} is VALID [2022-04-28 14:03:27,241 INFO L290 TraceCheckUtils]: 20: Hoare triple {6406#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {6406#true} is VALID [2022-04-28 14:03:27,241 INFO L290 TraceCheckUtils]: 21: Hoare triple {6406#true} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {6406#true} is VALID [2022-04-28 14:03:27,241 INFO L290 TraceCheckUtils]: 22: Hoare triple {6406#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {6406#true} is VALID [2022-04-28 14:03:27,241 INFO L290 TraceCheckUtils]: 23: Hoare triple {6406#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6406#true} is VALID [2022-04-28 14:03:27,241 INFO L290 TraceCheckUtils]: 24: Hoare triple {6406#true} assume !!(#t~post6 < 2);havoc #t~post6; {6406#true} is VALID [2022-04-28 14:03:27,241 INFO L272 TraceCheckUtils]: 25: Hoare triple {6406#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {6406#true} is VALID [2022-04-28 14:03:27,242 INFO L290 TraceCheckUtils]: 26: Hoare triple {6406#true} ~cond := #in~cond; {6489#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:03:27,242 INFO L290 TraceCheckUtils]: 27: Hoare triple {6489#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {6493#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:03:27,242 INFO L290 TraceCheckUtils]: 28: Hoare triple {6493#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6493#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:03:29,245 WARN L284 TraceCheckUtils]: 29: Hoare quadruple {6493#(not (= |__VERIFIER_assert_#in~cond| 0))} {6406#true} #71#return; {6500#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~b~0 0)) (not (= main_~a~0 0))))} is UNKNOWN [2022-04-28 14:03:29,246 INFO L290 TraceCheckUtils]: 30: Hoare triple {6500#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~b~0 0)) (not (= main_~a~0 0))))} assume !(0 != ~a~0 && 0 != ~b~0); {6504#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:03:29,247 INFO L272 TraceCheckUtils]: 31: Hoare triple {6504#(= main_~q~0 (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {6508#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:03:29,247 INFO L290 TraceCheckUtils]: 32: Hoare triple {6508#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6512#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:03:29,247 INFO L290 TraceCheckUtils]: 33: Hoare triple {6512#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6407#false} is VALID [2022-04-28 14:03:29,247 INFO L290 TraceCheckUtils]: 34: Hoare triple {6407#false} assume !false; {6407#false} is VALID [2022-04-28 14:03:29,248 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 14:03:29,248 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:04:03,245 INFO L290 TraceCheckUtils]: 34: Hoare triple {6407#false} assume !false; {6407#false} is VALID [2022-04-28 14:04:03,245 INFO L290 TraceCheckUtils]: 33: Hoare triple {6512#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6407#false} is VALID [2022-04-28 14:04:03,246 INFO L290 TraceCheckUtils]: 32: Hoare triple {6508#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6512#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:04:03,246 INFO L272 TraceCheckUtils]: 31: Hoare triple {6504#(= main_~q~0 (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {6508#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:04:03,247 INFO L290 TraceCheckUtils]: 30: Hoare triple {6531#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} assume !(0 != ~a~0 && 0 != ~b~0); {6504#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:04:03,248 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {6493#(not (= |__VERIFIER_assert_#in~cond| 0))} {6406#true} #71#return; {6531#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} is VALID [2022-04-28 14:04:03,249 INFO L290 TraceCheckUtils]: 28: Hoare triple {6493#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6493#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:04:03,249 INFO L290 TraceCheckUtils]: 27: Hoare triple {6544#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {6493#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:04:03,249 INFO L290 TraceCheckUtils]: 26: Hoare triple {6406#true} ~cond := #in~cond; {6544#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 14:04:03,249 INFO L272 TraceCheckUtils]: 25: Hoare triple {6406#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {6406#true} is VALID [2022-04-28 14:04:03,249 INFO L290 TraceCheckUtils]: 24: Hoare triple {6406#true} assume !!(#t~post6 < 2);havoc #t~post6; {6406#true} is VALID [2022-04-28 14:04:03,250 INFO L290 TraceCheckUtils]: 23: Hoare triple {6406#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6406#true} is VALID [2022-04-28 14:04:03,250 INFO L290 TraceCheckUtils]: 22: Hoare triple {6406#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {6406#true} is VALID [2022-04-28 14:04:03,250 INFO L290 TraceCheckUtils]: 21: Hoare triple {6406#true} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {6406#true} is VALID [2022-04-28 14:04:03,250 INFO L290 TraceCheckUtils]: 20: Hoare triple {6406#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {6406#true} is VALID [2022-04-28 14:04:03,250 INFO L290 TraceCheckUtils]: 19: Hoare triple {6406#true} assume !!(0 != ~a~0 && 0 != ~b~0); {6406#true} is VALID [2022-04-28 14:04:03,250 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {6406#true} {6406#true} #71#return; {6406#true} is VALID [2022-04-28 14:04:03,250 INFO L290 TraceCheckUtils]: 17: Hoare triple {6406#true} assume true; {6406#true} is VALID [2022-04-28 14:04:03,250 INFO L290 TraceCheckUtils]: 16: Hoare triple {6406#true} assume !(0 == ~cond); {6406#true} is VALID [2022-04-28 14:04:03,250 INFO L290 TraceCheckUtils]: 15: Hoare triple {6406#true} ~cond := #in~cond; {6406#true} is VALID [2022-04-28 14:04:03,250 INFO L272 TraceCheckUtils]: 14: Hoare triple {6406#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {6406#true} is VALID [2022-04-28 14:04:03,250 INFO L290 TraceCheckUtils]: 13: Hoare triple {6406#true} assume !!(#t~post6 < 2);havoc #t~post6; {6406#true} is VALID [2022-04-28 14:04:03,251 INFO L290 TraceCheckUtils]: 12: Hoare triple {6406#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6406#true} is VALID [2022-04-28 14:04:03,251 INFO L290 TraceCheckUtils]: 11: Hoare triple {6406#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {6406#true} is VALID [2022-04-28 14:04:03,251 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6406#true} {6406#true} #69#return; {6406#true} is VALID [2022-04-28 14:04:03,251 INFO L290 TraceCheckUtils]: 9: Hoare triple {6406#true} assume true; {6406#true} is VALID [2022-04-28 14:04:03,251 INFO L290 TraceCheckUtils]: 8: Hoare triple {6406#true} assume !(0 == ~cond); {6406#true} is VALID [2022-04-28 14:04:03,251 INFO L290 TraceCheckUtils]: 7: Hoare triple {6406#true} ~cond := #in~cond; {6406#true} is VALID [2022-04-28 14:04:03,251 INFO L272 TraceCheckUtils]: 6: Hoare triple {6406#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {6406#true} is VALID [2022-04-28 14:04:03,251 INFO L290 TraceCheckUtils]: 5: Hoare triple {6406#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {6406#true} is VALID [2022-04-28 14:04:03,251 INFO L272 TraceCheckUtils]: 4: Hoare triple {6406#true} call #t~ret7 := main(); {6406#true} is VALID [2022-04-28 14:04:03,251 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6406#true} {6406#true} #77#return; {6406#true} is VALID [2022-04-28 14:04:03,252 INFO L290 TraceCheckUtils]: 2: Hoare triple {6406#true} assume true; {6406#true} is VALID [2022-04-28 14:04:03,252 INFO L290 TraceCheckUtils]: 1: Hoare triple {6406#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6406#true} is VALID [2022-04-28 14:04:03,252 INFO L272 TraceCheckUtils]: 0: Hoare triple {6406#true} call ULTIMATE.init(); {6406#true} is VALID [2022-04-28 14:04:03,252 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 14:04:03,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:04:03,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545156299] [2022-04-28 14:04:03,252 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:04:03,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139747397] [2022-04-28 14:04:03,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2139747397] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:04:03,253 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:04:03,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-28 14:04:03,253 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:04:03,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1434651275] [2022-04-28 14:04:03,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1434651275] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:04:03,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:04:03,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 14:04:03,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056796852] [2022-04-28 14:04:03,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:04:03,254 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 35 [2022-04-28 14:04:03,254 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:04:03,254 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 14:04:05,276 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 31 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 14:04:05,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 14:04:05,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:04:05,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 14:04:05,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-28 14:04:05,277 INFO L87 Difference]: Start difference. First operand 94 states and 118 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 14:04:07,575 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 14:04:10,511 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 14:04:10,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:04:10,651 INFO L93 Difference]: Finished difference Result 101 states and 125 transitions. [2022-04-28 14:04:10,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 14:04:10,651 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 35 [2022-04-28 14:04:10,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:04:10,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 14:04:10,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2022-04-28 14:04:10,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 14:04:10,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2022-04-28 14:04:10,653 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 44 transitions. [2022-04-28 14:04:12,689 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 43 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 14:04:12,691 INFO L225 Difference]: With dead ends: 101 [2022-04-28 14:04:12,691 INFO L226 Difference]: Without dead ends: 98 [2022-04-28 14:04:12,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-04-28 14:04:12,692 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 16 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-04-28 14:04:12,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 90 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 83 Invalid, 2 Unknown, 0 Unchecked, 4.6s Time] [2022-04-28 14:04:12,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-04-28 14:04:12,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 72. [2022-04-28 14:04:12,756 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:04:12,756 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand has 72 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 55 states have internal predecessors, (66), 11 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:04:12,757 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand has 72 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 55 states have internal predecessors, (66), 11 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:04:12,757 INFO L87 Difference]: Start difference. First operand 98 states. Second operand has 72 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 55 states have internal predecessors, (66), 11 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:04:12,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:04:12,758 INFO L93 Difference]: Finished difference Result 98 states and 121 transitions. [2022-04-28 14:04:12,758 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 121 transitions. [2022-04-28 14:04:12,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:04:12,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:04:12,759 INFO L74 IsIncluded]: Start isIncluded. First operand has 72 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 55 states have internal predecessors, (66), 11 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) Second operand 98 states. [2022-04-28 14:04:12,759 INFO L87 Difference]: Start difference. First operand has 72 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 55 states have internal predecessors, (66), 11 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) Second operand 98 states. [2022-04-28 14:04:12,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:04:12,760 INFO L93 Difference]: Finished difference Result 98 states and 121 transitions. [2022-04-28 14:04:12,761 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 121 transitions. [2022-04-28 14:04:12,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:04:12,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:04:12,761 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:04:12,761 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:04:12,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 55 states have internal predecessors, (66), 11 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:04:12,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 86 transitions. [2022-04-28 14:04:12,762 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 86 transitions. Word has length 35 [2022-04-28 14:04:12,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:04:12,762 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 86 transitions. [2022-04-28 14:04:12,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 14:04:12,763 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 72 states and 86 transitions. [2022-04-28 14:04:17,060 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 84 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 14:04:17,060 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 86 transitions. [2022-04-28 14:04:17,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 14:04:17,061 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:04:17,061 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:04:17,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-28 14:04:17,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-28 14:04:17,262 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:04:17,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:04:17,262 INFO L85 PathProgramCache]: Analyzing trace with hash 604176890, now seen corresponding path program 3 times [2022-04-28 14:04:17,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:04:17,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1929095997] [2022-04-28 14:04:23,311 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:04:23,311 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:04:23,312 INFO L85 PathProgramCache]: Analyzing trace with hash 604176890, now seen corresponding path program 4 times [2022-04-28 14:04:23,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:04:23,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401202040] [2022-04-28 14:04:23,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:04:23,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:04:23,320 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:04:23,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1732892526] [2022-04-28 14:04:23,320 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 14:04:23,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:04:23,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:04:23,325 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:04:23,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-28 14:04:23,365 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 14:04:23,365 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-28 14:04:23,365 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 14:04:23,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 14:04:23,390 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 14:04:23,390 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-28 14:04:23,390 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-28 14:04:23,391 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 14:04:23,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-28 14:04:23,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-28 14:04:23,595 INFO L356 BasicCegarLoop]: Path program histogram: [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-04-28 14:04:23,597 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 14:04:23,605 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 14:04:23,605 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-28 14:04:23,605 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 14:04:23,605 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 14:04:23,605 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-28 14:04:23,605 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-28 14:04:23,605 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-28 14:04:23,606 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 14:04:23,606 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-28 14:04:23,606 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 14:04:23,606 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 14:04:23,606 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-28 14:04:23,606 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-28 14:04:23,606 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-28 14:04:23,606 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-28 14:04:23,606 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-28 14:04:23,606 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-28 14:04:23,606 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-28 14:04:23,606 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-28 14:04:23,606 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2022-04-28 14:04:23,606 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2022-04-28 14:04:23,606 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-28 14:04:23,606 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-28 14:04:23,606 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-28 14:04:23,606 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-28 14:04:23,606 WARN L170 areAnnotationChecker]: L46-2 has no Hoare annotation [2022-04-28 14:04:23,606 WARN L170 areAnnotationChecker]: L46-2 has no Hoare annotation [2022-04-28 14:04:23,606 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 14:04:23,607 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 14:04:23,607 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 14:04:23,607 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2022-04-28 14:04:23,607 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2022-04-28 14:04:23,607 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2022-04-28 14:04:23,607 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2022-04-28 14:04:23,607 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-28 14:04:23,607 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-28 14:04:23,607 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2022-04-28 14:04:23,607 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2022-04-28 14:04:23,607 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2022-04-28 14:04:23,607 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-04-28 14:04:23,607 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-04-28 14:04:23,607 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-04-28 14:04:23,607 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-04-28 14:04:23,607 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-28 14:04:23,607 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-04-28 14:04:23,607 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-04-28 14:04:23,607 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-28 14:04:23,607 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-04-28 14:04:23,607 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-04-28 14:04:23,608 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 14:04:23,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 02:04:23 BoogieIcfgContainer [2022-04-28 14:04:23,608 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 14:04:23,609 INFO L158 Benchmark]: Toolchain (without parser) took 343613.58ms. Allocated memory was 183.5MB in the beginning and 256.9MB in the end (delta: 73.4MB). Free memory was 129.9MB in the beginning and 120.6MB in the end (delta: 9.2MB). Peak memory consumption was 83.1MB. Max. memory is 8.0GB. [2022-04-28 14:04:23,609 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 183.5MB. Free memory is still 146.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 14:04:23,609 INFO L158 Benchmark]: CACSL2BoogieTranslator took 216.81ms. Allocated memory was 183.5MB in the beginning and 256.9MB in the end (delta: 73.4MB). Free memory was 129.6MB in the beginning and 227.6MB in the end (delta: -98.0MB). Peak memory consumption was 8.8MB. Max. memory is 8.0GB. [2022-04-28 14:04:23,609 INFO L158 Benchmark]: Boogie Preprocessor took 31.86ms. Allocated memory is still 256.9MB. Free memory was 227.6MB in the beginning and 226.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 14:04:23,609 INFO L158 Benchmark]: RCFGBuilder took 247.39ms. Allocated memory is still 256.9MB. Free memory was 226.0MB in the beginning and 212.9MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-28 14:04:23,610 INFO L158 Benchmark]: TraceAbstraction took 343114.16ms. Allocated memory is still 256.9MB. Free memory was 212.4MB in the beginning and 120.6MB in the end (delta: 91.8MB). Peak memory consumption was 92.8MB. Max. memory is 8.0GB. [2022-04-28 14:04:23,610 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 183.5MB. Free memory is still 146.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 216.81ms. Allocated memory was 183.5MB in the beginning and 256.9MB in the end (delta: 73.4MB). Free memory was 129.6MB in the beginning and 227.6MB in the end (delta: -98.0MB). Peak memory consumption was 8.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.86ms. Allocated memory is still 256.9MB. Free memory was 227.6MB in the beginning and 226.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 247.39ms. Allocated memory is still 256.9MB. Free memory was 226.0MB in the beginning and 212.9MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 343114.16ms. Allocated memory is still 256.9MB. Free memory was 212.4MB in the beginning and 120.6MB in the end (delta: 91.8MB). Peak memory consumption was 92.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 14]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L19] int counter = 0; [L21] int x, y; [L22] long long a, b, p, q; [L24] x = __VERIFIER_nondet_int() [L25] y = __VERIFIER_nondet_int() [L26] CALL assume_abort_if_not(y >= 1) [L9] COND FALSE !(!cond) [L26] RET assume_abort_if_not(y >= 1) [L28] a = x [L29] b = y [L30] p = 1 [L31] q = 0 [L33] EXPR counter++ [L33] COND TRUE counter++<2 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) [L12] COND FALSE !(!(cond)) [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) [L36] COND FALSE !(!(a != 0 && b != 0)) [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p [L33] EXPR counter++ [L33] COND TRUE counter++<2 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) [L12] COND FALSE !(!(cond)) [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) [L36] COND FALSE !(!(a != 0 && b != 0)) [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p [L33] EXPR counter++ [L33] COND FALSE !(counter++<2) [L56] CALL __VERIFIER_assert(q == (long long) x * y) [L12] COND TRUE !(cond) [L14] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 35 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 343.1s, OverallIterations: 14, TraceHistogramMax: 3, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 27.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 247 SdHoareTripleChecker+Valid, 11.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 228 mSDsluCounter, 1392 SdHoareTripleChecker+Invalid, 11.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1042 mSDsCounter, 76 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1309 IncrementalHoareTripleChecker+Invalid, 1388 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 76 mSolverCounterUnsat, 350 mSDtfsCounter, 1309 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 586 GetRequests, 467 SyntacticMatches, 11 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=12, InterpolantAutomatonStates: 94, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 13 MinimizatonAttempts, 66 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-28 14:04:23,655 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...