/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/divbin2_unwindbound5.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 11:42:05,348 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 11:42:05,350 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 11:42:05,384 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 11:42:05,384 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 11:42:05,385 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 11:42:05,388 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 11:42:05,390 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 11:42:05,391 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 11:42:05,394 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 11:42:05,399 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 11:42:05,400 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 11:42:05,400 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 11:42:05,401 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 11:42:05,402 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 11:42:05,402 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 11:42:05,403 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 11:42:05,403 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 11:42:05,404 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 11:42:05,405 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 11:42:05,406 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 11:42:05,407 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 11:42:05,408 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 11:42:05,409 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 11:42:05,409 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 11:42:05,416 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 11:42:05,416 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 11:42:05,416 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 11:42:05,417 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 11:42:05,417 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 11:42:05,418 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 11:42:05,418 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 11:42:05,420 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 11:42:05,420 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 11:42:05,420 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 11:42:05,421 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 11:42:05,421 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 11:42:05,422 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 11:42:05,422 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 11:42:05,422 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 11:42:05,422 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 11:42:05,424 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 11:42:05,425 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 11:42:05,433 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 11:42:05,433 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 11:42:05,435 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 11:42:05,435 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 11:42:05,435 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 11:42:05,435 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 11:42:05,435 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 11:42:05,435 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 11:42:05,435 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 11:42:05,436 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 11:42:05,436 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 11:42:05,436 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 11:42:05,436 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 11:42:05,436 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 11:42:05,436 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 11:42:05,436 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 11:42:05,436 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 11:42:05,437 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 11:42:05,437 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 11:42:05,437 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 11:42:05,437 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 11:42:05,437 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 11:42:05,437 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-08 11:42:05,601 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 11:42:05,616 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 11:42:05,617 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 11:42:05,618 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 11:42:05,619 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 11:42:05,620 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/divbin2_unwindbound5.i [2022-04-08 11:42:05,681 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a43be43e/645cf6480f554cdb8c27181b732e2941/FLAG6341e54d2 [2022-04-08 11:42:06,006 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 11:42:06,007 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin2_unwindbound5.i [2022-04-08 11:42:06,012 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a43be43e/645cf6480f554cdb8c27181b732e2941/FLAG6341e54d2 [2022-04-08 11:42:06,435 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a43be43e/645cf6480f554cdb8c27181b732e2941 [2022-04-08 11:42:06,437 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 11:42:06,438 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 11:42:06,439 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 11:42:06,439 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 11:42:06,452 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 11:42:06,454 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 11:42:06" (1/1) ... [2022-04-08 11:42:06,454 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4372ea5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:42:06, skipping insertion in model container [2022-04-08 11:42:06,454 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 11:42:06" (1/1) ... [2022-04-08 11:42:06,459 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 11:42:06,470 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 11:42:06,594 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/divbin2_unwindbound5.i[951,964] [2022-04-08 11:42:06,622 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 11:42:06,628 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 11:42:06,636 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/divbin2_unwindbound5.i[951,964] [2022-04-08 11:42:06,653 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 11:42:06,664 INFO L208 MainTranslator]: Completed translation [2022-04-08 11:42:06,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:42:06 WrapperNode [2022-04-08 11:42:06,675 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 11:42:06,676 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 11:42:06,676 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 11:42:06,676 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 11:42:06,683 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:42:06" (1/1) ... [2022-04-08 11:42:06,683 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:42:06" (1/1) ... [2022-04-08 11:42:06,687 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:42:06" (1/1) ... [2022-04-08 11:42:06,687 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:42:06" (1/1) ... [2022-04-08 11:42:06,691 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:42:06" (1/1) ... [2022-04-08 11:42:06,698 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:42:06" (1/1) ... [2022-04-08 11:42:06,698 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:42:06" (1/1) ... [2022-04-08 11:42:06,700 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 11:42:06,700 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 11:42:06,700 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 11:42:06,701 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 11:42:06,701 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:42:06" (1/1) ... [2022-04-08 11:42:06,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 11:42:06,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:42:06,722 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-08 11:42:06,740 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-08 11:42:06,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 11:42:06,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 11:42:06,750 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 11:42:06,750 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 11:42:06,750 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 11:42:06,750 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 11:42:06,750 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 11:42:06,751 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 11:42:06,751 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-08 11:42:06,751 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-08 11:42:06,751 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 11:42:06,751 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 11:42:06,751 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-08 11:42:06,751 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 11:42:06,751 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 11:42:06,751 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 11:42:06,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 11:42:06,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 11:42:06,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 11:42:06,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 11:42:06,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 11:42:06,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 11:42:06,797 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 11:42:06,799 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 11:42:06,925 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 11:42:06,929 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 11:42:06,929 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-08 11:42:06,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 11:42:06 BoogieIcfgContainer [2022-04-08 11:42:06,931 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 11:42:06,932 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 11:42:06,932 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 11:42:06,946 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 11:42:06,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 11:42:06" (1/3) ... [2022-04-08 11:42:06,947 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10b21928 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 11:42:06, skipping insertion in model container [2022-04-08 11:42:06,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:42:06" (2/3) ... [2022-04-08 11:42:06,947 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10b21928 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 11:42:06, skipping insertion in model container [2022-04-08 11:42:06,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 11:42:06" (3/3) ... [2022-04-08 11:42:06,948 INFO L111 eAbstractionObserver]: Analyzing ICFG divbin2_unwindbound5.i [2022-04-08 11:42:06,952 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 11:42:06,952 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 11:42:06,993 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 11:42:07,011 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 11:42:07,011 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 11:42:07,049 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 11:42:07,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 11:42:07,055 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:42:07,055 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:42:07,055 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:42:07,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:42:07,059 INFO L85 PathProgramCache]: Analyzing trace with hash -2126508982, now seen corresponding path program 1 times [2022-04-08 11:42:07,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:42:07,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1861340736] [2022-04-08 11:42:07,075 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:42:07,076 INFO L85 PathProgramCache]: Analyzing trace with hash -2126508982, now seen corresponding path program 2 times [2022-04-08 11:42:07,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:42:07,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013201632] [2022-04-08 11:42:07,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:42:07,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:42:07,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:42:07,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 11:42:07,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:42:07,198 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#(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(10, 2);~counter~0 := 0; {29#true} is VALID [2022-04-08 11:42:07,198 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-08 11:42:07,199 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29#true} {29#true} #82#return; {29#true} is VALID [2022-04-08 11:42:07,208 INFO L272 TraceCheckUtils]: 0: Hoare triple {29#true} call ULTIMATE.init(); {34#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 11:42:07,208 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#(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(10, 2);~counter~0 := 0; {29#true} is VALID [2022-04-08 11:42:07,208 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-08 11:42:07,209 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29#true} {29#true} #82#return; {29#true} is VALID [2022-04-08 11:42:07,209 INFO L272 TraceCheckUtils]: 4: Hoare triple {29#true} call #t~ret4 := main(); {29#true} is VALID [2022-04-08 11:42:07,209 INFO L290 TraceCheckUtils]: 5: Hoare triple {29#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {29#true} is VALID [2022-04-08 11:42:07,210 INFO L290 TraceCheckUtils]: 6: Hoare triple {29#true} assume !true; {30#false} is VALID [2022-04-08 11:42:07,210 INFO L290 TraceCheckUtils]: 7: Hoare triple {30#false} assume !true; {30#false} is VALID [2022-04-08 11:42:07,210 INFO L272 TraceCheckUtils]: 8: Hoare triple {30#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {30#false} is VALID [2022-04-08 11:42:07,210 INFO L290 TraceCheckUtils]: 9: Hoare triple {30#false} ~cond := #in~cond; {30#false} is VALID [2022-04-08 11:42:07,210 INFO L290 TraceCheckUtils]: 10: Hoare triple {30#false} assume 0 == ~cond; {30#false} is VALID [2022-04-08 11:42:07,211 INFO L290 TraceCheckUtils]: 11: Hoare triple {30#false} assume !false; {30#false} is VALID [2022-04-08 11:42:07,211 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-08 11:42:07,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:42:07,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013201632] [2022-04-08 11:42:07,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013201632] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:42:07,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:42:07,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 11:42:07,214 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:42:07,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1861340736] [2022-04-08 11:42:07,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1861340736] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:42:07,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:42:07,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 11:42:07,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83599984] [2022-04-08 11:42:07,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:42:07,220 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 11:42:07,221 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:42:07,223 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 11:42:07,237 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:42:07,238 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 11:42:07,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:42:07,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 11:42:07,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 11:42:07,257 INFO L87 Difference]: Start difference. First operand has 26 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 11:42:07,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:42:07,403 INFO L93 Difference]: Finished difference Result 44 states and 60 transitions. [2022-04-08 11:42:07,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 11:42:07,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 11:42:07,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:42:07,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 11:42:07,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-04-08 11:42:07,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 11:42:07,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-04-08 11:42:07,412 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 60 transitions. [2022-04-08 11:42:07,464 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-08 11:42:07,470 INFO L225 Difference]: With dead ends: 44 [2022-04-08 11:42:07,470 INFO L226 Difference]: Without dead ends: 22 [2022-04-08 11:42:07,472 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-08 11:42:07,478 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 11:42:07,480 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 34 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 11:42:07,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-08 11:42:07,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-04-08 11:42:07,504 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:42:07,504 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 11:42:07,505 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 11:42:07,505 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 11:42:07,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:42:07,508 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-04-08 11:42:07,508 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-08 11:42:07,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:42:07,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:42:07,509 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 22 states. [2022-04-08 11:42:07,509 INFO L87 Difference]: Start difference. First operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 22 states. [2022-04-08 11:42:07,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:42:07,511 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-04-08 11:42:07,511 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-08 11:42:07,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:42:07,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:42:07,512 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:42:07,512 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:42:07,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 11:42:07,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2022-04-08 11:42:07,515 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 12 [2022-04-08 11:42:07,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:42:07,515 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2022-04-08 11:42:07,515 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 11:42:07,515 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 26 transitions. [2022-04-08 11:42:07,537 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-08 11:42:07,538 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2022-04-08 11:42:07,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-08 11:42:07,543 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:42:07,543 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:42:07,544 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 11:42:07,544 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:42:07,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:42:07,546 INFO L85 PathProgramCache]: Analyzing trace with hash 941422680, now seen corresponding path program 1 times [2022-04-08 11:42:07,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:42:07,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1083390408] [2022-04-08 11:42:07,548 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:42:07,548 INFO L85 PathProgramCache]: Analyzing trace with hash 941422680, now seen corresponding path program 2 times [2022-04-08 11:42:07,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:42:07,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467247591] [2022-04-08 11:42:07,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:42:07,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:42:07,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:42:07,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 11:42:07,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:42:07,673 INFO L290 TraceCheckUtils]: 0: Hoare triple {218#(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(10, 2);~counter~0 := 0; {216#(<= ~counter~0 0)} is VALID [2022-04-08 11:42:07,676 INFO L290 TraceCheckUtils]: 1: Hoare triple {216#(<= ~counter~0 0)} assume true; {216#(<= ~counter~0 0)} is VALID [2022-04-08 11:42:07,676 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {216#(<= ~counter~0 0)} {211#true} #82#return; {216#(<= ~counter~0 0)} is VALID [2022-04-08 11:42:07,677 INFO L272 TraceCheckUtils]: 0: Hoare triple {211#true} call ULTIMATE.init(); {218#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 11:42:07,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {218#(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(10, 2);~counter~0 := 0; {216#(<= ~counter~0 0)} is VALID [2022-04-08 11:42:07,679 INFO L290 TraceCheckUtils]: 2: Hoare triple {216#(<= ~counter~0 0)} assume true; {216#(<= ~counter~0 0)} is VALID [2022-04-08 11:42:07,680 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {216#(<= ~counter~0 0)} {211#true} #82#return; {216#(<= ~counter~0 0)} is VALID [2022-04-08 11:42:07,680 INFO L272 TraceCheckUtils]: 4: Hoare triple {216#(<= ~counter~0 0)} call #t~ret4 := main(); {216#(<= ~counter~0 0)} is VALID [2022-04-08 11:42:07,681 INFO L290 TraceCheckUtils]: 5: Hoare triple {216#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {216#(<= ~counter~0 0)} is VALID [2022-04-08 11:42:07,681 INFO L290 TraceCheckUtils]: 6: Hoare triple {216#(<= ~counter~0 0)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {217#(<= |main_#t~post2| 0)} is VALID [2022-04-08 11:42:07,682 INFO L290 TraceCheckUtils]: 7: Hoare triple {217#(<= |main_#t~post2| 0)} assume !(#t~post2 < 5);havoc #t~post2; {212#false} is VALID [2022-04-08 11:42:07,682 INFO L290 TraceCheckUtils]: 8: Hoare triple {212#false} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {212#false} is VALID [2022-04-08 11:42:07,682 INFO L290 TraceCheckUtils]: 9: Hoare triple {212#false} assume !(#t~post3 < 5);havoc #t~post3; {212#false} is VALID [2022-04-08 11:42:07,682 INFO L272 TraceCheckUtils]: 10: Hoare triple {212#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {212#false} is VALID [2022-04-08 11:42:07,682 INFO L290 TraceCheckUtils]: 11: Hoare triple {212#false} ~cond := #in~cond; {212#false} is VALID [2022-04-08 11:42:07,683 INFO L290 TraceCheckUtils]: 12: Hoare triple {212#false} assume 0 == ~cond; {212#false} is VALID [2022-04-08 11:42:07,683 INFO L290 TraceCheckUtils]: 13: Hoare triple {212#false} assume !false; {212#false} is VALID [2022-04-08 11:42:07,683 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-08 11:42:07,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:42:07,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467247591] [2022-04-08 11:42:07,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467247591] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:42:07,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:42:07,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 11:42:07,684 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:42:07,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1083390408] [2022-04-08 11:42:07,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1083390408] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:42:07,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:42:07,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 11:42:07,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544374734] [2022-04-08 11:42:07,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:42:07,685 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-08 11:42:07,685 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:42:07,686 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 11:42:07,696 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:42:07,696 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 11:42:07,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:42:07,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 11:42:07,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 11:42:07,698 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 11:42:07,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:42:07,804 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-08 11:42:07,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 11:42:07,804 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-08 11:42:07,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:42:07,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 11:42:07,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-04-08 11:42:07,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 11:42:07,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-04-08 11:42:07,818 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 44 transitions. [2022-04-08 11:42:07,849 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-08 11:42:07,852 INFO L225 Difference]: With dead ends: 35 [2022-04-08 11:42:07,852 INFO L226 Difference]: Without dead ends: 23 [2022-04-08 11:42:07,853 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-08 11:42:07,858 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 6 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 11:42:07,859 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 53 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 11:42:07,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-08 11:42:07,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-08 11:42:07,874 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:42:07,875 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 11:42:07,875 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 11:42:07,875 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 11:42:07,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:42:07,877 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-04-08 11:42:07,878 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-08 11:42:07,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:42:07,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:42:07,879 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 23 states. [2022-04-08 11:42:07,880 INFO L87 Difference]: Start difference. First operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 23 states. [2022-04-08 11:42:07,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:42:07,881 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-04-08 11:42:07,881 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-08 11:42:07,881 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:42:07,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:42:07,882 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:42:07,882 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:42:07,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 11:42:07,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2022-04-08 11:42:07,887 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 14 [2022-04-08 11:42:07,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:42:07,888 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2022-04-08 11:42:07,888 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 11:42:07,888 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 28 transitions. [2022-04-08 11:42:07,908 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-08 11:42:07,908 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-08 11:42:07,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-08 11:42:07,909 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:42:07,909 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:42:07,909 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 11:42:07,910 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:42:07,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:42:07,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1209133518, now seen corresponding path program 1 times [2022-04-08 11:42:07,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:42:07,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [991116697] [2022-04-08 11:42:07,915 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:42:07,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1209133518, now seen corresponding path program 2 times [2022-04-08 11:42:07,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:42:07,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71784197] [2022-04-08 11:42:07,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:42:07,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:42:07,943 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:42:07,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [797711671] [2022-04-08 11:42:07,943 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:42:07,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:42:07,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:42:07,975 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-08 11:42:07,991 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-08 11:42:08,036 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 11:42:08,036 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:42:08,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 11:42:08,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:42:08,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:42:08,233 INFO L272 TraceCheckUtils]: 0: Hoare triple {385#true} call ULTIMATE.init(); {385#true} is VALID [2022-04-08 11:42:08,234 INFO L290 TraceCheckUtils]: 1: Hoare triple {385#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(10, 2);~counter~0 := 0; {393#(<= ~counter~0 0)} is VALID [2022-04-08 11:42:08,234 INFO L290 TraceCheckUtils]: 2: Hoare triple {393#(<= ~counter~0 0)} assume true; {393#(<= ~counter~0 0)} is VALID [2022-04-08 11:42:08,234 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {393#(<= ~counter~0 0)} {385#true} #82#return; {393#(<= ~counter~0 0)} is VALID [2022-04-08 11:42:08,235 INFO L272 TraceCheckUtils]: 4: Hoare triple {393#(<= ~counter~0 0)} call #t~ret4 := main(); {393#(<= ~counter~0 0)} is VALID [2022-04-08 11:42:08,235 INFO L290 TraceCheckUtils]: 5: Hoare triple {393#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {393#(<= ~counter~0 0)} is VALID [2022-04-08 11:42:08,236 INFO L290 TraceCheckUtils]: 6: Hoare triple {393#(<= ~counter~0 0)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {409#(<= ~counter~0 1)} is VALID [2022-04-08 11:42:08,236 INFO L290 TraceCheckUtils]: 7: Hoare triple {409#(<= ~counter~0 1)} assume !!(#t~post2 < 5);havoc #t~post2; {409#(<= ~counter~0 1)} is VALID [2022-04-08 11:42:08,236 INFO L290 TraceCheckUtils]: 8: Hoare triple {409#(<= ~counter~0 1)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {409#(<= ~counter~0 1)} is VALID [2022-04-08 11:42:08,237 INFO L290 TraceCheckUtils]: 9: Hoare triple {409#(<= ~counter~0 1)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {419#(<= |main_#t~post3| 1)} is VALID [2022-04-08 11:42:08,237 INFO L290 TraceCheckUtils]: 10: Hoare triple {419#(<= |main_#t~post3| 1)} assume !(#t~post3 < 5);havoc #t~post3; {386#false} is VALID [2022-04-08 11:42:08,237 INFO L272 TraceCheckUtils]: 11: Hoare triple {386#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {386#false} is VALID [2022-04-08 11:42:08,238 INFO L290 TraceCheckUtils]: 12: Hoare triple {386#false} ~cond := #in~cond; {386#false} is VALID [2022-04-08 11:42:08,238 INFO L290 TraceCheckUtils]: 13: Hoare triple {386#false} assume 0 == ~cond; {386#false} is VALID [2022-04-08 11:42:08,238 INFO L290 TraceCheckUtils]: 14: Hoare triple {386#false} assume !false; {386#false} is VALID [2022-04-08 11:42:08,238 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-08 11:42:08,238 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 11:42:08,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:42:08,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71784197] [2022-04-08 11:42:08,238 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:42:08,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797711671] [2022-04-08 11:42:08,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [797711671] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:42:08,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:42:08,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:42:08,239 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:42:08,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [991116697] [2022-04-08 11:42:08,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [991116697] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:42:08,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:42:08,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:42:08,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44990508] [2022-04-08 11:42:08,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:42:08,240 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-08 11:42:08,240 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:42:08,241 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 11:42:08,251 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:42:08,251 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 11:42:08,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:42:08,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 11:42:08,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-08 11:42:08,252 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 11:42:08,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:42:08,314 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2022-04-08 11:42:08,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 11:42:08,315 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-08 11:42:08,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:42:08,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 11:42:08,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-08 11:42:08,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 11:42:08,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-08 11:42:08,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2022-04-08 11:42:08,342 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-08 11:42:08,343 INFO L225 Difference]: With dead ends: 34 [2022-04-08 11:42:08,343 INFO L226 Difference]: Without dead ends: 27 [2022-04-08 11:42:08,344 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-08 11:42:08,344 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 3 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 11:42:08,345 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 81 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 11:42:08,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-08 11:42:08,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-04-08 11:42:08,352 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:42:08,353 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 26 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 11:42:08,353 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 26 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 11:42:08,353 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 26 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 11:42:08,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:42:08,354 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2022-04-08 11:42:08,354 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-04-08 11:42:08,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:42:08,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:42:08,355 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 27 states. [2022-04-08 11:42:08,355 INFO L87 Difference]: Start difference. First operand has 26 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 27 states. [2022-04-08 11:42:08,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:42:08,356 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2022-04-08 11:42:08,356 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-04-08 11:42:08,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:42:08,357 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:42:08,357 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:42:08,357 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:42:08,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 11:42:08,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2022-04-08 11:42:08,358 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 15 [2022-04-08 11:42:08,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:42:08,358 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2022-04-08 11:42:08,358 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 11:42:08,359 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 32 transitions. [2022-04-08 11:42:08,381 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:42:08,381 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2022-04-08 11:42:08,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-08 11:42:08,381 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:42:08,381 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:42:08,412 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-08 11:42:08,595 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:42:08,596 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:42:08,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:42:08,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1207346058, now seen corresponding path program 1 times [2022-04-08 11:42:08,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:42:08,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [140631147] [2022-04-08 11:42:08,597 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:42:08,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1207346058, now seen corresponding path program 2 times [2022-04-08 11:42:08,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:42:08,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105785447] [2022-04-08 11:42:08,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:42:08,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:42:08,611 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:42:08,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [732888161] [2022-04-08 11:42:08,611 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:42:08,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:42:08,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:42:08,627 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-08 11:42:08,629 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-08 11:42:08,673 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 11:42:08,673 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:42:08,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-08 11:42:08,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:42:08,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:42:08,907 INFO L272 TraceCheckUtils]: 0: Hoare triple {608#true} call ULTIMATE.init(); {608#true} is VALID [2022-04-08 11:42:08,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {608#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(10, 2);~counter~0 := 0; {608#true} is VALID [2022-04-08 11:42:08,908 INFO L290 TraceCheckUtils]: 2: Hoare triple {608#true} assume true; {608#true} is VALID [2022-04-08 11:42:08,908 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {608#true} {608#true} #82#return; {608#true} is VALID [2022-04-08 11:42:08,908 INFO L272 TraceCheckUtils]: 4: Hoare triple {608#true} call #t~ret4 := main(); {608#true} is VALID [2022-04-08 11:42:08,908 INFO L290 TraceCheckUtils]: 5: Hoare triple {608#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {628#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:42:08,909 INFO L290 TraceCheckUtils]: 6: Hoare triple {628#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {628#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:42:08,909 INFO L290 TraceCheckUtils]: 7: Hoare triple {628#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post2 < 5);havoc #t~post2; {628#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:42:08,910 INFO L290 TraceCheckUtils]: 8: Hoare triple {628#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {638#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:42:08,910 INFO L290 TraceCheckUtils]: 9: Hoare triple {638#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {638#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:42:08,911 INFO L290 TraceCheckUtils]: 10: Hoare triple {638#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post3 < 5);havoc #t~post3; {638#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:42:08,912 INFO L272 TraceCheckUtils]: 11: Hoare triple {638#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {648#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:42:08,912 INFO L290 TraceCheckUtils]: 12: Hoare triple {648#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {652#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:42:08,913 INFO L290 TraceCheckUtils]: 13: Hoare triple {652#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {609#false} is VALID [2022-04-08 11:42:08,913 INFO L290 TraceCheckUtils]: 14: Hoare triple {609#false} assume !false; {609#false} is VALID [2022-04-08 11:42:08,913 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-08 11:42:08,913 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 11:42:08,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:42:08,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105785447] [2022-04-08 11:42:08,914 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:42:08,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732888161] [2022-04-08 11:42:08,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [732888161] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:42:08,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:42:08,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 11:42:08,914 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:42:08,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [140631147] [2022-04-08 11:42:08,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [140631147] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:42:08,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:42:08,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 11:42:08,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163141164] [2022-04-08 11:42:08,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:42:08,915 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-08 11:42:08,915 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:42:08,915 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 11:42:08,928 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:42:08,928 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 11:42:08,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:42:08,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 11:42:08,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-08 11:42:08,929 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 11:42:09,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:42:09,096 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2022-04-08 11:42:09,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 11:42:09,096 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-08 11:42:09,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:42:09,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 11:42:09,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-04-08 11:42:09,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 11:42:09,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-04-08 11:42:09,099 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 42 transitions. [2022-04-08 11:42:09,131 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:42:09,132 INFO L225 Difference]: With dead ends: 35 [2022-04-08 11:42:09,132 INFO L226 Difference]: Without dead ends: 32 [2022-04-08 11:42:09,132 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-08 11:42:09,133 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 9 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 11:42:09,133 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 88 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 11:42:09,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-08 11:42:09,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-08 11:42:09,146 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:42:09,147 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 11:42:09,147 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 11:42:09,147 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 11:42:09,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:42:09,148 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2022-04-08 11:42:09,148 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-04-08 11:42:09,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:42:09,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:42:09,149 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 32 states. [2022-04-08 11:42:09,149 INFO L87 Difference]: Start difference. First operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 32 states. [2022-04-08 11:42:09,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:42:09,150 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2022-04-08 11:42:09,150 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-04-08 11:42:09,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:42:09,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:42:09,151 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:42:09,151 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:42:09,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 11:42:09,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-04-08 11:42:09,152 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 15 [2022-04-08 11:42:09,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:42:09,152 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-04-08 11:42:09,152 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 11:42:09,152 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 38 transitions. [2022-04-08 11:42:09,183 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-08 11:42:09,183 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-04-08 11:42:09,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 11:42:09,184 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:42:09,184 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:42:09,220 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-08 11:42:09,420 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-08 11:42:09,420 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:42:09,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:42:09,421 INFO L85 PathProgramCache]: Analyzing trace with hash -352921097, now seen corresponding path program 1 times [2022-04-08 11:42:09,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:42:09,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [507792918] [2022-04-08 11:42:09,449 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:42:09,449 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:42:09,449 INFO L85 PathProgramCache]: Analyzing trace with hash -352921097, now seen corresponding path program 2 times [2022-04-08 11:42:09,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:42:09,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762335803] [2022-04-08 11:42:09,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:42:09,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:42:09,461 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:42:09,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1022074841] [2022-04-08 11:42:09,461 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:42:09,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:42:09,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:42:09,472 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-08 11:42:09,486 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-08 11:42:09,518 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 11:42:09,519 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:42:09,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 11:42:09,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:42:09,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:42:09,664 INFO L272 TraceCheckUtils]: 0: Hoare triple {858#true} call ULTIMATE.init(); {858#true} is VALID [2022-04-08 11:42:09,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {858#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(10, 2);~counter~0 := 0; {858#true} is VALID [2022-04-08 11:42:09,665 INFO L290 TraceCheckUtils]: 2: Hoare triple {858#true} assume true; {858#true} is VALID [2022-04-08 11:42:09,665 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {858#true} {858#true} #82#return; {858#true} is VALID [2022-04-08 11:42:09,665 INFO L272 TraceCheckUtils]: 4: Hoare triple {858#true} call #t~ret4 := main(); {858#true} is VALID [2022-04-08 11:42:09,675 INFO L290 TraceCheckUtils]: 5: Hoare triple {858#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:42:09,676 INFO L290 TraceCheckUtils]: 6: Hoare triple {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:42:09,676 INFO L290 TraceCheckUtils]: 7: Hoare triple {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post2 < 5);havoc #t~post2; {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:42:09,677 INFO L290 TraceCheckUtils]: 8: Hoare triple {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:42:09,677 INFO L290 TraceCheckUtils]: 9: Hoare triple {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:42:09,677 INFO L290 TraceCheckUtils]: 10: Hoare triple {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(#t~post2 < 5);havoc #t~post2; {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:42:09,678 INFO L290 TraceCheckUtils]: 11: Hoare triple {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:42:09,678 INFO L290 TraceCheckUtils]: 12: Hoare triple {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(#t~post3 < 5);havoc #t~post3; {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:42:09,679 INFO L272 TraceCheckUtils]: 13: Hoare triple {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {903#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:42:09,679 INFO L290 TraceCheckUtils]: 14: Hoare triple {903#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {907#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:42:09,680 INFO L290 TraceCheckUtils]: 15: Hoare triple {907#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {859#false} is VALID [2022-04-08 11:42:09,680 INFO L290 TraceCheckUtils]: 16: Hoare triple {859#false} assume !false; {859#false} is VALID [2022-04-08 11:42:09,680 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 11:42:09,680 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 11:42:09,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:42:09,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762335803] [2022-04-08 11:42:09,680 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:42:09,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022074841] [2022-04-08 11:42:09,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1022074841] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:42:09,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:42:09,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:42:09,681 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:42:09,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [507792918] [2022-04-08 11:42:09,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [507792918] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:42:09,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:42:09,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:42:09,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877259658] [2022-04-08 11:42:09,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:42:09,682 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-08 11:42:09,682 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:42:09,682 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 11:42:09,693 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:42:09,693 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 11:42:09,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:42:09,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 11:42:09,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 11:42:09,694 INFO L87 Difference]: Start difference. First operand 32 states and 38 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 11:42:09,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:42:09,820 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2022-04-08 11:42:09,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 11:42:09,820 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-08 11:42:09,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:42:09,820 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 11:42:09,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-08 11:42:09,822 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 11:42:09,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-08 11:42:09,823 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2022-04-08 11:42:09,850 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:42:09,850 INFO L225 Difference]: With dead ends: 44 [2022-04-08 11:42:09,851 INFO L226 Difference]: Without dead ends: 41 [2022-04-08 11:42:09,851 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 11:42:09,851 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 9 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 11:42:09,852 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 66 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 11:42:09,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-08 11:42:09,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 32. [2022-04-08 11:42:09,865 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:42:09,865 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 11:42:09,865 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 11:42:09,866 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 11:42:09,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:42:09,867 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-08 11:42:09,867 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2022-04-08 11:42:09,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:42:09,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:42:09,867 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 41 states. [2022-04-08 11:42:09,868 INFO L87 Difference]: Start difference. First operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 41 states. [2022-04-08 11:42:09,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:42:09,869 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-08 11:42:09,869 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2022-04-08 11:42:09,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:42:09,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:42:09,869 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:42:09,869 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:42:09,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 11:42:09,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-04-08 11:42:09,870 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 17 [2022-04-08 11:42:09,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:42:09,870 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-04-08 11:42:09,871 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 11:42:09,871 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 38 transitions. [2022-04-08 11:42:09,901 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-08 11:42:09,901 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-04-08 11:42:09,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 11:42:09,901 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:42:09,902 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:42:09,948 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-08 11:42:10,102 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:42:10,102 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:42:10,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:42:10,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1626008211, now seen corresponding path program 1 times [2022-04-08 11:42:10,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:42:10,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [854931502] [2022-04-08 11:42:10,103 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:42:10,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1626008211, now seen corresponding path program 2 times [2022-04-08 11:42:10,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:42:10,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663263909] [2022-04-08 11:42:10,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:42:10,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:42:10,118 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:42:10,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [194699826] [2022-04-08 11:42:10,118 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:42:10,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:42:10,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:42:10,131 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-08 11:42:10,132 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-08 11:42:10,162 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:42:10,162 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:42:10,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 11:42:10,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:42:10,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:42:10,301 INFO L272 TraceCheckUtils]: 0: Hoare triple {1149#true} call ULTIMATE.init(); {1149#true} is VALID [2022-04-08 11:42:10,302 INFO L290 TraceCheckUtils]: 1: Hoare triple {1149#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(10, 2);~counter~0 := 0; {1157#(<= ~counter~0 0)} is VALID [2022-04-08 11:42:10,302 INFO L290 TraceCheckUtils]: 2: Hoare triple {1157#(<= ~counter~0 0)} assume true; {1157#(<= ~counter~0 0)} is VALID [2022-04-08 11:42:10,303 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1157#(<= ~counter~0 0)} {1149#true} #82#return; {1157#(<= ~counter~0 0)} is VALID [2022-04-08 11:42:10,303 INFO L272 TraceCheckUtils]: 4: Hoare triple {1157#(<= ~counter~0 0)} call #t~ret4 := main(); {1157#(<= ~counter~0 0)} is VALID [2022-04-08 11:42:10,303 INFO L290 TraceCheckUtils]: 5: Hoare triple {1157#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1157#(<= ~counter~0 0)} is VALID [2022-04-08 11:42:10,304 INFO L290 TraceCheckUtils]: 6: Hoare triple {1157#(<= ~counter~0 0)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {1173#(<= ~counter~0 1)} is VALID [2022-04-08 11:42:10,304 INFO L290 TraceCheckUtils]: 7: Hoare triple {1173#(<= ~counter~0 1)} assume !!(#t~post2 < 5);havoc #t~post2; {1173#(<= ~counter~0 1)} is VALID [2022-04-08 11:42:10,304 INFO L290 TraceCheckUtils]: 8: Hoare triple {1173#(<= ~counter~0 1)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1173#(<= ~counter~0 1)} is VALID [2022-04-08 11:42:10,305 INFO L290 TraceCheckUtils]: 9: Hoare triple {1173#(<= ~counter~0 1)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1183#(<= ~counter~0 2)} is VALID [2022-04-08 11:42:10,305 INFO L290 TraceCheckUtils]: 10: Hoare triple {1183#(<= ~counter~0 2)} assume !!(#t~post3 < 5);havoc #t~post3; {1183#(<= ~counter~0 2)} is VALID [2022-04-08 11:42:10,306 INFO L272 TraceCheckUtils]: 11: Hoare triple {1183#(<= ~counter~0 2)} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1183#(<= ~counter~0 2)} is VALID [2022-04-08 11:42:10,306 INFO L290 TraceCheckUtils]: 12: Hoare triple {1183#(<= ~counter~0 2)} ~cond := #in~cond; {1183#(<= ~counter~0 2)} is VALID [2022-04-08 11:42:10,306 INFO L290 TraceCheckUtils]: 13: Hoare triple {1183#(<= ~counter~0 2)} assume !(0 == ~cond); {1183#(<= ~counter~0 2)} is VALID [2022-04-08 11:42:10,307 INFO L290 TraceCheckUtils]: 14: Hoare triple {1183#(<= ~counter~0 2)} assume true; {1183#(<= ~counter~0 2)} is VALID [2022-04-08 11:42:10,307 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1183#(<= ~counter~0 2)} {1183#(<= ~counter~0 2)} #78#return; {1183#(<= ~counter~0 2)} is VALID [2022-04-08 11:42:10,307 INFO L290 TraceCheckUtils]: 16: Hoare triple {1183#(<= ~counter~0 2)} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {1183#(<= ~counter~0 2)} is VALID [2022-04-08 11:42:10,308 INFO L290 TraceCheckUtils]: 17: Hoare triple {1183#(<= ~counter~0 2)} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1183#(<= ~counter~0 2)} is VALID [2022-04-08 11:42:10,308 INFO L290 TraceCheckUtils]: 18: Hoare triple {1183#(<= ~counter~0 2)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1211#(<= |main_#t~post3| 2)} is VALID [2022-04-08 11:42:10,309 INFO L290 TraceCheckUtils]: 19: Hoare triple {1211#(<= |main_#t~post3| 2)} assume !(#t~post3 < 5);havoc #t~post3; {1150#false} is VALID [2022-04-08 11:42:10,309 INFO L272 TraceCheckUtils]: 20: Hoare triple {1150#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1150#false} is VALID [2022-04-08 11:42:10,309 INFO L290 TraceCheckUtils]: 21: Hoare triple {1150#false} ~cond := #in~cond; {1150#false} is VALID [2022-04-08 11:42:10,309 INFO L290 TraceCheckUtils]: 22: Hoare triple {1150#false} assume 0 == ~cond; {1150#false} is VALID [2022-04-08 11:42:10,309 INFO L290 TraceCheckUtils]: 23: Hoare triple {1150#false} assume !false; {1150#false} is VALID [2022-04-08 11:42:10,309 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-08 11:42:10,309 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:42:10,439 INFO L290 TraceCheckUtils]: 23: Hoare triple {1150#false} assume !false; {1150#false} is VALID [2022-04-08 11:42:10,439 INFO L290 TraceCheckUtils]: 22: Hoare triple {1150#false} assume 0 == ~cond; {1150#false} is VALID [2022-04-08 11:42:10,439 INFO L290 TraceCheckUtils]: 21: Hoare triple {1150#false} ~cond := #in~cond; {1150#false} is VALID [2022-04-08 11:42:10,440 INFO L272 TraceCheckUtils]: 20: Hoare triple {1150#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1150#false} is VALID [2022-04-08 11:42:10,441 INFO L290 TraceCheckUtils]: 19: Hoare triple {1239#(< |main_#t~post3| 5)} assume !(#t~post3 < 5);havoc #t~post3; {1150#false} is VALID [2022-04-08 11:42:10,442 INFO L290 TraceCheckUtils]: 18: Hoare triple {1243#(< ~counter~0 5)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1239#(< |main_#t~post3| 5)} is VALID [2022-04-08 11:42:10,442 INFO L290 TraceCheckUtils]: 17: Hoare triple {1243#(< ~counter~0 5)} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1243#(< ~counter~0 5)} is VALID [2022-04-08 11:42:10,442 INFO L290 TraceCheckUtils]: 16: Hoare triple {1243#(< ~counter~0 5)} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {1243#(< ~counter~0 5)} is VALID [2022-04-08 11:42:10,443 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1149#true} {1243#(< ~counter~0 5)} #78#return; {1243#(< ~counter~0 5)} is VALID [2022-04-08 11:42:10,443 INFO L290 TraceCheckUtils]: 14: Hoare triple {1149#true} assume true; {1149#true} is VALID [2022-04-08 11:42:10,443 INFO L290 TraceCheckUtils]: 13: Hoare triple {1149#true} assume !(0 == ~cond); {1149#true} is VALID [2022-04-08 11:42:10,443 INFO L290 TraceCheckUtils]: 12: Hoare triple {1149#true} ~cond := #in~cond; {1149#true} is VALID [2022-04-08 11:42:10,443 INFO L272 TraceCheckUtils]: 11: Hoare triple {1243#(< ~counter~0 5)} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1149#true} is VALID [2022-04-08 11:42:10,444 INFO L290 TraceCheckUtils]: 10: Hoare triple {1243#(< ~counter~0 5)} assume !!(#t~post3 < 5);havoc #t~post3; {1243#(< ~counter~0 5)} is VALID [2022-04-08 11:42:10,445 INFO L290 TraceCheckUtils]: 9: Hoare triple {1271#(< ~counter~0 4)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1243#(< ~counter~0 5)} is VALID [2022-04-08 11:42:10,446 INFO L290 TraceCheckUtils]: 8: Hoare triple {1271#(< ~counter~0 4)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1271#(< ~counter~0 4)} is VALID [2022-04-08 11:42:10,446 INFO L290 TraceCheckUtils]: 7: Hoare triple {1271#(< ~counter~0 4)} assume !!(#t~post2 < 5);havoc #t~post2; {1271#(< ~counter~0 4)} is VALID [2022-04-08 11:42:10,455 INFO L290 TraceCheckUtils]: 6: Hoare triple {1183#(<= ~counter~0 2)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {1271#(< ~counter~0 4)} is VALID [2022-04-08 11:42:10,456 INFO L290 TraceCheckUtils]: 5: Hoare triple {1183#(<= ~counter~0 2)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1183#(<= ~counter~0 2)} is VALID [2022-04-08 11:42:10,456 INFO L272 TraceCheckUtils]: 4: Hoare triple {1183#(<= ~counter~0 2)} call #t~ret4 := main(); {1183#(<= ~counter~0 2)} is VALID [2022-04-08 11:42:10,456 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1183#(<= ~counter~0 2)} {1149#true} #82#return; {1183#(<= ~counter~0 2)} is VALID [2022-04-08 11:42:10,457 INFO L290 TraceCheckUtils]: 2: Hoare triple {1183#(<= ~counter~0 2)} assume true; {1183#(<= ~counter~0 2)} is VALID [2022-04-08 11:42:10,457 INFO L290 TraceCheckUtils]: 1: Hoare triple {1149#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(10, 2);~counter~0 := 0; {1183#(<= ~counter~0 2)} is VALID [2022-04-08 11:42:10,457 INFO L272 TraceCheckUtils]: 0: Hoare triple {1149#true} call ULTIMATE.init(); {1149#true} is VALID [2022-04-08 11:42:10,457 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-08 11:42:10,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:42:10,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663263909] [2022-04-08 11:42:10,458 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:42:10,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194699826] [2022-04-08 11:42:10,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [194699826] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:42:10,458 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:42:10,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-04-08 11:42:10,458 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:42:10,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [854931502] [2022-04-08 11:42:10,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [854931502] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:42:10,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:42:10,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 11:42:10,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593853744] [2022-04-08 11:42:10,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:42:10,459 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-04-08 11:42:10,459 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:42:10,459 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 11:42:10,474 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:42:10,474 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 11:42:10,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:42:10,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 11:42:10,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-08 11:42:10,475 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 11:42:10,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:42:10,578 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-04-08 11:42:10,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 11:42:10,578 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-04-08 11:42:10,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:42:10,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 11:42:10,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2022-04-08 11:42:10,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 11:42:10,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2022-04-08 11:42:10,585 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 55 transitions. [2022-04-08 11:42:10,618 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:42:10,618 INFO L225 Difference]: With dead ends: 57 [2022-04-08 11:42:10,618 INFO L226 Difference]: Without dead ends: 50 [2022-04-08 11:42:10,619 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-08 11:42:10,619 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 10 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 11:42:10,619 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 85 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 11:42:10,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-08 11:42:10,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 44. [2022-04-08 11:42:10,648 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:42:10,648 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 44 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 34 states have internal predecessors, (42), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 11:42:10,648 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 44 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 34 states have internal predecessors, (42), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 11:42:10,648 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 44 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 34 states have internal predecessors, (42), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 11:42:10,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:42:10,649 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2022-04-08 11:42:10,649 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2022-04-08 11:42:10,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:42:10,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:42:10,650 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 34 states have internal predecessors, (42), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 50 states. [2022-04-08 11:42:10,650 INFO L87 Difference]: Start difference. First operand has 44 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 34 states have internal predecessors, (42), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 50 states. [2022-04-08 11:42:10,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:42:10,651 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2022-04-08 11:42:10,651 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2022-04-08 11:42:10,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:42:10,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:42:10,651 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:42:10,651 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:42:10,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 34 states have internal predecessors, (42), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 11:42:10,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2022-04-08 11:42:10,653 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 24 [2022-04-08 11:42:10,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:42:10,653 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2022-04-08 11:42:10,653 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 11:42:10,653 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 52 transitions. [2022-04-08 11:42:10,707 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:42:10,707 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-04-08 11:42:10,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 11:42:10,707 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:42:10,707 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:42:10,741 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-08 11:42:10,923 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:42:10,923 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:42:10,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:42:10,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1627795671, now seen corresponding path program 1 times [2022-04-08 11:42:10,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:42:10,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [361555184] [2022-04-08 11:42:10,924 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:42:10,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1627795671, now seen corresponding path program 2 times [2022-04-08 11:42:10,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:42:10,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021584078] [2022-04-08 11:42:10,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:42:10,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:42:10,934 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:42:10,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1168850108] [2022-04-08 11:42:10,934 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:42:10,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:42:10,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:42:10,935 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-08 11:42:10,936 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-08 11:42:10,969 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:42:10,969 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:42:10,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 11:42:10,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:42:10,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:42:11,041 INFO L272 TraceCheckUtils]: 0: Hoare triple {1605#true} call ULTIMATE.init(); {1605#true} is VALID [2022-04-08 11:42:11,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {1605#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(10, 2);~counter~0 := 0; {1605#true} is VALID [2022-04-08 11:42:11,041 INFO L290 TraceCheckUtils]: 2: Hoare triple {1605#true} assume true; {1605#true} is VALID [2022-04-08 11:42:11,041 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1605#true} {1605#true} #82#return; {1605#true} is VALID [2022-04-08 11:42:11,041 INFO L272 TraceCheckUtils]: 4: Hoare triple {1605#true} call #t~ret4 := main(); {1605#true} is VALID [2022-04-08 11:42:11,042 INFO L290 TraceCheckUtils]: 5: Hoare triple {1605#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1625#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-08 11:42:11,042 INFO L290 TraceCheckUtils]: 6: Hoare triple {1625#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {1625#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-08 11:42:11,042 INFO L290 TraceCheckUtils]: 7: Hoare triple {1625#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !!(#t~post2 < 5);havoc #t~post2; {1625#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-08 11:42:11,043 INFO L290 TraceCheckUtils]: 8: Hoare triple {1625#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1625#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-08 11:42:11,043 INFO L290 TraceCheckUtils]: 9: Hoare triple {1625#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1625#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-08 11:42:11,043 INFO L290 TraceCheckUtils]: 10: Hoare triple {1625#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !!(#t~post3 < 5);havoc #t~post3; {1625#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-08 11:42:11,043 INFO L272 TraceCheckUtils]: 11: Hoare triple {1625#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1605#true} is VALID [2022-04-08 11:42:11,044 INFO L290 TraceCheckUtils]: 12: Hoare triple {1605#true} ~cond := #in~cond; {1605#true} is VALID [2022-04-08 11:42:11,044 INFO L290 TraceCheckUtils]: 13: Hoare triple {1605#true} assume !(0 == ~cond); {1605#true} is VALID [2022-04-08 11:42:11,044 INFO L290 TraceCheckUtils]: 14: Hoare triple {1605#true} assume true; {1605#true} is VALID [2022-04-08 11:42:11,044 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1605#true} {1625#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} #78#return; {1625#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-08 11:42:11,045 INFO L290 TraceCheckUtils]: 16: Hoare triple {1625#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {1606#false} is VALID [2022-04-08 11:42:11,045 INFO L290 TraceCheckUtils]: 17: Hoare triple {1606#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1606#false} is VALID [2022-04-08 11:42:11,045 INFO L290 TraceCheckUtils]: 18: Hoare triple {1606#false} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1606#false} is VALID [2022-04-08 11:42:11,045 INFO L290 TraceCheckUtils]: 19: Hoare triple {1606#false} assume !!(#t~post3 < 5);havoc #t~post3; {1606#false} is VALID [2022-04-08 11:42:11,045 INFO L272 TraceCheckUtils]: 20: Hoare triple {1606#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1606#false} is VALID [2022-04-08 11:42:11,045 INFO L290 TraceCheckUtils]: 21: Hoare triple {1606#false} ~cond := #in~cond; {1606#false} is VALID [2022-04-08 11:42:11,045 INFO L290 TraceCheckUtils]: 22: Hoare triple {1606#false} assume 0 == ~cond; {1606#false} is VALID [2022-04-08 11:42:11,045 INFO L290 TraceCheckUtils]: 23: Hoare triple {1606#false} assume !false; {1606#false} is VALID [2022-04-08 11:42:11,045 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 11:42:11,045 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 11:42:11,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:42:11,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021584078] [2022-04-08 11:42:11,046 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:42:11,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1168850108] [2022-04-08 11:42:11,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1168850108] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:42:11,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:42:11,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 11:42:11,046 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:42:11,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [361555184] [2022-04-08 11:42:11,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [361555184] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:42:11,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:42:11,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 11:42:11,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585164342] [2022-04-08 11:42:11,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:42:11,047 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-04-08 11:42:11,047 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:42:11,047 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 11:42:11,060 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:42:11,060 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 11:42:11,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:42:11,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 11:42:11,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 11:42:11,061 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 11:42:11,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:42:11,116 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2022-04-08 11:42:11,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 11:42:11,116 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-04-08 11:42:11,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:42:11,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 11:42:11,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-04-08 11:42:11,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 11:42:11,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-04-08 11:42:11,118 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 50 transitions. [2022-04-08 11:42:11,143 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:42:11,147 INFO L225 Difference]: With dead ends: 65 [2022-04-08 11:42:11,147 INFO L226 Difference]: Without dead ends: 33 [2022-04-08 11:42:11,148 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 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-08 11:42:11,148 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 11:42:11,148 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 11:42:11,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-08 11:42:11,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-08 11:42:11,178 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:42:11,178 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 11:42:11,178 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 11:42:11,178 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 11:42:11,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:42:11,179 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-04-08 11:42:11,179 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-04-08 11:42:11,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:42:11,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:42:11,180 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 33 states. [2022-04-08 11:42:11,180 INFO L87 Difference]: Start difference. First operand has 33 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 33 states. [2022-04-08 11:42:11,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:42:11,180 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-04-08 11:42:11,181 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-04-08 11:42:11,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:42:11,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:42:11,181 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:42:11,181 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:42:11,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 11:42:11,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2022-04-08 11:42:11,182 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 24 [2022-04-08 11:42:11,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:42:11,182 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-04-08 11:42:11,182 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 11:42:11,182 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 39 transitions. [2022-04-08 11:42:11,214 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:42:11,214 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-04-08 11:42:11,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 11:42:11,214 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:42:11,215 INFO L499 BasicCegarLoop]: trace histogram [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-08 11:42:11,233 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-08 11:42:11,431 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:42:11,431 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:42:11,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:42:11,432 INFO L85 PathProgramCache]: Analyzing trace with hash 76649582, now seen corresponding path program 1 times [2022-04-08 11:42:11,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:42:11,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2136416324] [2022-04-08 11:42:11,438 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:42:11,438 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:42:11,438 INFO L85 PathProgramCache]: Analyzing trace with hash 76649582, now seen corresponding path program 2 times [2022-04-08 11:42:11,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:42:11,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576243097] [2022-04-08 11:42:11,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:42:11,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:42:11,453 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:42:11,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [19243444] [2022-04-08 11:42:11,453 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:42:11,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:42:11,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:42:11,465 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-08 11:42:11,466 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-08 11:42:11,509 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:42:11,509 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:42:11,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 11:42:11,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:42:11,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:42:11,610 INFO L272 TraceCheckUtils]: 0: Hoare triple {1941#true} call ULTIMATE.init(); {1941#true} is VALID [2022-04-08 11:42:11,611 INFO L290 TraceCheckUtils]: 1: Hoare triple {1941#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(10, 2);~counter~0 := 0; {1949#(<= ~counter~0 0)} is VALID [2022-04-08 11:42:11,611 INFO L290 TraceCheckUtils]: 2: Hoare triple {1949#(<= ~counter~0 0)} assume true; {1949#(<= ~counter~0 0)} is VALID [2022-04-08 11:42:11,612 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1949#(<= ~counter~0 0)} {1941#true} #82#return; {1949#(<= ~counter~0 0)} is VALID [2022-04-08 11:42:11,612 INFO L272 TraceCheckUtils]: 4: Hoare triple {1949#(<= ~counter~0 0)} call #t~ret4 := main(); {1949#(<= ~counter~0 0)} is VALID [2022-04-08 11:42:11,612 INFO L290 TraceCheckUtils]: 5: Hoare triple {1949#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1949#(<= ~counter~0 0)} is VALID [2022-04-08 11:42:11,613 INFO L290 TraceCheckUtils]: 6: Hoare triple {1949#(<= ~counter~0 0)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {1965#(<= ~counter~0 1)} is VALID [2022-04-08 11:42:11,613 INFO L290 TraceCheckUtils]: 7: Hoare triple {1965#(<= ~counter~0 1)} assume !!(#t~post2 < 5);havoc #t~post2; {1965#(<= ~counter~0 1)} is VALID [2022-04-08 11:42:11,613 INFO L290 TraceCheckUtils]: 8: Hoare triple {1965#(<= ~counter~0 1)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1965#(<= ~counter~0 1)} is VALID [2022-04-08 11:42:11,613 INFO L290 TraceCheckUtils]: 9: Hoare triple {1965#(<= ~counter~0 1)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {1975#(<= |main_#t~post2| 1)} is VALID [2022-04-08 11:42:11,614 INFO L290 TraceCheckUtils]: 10: Hoare triple {1975#(<= |main_#t~post2| 1)} assume !(#t~post2 < 5);havoc #t~post2; {1942#false} is VALID [2022-04-08 11:42:11,614 INFO L290 TraceCheckUtils]: 11: Hoare triple {1942#false} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1942#false} is VALID [2022-04-08 11:42:11,614 INFO L290 TraceCheckUtils]: 12: Hoare triple {1942#false} assume !!(#t~post3 < 5);havoc #t~post3; {1942#false} is VALID [2022-04-08 11:42:11,614 INFO L272 TraceCheckUtils]: 13: Hoare triple {1942#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1942#false} is VALID [2022-04-08 11:42:11,614 INFO L290 TraceCheckUtils]: 14: Hoare triple {1942#false} ~cond := #in~cond; {1942#false} is VALID [2022-04-08 11:42:11,614 INFO L290 TraceCheckUtils]: 15: Hoare triple {1942#false} assume !(0 == ~cond); {1942#false} is VALID [2022-04-08 11:42:11,614 INFO L290 TraceCheckUtils]: 16: Hoare triple {1942#false} assume true; {1942#false} is VALID [2022-04-08 11:42:11,614 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1942#false} {1942#false} #78#return; {1942#false} is VALID [2022-04-08 11:42:11,614 INFO L290 TraceCheckUtils]: 18: Hoare triple {1942#false} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {1942#false} is VALID [2022-04-08 11:42:11,614 INFO L290 TraceCheckUtils]: 19: Hoare triple {1942#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1942#false} is VALID [2022-04-08 11:42:11,614 INFO L290 TraceCheckUtils]: 20: Hoare triple {1942#false} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1942#false} is VALID [2022-04-08 11:42:11,615 INFO L290 TraceCheckUtils]: 21: Hoare triple {1942#false} assume !(#t~post3 < 5);havoc #t~post3; {1942#false} is VALID [2022-04-08 11:42:11,615 INFO L272 TraceCheckUtils]: 22: Hoare triple {1942#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1942#false} is VALID [2022-04-08 11:42:11,616 INFO L290 TraceCheckUtils]: 23: Hoare triple {1942#false} ~cond := #in~cond; {1942#false} is VALID [2022-04-08 11:42:11,616 INFO L290 TraceCheckUtils]: 24: Hoare triple {1942#false} assume 0 == ~cond; {1942#false} is VALID [2022-04-08 11:42:11,616 INFO L290 TraceCheckUtils]: 25: Hoare triple {1942#false} assume !false; {1942#false} is VALID [2022-04-08 11:42:11,616 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 11:42:11,616 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:42:11,753 INFO L290 TraceCheckUtils]: 25: Hoare triple {1942#false} assume !false; {1942#false} is VALID [2022-04-08 11:42:11,753 INFO L290 TraceCheckUtils]: 24: Hoare triple {1942#false} assume 0 == ~cond; {1942#false} is VALID [2022-04-08 11:42:11,753 INFO L290 TraceCheckUtils]: 23: Hoare triple {1942#false} ~cond := #in~cond; {1942#false} is VALID [2022-04-08 11:42:11,753 INFO L272 TraceCheckUtils]: 22: Hoare triple {1942#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1942#false} is VALID [2022-04-08 11:42:11,753 INFO L290 TraceCheckUtils]: 21: Hoare triple {1942#false} assume !(#t~post3 < 5);havoc #t~post3; {1942#false} is VALID [2022-04-08 11:42:11,753 INFO L290 TraceCheckUtils]: 20: Hoare triple {1942#false} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1942#false} is VALID [2022-04-08 11:42:11,753 INFO L290 TraceCheckUtils]: 19: Hoare triple {1942#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1942#false} is VALID [2022-04-08 11:42:11,754 INFO L290 TraceCheckUtils]: 18: Hoare triple {1942#false} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {1942#false} is VALID [2022-04-08 11:42:11,758 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1941#true} {1942#false} #78#return; {1942#false} is VALID [2022-04-08 11:42:11,758 INFO L290 TraceCheckUtils]: 16: Hoare triple {1941#true} assume true; {1941#true} is VALID [2022-04-08 11:42:11,758 INFO L290 TraceCheckUtils]: 15: Hoare triple {1941#true} assume !(0 == ~cond); {1941#true} is VALID [2022-04-08 11:42:11,758 INFO L290 TraceCheckUtils]: 14: Hoare triple {1941#true} ~cond := #in~cond; {1941#true} is VALID [2022-04-08 11:42:11,758 INFO L272 TraceCheckUtils]: 13: Hoare triple {1942#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1941#true} is VALID [2022-04-08 11:42:11,758 INFO L290 TraceCheckUtils]: 12: Hoare triple {1942#false} assume !!(#t~post3 < 5);havoc #t~post3; {1942#false} is VALID [2022-04-08 11:42:11,758 INFO L290 TraceCheckUtils]: 11: Hoare triple {1942#false} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1942#false} is VALID [2022-04-08 11:42:11,759 INFO L290 TraceCheckUtils]: 10: Hoare triple {2069#(< |main_#t~post2| 5)} assume !(#t~post2 < 5);havoc #t~post2; {1942#false} is VALID [2022-04-08 11:42:11,759 INFO L290 TraceCheckUtils]: 9: Hoare triple {2073#(< ~counter~0 5)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {2069#(< |main_#t~post2| 5)} is VALID [2022-04-08 11:42:11,759 INFO L290 TraceCheckUtils]: 8: Hoare triple {2073#(< ~counter~0 5)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {2073#(< ~counter~0 5)} is VALID [2022-04-08 11:42:11,760 INFO L290 TraceCheckUtils]: 7: Hoare triple {2073#(< ~counter~0 5)} assume !!(#t~post2 < 5);havoc #t~post2; {2073#(< ~counter~0 5)} is VALID [2022-04-08 11:42:11,760 INFO L290 TraceCheckUtils]: 6: Hoare triple {2083#(< ~counter~0 4)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {2073#(< ~counter~0 5)} is VALID [2022-04-08 11:42:11,760 INFO L290 TraceCheckUtils]: 5: Hoare triple {2083#(< ~counter~0 4)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {2083#(< ~counter~0 4)} is VALID [2022-04-08 11:42:11,765 INFO L272 TraceCheckUtils]: 4: Hoare triple {2083#(< ~counter~0 4)} call #t~ret4 := main(); {2083#(< ~counter~0 4)} is VALID [2022-04-08 11:42:11,766 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2083#(< ~counter~0 4)} {1941#true} #82#return; {2083#(< ~counter~0 4)} is VALID [2022-04-08 11:42:11,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {2083#(< ~counter~0 4)} assume true; {2083#(< ~counter~0 4)} is VALID [2022-04-08 11:42:11,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {1941#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(10, 2);~counter~0 := 0; {2083#(< ~counter~0 4)} is VALID [2022-04-08 11:42:11,770 INFO L272 TraceCheckUtils]: 0: Hoare triple {1941#true} call ULTIMATE.init(); {1941#true} is VALID [2022-04-08 11:42:11,770 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 11:42:11,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:42:11,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576243097] [2022-04-08 11:42:11,771 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:42:11,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19243444] [2022-04-08 11:42:11,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [19243444] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:42:11,771 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:42:11,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-08 11:42:11,771 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:42:11,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2136416324] [2022-04-08 11:42:11,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2136416324] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:42:11,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:42:11,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:42:11,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462716481] [2022-04-08 11:42:11,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:42:11,772 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2022-04-08 11:42:11,772 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:42:11,772 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 11:42:11,786 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:42:11,786 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 11:42:11,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:42:11,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 11:42:11,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-08 11:42:11,787 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 11:42:11,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:42:11,858 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2022-04-08 11:42:11,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 11:42:11,858 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2022-04-08 11:42:11,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:42:11,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 11:42:11,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-04-08 11:42:11,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 11:42:11,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-04-08 11:42:11,862 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 47 transitions. [2022-04-08 11:42:11,890 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:42:11,892 INFO L225 Difference]: With dead ends: 56 [2022-04-08 11:42:11,893 INFO L226 Difference]: Without dead ends: 35 [2022-04-08 11:42:11,893 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-08 11:42:11,893 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 2 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 11:42:11,894 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 66 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 11:42:11,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-08 11:42:11,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-08 11:42:11,917 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:42:11,917 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 11:42:11,923 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 11:42:11,925 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 11:42:11,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:42:11,927 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-08 11:42:11,927 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-08 11:42:11,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:42:11,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:42:11,929 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 35 states. [2022-04-08 11:42:11,929 INFO L87 Difference]: Start difference. First operand has 35 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 35 states. [2022-04-08 11:42:11,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:42:11,930 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-08 11:42:11,931 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-08 11:42:11,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:42:11,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:42:11,931 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:42:11,931 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:42:11,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 11:42:11,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2022-04-08 11:42:11,932 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 26 [2022-04-08 11:42:11,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:42:11,932 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2022-04-08 11:42:11,932 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 11:42:11,932 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 41 transitions. [2022-04-08 11:42:11,969 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:42:11,969 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-08 11:42:11,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 11:42:11,969 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:42:11,970 INFO L499 BasicCegarLoop]: 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-08 11:42:11,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-08 11:42:12,187 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:42:12,187 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:42:12,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:42:12,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1817538190, now seen corresponding path program 1 times [2022-04-08 11:42:12,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:42:12,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [454352552] [2022-04-08 11:42:12,194 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:42:12,194 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:42:12,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1817538190, now seen corresponding path program 2 times [2022-04-08 11:42:12,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:42:12,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845106798] [2022-04-08 11:42:12,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:42:12,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:42:12,224 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:42:12,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [961555860] [2022-04-08 11:42:12,225 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:42:12,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:42:12,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:42:12,240 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-08 11:42:12,241 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-08 11:42:12,279 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:42:12,279 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:42:12,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 11:42:12,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:42:12,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:42:12,433 INFO L272 TraceCheckUtils]: 0: Hoare triple {2358#true} call ULTIMATE.init(); {2358#true} is VALID [2022-04-08 11:42:12,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {2358#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(10, 2);~counter~0 := 0; {2366#(<= ~counter~0 0)} is VALID [2022-04-08 11:42:12,434 INFO L290 TraceCheckUtils]: 2: Hoare triple {2366#(<= ~counter~0 0)} assume true; {2366#(<= ~counter~0 0)} is VALID [2022-04-08 11:42:12,435 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2366#(<= ~counter~0 0)} {2358#true} #82#return; {2366#(<= ~counter~0 0)} is VALID [2022-04-08 11:42:12,435 INFO L272 TraceCheckUtils]: 4: Hoare triple {2366#(<= ~counter~0 0)} call #t~ret4 := main(); {2366#(<= ~counter~0 0)} is VALID [2022-04-08 11:42:12,436 INFO L290 TraceCheckUtils]: 5: Hoare triple {2366#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {2366#(<= ~counter~0 0)} is VALID [2022-04-08 11:42:12,436 INFO L290 TraceCheckUtils]: 6: Hoare triple {2366#(<= ~counter~0 0)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {2382#(<= ~counter~0 1)} is VALID [2022-04-08 11:42:12,436 INFO L290 TraceCheckUtils]: 7: Hoare triple {2382#(<= ~counter~0 1)} assume !!(#t~post2 < 5);havoc #t~post2; {2382#(<= ~counter~0 1)} is VALID [2022-04-08 11:42:12,436 INFO L290 TraceCheckUtils]: 8: Hoare triple {2382#(<= ~counter~0 1)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {2382#(<= ~counter~0 1)} is VALID [2022-04-08 11:42:12,437 INFO L290 TraceCheckUtils]: 9: Hoare triple {2382#(<= ~counter~0 1)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {2392#(<= ~counter~0 2)} is VALID [2022-04-08 11:42:12,437 INFO L290 TraceCheckUtils]: 10: Hoare triple {2392#(<= ~counter~0 2)} assume !!(#t~post2 < 5);havoc #t~post2; {2392#(<= ~counter~0 2)} is VALID [2022-04-08 11:42:12,437 INFO L290 TraceCheckUtils]: 11: Hoare triple {2392#(<= ~counter~0 2)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {2392#(<= ~counter~0 2)} is VALID [2022-04-08 11:42:12,438 INFO L290 TraceCheckUtils]: 12: Hoare triple {2392#(<= ~counter~0 2)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2402#(<= ~counter~0 3)} is VALID [2022-04-08 11:42:12,438 INFO L290 TraceCheckUtils]: 13: Hoare triple {2402#(<= ~counter~0 3)} assume !!(#t~post3 < 5);havoc #t~post3; {2402#(<= ~counter~0 3)} is VALID [2022-04-08 11:42:12,438 INFO L272 TraceCheckUtils]: 14: Hoare triple {2402#(<= ~counter~0 3)} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2402#(<= ~counter~0 3)} is VALID [2022-04-08 11:42:12,439 INFO L290 TraceCheckUtils]: 15: Hoare triple {2402#(<= ~counter~0 3)} ~cond := #in~cond; {2402#(<= ~counter~0 3)} is VALID [2022-04-08 11:42:12,439 INFO L290 TraceCheckUtils]: 16: Hoare triple {2402#(<= ~counter~0 3)} assume !(0 == ~cond); {2402#(<= ~counter~0 3)} is VALID [2022-04-08 11:42:12,439 INFO L290 TraceCheckUtils]: 17: Hoare triple {2402#(<= ~counter~0 3)} assume true; {2402#(<= ~counter~0 3)} is VALID [2022-04-08 11:42:12,440 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2402#(<= ~counter~0 3)} {2402#(<= ~counter~0 3)} #78#return; {2402#(<= ~counter~0 3)} is VALID [2022-04-08 11:42:12,440 INFO L290 TraceCheckUtils]: 19: Hoare triple {2402#(<= ~counter~0 3)} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {2402#(<= ~counter~0 3)} is VALID [2022-04-08 11:42:12,440 INFO L290 TraceCheckUtils]: 20: Hoare triple {2402#(<= ~counter~0 3)} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {2402#(<= ~counter~0 3)} is VALID [2022-04-08 11:42:12,441 INFO L290 TraceCheckUtils]: 21: Hoare triple {2402#(<= ~counter~0 3)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2430#(<= |main_#t~post3| 3)} is VALID [2022-04-08 11:42:12,441 INFO L290 TraceCheckUtils]: 22: Hoare triple {2430#(<= |main_#t~post3| 3)} assume !(#t~post3 < 5);havoc #t~post3; {2359#false} is VALID [2022-04-08 11:42:12,441 INFO L272 TraceCheckUtils]: 23: Hoare triple {2359#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2359#false} is VALID [2022-04-08 11:42:12,441 INFO L290 TraceCheckUtils]: 24: Hoare triple {2359#false} ~cond := #in~cond; {2359#false} is VALID [2022-04-08 11:42:12,441 INFO L290 TraceCheckUtils]: 25: Hoare triple {2359#false} assume 0 == ~cond; {2359#false} is VALID [2022-04-08 11:42:12,441 INFO L290 TraceCheckUtils]: 26: Hoare triple {2359#false} assume !false; {2359#false} is VALID [2022-04-08 11:42:12,442 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 11:42:12,442 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:42:12,605 INFO L290 TraceCheckUtils]: 26: Hoare triple {2359#false} assume !false; {2359#false} is VALID [2022-04-08 11:42:12,606 INFO L290 TraceCheckUtils]: 25: Hoare triple {2359#false} assume 0 == ~cond; {2359#false} is VALID [2022-04-08 11:42:12,606 INFO L290 TraceCheckUtils]: 24: Hoare triple {2359#false} ~cond := #in~cond; {2359#false} is VALID [2022-04-08 11:42:12,606 INFO L272 TraceCheckUtils]: 23: Hoare triple {2359#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2359#false} is VALID [2022-04-08 11:42:12,606 INFO L290 TraceCheckUtils]: 22: Hoare triple {2458#(< |main_#t~post3| 5)} assume !(#t~post3 < 5);havoc #t~post3; {2359#false} is VALID [2022-04-08 11:42:12,607 INFO L290 TraceCheckUtils]: 21: Hoare triple {2462#(< ~counter~0 5)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2458#(< |main_#t~post3| 5)} is VALID [2022-04-08 11:42:12,607 INFO L290 TraceCheckUtils]: 20: Hoare triple {2462#(< ~counter~0 5)} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {2462#(< ~counter~0 5)} is VALID [2022-04-08 11:42:12,607 INFO L290 TraceCheckUtils]: 19: Hoare triple {2462#(< ~counter~0 5)} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {2462#(< ~counter~0 5)} is VALID [2022-04-08 11:42:12,608 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2358#true} {2462#(< ~counter~0 5)} #78#return; {2462#(< ~counter~0 5)} is VALID [2022-04-08 11:42:12,608 INFO L290 TraceCheckUtils]: 17: Hoare triple {2358#true} assume true; {2358#true} is VALID [2022-04-08 11:42:12,608 INFO L290 TraceCheckUtils]: 16: Hoare triple {2358#true} assume !(0 == ~cond); {2358#true} is VALID [2022-04-08 11:42:12,608 INFO L290 TraceCheckUtils]: 15: Hoare triple {2358#true} ~cond := #in~cond; {2358#true} is VALID [2022-04-08 11:42:12,608 INFO L272 TraceCheckUtils]: 14: Hoare triple {2462#(< ~counter~0 5)} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2358#true} is VALID [2022-04-08 11:42:12,608 INFO L290 TraceCheckUtils]: 13: Hoare triple {2462#(< ~counter~0 5)} assume !!(#t~post3 < 5);havoc #t~post3; {2462#(< ~counter~0 5)} is VALID [2022-04-08 11:42:12,609 INFO L290 TraceCheckUtils]: 12: Hoare triple {2402#(<= ~counter~0 3)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2462#(< ~counter~0 5)} is VALID [2022-04-08 11:42:12,609 INFO L290 TraceCheckUtils]: 11: Hoare triple {2402#(<= ~counter~0 3)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {2402#(<= ~counter~0 3)} is VALID [2022-04-08 11:42:12,611 INFO L290 TraceCheckUtils]: 10: Hoare triple {2402#(<= ~counter~0 3)} assume !!(#t~post2 < 5);havoc #t~post2; {2402#(<= ~counter~0 3)} is VALID [2022-04-08 11:42:12,614 INFO L290 TraceCheckUtils]: 9: Hoare triple {2392#(<= ~counter~0 2)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {2402#(<= ~counter~0 3)} is VALID [2022-04-08 11:42:12,614 INFO L290 TraceCheckUtils]: 8: Hoare triple {2392#(<= ~counter~0 2)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {2392#(<= ~counter~0 2)} is VALID [2022-04-08 11:42:12,620 INFO L290 TraceCheckUtils]: 7: Hoare triple {2392#(<= ~counter~0 2)} assume !!(#t~post2 < 5);havoc #t~post2; {2392#(<= ~counter~0 2)} is VALID [2022-04-08 11:42:12,620 INFO L290 TraceCheckUtils]: 6: Hoare triple {2382#(<= ~counter~0 1)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {2392#(<= ~counter~0 2)} is VALID [2022-04-08 11:42:12,621 INFO L290 TraceCheckUtils]: 5: Hoare triple {2382#(<= ~counter~0 1)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {2382#(<= ~counter~0 1)} is VALID [2022-04-08 11:42:12,621 INFO L272 TraceCheckUtils]: 4: Hoare triple {2382#(<= ~counter~0 1)} call #t~ret4 := main(); {2382#(<= ~counter~0 1)} is VALID [2022-04-08 11:42:12,622 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2382#(<= ~counter~0 1)} {2358#true} #82#return; {2382#(<= ~counter~0 1)} is VALID [2022-04-08 11:42:12,622 INFO L290 TraceCheckUtils]: 2: Hoare triple {2382#(<= ~counter~0 1)} assume true; {2382#(<= ~counter~0 1)} is VALID [2022-04-08 11:42:12,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {2358#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(10, 2);~counter~0 := 0; {2382#(<= ~counter~0 1)} is VALID [2022-04-08 11:42:12,625 INFO L272 TraceCheckUtils]: 0: Hoare triple {2358#true} call ULTIMATE.init(); {2358#true} is VALID [2022-04-08 11:42:12,625 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 11:42:12,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:42:12,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845106798] [2022-04-08 11:42:12,625 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:42:12,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961555860] [2022-04-08 11:42:12,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [961555860] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:42:12,625 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:42:12,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-04-08 11:42:12,625 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:42:12,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [454352552] [2022-04-08 11:42:12,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [454352552] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:42:12,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:42:12,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 11:42:12,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372571351] [2022-04-08 11:42:12,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:42:12,626 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2022-04-08 11:42:12,626 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:42:12,626 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 11:42:12,642 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-08 11:42:12,642 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 11:42:12,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:42:12,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 11:42:12,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-08 11:42:12,643 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 11:42:12,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:42:12,788 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2022-04-08 11:42:12,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 11:42:12,789 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2022-04-08 11:42:12,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:42:12,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 11:42:12,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 58 transitions. [2022-04-08 11:42:12,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 11:42:12,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 58 transitions. [2022-04-08 11:42:12,799 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 58 transitions. [2022-04-08 11:42:12,835 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:42:12,836 INFO L225 Difference]: With dead ends: 60 [2022-04-08 11:42:12,836 INFO L226 Difference]: Without dead ends: 53 [2022-04-08 11:42:12,836 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-04-08 11:42:12,838 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 14 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 11:42:12,838 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 102 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 11:42:12,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-08 11:42:12,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 47. [2022-04-08 11:42:12,877 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:42:12,877 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 47 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 11:42:12,877 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 47 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 11:42:12,877 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 47 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 11:42:12,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:42:12,879 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2022-04-08 11:42:12,879 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2022-04-08 11:42:12,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:42:12,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:42:12,879 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 53 states. [2022-04-08 11:42:12,879 INFO L87 Difference]: Start difference. First operand has 47 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 53 states. [2022-04-08 11:42:12,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:42:12,880 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2022-04-08 11:42:12,880 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2022-04-08 11:42:12,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:42:12,880 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:42:12,880 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:42:12,880 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:42:12,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 11:42:12,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2022-04-08 11:42:12,881 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 27 [2022-04-08 11:42:12,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:42:12,882 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2022-04-08 11:42:12,882 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 11:42:12,882 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 55 transitions. [2022-04-08 11:42:12,929 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:42:12,930 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2022-04-08 11:42:12,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 11:42:12,930 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:42:12,930 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:42:12,948 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-08 11:42:13,147 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:42:13,147 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:42:13,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:42:13,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1815750730, now seen corresponding path program 1 times [2022-04-08 11:42:13,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:42:13,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2059653237] [2022-04-08 11:42:13,153 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:42:13,153 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:42:13,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1815750730, now seen corresponding path program 2 times [2022-04-08 11:42:13,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:42:13,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78679048] [2022-04-08 11:42:13,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:42:13,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:42:13,164 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:42:13,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1345182798] [2022-04-08 11:42:13,164 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:42:13,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:42:13,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:42:13,167 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-08 11:42:13,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process