/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_unwindbound50.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 11:43:19,634 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 11:43:19,635 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 11:43:19,671 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 11:43:19,671 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 11:43:19,673 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 11:43:19,675 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 11:43:19,677 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 11:43:19,678 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 11:43:19,681 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 11:43:19,683 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 11:43:19,684 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 11:43:19,684 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 11:43:19,685 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 11:43:19,686 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 11:43:19,688 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 11:43:19,688 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 11:43:19,689 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 11:43:19,690 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 11:43:19,694 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 11:43:19,695 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 11:43:19,696 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 11:43:19,697 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 11:43:19,697 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 11:43:19,698 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 11:43:19,703 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 11:43:19,703 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 11:43:19,704 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 11:43:19,704 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 11:43:19,704 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 11:43:19,705 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 11:43:19,705 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 11:43:19,707 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 11:43:19,707 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 11:43:19,707 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 11:43:19,708 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 11:43:19,708 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 11:43:19,708 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 11:43:19,709 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 11:43:19,709 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 11:43:19,710 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 11:43:19,710 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 11:43:19,711 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:43:19,719 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 11:43:19,719 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 11:43:19,720 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 11:43:19,720 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 11:43:19,720 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 11:43:19,720 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 11:43:19,720 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 11:43:19,720 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 11:43:19,721 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 11:43:19,721 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 11:43:19,721 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 11:43:19,721 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 11:43:19,721 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 11:43:19,722 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 11:43:19,722 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 11:43:19,722 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 11:43:19,722 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 11:43:19,722 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 11:43:19,722 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 11:43:19,722 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 11:43:19,722 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 11:43:19,722 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 11:43:19,722 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:43:19,894 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 11:43:19,914 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 11:43:19,916 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 11:43:19,920 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 11:43:19,920 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 11:43:19,921 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/divbin2_unwindbound50.i [2022-04-08 11:43:20,003 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad0cbdc5a/790872604f2f4e6eb48dd0f508873232/FLAG09b108ad6 [2022-04-08 11:43:20,404 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 11:43:20,404 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin2_unwindbound50.i [2022-04-08 11:43:20,409 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad0cbdc5a/790872604f2f4e6eb48dd0f508873232/FLAG09b108ad6 [2022-04-08 11:43:20,426 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad0cbdc5a/790872604f2f4e6eb48dd0f508873232 [2022-04-08 11:43:20,428 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 11:43:20,429 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 11:43:20,431 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 11:43:20,431 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 11:43:20,434 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 11:43:20,435 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 11:43:20" (1/1) ... [2022-04-08 11:43:20,437 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17c5874d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:43:20, skipping insertion in model container [2022-04-08 11:43:20,437 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 11:43:20" (1/1) ... [2022-04-08 11:43:20,444 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 11:43:20,456 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 11:43:20,609 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_unwindbound50.i[951,964] [2022-04-08 11:43:20,636 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 11:43:20,644 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 11:43:20,655 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_unwindbound50.i[951,964] [2022-04-08 11:43:20,669 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 11:43:20,680 INFO L208 MainTranslator]: Completed translation [2022-04-08 11:43:20,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:43:20 WrapperNode [2022-04-08 11:43:20,680 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 11:43:20,681 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 11:43:20,681 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 11:43:20,681 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 11:43:20,689 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:43:20" (1/1) ... [2022-04-08 11:43:20,690 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:43:20" (1/1) ... [2022-04-08 11:43:20,695 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:43:20" (1/1) ... [2022-04-08 11:43:20,695 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:43:20" (1/1) ... [2022-04-08 11:43:20,708 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:43:20" (1/1) ... [2022-04-08 11:43:20,721 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:43:20" (1/1) ... [2022-04-08 11:43:20,726 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:43:20" (1/1) ... [2022-04-08 11:43:20,729 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 11:43:20,730 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 11:43:20,730 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 11:43:20,730 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 11:43:20,731 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:43:20" (1/1) ... [2022-04-08 11:43:20,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 11:43:20,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:43:20,769 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:43:20,787 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:43:20,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 11:43:20,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 11:43:20,805 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 11:43:20,805 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 11:43:20,805 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 11:43:20,805 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 11:43:20,805 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 11:43:20,805 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 11:43:20,806 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-08 11:43:20,806 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-08 11:43:20,806 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 11:43:20,806 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 11:43:20,806 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-08 11:43:20,806 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 11:43:20,807 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 11:43:20,807 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 11:43:20,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 11:43:20,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 11:43:20,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 11:43:20,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 11:43:20,808 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 11:43:20,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 11:43:20,875 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 11:43:20,878 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 11:43:21,013 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 11:43:21,018 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 11:43:21,018 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-08 11:43:21,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 11:43:21 BoogieIcfgContainer [2022-04-08 11:43:21,019 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 11:43:21,021 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 11:43:21,021 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 11:43:21,023 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 11:43:21,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 11:43:20" (1/3) ... [2022-04-08 11:43:21,024 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a3f4346 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 11:43:21, skipping insertion in model container [2022-04-08 11:43:21,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:43:20" (2/3) ... [2022-04-08 11:43:21,024 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a3f4346 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 11:43:21, skipping insertion in model container [2022-04-08 11:43:21,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 11:43:21" (3/3) ... [2022-04-08 11:43:21,025 INFO L111 eAbstractionObserver]: Analyzing ICFG divbin2_unwindbound50.i [2022-04-08 11:43:21,028 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 11:43:21,028 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 11:43:21,060 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 11:43:21,064 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:43:21,065 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 11:43:21,106 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:43:21,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 11:43:21,113 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:43:21,114 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:43:21,114 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:43:21,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:43:21,117 INFO L85 PathProgramCache]: Analyzing trace with hash -2126508982, now seen corresponding path program 1 times [2022-04-08 11:43:21,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:43:21,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [904129454] [2022-04-08 11:43:21,129 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:43:21,130 INFO L85 PathProgramCache]: Analyzing trace with hash -2126508982, now seen corresponding path program 2 times [2022-04-08 11:43:21,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:43:21,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388986361] [2022-04-08 11:43:21,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:43:21,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:43:21,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:43:21,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 11:43:21,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:43:21,240 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:43:21,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-08 11:43:21,241 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29#true} {29#true} #82#return; {29#true} is VALID [2022-04-08 11:43:21,242 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:43:21,243 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:43:21,243 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-08 11:43:21,243 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29#true} {29#true} #82#return; {29#true} is VALID [2022-04-08 11:43:21,243 INFO L272 TraceCheckUtils]: 4: Hoare triple {29#true} call #t~ret4 := main(); {29#true} is VALID [2022-04-08 11:43:21,243 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:43:21,244 INFO L290 TraceCheckUtils]: 6: Hoare triple {29#true} assume !true; {30#false} is VALID [2022-04-08 11:43:21,244 INFO L290 TraceCheckUtils]: 7: Hoare triple {30#false} assume !true; {30#false} is VALID [2022-04-08 11:43:21,244 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:43:21,244 INFO L290 TraceCheckUtils]: 9: Hoare triple {30#false} ~cond := #in~cond; {30#false} is VALID [2022-04-08 11:43:21,245 INFO L290 TraceCheckUtils]: 10: Hoare triple {30#false} assume 0 == ~cond; {30#false} is VALID [2022-04-08 11:43:21,245 INFO L290 TraceCheckUtils]: 11: Hoare triple {30#false} assume !false; {30#false} is VALID [2022-04-08 11:43:21,245 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:43:21,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:43:21,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388986361] [2022-04-08 11:43:21,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388986361] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:43:21,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:43:21,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 11:43:21,248 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:43:21,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [904129454] [2022-04-08 11:43:21,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [904129454] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:43:21,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:43:21,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 11:43:21,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776596941] [2022-04-08 11:43:21,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:43:21,253 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:43:21,253 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:43:21,255 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:43:21,268 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:43:21,268 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 11:43:21,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:43:21,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 11:43:21,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 11:43:21,284 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:43:21,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:43:21,414 INFO L93 Difference]: Finished difference Result 44 states and 60 transitions. [2022-04-08 11:43:21,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 11:43:21,414 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:43:21,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:43:21,415 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:43:21,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-04-08 11:43:21,421 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:43:21,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-04-08 11:43:21,435 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 60 transitions. [2022-04-08 11:43:21,500 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:43:21,511 INFO L225 Difference]: With dead ends: 44 [2022-04-08 11:43:21,512 INFO L226 Difference]: Without dead ends: 22 [2022-04-08 11:43:21,514 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:43:21,517 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:43:21,518 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:43:21,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-08 11:43:21,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-04-08 11:43:21,543 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:43:21,544 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:43:21,544 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:43:21,544 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:43:21,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:43:21,547 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-04-08 11:43:21,547 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-08 11:43:21,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:43:21,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:43:21,548 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:43:21,548 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:43:21,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:43:21,550 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-04-08 11:43:21,550 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-08 11:43:21,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:43:21,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:43:21,550 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:43:21,551 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:43:21,551 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:43:21,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2022-04-08 11:43:21,553 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 12 [2022-04-08 11:43:21,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:43:21,554 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2022-04-08 11:43:21,555 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:43:21,555 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 26 transitions. [2022-04-08 11:43:21,579 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:43:21,579 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2022-04-08 11:43:21,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-08 11:43:21,580 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:43:21,580 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:43:21,580 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 11:43:21,581 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:43:21,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:43:21,581 INFO L85 PathProgramCache]: Analyzing trace with hash 941422680, now seen corresponding path program 1 times [2022-04-08 11:43:21,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:43:21,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [585316707] [2022-04-08 11:43:21,582 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:43:21,582 INFO L85 PathProgramCache]: Analyzing trace with hash 941422680, now seen corresponding path program 2 times [2022-04-08 11:43:21,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:43:21,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103068422] [2022-04-08 11:43:21,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:43:21,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:43:21,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:43:21,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 11:43:21,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:43:21,660 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:43:21,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {216#(<= ~counter~0 0)} assume true; {216#(<= ~counter~0 0)} is VALID [2022-04-08 11:43:21,662 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {216#(<= ~counter~0 0)} {211#true} #82#return; {216#(<= ~counter~0 0)} is VALID [2022-04-08 11:43:21,662 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:43:21,663 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:43:21,664 INFO L290 TraceCheckUtils]: 2: Hoare triple {216#(<= ~counter~0 0)} assume true; {216#(<= ~counter~0 0)} is VALID [2022-04-08 11:43:21,664 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {216#(<= ~counter~0 0)} {211#true} #82#return; {216#(<= ~counter~0 0)} is VALID [2022-04-08 11:43:21,665 INFO L272 TraceCheckUtils]: 4: Hoare triple {216#(<= ~counter~0 0)} call #t~ret4 := main(); {216#(<= ~counter~0 0)} is VALID [2022-04-08 11:43:21,665 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:43:21,666 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:43:21,666 INFO L290 TraceCheckUtils]: 7: Hoare triple {217#(<= |main_#t~post2| 0)} assume !(#t~post2 < 50);havoc #t~post2; {212#false} is VALID [2022-04-08 11:43:21,667 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:43:21,667 INFO L290 TraceCheckUtils]: 9: Hoare triple {212#false} assume !(#t~post3 < 50);havoc #t~post3; {212#false} is VALID [2022-04-08 11:43:21,667 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:43:21,667 INFO L290 TraceCheckUtils]: 11: Hoare triple {212#false} ~cond := #in~cond; {212#false} is VALID [2022-04-08 11:43:21,667 INFO L290 TraceCheckUtils]: 12: Hoare triple {212#false} assume 0 == ~cond; {212#false} is VALID [2022-04-08 11:43:21,668 INFO L290 TraceCheckUtils]: 13: Hoare triple {212#false} assume !false; {212#false} is VALID [2022-04-08 11:43:21,668 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:43:21,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:43:21,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103068422] [2022-04-08 11:43:21,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103068422] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:43:21,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:43:21,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 11:43:21,671 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:43:21,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [585316707] [2022-04-08 11:43:21,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [585316707] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:43:21,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:43:21,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 11:43:21,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271088364] [2022-04-08 11:43:21,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:43:21,674 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:43:21,675 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:43:21,675 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:43:21,686 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:43:21,686 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 11:43:21,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:43:21,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 11:43:21,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 11:43:21,688 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:43:21,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:43:21,818 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-08 11:43:21,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 11:43:21,819 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:43:21,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:43:21,819 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:43:21,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-04-08 11:43:21,821 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:43:21,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-04-08 11:43:21,822 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 44 transitions. [2022-04-08 11:43:21,853 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:43:21,854 INFO L225 Difference]: With dead ends: 35 [2022-04-08 11:43:21,854 INFO L226 Difference]: Without dead ends: 23 [2022-04-08 11:43:21,855 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:43:21,855 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:43:21,856 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:43:21,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-08 11:43:21,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-08 11:43:21,862 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:43:21,863 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:43:21,863 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:43:21,863 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:43:21,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:43:21,864 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-04-08 11:43:21,864 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-08 11:43:21,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:43:21,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:43:21,865 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:43:21,865 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:43:21,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:43:21,866 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-04-08 11:43:21,866 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-08 11:43:21,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:43:21,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:43:21,867 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:43:21,867 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:43:21,867 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:43:21,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2022-04-08 11:43:21,868 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 14 [2022-04-08 11:43:21,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:43:21,868 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2022-04-08 11:43:21,868 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:43:21,868 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 28 transitions. [2022-04-08 11:43:21,889 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:43:21,889 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-08 11:43:21,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-08 11:43:21,889 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:43:21,889 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:43:21,890 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 11:43:21,890 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:43:21,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:43:21,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1209133518, now seen corresponding path program 1 times [2022-04-08 11:43:21,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:43:21,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1461676489] [2022-04-08 11:43:21,891 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:43:21,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1209133518, now seen corresponding path program 2 times [2022-04-08 11:43:21,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:43:21,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155854894] [2022-04-08 11:43:21,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:43:21,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:43:21,905 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:43:21,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1063729648] [2022-04-08 11:43:21,905 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:43:21,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:43:21,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:43:21,907 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:43:21,908 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:43:21,943 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 11:43:21,943 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:43:21,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 11:43:21,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:43:21,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:43:22,077 INFO L272 TraceCheckUtils]: 0: Hoare triple {385#true} call ULTIMATE.init(); {385#true} is VALID [2022-04-08 11:43:22,078 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:43:22,079 INFO L290 TraceCheckUtils]: 2: Hoare triple {393#(<= ~counter~0 0)} assume true; {393#(<= ~counter~0 0)} is VALID [2022-04-08 11:43:22,079 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {393#(<= ~counter~0 0)} {385#true} #82#return; {393#(<= ~counter~0 0)} is VALID [2022-04-08 11:43:22,080 INFO L272 TraceCheckUtils]: 4: Hoare triple {393#(<= ~counter~0 0)} call #t~ret4 := main(); {393#(<= ~counter~0 0)} is VALID [2022-04-08 11:43:22,080 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:43:22,081 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:43:22,081 INFO L290 TraceCheckUtils]: 7: Hoare triple {409#(<= ~counter~0 1)} assume !!(#t~post2 < 50);havoc #t~post2; {409#(<= ~counter~0 1)} is VALID [2022-04-08 11:43:22,082 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:43:22,083 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:43:22,083 INFO L290 TraceCheckUtils]: 10: Hoare triple {419#(<= |main_#t~post3| 1)} assume !(#t~post3 < 50);havoc #t~post3; {386#false} is VALID [2022-04-08 11:43:22,083 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:43:22,083 INFO L290 TraceCheckUtils]: 12: Hoare triple {386#false} ~cond := #in~cond; {386#false} is VALID [2022-04-08 11:43:22,084 INFO L290 TraceCheckUtils]: 13: Hoare triple {386#false} assume 0 == ~cond; {386#false} is VALID [2022-04-08 11:43:22,084 INFO L290 TraceCheckUtils]: 14: Hoare triple {386#false} assume !false; {386#false} is VALID [2022-04-08 11:43:22,084 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:43:22,084 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 11:43:22,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:43:22,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155854894] [2022-04-08 11:43:22,085 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:43:22,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063729648] [2022-04-08 11:43:22,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063729648] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:43:22,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:43:22,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:43:22,086 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:43:22,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1461676489] [2022-04-08 11:43:22,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1461676489] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:43:22,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:43:22,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:43:22,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928727344] [2022-04-08 11:43:22,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:43:22,087 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:43:22,088 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:43:22,088 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:43:22,101 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:43:22,102 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 11:43:22,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:43:22,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 11:43:22,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-08 11:43:22,103 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:43:22,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:43:22,187 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2022-04-08 11:43:22,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 11:43:22,187 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:43:22,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:43:22,188 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:43:22,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-08 11:43:22,190 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:43:22,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-08 11:43:22,193 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2022-04-08 11:43:22,220 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:43:22,221 INFO L225 Difference]: With dead ends: 34 [2022-04-08 11:43:22,221 INFO L226 Difference]: Without dead ends: 27 [2022-04-08 11:43:22,222 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:43:22,225 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:43:22,230 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:43:22,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-08 11:43:22,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-04-08 11:43:22,241 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:43:22,241 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:43:22,241 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:43:22,242 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:43:22,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:43:22,243 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2022-04-08 11:43:22,243 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-04-08 11:43:22,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:43:22,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:43:22,243 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:43:22,244 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:43:22,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:43:22,245 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2022-04-08 11:43:22,245 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-04-08 11:43:22,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:43:22,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:43:22,245 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:43:22,245 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:43:22,246 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:43:22,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2022-04-08 11:43:22,247 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 15 [2022-04-08 11:43:22,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:43:22,247 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2022-04-08 11:43:22,247 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:43:22,247 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 32 transitions. [2022-04-08 11:43:22,274 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:43:22,274 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2022-04-08 11:43:22,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-08 11:43:22,274 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:43:22,275 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:43:22,294 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:43:22,491 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:43:22,491 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:43:22,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:43:22,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1207346058, now seen corresponding path program 1 times [2022-04-08 11:43:22,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:43:22,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1802274571] [2022-04-08 11:43:22,493 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:43:22,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1207346058, now seen corresponding path program 2 times [2022-04-08 11:43:22,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:43:22,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376770670] [2022-04-08 11:43:22,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:43:22,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:43:22,512 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:43:22,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1364486444] [2022-04-08 11:43:22,512 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:43:22,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:43:22,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:43:22,517 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:43:22,518 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:43:22,562 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 11:43:22,563 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:43:22,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-08 11:43:22,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:43:22,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:43:22,800 INFO L272 TraceCheckUtils]: 0: Hoare triple {608#true} call ULTIMATE.init(); {608#true} is VALID [2022-04-08 11:43:22,800 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:43:22,800 INFO L290 TraceCheckUtils]: 2: Hoare triple {608#true} assume true; {608#true} is VALID [2022-04-08 11:43:22,801 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {608#true} {608#true} #82#return; {608#true} is VALID [2022-04-08 11:43:22,801 INFO L272 TraceCheckUtils]: 4: Hoare triple {608#true} call #t~ret4 := main(); {608#true} is VALID [2022-04-08 11:43:22,801 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:43:22,802 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:43:22,803 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 < 50);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:43:22,803 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:43:22,804 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:43:22,804 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 < 50);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:43:22,805 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:43:22,806 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:43:22,806 INFO L290 TraceCheckUtils]: 13: Hoare triple {652#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {609#false} is VALID [2022-04-08 11:43:22,807 INFO L290 TraceCheckUtils]: 14: Hoare triple {609#false} assume !false; {609#false} is VALID [2022-04-08 11:43:22,807 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:43:22,807 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 11:43:22,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:43:22,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376770670] [2022-04-08 11:43:22,807 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:43:22,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364486444] [2022-04-08 11:43:22,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1364486444] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:43:22,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:43:22,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 11:43:22,808 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:43:22,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1802274571] [2022-04-08 11:43:22,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1802274571] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:43:22,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:43:22,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 11:43:22,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179085439] [2022-04-08 11:43:22,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:43:22,809 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:43:22,809 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:43:22,809 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:43:22,822 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:43:22,823 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 11:43:22,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:43:22,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 11:43:22,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-08 11:43:22,823 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:43:22,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:43:22,982 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2022-04-08 11:43:22,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 11:43:22,983 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:43:22,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:43:22,983 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:43:22,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-04-08 11:43:22,987 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:43:22,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-04-08 11:43:22,989 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 42 transitions. [2022-04-08 11:43:23,020 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:43:23,021 INFO L225 Difference]: With dead ends: 35 [2022-04-08 11:43:23,021 INFO L226 Difference]: Without dead ends: 32 [2022-04-08 11:43:23,021 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:43:23,022 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 9 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-08 11:43:23,022 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.0s Time] [2022-04-08 11:43:23,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-08 11:43:23,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-08 11:43:23,035 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:43:23,035 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:43:23,036 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:43:23,036 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:43:23,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:43:23,037 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2022-04-08 11:43:23,037 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-04-08 11:43:23,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:43:23,038 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:43:23,038 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:43:23,038 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:43:23,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:43:23,039 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2022-04-08 11:43:23,039 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-04-08 11:43:23,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:43:23,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:43:23,040 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:43:23,040 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:43:23,040 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:43:23,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-04-08 11:43:23,041 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 15 [2022-04-08 11:43:23,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:43:23,041 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-04-08 11:43:23,041 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:43:23,041 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 38 transitions. [2022-04-08 11:43:23,073 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:43:23,074 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-04-08 11:43:23,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 11:43:23,074 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:43:23,074 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:43:23,091 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:43:23,287 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:43:23,288 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:43:23,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:43:23,288 INFO L85 PathProgramCache]: Analyzing trace with hash -352921097, now seen corresponding path program 1 times [2022-04-08 11:43:23,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:43:23,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1422607892] [2022-04-08 11:43:23,322 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:43:23,322 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:43:23,322 INFO L85 PathProgramCache]: Analyzing trace with hash -352921097, now seen corresponding path program 2 times [2022-04-08 11:43:23,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:43:23,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25789152] [2022-04-08 11:43:23,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:43:23,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:43:23,346 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:43:23,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1056856598] [2022-04-08 11:43:23,346 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:43:23,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:43:23,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:43:23,360 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:43:23,361 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:43:23,401 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 11:43:23,402 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:43:23,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 11:43:23,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:43:23,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:43:23,478 INFO L272 TraceCheckUtils]: 0: Hoare triple {858#true} call ULTIMATE.init(); {858#true} is VALID [2022-04-08 11:43:23,479 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:43:23,479 INFO L290 TraceCheckUtils]: 2: Hoare triple {858#true} assume true; {858#true} is VALID [2022-04-08 11:43:23,479 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {858#true} {858#true} #82#return; {858#true} is VALID [2022-04-08 11:43:23,479 INFO L272 TraceCheckUtils]: 4: Hoare triple {858#true} call #t~ret4 := main(); {858#true} is VALID [2022-04-08 11:43:23,480 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:43:23,480 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:43:23,480 INFO L290 TraceCheckUtils]: 7: Hoare triple {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post2 < 50);havoc #t~post2; {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:43:23,481 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:43:23,481 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:43:23,482 INFO L290 TraceCheckUtils]: 10: Hoare triple {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(#t~post2 < 50);havoc #t~post2; {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:43:23,482 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:43:23,482 INFO L290 TraceCheckUtils]: 12: Hoare triple {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(#t~post3 < 50);havoc #t~post3; {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:43:23,483 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:43:23,483 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:43:23,484 INFO L290 TraceCheckUtils]: 15: Hoare triple {907#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {859#false} is VALID [2022-04-08 11:43:23,484 INFO L290 TraceCheckUtils]: 16: Hoare triple {859#false} assume !false; {859#false} is VALID [2022-04-08 11:43:23,484 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:43:23,484 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 11:43:23,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:43:23,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25789152] [2022-04-08 11:43:23,485 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:43:23,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056856598] [2022-04-08 11:43:23,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056856598] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:43:23,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:43:23,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:43:23,485 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:43:23,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1422607892] [2022-04-08 11:43:23,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1422607892] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:43:23,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:43:23,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:43:23,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268303272] [2022-04-08 11:43:23,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:43:23,486 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:43:23,486 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:43:23,486 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:43:23,496 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:43:23,497 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 11:43:23,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:43:23,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 11:43:23,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 11:43:23,498 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:43:23,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:43:23,605 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2022-04-08 11:43:23,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 11:43:23,605 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:43:23,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:43:23,605 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:43:23,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-08 11:43:23,606 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:43:23,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-08 11:43:23,607 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2022-04-08 11:43:23,637 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:43:23,639 INFO L225 Difference]: With dead ends: 44 [2022-04-08 11:43:23,639 INFO L226 Difference]: Without dead ends: 41 [2022-04-08 11:43:23,639 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:43:23,639 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:43:23,640 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:43:23,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-08 11:43:23,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 32. [2022-04-08 11:43:23,654 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:43:23,655 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:43:23,655 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:43:23,655 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:43:23,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:43:23,656 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-08 11:43:23,656 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2022-04-08 11:43:23,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:43:23,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:43:23,657 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:43:23,657 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:43:23,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:43:23,658 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-08 11:43:23,658 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2022-04-08 11:43:23,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:43:23,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:43:23,659 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:43:23,659 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:43:23,659 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:43:23,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-04-08 11:43:23,660 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 17 [2022-04-08 11:43:23,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:43:23,660 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-04-08 11:43:23,660 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:43:23,660 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 38 transitions. [2022-04-08 11:43:23,692 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:43:23,693 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-04-08 11:43:23,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 11:43:23,693 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:43:23,693 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:43:23,710 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:43:23,905 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:43:23,906 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:43:23,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:43:23,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1626008211, now seen corresponding path program 1 times [2022-04-08 11:43:23,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:43:23,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1264276609] [2022-04-08 11:43:23,907 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:43:23,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1626008211, now seen corresponding path program 2 times [2022-04-08 11:43:23,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:43:23,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404870331] [2022-04-08 11:43:23,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:43:23,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:43:23,922 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:43:23,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [285338248] [2022-04-08 11:43:23,922 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:43:23,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:43:23,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:43:23,930 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:43:23,932 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:43:23,965 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:43:23,966 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:43:23,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 11:43:23,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:43:23,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:43:24,090 INFO L272 TraceCheckUtils]: 0: Hoare triple {1149#true} call ULTIMATE.init(); {1149#true} is VALID [2022-04-08 11:43:24,091 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:43:24,091 INFO L290 TraceCheckUtils]: 2: Hoare triple {1157#(<= ~counter~0 0)} assume true; {1157#(<= ~counter~0 0)} is VALID [2022-04-08 11:43:24,092 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1157#(<= ~counter~0 0)} {1149#true} #82#return; {1157#(<= ~counter~0 0)} is VALID [2022-04-08 11:43:24,092 INFO L272 TraceCheckUtils]: 4: Hoare triple {1157#(<= ~counter~0 0)} call #t~ret4 := main(); {1157#(<= ~counter~0 0)} is VALID [2022-04-08 11:43:24,093 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:43:24,093 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:43:24,093 INFO L290 TraceCheckUtils]: 7: Hoare triple {1173#(<= ~counter~0 1)} assume !!(#t~post2 < 50);havoc #t~post2; {1173#(<= ~counter~0 1)} is VALID [2022-04-08 11:43:24,094 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:43:24,094 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:43:24,094 INFO L290 TraceCheckUtils]: 10: Hoare triple {1183#(<= ~counter~0 2)} assume !!(#t~post3 < 50);havoc #t~post3; {1183#(<= ~counter~0 2)} is VALID [2022-04-08 11:43:24,095 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:43:24,095 INFO L290 TraceCheckUtils]: 12: Hoare triple {1183#(<= ~counter~0 2)} ~cond := #in~cond; {1183#(<= ~counter~0 2)} is VALID [2022-04-08 11:43:24,096 INFO L290 TraceCheckUtils]: 13: Hoare triple {1183#(<= ~counter~0 2)} assume !(0 == ~cond); {1183#(<= ~counter~0 2)} is VALID [2022-04-08 11:43:24,096 INFO L290 TraceCheckUtils]: 14: Hoare triple {1183#(<= ~counter~0 2)} assume true; {1183#(<= ~counter~0 2)} is VALID [2022-04-08 11:43:24,096 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:43:24,097 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:43:24,097 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:43:24,097 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:43:24,098 INFO L290 TraceCheckUtils]: 19: Hoare triple {1211#(<= |main_#t~post3| 2)} assume !(#t~post3 < 50);havoc #t~post3; {1150#false} is VALID [2022-04-08 11:43:24,098 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:43:24,098 INFO L290 TraceCheckUtils]: 21: Hoare triple {1150#false} ~cond := #in~cond; {1150#false} is VALID [2022-04-08 11:43:24,098 INFO L290 TraceCheckUtils]: 22: Hoare triple {1150#false} assume 0 == ~cond; {1150#false} is VALID [2022-04-08 11:43:24,098 INFO L290 TraceCheckUtils]: 23: Hoare triple {1150#false} assume !false; {1150#false} is VALID [2022-04-08 11:43:24,099 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:43:24,099 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:43:24,227 INFO L290 TraceCheckUtils]: 23: Hoare triple {1150#false} assume !false; {1150#false} is VALID [2022-04-08 11:43:24,228 INFO L290 TraceCheckUtils]: 22: Hoare triple {1150#false} assume 0 == ~cond; {1150#false} is VALID [2022-04-08 11:43:24,228 INFO L290 TraceCheckUtils]: 21: Hoare triple {1150#false} ~cond := #in~cond; {1150#false} is VALID [2022-04-08 11:43:24,228 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:43:24,228 INFO L290 TraceCheckUtils]: 19: Hoare triple {1239#(< |main_#t~post3| 50)} assume !(#t~post3 < 50);havoc #t~post3; {1150#false} is VALID [2022-04-08 11:43:24,229 INFO L290 TraceCheckUtils]: 18: Hoare triple {1243#(< ~counter~0 50)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1239#(< |main_#t~post3| 50)} is VALID [2022-04-08 11:43:24,229 INFO L290 TraceCheckUtils]: 17: Hoare triple {1243#(< ~counter~0 50)} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1243#(< ~counter~0 50)} is VALID [2022-04-08 11:43:24,229 INFO L290 TraceCheckUtils]: 16: Hoare triple {1243#(< ~counter~0 50)} 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 50)} is VALID [2022-04-08 11:43:24,230 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1149#true} {1243#(< ~counter~0 50)} #78#return; {1243#(< ~counter~0 50)} is VALID [2022-04-08 11:43:24,230 INFO L290 TraceCheckUtils]: 14: Hoare triple {1149#true} assume true; {1149#true} is VALID [2022-04-08 11:43:24,230 INFO L290 TraceCheckUtils]: 13: Hoare triple {1149#true} assume !(0 == ~cond); {1149#true} is VALID [2022-04-08 11:43:24,230 INFO L290 TraceCheckUtils]: 12: Hoare triple {1149#true} ~cond := #in~cond; {1149#true} is VALID [2022-04-08 11:43:24,230 INFO L272 TraceCheckUtils]: 11: Hoare triple {1243#(< ~counter~0 50)} 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:43:24,231 INFO L290 TraceCheckUtils]: 10: Hoare triple {1243#(< ~counter~0 50)} assume !!(#t~post3 < 50);havoc #t~post3; {1243#(< ~counter~0 50)} is VALID [2022-04-08 11:43:24,231 INFO L290 TraceCheckUtils]: 9: Hoare triple {1271#(< ~counter~0 49)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1243#(< ~counter~0 50)} is VALID [2022-04-08 11:43:24,231 INFO L290 TraceCheckUtils]: 8: Hoare triple {1271#(< ~counter~0 49)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1271#(< ~counter~0 49)} is VALID [2022-04-08 11:43:24,232 INFO L290 TraceCheckUtils]: 7: Hoare triple {1271#(< ~counter~0 49)} assume !!(#t~post2 < 50);havoc #t~post2; {1271#(< ~counter~0 49)} is VALID [2022-04-08 11:43:24,232 INFO L290 TraceCheckUtils]: 6: Hoare triple {1281#(< ~counter~0 48)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {1271#(< ~counter~0 49)} is VALID [2022-04-08 11:43:24,233 INFO L290 TraceCheckUtils]: 5: Hoare triple {1281#(< ~counter~0 48)} 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; {1281#(< ~counter~0 48)} is VALID [2022-04-08 11:43:24,233 INFO L272 TraceCheckUtils]: 4: Hoare triple {1281#(< ~counter~0 48)} call #t~ret4 := main(); {1281#(< ~counter~0 48)} is VALID [2022-04-08 11:43:24,233 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1281#(< ~counter~0 48)} {1149#true} #82#return; {1281#(< ~counter~0 48)} is VALID [2022-04-08 11:43:24,234 INFO L290 TraceCheckUtils]: 2: Hoare triple {1281#(< ~counter~0 48)} assume true; {1281#(< ~counter~0 48)} is VALID [2022-04-08 11:43:24,234 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; {1281#(< ~counter~0 48)} is VALID [2022-04-08 11:43:24,234 INFO L272 TraceCheckUtils]: 0: Hoare triple {1149#true} call ULTIMATE.init(); {1149#true} is VALID [2022-04-08 11:43:24,234 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:43:24,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:43:24,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404870331] [2022-04-08 11:43:24,235 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:43:24,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285338248] [2022-04-08 11:43:24,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285338248] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:43:24,235 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:43:24,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-08 11:43:24,235 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:43:24,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1264276609] [2022-04-08 11:43:24,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1264276609] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:43:24,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:43:24,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 11:43:24,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618395268] [2022-04-08 11:43:24,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:43:24,236 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:43:24,236 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:43:24,236 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:43:24,250 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:43:24,251 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 11:43:24,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:43:24,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 11:43:24,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-08 11:43:24,251 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:43:24,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:43:24,352 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-04-08 11:43:24,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 11:43:24,352 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:43:24,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:43:24,353 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:43:24,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2022-04-08 11:43:24,354 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:43:24,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2022-04-08 11:43:24,355 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 55 transitions. [2022-04-08 11:43:24,394 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:43:24,395 INFO L225 Difference]: With dead ends: 57 [2022-04-08 11:43:24,395 INFO L226 Difference]: Without dead ends: 50 [2022-04-08 11:43:24,395 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-04-08 11:43:24,396 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:43:24,396 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:43:24,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-08 11:43:24,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 44. [2022-04-08 11:43:24,424 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:43:24,424 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:43:24,425 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:43:24,425 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:43:24,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:43:24,426 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2022-04-08 11:43:24,426 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2022-04-08 11:43:24,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:43:24,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:43:24,427 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:43:24,427 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:43:24,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:43:24,428 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2022-04-08 11:43:24,428 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2022-04-08 11:43:24,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:43:24,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:43:24,428 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:43:24,428 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:43:24,429 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:43:24,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2022-04-08 11:43:24,430 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 24 [2022-04-08 11:43:24,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:43:24,430 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2022-04-08 11:43:24,430 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:43:24,430 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 52 transitions. [2022-04-08 11:43:24,475 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:43:24,476 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-04-08 11:43:24,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 11:43:24,476 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:43:24,477 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:43:24,495 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:43:24,686 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:43:24,687 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:43:24,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:43:24,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1627795671, now seen corresponding path program 1 times [2022-04-08 11:43:24,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:43:24,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [461130801] [2022-04-08 11:43:24,689 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:43:24,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1627795671, now seen corresponding path program 2 times [2022-04-08 11:43:24,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:43:24,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344370892] [2022-04-08 11:43:24,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:43:24,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:43:24,723 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:43:24,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1242068842] [2022-04-08 11:43:24,723 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:43:24,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:43:24,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:43:24,743 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:43:24,744 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:43:24,796 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:43:24,796 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:43:24,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 11:43:24,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:43:24,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:43:24,871 INFO L272 TraceCheckUtils]: 0: Hoare triple {1606#true} call ULTIMATE.init(); {1606#true} is VALID [2022-04-08 11:43:24,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {1606#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; {1606#true} is VALID [2022-04-08 11:43:24,872 INFO L290 TraceCheckUtils]: 2: Hoare triple {1606#true} assume true; {1606#true} is VALID [2022-04-08 11:43:24,872 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1606#true} {1606#true} #82#return; {1606#true} is VALID [2022-04-08 11:43:24,872 INFO L272 TraceCheckUtils]: 4: Hoare triple {1606#true} call #t~ret4 := main(); {1606#true} is VALID [2022-04-08 11:43:24,872 INFO L290 TraceCheckUtils]: 5: Hoare triple {1606#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; {1626#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-08 11:43:24,873 INFO L290 TraceCheckUtils]: 6: Hoare triple {1626#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {1626#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-08 11:43:24,873 INFO L290 TraceCheckUtils]: 7: Hoare triple {1626#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !!(#t~post2 < 50);havoc #t~post2; {1626#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-08 11:43:24,874 INFO L290 TraceCheckUtils]: 8: Hoare triple {1626#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1626#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-08 11:43:24,874 INFO L290 TraceCheckUtils]: 9: Hoare triple {1626#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1626#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-08 11:43:24,875 INFO L290 TraceCheckUtils]: 10: Hoare triple {1626#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !!(#t~post3 < 50);havoc #t~post3; {1626#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-08 11:43:24,875 INFO L272 TraceCheckUtils]: 11: Hoare triple {1626#(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)); {1606#true} is VALID [2022-04-08 11:43:24,875 INFO L290 TraceCheckUtils]: 12: Hoare triple {1606#true} ~cond := #in~cond; {1606#true} is VALID [2022-04-08 11:43:24,875 INFO L290 TraceCheckUtils]: 13: Hoare triple {1606#true} assume !(0 == ~cond); {1606#true} is VALID [2022-04-08 11:43:24,875 INFO L290 TraceCheckUtils]: 14: Hoare triple {1606#true} assume true; {1606#true} is VALID [2022-04-08 11:43:24,876 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1606#true} {1626#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} #78#return; {1626#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-08 11:43:24,876 INFO L290 TraceCheckUtils]: 16: Hoare triple {1626#(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); {1607#false} is VALID [2022-04-08 11:43:24,876 INFO L290 TraceCheckUtils]: 17: Hoare triple {1607#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1607#false} is VALID [2022-04-08 11:43:24,876 INFO L290 TraceCheckUtils]: 18: Hoare triple {1607#false} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1607#false} is VALID [2022-04-08 11:43:24,876 INFO L290 TraceCheckUtils]: 19: Hoare triple {1607#false} assume !!(#t~post3 < 50);havoc #t~post3; {1607#false} is VALID [2022-04-08 11:43:24,876 INFO L272 TraceCheckUtils]: 20: Hoare triple {1607#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1607#false} is VALID [2022-04-08 11:43:24,877 INFO L290 TraceCheckUtils]: 21: Hoare triple {1607#false} ~cond := #in~cond; {1607#false} is VALID [2022-04-08 11:43:24,877 INFO L290 TraceCheckUtils]: 22: Hoare triple {1607#false} assume 0 == ~cond; {1607#false} is VALID [2022-04-08 11:43:24,877 INFO L290 TraceCheckUtils]: 23: Hoare triple {1607#false} assume !false; {1607#false} is VALID [2022-04-08 11:43:24,877 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:43:24,877 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 11:43:24,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:43:24,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344370892] [2022-04-08 11:43:24,877 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:43:24,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1242068842] [2022-04-08 11:43:24,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1242068842] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:43:24,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:43:24,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 11:43:24,878 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:43:24,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [461130801] [2022-04-08 11:43:24,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [461130801] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:43:24,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:43:24,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 11:43:24,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268883565] [2022-04-08 11:43:24,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:43:24,879 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:43:24,879 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:43:24,879 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:43:24,894 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:43:24,894 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 11:43:24,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:43:24,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 11:43:24,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 11:43:24,895 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:43:24,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:43:24,953 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2022-04-08 11:43:24,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 11:43:24,953 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:43:24,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:43:24,953 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:43:24,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-04-08 11:43:24,954 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:43:24,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-04-08 11:43:24,955 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 50 transitions. [2022-04-08 11:43:24,992 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:43:24,993 INFO L225 Difference]: With dead ends: 65 [2022-04-08 11:43:24,993 INFO L226 Difference]: Without dead ends: 33 [2022-04-08 11:43:24,993 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:43:24,994 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:43:24,994 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:43:24,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-08 11:43:25,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-08 11:43:25,011 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:43:25,011 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:43:25,011 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:43:25,011 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:43:25,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:43:25,012 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-04-08 11:43:25,013 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-04-08 11:43:25,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:43:25,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:43:25,013 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:43:25,013 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:43:25,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:43:25,014 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-04-08 11:43:25,014 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-04-08 11:43:25,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:43:25,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:43:25,014 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:43:25,014 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:43:25,015 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:43:25,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2022-04-08 11:43:25,015 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 24 [2022-04-08 11:43:25,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:43:25,016 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-04-08 11:43:25,016 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:43:25,016 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 39 transitions. [2022-04-08 11:43:25,050 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:43:25,050 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-04-08 11:43:25,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 11:43:25,050 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:43:25,050 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:43:25,067 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:43:25,267 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:43:25,268 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:43:25,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:43:25,268 INFO L85 PathProgramCache]: Analyzing trace with hash 76649582, now seen corresponding path program 1 times [2022-04-08 11:43:25,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:43:25,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1931134496] [2022-04-08 11:43:25,274 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:43:25,274 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:43:25,274 INFO L85 PathProgramCache]: Analyzing trace with hash 76649582, now seen corresponding path program 2 times [2022-04-08 11:43:25,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:43:25,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133417307] [2022-04-08 11:43:25,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:43:25,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:43:25,297 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:43:25,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [668345703] [2022-04-08 11:43:25,298 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:43:25,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:43:25,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:43:25,299 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:43:25,300 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:43:25,331 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:43:25,331 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:43:25,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 11:43:25,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:43:25,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:43:25,421 INFO L272 TraceCheckUtils]: 0: Hoare triple {1942#true} call ULTIMATE.init(); {1942#true} is VALID [2022-04-08 11:43:25,422 INFO L290 TraceCheckUtils]: 1: Hoare triple {1942#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; {1950#(<= ~counter~0 0)} is VALID [2022-04-08 11:43:25,422 INFO L290 TraceCheckUtils]: 2: Hoare triple {1950#(<= ~counter~0 0)} assume true; {1950#(<= ~counter~0 0)} is VALID [2022-04-08 11:43:25,422 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1950#(<= ~counter~0 0)} {1942#true} #82#return; {1950#(<= ~counter~0 0)} is VALID [2022-04-08 11:43:25,423 INFO L272 TraceCheckUtils]: 4: Hoare triple {1950#(<= ~counter~0 0)} call #t~ret4 := main(); {1950#(<= ~counter~0 0)} is VALID [2022-04-08 11:43:25,423 INFO L290 TraceCheckUtils]: 5: Hoare triple {1950#(<= ~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; {1950#(<= ~counter~0 0)} is VALID [2022-04-08 11:43:25,423 INFO L290 TraceCheckUtils]: 6: Hoare triple {1950#(<= ~counter~0 0)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {1966#(<= ~counter~0 1)} is VALID [2022-04-08 11:43:25,424 INFO L290 TraceCheckUtils]: 7: Hoare triple {1966#(<= ~counter~0 1)} assume !!(#t~post2 < 50);havoc #t~post2; {1966#(<= ~counter~0 1)} is VALID [2022-04-08 11:43:25,424 INFO L290 TraceCheckUtils]: 8: Hoare triple {1966#(<= ~counter~0 1)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1966#(<= ~counter~0 1)} is VALID [2022-04-08 11:43:25,424 INFO L290 TraceCheckUtils]: 9: Hoare triple {1966#(<= ~counter~0 1)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {1976#(<= |main_#t~post2| 1)} is VALID [2022-04-08 11:43:25,425 INFO L290 TraceCheckUtils]: 10: Hoare triple {1976#(<= |main_#t~post2| 1)} assume !(#t~post2 < 50);havoc #t~post2; {1943#false} is VALID [2022-04-08 11:43:25,425 INFO L290 TraceCheckUtils]: 11: Hoare triple {1943#false} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1943#false} is VALID [2022-04-08 11:43:25,425 INFO L290 TraceCheckUtils]: 12: Hoare triple {1943#false} assume !!(#t~post3 < 50);havoc #t~post3; {1943#false} is VALID [2022-04-08 11:43:25,425 INFO L272 TraceCheckUtils]: 13: Hoare triple {1943#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1943#false} is VALID [2022-04-08 11:43:25,425 INFO L290 TraceCheckUtils]: 14: Hoare triple {1943#false} ~cond := #in~cond; {1943#false} is VALID [2022-04-08 11:43:25,425 INFO L290 TraceCheckUtils]: 15: Hoare triple {1943#false} assume !(0 == ~cond); {1943#false} is VALID [2022-04-08 11:43:25,425 INFO L290 TraceCheckUtils]: 16: Hoare triple {1943#false} assume true; {1943#false} is VALID [2022-04-08 11:43:25,425 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1943#false} {1943#false} #78#return; {1943#false} is VALID [2022-04-08 11:43:25,425 INFO L290 TraceCheckUtils]: 18: Hoare triple {1943#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); {1943#false} is VALID [2022-04-08 11:43:25,425 INFO L290 TraceCheckUtils]: 19: Hoare triple {1943#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1943#false} is VALID [2022-04-08 11:43:25,426 INFO L290 TraceCheckUtils]: 20: Hoare triple {1943#false} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1943#false} is VALID [2022-04-08 11:43:25,426 INFO L290 TraceCheckUtils]: 21: Hoare triple {1943#false} assume !(#t~post3 < 50);havoc #t~post3; {1943#false} is VALID [2022-04-08 11:43:25,426 INFO L272 TraceCheckUtils]: 22: Hoare triple {1943#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1943#false} is VALID [2022-04-08 11:43:25,426 INFO L290 TraceCheckUtils]: 23: Hoare triple {1943#false} ~cond := #in~cond; {1943#false} is VALID [2022-04-08 11:43:25,426 INFO L290 TraceCheckUtils]: 24: Hoare triple {1943#false} assume 0 == ~cond; {1943#false} is VALID [2022-04-08 11:43:25,426 INFO L290 TraceCheckUtils]: 25: Hoare triple {1943#false} assume !false; {1943#false} is VALID [2022-04-08 11:43:25,426 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:43:25,426 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:43:25,530 INFO L290 TraceCheckUtils]: 25: Hoare triple {1943#false} assume !false; {1943#false} is VALID [2022-04-08 11:43:25,530 INFO L290 TraceCheckUtils]: 24: Hoare triple {1943#false} assume 0 == ~cond; {1943#false} is VALID [2022-04-08 11:43:25,530 INFO L290 TraceCheckUtils]: 23: Hoare triple {1943#false} ~cond := #in~cond; {1943#false} is VALID [2022-04-08 11:43:25,530 INFO L272 TraceCheckUtils]: 22: Hoare triple {1943#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1943#false} is VALID [2022-04-08 11:43:25,530 INFO L290 TraceCheckUtils]: 21: Hoare triple {1943#false} assume !(#t~post3 < 50);havoc #t~post3; {1943#false} is VALID [2022-04-08 11:43:25,530 INFO L290 TraceCheckUtils]: 20: Hoare triple {1943#false} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1943#false} is VALID [2022-04-08 11:43:25,530 INFO L290 TraceCheckUtils]: 19: Hoare triple {1943#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1943#false} is VALID [2022-04-08 11:43:25,531 INFO L290 TraceCheckUtils]: 18: Hoare triple {1943#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); {1943#false} is VALID [2022-04-08 11:43:25,531 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1942#true} {1943#false} #78#return; {1943#false} is VALID [2022-04-08 11:43:25,531 INFO L290 TraceCheckUtils]: 16: Hoare triple {1942#true} assume true; {1942#true} is VALID [2022-04-08 11:43:25,531 INFO L290 TraceCheckUtils]: 15: Hoare triple {1942#true} assume !(0 == ~cond); {1942#true} is VALID [2022-04-08 11:43:25,531 INFO L290 TraceCheckUtils]: 14: Hoare triple {1942#true} ~cond := #in~cond; {1942#true} is VALID [2022-04-08 11:43:25,531 INFO L272 TraceCheckUtils]: 13: Hoare triple {1943#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1942#true} is VALID [2022-04-08 11:43:25,531 INFO L290 TraceCheckUtils]: 12: Hoare triple {1943#false} assume !!(#t~post3 < 50);havoc #t~post3; {1943#false} is VALID [2022-04-08 11:43:25,531 INFO L290 TraceCheckUtils]: 11: Hoare triple {1943#false} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1943#false} is VALID [2022-04-08 11:43:25,532 INFO L290 TraceCheckUtils]: 10: Hoare triple {2070#(< |main_#t~post2| 50)} assume !(#t~post2 < 50);havoc #t~post2; {1943#false} is VALID [2022-04-08 11:43:25,532 INFO L290 TraceCheckUtils]: 9: Hoare triple {2074#(< ~counter~0 50)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {2070#(< |main_#t~post2| 50)} is VALID [2022-04-08 11:43:25,532 INFO L290 TraceCheckUtils]: 8: Hoare triple {2074#(< ~counter~0 50)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {2074#(< ~counter~0 50)} is VALID [2022-04-08 11:43:25,533 INFO L290 TraceCheckUtils]: 7: Hoare triple {2074#(< ~counter~0 50)} assume !!(#t~post2 < 50);havoc #t~post2; {2074#(< ~counter~0 50)} is VALID [2022-04-08 11:43:25,533 INFO L290 TraceCheckUtils]: 6: Hoare triple {2084#(< ~counter~0 49)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {2074#(< ~counter~0 50)} is VALID [2022-04-08 11:43:25,533 INFO L290 TraceCheckUtils]: 5: Hoare triple {2084#(< ~counter~0 49)} 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; {2084#(< ~counter~0 49)} is VALID [2022-04-08 11:43:25,534 INFO L272 TraceCheckUtils]: 4: Hoare triple {2084#(< ~counter~0 49)} call #t~ret4 := main(); {2084#(< ~counter~0 49)} is VALID [2022-04-08 11:43:25,534 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2084#(< ~counter~0 49)} {1942#true} #82#return; {2084#(< ~counter~0 49)} is VALID [2022-04-08 11:43:25,534 INFO L290 TraceCheckUtils]: 2: Hoare triple {2084#(< ~counter~0 49)} assume true; {2084#(< ~counter~0 49)} is VALID [2022-04-08 11:43:25,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {1942#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; {2084#(< ~counter~0 49)} is VALID [2022-04-08 11:43:25,535 INFO L272 TraceCheckUtils]: 0: Hoare triple {1942#true} call ULTIMATE.init(); {1942#true} is VALID [2022-04-08 11:43:25,535 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:43:25,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:43:25,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133417307] [2022-04-08 11:43:25,535 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:43:25,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668345703] [2022-04-08 11:43:25,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [668345703] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:43:25,536 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:43:25,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-08 11:43:25,536 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:43:25,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1931134496] [2022-04-08 11:43:25,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1931134496] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:43:25,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:43:25,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:43:25,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637380903] [2022-04-08 11:43:25,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:43:25,537 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:43:25,537 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:43:25,537 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:43:25,550 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:43:25,551 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 11:43:25,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:43:25,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 11:43:25,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-08 11:43:25,551 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:43:25,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:43:25,622 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2022-04-08 11:43:25,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 11:43:25,623 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:43:25,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:43:25,623 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:43:25,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-04-08 11:43:25,624 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:43:25,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-04-08 11:43:25,625 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 47 transitions. [2022-04-08 11:43:25,659 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:43:25,660 INFO L225 Difference]: With dead ends: 56 [2022-04-08 11:43:25,660 INFO L226 Difference]: Without dead ends: 35 [2022-04-08 11:43:25,660 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:43:25,660 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 2 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 11:43:25,661 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 83 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 11:43:25,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-08 11:43:25,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-08 11:43:25,679 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:43:25,679 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:43:25,679 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:43:25,680 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:43:25,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:43:25,681 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-08 11:43:25,681 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-08 11:43:25,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:43:25,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:43:25,681 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:43:25,681 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:43:25,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:43:25,682 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-08 11:43:25,682 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-08 11:43:25,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:43:25,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:43:25,682 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:43:25,682 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:43:25,682 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:43:25,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2022-04-08 11:43:25,683 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 26 [2022-04-08 11:43:25,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:43:25,683 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2022-04-08 11:43:25,683 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:43:25,684 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 41 transitions. [2022-04-08 11:43:25,719 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:43:25,719 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-08 11:43:25,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 11:43:25,719 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:43:25,720 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:43:25,737 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:43:25,936 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:43:25,937 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:43:25,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:43:25,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1817538190, now seen corresponding path program 1 times [2022-04-08 11:43:25,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:43:25,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [418662274] [2022-04-08 11:43:25,944 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:43:25,944 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:43:25,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1817538190, now seen corresponding path program 2 times [2022-04-08 11:43:25,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:43:25,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470727034] [2022-04-08 11:43:25,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:43:25,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:43:25,966 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:43:25,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [113722576] [2022-04-08 11:43:25,966 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:43:25,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:43:25,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:43:25,969 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:43:25,970 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:43:26,001 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:43:26,001 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:43:26,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 11:43:26,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:43:26,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:43:26,139 INFO L272 TraceCheckUtils]: 0: Hoare triple {2359#true} call ULTIMATE.init(); {2359#true} is VALID [2022-04-08 11:43:26,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {2359#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; {2367#(<= ~counter~0 0)} is VALID [2022-04-08 11:43:26,140 INFO L290 TraceCheckUtils]: 2: Hoare triple {2367#(<= ~counter~0 0)} assume true; {2367#(<= ~counter~0 0)} is VALID [2022-04-08 11:43:26,140 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2367#(<= ~counter~0 0)} {2359#true} #82#return; {2367#(<= ~counter~0 0)} is VALID [2022-04-08 11:43:26,141 INFO L272 TraceCheckUtils]: 4: Hoare triple {2367#(<= ~counter~0 0)} call #t~ret4 := main(); {2367#(<= ~counter~0 0)} is VALID [2022-04-08 11:43:26,141 INFO L290 TraceCheckUtils]: 5: Hoare triple {2367#(<= ~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; {2367#(<= ~counter~0 0)} is VALID [2022-04-08 11:43:26,141 INFO L290 TraceCheckUtils]: 6: Hoare triple {2367#(<= ~counter~0 0)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {2383#(<= ~counter~0 1)} is VALID [2022-04-08 11:43:26,142 INFO L290 TraceCheckUtils]: 7: Hoare triple {2383#(<= ~counter~0 1)} assume !!(#t~post2 < 50);havoc #t~post2; {2383#(<= ~counter~0 1)} is VALID [2022-04-08 11:43:26,142 INFO L290 TraceCheckUtils]: 8: Hoare triple {2383#(<= ~counter~0 1)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {2383#(<= ~counter~0 1)} is VALID [2022-04-08 11:43:26,142 INFO L290 TraceCheckUtils]: 9: Hoare triple {2383#(<= ~counter~0 1)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {2393#(<= ~counter~0 2)} is VALID [2022-04-08 11:43:26,143 INFO L290 TraceCheckUtils]: 10: Hoare triple {2393#(<= ~counter~0 2)} assume !!(#t~post2 < 50);havoc #t~post2; {2393#(<= ~counter~0 2)} is VALID [2022-04-08 11:43:26,143 INFO L290 TraceCheckUtils]: 11: Hoare triple {2393#(<= ~counter~0 2)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {2393#(<= ~counter~0 2)} is VALID [2022-04-08 11:43:26,143 INFO L290 TraceCheckUtils]: 12: Hoare triple {2393#(<= ~counter~0 2)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2403#(<= ~counter~0 3)} is VALID [2022-04-08 11:43:26,143 INFO L290 TraceCheckUtils]: 13: Hoare triple {2403#(<= ~counter~0 3)} assume !!(#t~post3 < 50);havoc #t~post3; {2403#(<= ~counter~0 3)} is VALID [2022-04-08 11:43:26,144 INFO L272 TraceCheckUtils]: 14: Hoare triple {2403#(<= ~counter~0 3)} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2403#(<= ~counter~0 3)} is VALID [2022-04-08 11:43:26,144 INFO L290 TraceCheckUtils]: 15: Hoare triple {2403#(<= ~counter~0 3)} ~cond := #in~cond; {2403#(<= ~counter~0 3)} is VALID [2022-04-08 11:43:26,145 INFO L290 TraceCheckUtils]: 16: Hoare triple {2403#(<= ~counter~0 3)} assume !(0 == ~cond); {2403#(<= ~counter~0 3)} is VALID [2022-04-08 11:43:26,145 INFO L290 TraceCheckUtils]: 17: Hoare triple {2403#(<= ~counter~0 3)} assume true; {2403#(<= ~counter~0 3)} is VALID [2022-04-08 11:43:26,145 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2403#(<= ~counter~0 3)} {2403#(<= ~counter~0 3)} #78#return; {2403#(<= ~counter~0 3)} is VALID [2022-04-08 11:43:26,146 INFO L290 TraceCheckUtils]: 19: Hoare triple {2403#(<= ~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); {2403#(<= ~counter~0 3)} is VALID [2022-04-08 11:43:26,146 INFO L290 TraceCheckUtils]: 20: Hoare triple {2403#(<= ~counter~0 3)} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {2403#(<= ~counter~0 3)} is VALID [2022-04-08 11:43:26,146 INFO L290 TraceCheckUtils]: 21: Hoare triple {2403#(<= ~counter~0 3)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2431#(<= |main_#t~post3| 3)} is VALID [2022-04-08 11:43:26,147 INFO L290 TraceCheckUtils]: 22: Hoare triple {2431#(<= |main_#t~post3| 3)} assume !(#t~post3 < 50);havoc #t~post3; {2360#false} is VALID [2022-04-08 11:43:26,147 INFO L272 TraceCheckUtils]: 23: Hoare triple {2360#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2360#false} is VALID [2022-04-08 11:43:26,147 INFO L290 TraceCheckUtils]: 24: Hoare triple {2360#false} ~cond := #in~cond; {2360#false} is VALID [2022-04-08 11:43:26,147 INFO L290 TraceCheckUtils]: 25: Hoare triple {2360#false} assume 0 == ~cond; {2360#false} is VALID [2022-04-08 11:43:26,147 INFO L290 TraceCheckUtils]: 26: Hoare triple {2360#false} assume !false; {2360#false} is VALID [2022-04-08 11:43:26,147 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:43:26,147 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:43:26,311 INFO L290 TraceCheckUtils]: 26: Hoare triple {2360#false} assume !false; {2360#false} is VALID [2022-04-08 11:43:26,311 INFO L290 TraceCheckUtils]: 25: Hoare triple {2360#false} assume 0 == ~cond; {2360#false} is VALID [2022-04-08 11:43:26,311 INFO L290 TraceCheckUtils]: 24: Hoare triple {2360#false} ~cond := #in~cond; {2360#false} is VALID [2022-04-08 11:43:26,311 INFO L272 TraceCheckUtils]: 23: Hoare triple {2360#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2360#false} is VALID [2022-04-08 11:43:26,311 INFO L290 TraceCheckUtils]: 22: Hoare triple {2459#(< |main_#t~post3| 50)} assume !(#t~post3 < 50);havoc #t~post3; {2360#false} is VALID [2022-04-08 11:43:26,312 INFO L290 TraceCheckUtils]: 21: Hoare triple {2463#(< ~counter~0 50)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2459#(< |main_#t~post3| 50)} is VALID [2022-04-08 11:43:26,312 INFO L290 TraceCheckUtils]: 20: Hoare triple {2463#(< ~counter~0 50)} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {2463#(< ~counter~0 50)} is VALID [2022-04-08 11:43:26,312 INFO L290 TraceCheckUtils]: 19: Hoare triple {2463#(< ~counter~0 50)} 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); {2463#(< ~counter~0 50)} is VALID [2022-04-08 11:43:26,313 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2359#true} {2463#(< ~counter~0 50)} #78#return; {2463#(< ~counter~0 50)} is VALID [2022-04-08 11:43:26,313 INFO L290 TraceCheckUtils]: 17: Hoare triple {2359#true} assume true; {2359#true} is VALID [2022-04-08 11:43:26,313 INFO L290 TraceCheckUtils]: 16: Hoare triple {2359#true} assume !(0 == ~cond); {2359#true} is VALID [2022-04-08 11:43:26,313 INFO L290 TraceCheckUtils]: 15: Hoare triple {2359#true} ~cond := #in~cond; {2359#true} is VALID [2022-04-08 11:43:26,314 INFO L272 TraceCheckUtils]: 14: Hoare triple {2463#(< ~counter~0 50)} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2359#true} is VALID [2022-04-08 11:43:26,314 INFO L290 TraceCheckUtils]: 13: Hoare triple {2463#(< ~counter~0 50)} assume !!(#t~post3 < 50);havoc #t~post3; {2463#(< ~counter~0 50)} is VALID [2022-04-08 11:43:26,314 INFO L290 TraceCheckUtils]: 12: Hoare triple {2491#(< ~counter~0 49)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2463#(< ~counter~0 50)} is VALID [2022-04-08 11:43:26,315 INFO L290 TraceCheckUtils]: 11: Hoare triple {2491#(< ~counter~0 49)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {2491#(< ~counter~0 49)} is VALID [2022-04-08 11:43:26,315 INFO L290 TraceCheckUtils]: 10: Hoare triple {2491#(< ~counter~0 49)} assume !!(#t~post2 < 50);havoc #t~post2; {2491#(< ~counter~0 49)} is VALID [2022-04-08 11:43:26,315 INFO L290 TraceCheckUtils]: 9: Hoare triple {2501#(< ~counter~0 48)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {2491#(< ~counter~0 49)} is VALID [2022-04-08 11:43:26,316 INFO L290 TraceCheckUtils]: 8: Hoare triple {2501#(< ~counter~0 48)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {2501#(< ~counter~0 48)} is VALID [2022-04-08 11:43:26,316 INFO L290 TraceCheckUtils]: 7: Hoare triple {2501#(< ~counter~0 48)} assume !!(#t~post2 < 50);havoc #t~post2; {2501#(< ~counter~0 48)} is VALID [2022-04-08 11:43:26,317 INFO L290 TraceCheckUtils]: 6: Hoare triple {2511#(< ~counter~0 47)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {2501#(< ~counter~0 48)} is VALID [2022-04-08 11:43:26,317 INFO L290 TraceCheckUtils]: 5: Hoare triple {2511#(< ~counter~0 47)} 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; {2511#(< ~counter~0 47)} is VALID [2022-04-08 11:43:26,317 INFO L272 TraceCheckUtils]: 4: Hoare triple {2511#(< ~counter~0 47)} call #t~ret4 := main(); {2511#(< ~counter~0 47)} is VALID [2022-04-08 11:43:26,318 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2511#(< ~counter~0 47)} {2359#true} #82#return; {2511#(< ~counter~0 47)} is VALID [2022-04-08 11:43:26,318 INFO L290 TraceCheckUtils]: 2: Hoare triple {2511#(< ~counter~0 47)} assume true; {2511#(< ~counter~0 47)} is VALID [2022-04-08 11:43:26,318 INFO L290 TraceCheckUtils]: 1: Hoare triple {2359#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; {2511#(< ~counter~0 47)} is VALID [2022-04-08 11:43:26,319 INFO L272 TraceCheckUtils]: 0: Hoare triple {2359#true} call ULTIMATE.init(); {2359#true} is VALID [2022-04-08 11:43:26,319 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:43:26,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:43:26,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470727034] [2022-04-08 11:43:26,319 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:43:26,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113722576] [2022-04-08 11:43:26,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113722576] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:43:26,319 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:43:26,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-08 11:43:26,320 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:43:26,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [418662274] [2022-04-08 11:43:26,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [418662274] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:43:26,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:43:26,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 11:43:26,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742693904] [2022-04-08 11:43:26,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:43:26,321 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:43:26,321 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:43:26,321 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:43:26,339 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:43:26,339 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 11:43:26,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:43:26,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 11:43:26,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-08 11:43:26,340 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:43:26,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:43:26,466 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2022-04-08 11:43:26,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 11:43:26,466 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:43:26,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:43:26,466 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:43:26,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 58 transitions. [2022-04-08 11:43:26,468 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:43:26,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 58 transitions. [2022-04-08 11:43:26,469 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 58 transitions. [2022-04-08 11:43:26,506 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:43:26,507 INFO L225 Difference]: With dead ends: 60 [2022-04-08 11:43:26,507 INFO L226 Difference]: Without dead ends: 53 [2022-04-08 11:43:26,508 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2022-04-08 11:43:26,508 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 14 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 11:43:26,508 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 87 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 11:43:26,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-08 11:43:26,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 47. [2022-04-08 11:43:26,544 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:43:26,544 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:43:26,544 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:43:26,544 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:43:26,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:43:26,546 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2022-04-08 11:43:26,546 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2022-04-08 11:43:26,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:43:26,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:43:26,546 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:43:26,546 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:43:26,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:43:26,547 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2022-04-08 11:43:26,548 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2022-04-08 11:43:26,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:43:26,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:43:26,548 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:43:26,548 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:43:26,548 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:43:26,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2022-04-08 11:43:26,549 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 27 [2022-04-08 11:43:26,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:43:26,549 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2022-04-08 11:43:26,550 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:43:26,550 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 55 transitions. [2022-04-08 11:43:26,600 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:43:26,600 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2022-04-08 11:43:26,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 11:43:26,601 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:43:26,601 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:43:26,619 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:43:26,809 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:43:26,809 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:43:26,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:43:26,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1815750730, now seen corresponding path program 1 times [2022-04-08 11:43:26,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:43:26,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [362332977] [2022-04-08 11:43:26,817 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:43:26,817 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:43:26,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1815750730, now seen corresponding path program 2 times [2022-04-08 11:43:26,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:43:26,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594541677] [2022-04-08 11:43:26,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:43:26,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:43:26,859 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:43:26,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [566885848] [2022-04-08 11:43:26,859 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:43:26,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:43:26,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:43:26,860 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:43:26,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process