/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_valuebound10.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 11:43:57,713 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 11:43:57,715 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 11:43:57,751 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 11:43:57,754 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 11:43:57,755 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 11:43:57,760 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 11:43:57,765 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 11:43:57,767 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 11:43:57,771 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 11:43:57,772 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 11:43:57,773 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 11:43:57,773 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 11:43:57,775 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 11:43:57,776 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 11:43:57,777 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 11:43:57,778 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 11:43:57,779 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 11:43:57,782 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 11:43:57,788 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 11:43:57,790 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 11:43:57,791 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 11:43:57,791 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 11:43:57,792 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 11:43:57,793 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 11:43:57,799 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 11:43:57,800 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 11:43:57,800 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 11:43:57,801 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 11:43:57,801 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 11:43:57,802 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 11:43:57,803 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 11:43:57,804 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 11:43:57,805 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 11:43:57,805 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 11:43:57,806 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 11:43:57,806 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 11:43:57,806 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 11:43:57,806 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 11:43:57,807 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 11:43:57,807 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 11:43:57,809 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 11:43:57,810 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:57,819 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 11:43:57,820 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 11:43:57,821 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 11:43:57,821 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 11:43:57,821 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 11:43:57,821 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 11:43:57,821 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 11:43:57,821 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 11:43:57,821 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 11:43:57,822 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 11:43:57,822 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 11:43:57,823 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 11:43:57,823 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 11:43:57,823 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 11:43:57,823 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 11:43:57,823 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 11:43:57,823 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 11:43:57,823 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 11:43:57,823 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 11:43:57,823 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 11:43:57,824 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 11:43:57,824 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 11:43:57,824 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:58,024 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 11:43:58,043 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 11:43:58,045 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 11:43:58,046 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 11:43:58,048 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 11:43:58,050 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/divbin2_valuebound10.i [2022-04-08 11:43:58,103 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee8db4e07/2d4743c1a6ae43d0997e26a15ad5ce8f/FLAG4b8baf053 [2022-04-08 11:43:58,515 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 11:43:58,515 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin2_valuebound10.i [2022-04-08 11:43:58,520 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee8db4e07/2d4743c1a6ae43d0997e26a15ad5ce8f/FLAG4b8baf053 [2022-04-08 11:43:58,926 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee8db4e07/2d4743c1a6ae43d0997e26a15ad5ce8f [2022-04-08 11:43:58,928 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 11:43:58,929 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 11:43:58,931 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 11:43:58,931 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 11:43:58,942 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 11:43:58,944 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 11:43:58" (1/1) ... [2022-04-08 11:43:58,945 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47df41fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:43:58, skipping insertion in model container [2022-04-08 11:43:58,945 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 11:43:58" (1/1) ... [2022-04-08 11:43:58,950 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 11:43:58,962 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 11:43:59,104 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_valuebound10.i[951,964] [2022-04-08 11:43:59,130 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 11:43:59,148 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 11:43:59,160 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_valuebound10.i[951,964] [2022-04-08 11:43:59,167 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 11:43:59,176 INFO L208 MainTranslator]: Completed translation [2022-04-08 11:43:59,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:43:59 WrapperNode [2022-04-08 11:43:59,177 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 11:43:59,178 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 11:43:59,178 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 11:43:59,178 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 11:43:59,186 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:59" (1/1) ... [2022-04-08 11:43:59,186 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:59" (1/1) ... [2022-04-08 11:43:59,191 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:59" (1/1) ... [2022-04-08 11:43:59,191 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:59" (1/1) ... [2022-04-08 11:43:59,196 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:59" (1/1) ... [2022-04-08 11:43:59,200 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:59" (1/1) ... [2022-04-08 11:43:59,201 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:59" (1/1) ... [2022-04-08 11:43:59,202 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 11:43:59,203 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 11:43:59,203 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 11:43:59,203 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 11:43:59,204 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:43:59" (1/1) ... [2022-04-08 11:43:59,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 11:43:59,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:43:59,232 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:59,236 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:59,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 11:43:59,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 11:43:59,263 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 11:43:59,263 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 11:43:59,263 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 11:43:59,263 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 11:43:59,263 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 11:43:59,263 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 11:43:59,263 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-08 11:43:59,264 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-08 11:43:59,264 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 11:43:59,264 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 11:43:59,264 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-08 11:43:59,264 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 11:43:59,264 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 11:43:59,264 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 11:43:59,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 11:43:59,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 11:43:59,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 11:43:59,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 11:43:59,265 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 11:43:59,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 11:43:59,315 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 11:43:59,316 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 11:43:59,521 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 11:43:59,527 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 11:43:59,527 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-08 11:43:59,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 11:43:59 BoogieIcfgContainer [2022-04-08 11:43:59,533 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 11:43:59,534 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 11:43:59,534 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 11:43:59,545 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 11:43:59,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 11:43:58" (1/3) ... [2022-04-08 11:43:59,546 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a6dd52f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 11:43:59, skipping insertion in model container [2022-04-08 11:43:59,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:43:59" (2/3) ... [2022-04-08 11:43:59,546 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a6dd52f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 11:43:59, skipping insertion in model container [2022-04-08 11:43:59,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 11:43:59" (3/3) ... [2022-04-08 11:43:59,551 INFO L111 eAbstractionObserver]: Analyzing ICFG divbin2_valuebound10.i [2022-04-08 11:43:59,560 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 11:43:59,560 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 11:43:59,635 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 11:43:59,640 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:59,640 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 11:43:59,665 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 11:43:59,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 11:43:59,679 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:43:59,680 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:43:59,681 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:43:59,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:43:59,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1171333446, now seen corresponding path program 1 times [2022-04-08 11:43:59,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:43:59,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1367895428] [2022-04-08 11:43:59,708 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:43:59,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1171333446, now seen corresponding path program 2 times [2022-04-08 11:43:59,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:43:59,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955937923] [2022-04-08 11:43:59,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:43:59,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:43:59,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:43:59,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 11:43:59,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:43:59,917 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {33#true} is VALID [2022-04-08 11:43:59,918 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-08 11:43:59,918 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} #84#return; {33#true} is VALID [2022-04-08 11:43:59,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 11:43:59,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:43:59,933 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-08 11:43:59,934 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-08 11:43:59,935 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-08 11:43:59,936 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#false} {33#true} #78#return; {34#false} is VALID [2022-04-08 11:43:59,937 INFO L272 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {42#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 11:43:59,937 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {33#true} is VALID [2022-04-08 11:43:59,938 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-08 11:43:59,938 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #84#return; {33#true} is VALID [2022-04-08 11:43:59,939 INFO L272 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret2 := main(); {33#true} is VALID [2022-04-08 11:43:59,939 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {33#true} is VALID [2022-04-08 11:43:59,939 INFO L272 TraceCheckUtils]: 6: Hoare triple {33#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 10 then 1 else 0)); {33#true} is VALID [2022-04-08 11:43:59,940 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-08 11:43:59,942 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-08 11:43:59,942 INFO L290 TraceCheckUtils]: 9: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-08 11:43:59,942 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {34#false} {33#true} #78#return; {34#false} is VALID [2022-04-08 11:43:59,943 INFO L290 TraceCheckUtils]: 11: Hoare triple {34#false} ~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {34#false} is VALID [2022-04-08 11:43:59,943 INFO L290 TraceCheckUtils]: 12: Hoare triple {34#false} assume !true; {34#false} is VALID [2022-04-08 11:43:59,943 INFO L290 TraceCheckUtils]: 13: Hoare triple {34#false} assume !true; {34#false} is VALID [2022-04-08 11:43:59,944 INFO L272 TraceCheckUtils]: 14: Hoare triple {34#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {34#false} is VALID [2022-04-08 11:43:59,944 INFO L290 TraceCheckUtils]: 15: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2022-04-08 11:43:59,944 INFO L290 TraceCheckUtils]: 16: Hoare triple {34#false} assume 0 == ~cond; {34#false} is VALID [2022-04-08 11:43:59,944 INFO L290 TraceCheckUtils]: 17: Hoare triple {34#false} assume !false; {34#false} is VALID [2022-04-08 11:43:59,945 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:59,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:43:59,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955937923] [2022-04-08 11:43:59,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955937923] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:43:59,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:43:59,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 11:43:59,949 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:43:59,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1367895428] [2022-04-08 11:43:59,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1367895428] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:43:59,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:43:59,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 11:43:59,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023400545] [2022-04-08 11:43:59,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:43:59,956 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-08 11:43:59,958 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:43:59,960 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 11:43:59,986 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:43:59,986 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 11:43:59,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:44:00,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 11:44:00,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 11:44:00,011 INFO L87 Difference]: Start difference. First operand has 30 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 11:44:00,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:44:00,157 INFO L93 Difference]: Finished difference Result 51 states and 70 transitions. [2022-04-08 11:44:00,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 11:44:00,157 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-08 11:44:00,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:44:00,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 11:44:00,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-04-08 11:44:00,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 11:44:00,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-04-08 11:44:00,185 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 70 transitions. [2022-04-08 11:44:00,289 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:44:00,298 INFO L225 Difference]: With dead ends: 51 [2022-04-08 11:44:00,299 INFO L226 Difference]: Without dead ends: 25 [2022-04-08 11:44:00,302 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 11:44:00,308 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 11:44:00,310 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 33 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 11:44:00,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-08 11:44:00,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-08 11:44:00,346 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:44:00,347 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 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:44:00,348 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 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:44:00,349 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 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:44:00,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:44:00,353 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-08 11:44:00,353 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-08 11:44:00,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:44:00,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:44:00,355 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 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 25 states. [2022-04-08 11:44:00,356 INFO L87 Difference]: Start difference. First operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 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 25 states. [2022-04-08 11:44:00,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:44:00,360 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-08 11:44:00,362 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-08 11:44:00,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:44:00,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:44:00,367 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:44:00,368 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:44:00,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 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:44:00,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-04-08 11:44:00,372 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 18 [2022-04-08 11:44:00,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:44:00,372 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-04-08 11:44:00,374 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 11:44:00,375 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 28 transitions. [2022-04-08 11:44:00,415 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:44:00,415 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-08 11:44:00,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-08 11:44:00,416 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:44:00,416 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:44:00,417 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 11:44:00,417 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:44:00,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:44:00,418 INFO L85 PathProgramCache]: Analyzing trace with hash -73515422, now seen corresponding path program 1 times [2022-04-08 11:44:00,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:44:00,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1165788802] [2022-04-08 11:44:00,426 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:44:00,426 INFO L85 PathProgramCache]: Analyzing trace with hash -73515422, now seen corresponding path program 2 times [2022-04-08 11:44:00,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:44:00,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615932632] [2022-04-08 11:44:00,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:44:00,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:44:00,461 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:44:00,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [689101010] [2022-04-08 11:44:00,461 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:44:00,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:44:00,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:44:00,505 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:44:00,535 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:44:00,595 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 11:44:00,595 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:44:00,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-08 11:44:00,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:44:00,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:44:00,972 INFO L272 TraceCheckUtils]: 0: Hoare triple {247#true} call ULTIMATE.init(); {247#true} is VALID [2022-04-08 11:44:00,972 INFO L290 TraceCheckUtils]: 1: Hoare triple {247#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); {247#true} is VALID [2022-04-08 11:44:00,972 INFO L290 TraceCheckUtils]: 2: Hoare triple {247#true} assume true; {247#true} is VALID [2022-04-08 11:44:00,973 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {247#true} {247#true} #84#return; {247#true} is VALID [2022-04-08 11:44:00,973 INFO L272 TraceCheckUtils]: 4: Hoare triple {247#true} call #t~ret2 := main(); {247#true} is VALID [2022-04-08 11:44:00,973 INFO L290 TraceCheckUtils]: 5: Hoare triple {247#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {247#true} is VALID [2022-04-08 11:44:00,973 INFO L272 TraceCheckUtils]: 6: Hoare triple {247#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 10 then 1 else 0)); {247#true} is VALID [2022-04-08 11:44:00,974 INFO L290 TraceCheckUtils]: 7: Hoare triple {247#true} ~cond := #in~cond; {247#true} is VALID [2022-04-08 11:44:00,974 INFO L290 TraceCheckUtils]: 8: Hoare triple {247#true} assume !(0 == ~cond); {247#true} is VALID [2022-04-08 11:44:00,975 INFO L290 TraceCheckUtils]: 9: Hoare triple {247#true} assume true; {247#true} is VALID [2022-04-08 11:44:00,975 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {247#true} {247#true} #78#return; {247#true} is VALID [2022-04-08 11:44:00,976 INFO L290 TraceCheckUtils]: 11: Hoare triple {247#true} ~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {285#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:44:00,977 INFO L290 TraceCheckUtils]: 12: Hoare triple {285#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !false; {285#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:44:00,979 INFO L290 TraceCheckUtils]: 13: Hoare triple {285#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {292#(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:44:00,982 INFO L290 TraceCheckUtils]: 14: Hoare triple {292#(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 !false; {292#(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:44:00,984 INFO L272 TraceCheckUtils]: 15: Hoare triple {292#(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)); {299#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:44:00,985 INFO L290 TraceCheckUtils]: 16: Hoare triple {299#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {303#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:44:00,986 INFO L290 TraceCheckUtils]: 17: Hoare triple {303#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {248#false} is VALID [2022-04-08 11:44:00,986 INFO L290 TraceCheckUtils]: 18: Hoare triple {248#false} assume !false; {248#false} is VALID [2022-04-08 11:44:00,986 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:44:00,986 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 11:44:00,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:44:00,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615932632] [2022-04-08 11:44:00,987 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:44:00,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689101010] [2022-04-08 11:44:00,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [689101010] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:44:00,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:44:00,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 11:44:00,989 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:44:00,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1165788802] [2022-04-08 11:44:00,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1165788802] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:44:00,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:44:00,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 11:44:00,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786203407] [2022-04-08 11:44:00,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:44:00,991 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-04-08 11:44:00,991 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:44:00,991 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 11:44:01,017 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:44:01,018 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 11:44:01,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:44:01,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 11:44:01,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-08 11:44:01,019 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 11:44:01,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:44:01,235 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-04-08 11:44:01,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 11:44:01,235 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-04-08 11:44:01,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:44:01,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 11:44:01,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-04-08 11:44:01,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 11:44:01,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-04-08 11:44:01,239 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 42 transitions. [2022-04-08 11:44:01,280 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:44:01,282 INFO L225 Difference]: With dead ends: 37 [2022-04-08 11:44:01,282 INFO L226 Difference]: Without dead ends: 34 [2022-04-08 11:44:01,283 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 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:44:01,284 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 8 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 11:44:01,284 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 92 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 11:44:01,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-08 11:44:01,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-08 11:44:01,300 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:44:01,300 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 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:44:01,301 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 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:44:01,301 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 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:44:01,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:44:01,303 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-08 11:44:01,303 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-08 11:44:01,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:44:01,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:44:01,304 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 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 34 states. [2022-04-08 11:44:01,304 INFO L87 Difference]: Start difference. First operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 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 34 states. [2022-04-08 11:44:01,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:44:01,306 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-08 11:44:01,306 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-08 11:44:01,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:44:01,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:44:01,307 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:44:01,307 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:44:01,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 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:44:01,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2022-04-08 11:44:01,309 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 19 [2022-04-08 11:44:01,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:44:01,309 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2022-04-08 11:44:01,309 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 11:44:01,310 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 38 transitions. [2022-04-08 11:44:01,368 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:44:01,370 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-08 11:44:01,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-08 11:44:01,371 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:44:01,372 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:44:01,402 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:44:01,591 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:44:01,591 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:44:01,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:44:01,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1211706883, now seen corresponding path program 1 times [2022-04-08 11:44:01,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:44:01,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1457151887] [2022-04-08 11:44:01,609 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:44:01,609 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:44:01,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1211706883, now seen corresponding path program 2 times [2022-04-08 11:44:01,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:44:01,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317522007] [2022-04-08 11:44:01,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:44:01,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:44:01,623 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:44:01,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1636834749] [2022-04-08 11:44:01,623 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:44:01,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:44:01,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:44:01,625 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:44:01,651 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:44:01,672 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 11:44:01,673 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:44:01,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-08 11:44:01,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:44:01,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:44:02,014 INFO L272 TraceCheckUtils]: 0: Hoare triple {521#true} call ULTIMATE.init(); {521#true} is VALID [2022-04-08 11:44:02,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {521#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); {521#true} is VALID [2022-04-08 11:44:02,015 INFO L290 TraceCheckUtils]: 2: Hoare triple {521#true} assume true; {521#true} is VALID [2022-04-08 11:44:02,015 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {521#true} {521#true} #84#return; {521#true} is VALID [2022-04-08 11:44:02,015 INFO L272 TraceCheckUtils]: 4: Hoare triple {521#true} call #t~ret2 := main(); {521#true} is VALID [2022-04-08 11:44:02,015 INFO L290 TraceCheckUtils]: 5: Hoare triple {521#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {521#true} is VALID [2022-04-08 11:44:02,015 INFO L272 TraceCheckUtils]: 6: Hoare triple {521#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 10 then 1 else 0)); {521#true} is VALID [2022-04-08 11:44:02,019 INFO L290 TraceCheckUtils]: 7: Hoare triple {521#true} ~cond := #in~cond; {547#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 11:44:02,020 INFO L290 TraceCheckUtils]: 8: Hoare triple {547#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {551#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 11:44:02,022 INFO L290 TraceCheckUtils]: 9: Hoare triple {551#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {551#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 11:44:02,022 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {551#(not (= |assume_abort_if_not_#in~cond| 0))} {521#true} #78#return; {558#(<= (mod main_~A~0 4294967296) 10)} is VALID [2022-04-08 11:44:02,023 INFO L290 TraceCheckUtils]: 11: Hoare triple {558#(<= (mod main_~A~0 4294967296) 10)} ~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {562#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 10))} is VALID [2022-04-08 11:44:02,024 INFO L290 TraceCheckUtils]: 12: Hoare triple {562#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 10))} assume !false; {562#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 10))} is VALID [2022-04-08 11:44:02,024 INFO L290 TraceCheckUtils]: 13: Hoare triple {562#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 10))} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {562#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 10))} is VALID [2022-04-08 11:44:02,025 INFO L290 TraceCheckUtils]: 14: Hoare triple {562#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 10))} assume !false; {562#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 10))} is VALID [2022-04-08 11:44:02,026 INFO L290 TraceCheckUtils]: 15: Hoare triple {562#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 10))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {562#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 10))} is VALID [2022-04-08 11:44:02,026 INFO L290 TraceCheckUtils]: 16: Hoare triple {562#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 10))} assume !false; {562#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 10))} is VALID [2022-04-08 11:44:02,027 INFO L272 TraceCheckUtils]: 17: Hoare triple {562#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 10))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {581#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:44:02,031 INFO L290 TraceCheckUtils]: 18: Hoare triple {581#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {585#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:44:02,032 INFO L290 TraceCheckUtils]: 19: Hoare triple {585#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {522#false} is VALID [2022-04-08 11:44:02,032 INFO L290 TraceCheckUtils]: 20: Hoare triple {522#false} assume !false; {522#false} is VALID [2022-04-08 11:44:02,032 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:44:02,033 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 11:44:02,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:44:02,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317522007] [2022-04-08 11:44:02,033 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:44:02,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636834749] [2022-04-08 11:44:02,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636834749] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:44:02,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:44:02,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 11:44:02,034 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:44:02,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1457151887] [2022-04-08 11:44:02,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1457151887] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:44:02,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:44:02,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 11:44:02,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461111191] [2022-04-08 11:44:02,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:44:02,035 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-04-08 11:44:02,035 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:44:02,035 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 11:44:02,053 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:44:02,054 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 11:44:02,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:44:02,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 11:44:02,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-08 11:44:02,055 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 11:44:02,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:44:02,359 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-08 11:44:02,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 11:44:02,359 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-04-08 11:44:02,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:44:02,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 11:44:02,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 41 transitions. [2022-04-08 11:44:02,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 11:44:02,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 41 transitions. [2022-04-08 11:44:02,363 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 41 transitions. [2022-04-08 11:44:02,408 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:44:02,410 INFO L225 Difference]: With dead ends: 45 [2022-04-08 11:44:02,410 INFO L226 Difference]: Without dead ends: 42 [2022-04-08 11:44:02,410 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-08 11:44:02,411 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 21 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 11:44:02,412 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 88 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 11:44:02,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-08 11:44:02,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 33. [2022-04-08 11:44:02,430 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:44:02,430 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 33 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 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:44:02,431 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 33 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 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:44:02,431 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 33 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 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:44:02,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:44:02,433 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-04-08 11:44:02,434 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-08 11:44:02,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:44:02,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:44:02,434 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 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 42 states. [2022-04-08 11:44:02,434 INFO L87 Difference]: Start difference. First operand has 33 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 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 42 states. [2022-04-08 11:44:02,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:44:02,436 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-04-08 11:44:02,437 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-08 11:44:02,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:44:02,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:44:02,437 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:44:02,437 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:44:02,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 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:44:02,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2022-04-08 11:44:02,439 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 21 [2022-04-08 11:44:02,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:44:02,439 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2022-04-08 11:44:02,439 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 11:44:02,439 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 37 transitions. [2022-04-08 11:44:02,486 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:44:02,487 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-04-08 11:44:02,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 11:44:02,487 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:44:02,488 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, 1] [2022-04-08 11:44:02,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-08 11:44:02,695 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,SelfDestructingSolverStorable2 [2022-04-08 11:44:02,696 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:44:02,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:44:02,696 INFO L85 PathProgramCache]: Analyzing trace with hash 947727214, now seen corresponding path program 1 times [2022-04-08 11:44:02,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:44:02,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [19378321] [2022-04-08 11:44:02,697 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:44:02,697 INFO L85 PathProgramCache]: Analyzing trace with hash 947727214, now seen corresponding path program 2 times [2022-04-08 11:44:02,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:44:02,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686341478] [2022-04-08 11:44:02,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:44:02,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:44:02,713 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:44:02,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1358333254] [2022-04-08 11:44:02,713 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:44:02,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:44:02,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:44:02,717 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:44:02,720 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:44:02,759 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:44:02,760 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:44:02,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 11:44:02,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:44:02,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:44:02,872 INFO L272 TraceCheckUtils]: 0: Hoare triple {835#true} call ULTIMATE.init(); {835#true} is VALID [2022-04-08 11:44:02,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {835#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); {835#true} is VALID [2022-04-08 11:44:02,873 INFO L290 TraceCheckUtils]: 2: Hoare triple {835#true} assume true; {835#true} is VALID [2022-04-08 11:44:02,873 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {835#true} {835#true} #84#return; {835#true} is VALID [2022-04-08 11:44:02,873 INFO L272 TraceCheckUtils]: 4: Hoare triple {835#true} call #t~ret2 := main(); {835#true} is VALID [2022-04-08 11:44:02,873 INFO L290 TraceCheckUtils]: 5: Hoare triple {835#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {835#true} is VALID [2022-04-08 11:44:02,873 INFO L272 TraceCheckUtils]: 6: Hoare triple {835#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 10 then 1 else 0)); {835#true} is VALID [2022-04-08 11:44:02,873 INFO L290 TraceCheckUtils]: 7: Hoare triple {835#true} ~cond := #in~cond; {835#true} is VALID [2022-04-08 11:44:02,873 INFO L290 TraceCheckUtils]: 8: Hoare triple {835#true} assume !(0 == ~cond); {835#true} is VALID [2022-04-08 11:44:02,874 INFO L290 TraceCheckUtils]: 9: Hoare triple {835#true} assume true; {835#true} is VALID [2022-04-08 11:44:02,874 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {835#true} {835#true} #78#return; {835#true} is VALID [2022-04-08 11:44:02,874 INFO L290 TraceCheckUtils]: 11: Hoare triple {835#true} ~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {873#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-08 11:44:02,875 INFO L290 TraceCheckUtils]: 12: Hoare triple {873#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !false; {873#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-08 11:44:02,875 INFO L290 TraceCheckUtils]: 13: Hoare triple {873#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {873#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-08 11:44:02,875 INFO L290 TraceCheckUtils]: 14: Hoare triple {873#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !false; {873#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-08 11:44:02,875 INFO L272 TraceCheckUtils]: 15: Hoare triple {873#(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)); {835#true} is VALID [2022-04-08 11:44:02,876 INFO L290 TraceCheckUtils]: 16: Hoare triple {835#true} ~cond := #in~cond; {835#true} is VALID [2022-04-08 11:44:02,876 INFO L290 TraceCheckUtils]: 17: Hoare triple {835#true} assume !(0 == ~cond); {835#true} is VALID [2022-04-08 11:44:02,876 INFO L290 TraceCheckUtils]: 18: Hoare triple {835#true} assume true; {835#true} is VALID [2022-04-08 11:44:02,877 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {835#true} {873#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} #80#return; {873#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-08 11:44:02,877 INFO L290 TraceCheckUtils]: 20: Hoare triple {873#(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); {836#false} is VALID [2022-04-08 11:44:02,878 INFO L290 TraceCheckUtils]: 21: Hoare triple {836#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {836#false} is VALID [2022-04-08 11:44:02,878 INFO L290 TraceCheckUtils]: 22: Hoare triple {836#false} assume !false; {836#false} is VALID [2022-04-08 11:44:02,878 INFO L272 TraceCheckUtils]: 23: Hoare triple {836#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {836#false} is VALID [2022-04-08 11:44:02,878 INFO L290 TraceCheckUtils]: 24: Hoare triple {836#false} ~cond := #in~cond; {836#false} is VALID [2022-04-08 11:44:02,878 INFO L290 TraceCheckUtils]: 25: Hoare triple {836#false} assume 0 == ~cond; {836#false} is VALID [2022-04-08 11:44:02,878 INFO L290 TraceCheckUtils]: 26: Hoare triple {836#false} assume !false; {836#false} is VALID [2022-04-08 11:44:02,879 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 11:44:02,879 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 11:44:02,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:44:02,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686341478] [2022-04-08 11:44:02,879 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:44:02,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358333254] [2022-04-08 11:44:02,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1358333254] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:44:02,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:44:02,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 11:44:02,880 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:44:02,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [19378321] [2022-04-08 11:44:02,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [19378321] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:44:02,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:44:02,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 11:44:02,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765889250] [2022-04-08 11:44:02,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:44:02,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2022-04-08 11:44:02,881 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:44:02,881 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 11:44:02,903 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:44:02,903 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 11:44:02,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:44:02,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 11:44:02,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 11:44:02,904 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 11:44:02,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:44:02,982 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2022-04-08 11:44:02,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 11:44:02,982 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2022-04-08 11:44:02,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:44:02,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 11:44:02,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-04-08 11:44:02,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 11:44:02,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-04-08 11:44:02,986 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 48 transitions. [2022-04-08 11:44:03,020 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:44:03,021 INFO L225 Difference]: With dead ends: 57 [2022-04-08 11:44:03,022 INFO L226 Difference]: Without dead ends: 35 [2022-04-08 11:44:03,022 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 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:44:03,023 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 11:44:03,023 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 11:44:03,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-08 11:44:03,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-08 11:44:03,063 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:44:03,063 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 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:44:03,063 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 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:44:03,063 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 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:44:03,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:44:03,065 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-04-08 11:44:03,065 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-08 11:44:03,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:44:03,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:44:03,066 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 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 35 states. [2022-04-08 11:44:03,066 INFO L87 Difference]: Start difference. First operand has 35 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 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 35 states. [2022-04-08 11:44:03,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:44:03,067 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-04-08 11:44:03,068 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-08 11:44:03,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:44:03,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:44:03,068 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:44:03,068 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:44:03,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 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:44:03,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2022-04-08 11:44:03,070 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 27 [2022-04-08 11:44:03,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:44:03,070 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2022-04-08 11:44:03,070 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 11:44:03,070 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 39 transitions. [2022-04-08 11:44:03,112 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:44:03,113 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-08 11:44:03,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 11:44:03,113 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:44:03,113 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, 1, 1] [2022-04-08 11:44:03,132 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:44:03,314 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:44:03,314 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:44:03,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:44:03,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1574040585, now seen corresponding path program 1 times [2022-04-08 11:44:03,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:44:03,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1239034223] [2022-04-08 11:44:03,319 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:44:03,319 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:44:03,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1574040585, now seen corresponding path program 2 times [2022-04-08 11:44:03,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:44:03,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672783456] [2022-04-08 11:44:03,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:44:03,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:44:03,331 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:44:03,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [826286220] [2022-04-08 11:44:03,331 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:44:03,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:44:03,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:44:03,332 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:44:03,341 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:44:03,390 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:44:03,390 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:44:03,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-08 11:44:03,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:44:03,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:44:04,245 INFO L272 TraceCheckUtils]: 0: Hoare triple {1172#true} call ULTIMATE.init(); {1172#true} is VALID [2022-04-08 11:44:04,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {1172#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); {1172#true} is VALID [2022-04-08 11:44:04,246 INFO L290 TraceCheckUtils]: 2: Hoare triple {1172#true} assume true; {1172#true} is VALID [2022-04-08 11:44:04,246 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1172#true} {1172#true} #84#return; {1172#true} is VALID [2022-04-08 11:44:04,246 INFO L272 TraceCheckUtils]: 4: Hoare triple {1172#true} call #t~ret2 := main(); {1172#true} is VALID [2022-04-08 11:44:04,246 INFO L290 TraceCheckUtils]: 5: Hoare triple {1172#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {1172#true} is VALID [2022-04-08 11:44:04,246 INFO L272 TraceCheckUtils]: 6: Hoare triple {1172#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 10 then 1 else 0)); {1172#true} is VALID [2022-04-08 11:44:04,246 INFO L290 TraceCheckUtils]: 7: Hoare triple {1172#true} ~cond := #in~cond; {1172#true} is VALID [2022-04-08 11:44:04,246 INFO L290 TraceCheckUtils]: 8: Hoare triple {1172#true} assume !(0 == ~cond); {1172#true} is VALID [2022-04-08 11:44:04,246 INFO L290 TraceCheckUtils]: 9: Hoare triple {1172#true} assume true; {1172#true} is VALID [2022-04-08 11:44:04,246 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1172#true} {1172#true} #78#return; {1172#true} is VALID [2022-04-08 11:44:04,249 INFO L290 TraceCheckUtils]: 11: Hoare triple {1172#true} ~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1210#(and (= main_~A~0 main_~r~0) (= main_~B~0 main_~b~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 11:44:04,250 INFO L290 TraceCheckUtils]: 12: Hoare triple {1210#(and (= main_~A~0 main_~r~0) (= main_~B~0 main_~b~0) (= main_~q~0 0) (= main_~B~0 1))} assume !false; {1210#(and (= main_~A~0 main_~r~0) (= main_~B~0 main_~b~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 11:44:04,250 INFO L290 TraceCheckUtils]: 13: Hoare triple {1210#(and (= main_~A~0 main_~r~0) (= main_~B~0 main_~b~0) (= main_~q~0 0) (= main_~B~0 1))} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1217#(and (= main_~A~0 main_~r~0) (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296)) (= main_~q~0 0) (= main_~B~0 1) (= (* main_~B~0 2) main_~b~0))} is VALID [2022-04-08 11:44:04,251 INFO L290 TraceCheckUtils]: 14: Hoare triple {1217#(and (= main_~A~0 main_~r~0) (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296)) (= main_~q~0 0) (= main_~B~0 1) (= (* main_~B~0 2) main_~b~0))} assume !false; {1217#(and (= main_~A~0 main_~r~0) (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296)) (= main_~q~0 0) (= main_~B~0 1) (= (* main_~B~0 2) main_~b~0))} is VALID [2022-04-08 11:44:04,251 INFO L290 TraceCheckUtils]: 15: Hoare triple {1217#(and (= main_~A~0 main_~r~0) (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296)) (= main_~q~0 0) (= main_~B~0 1) (= (* main_~B~0 2) main_~b~0))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1224#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296)) (= main_~q~0 0) (= main_~B~0 1) (= (* main_~B~0 2) main_~b~0))} is VALID [2022-04-08 11:44:04,252 INFO L290 TraceCheckUtils]: 16: Hoare triple {1224#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296)) (= main_~q~0 0) (= main_~B~0 1) (= (* main_~B~0 2) main_~b~0))} assume !false; {1224#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296)) (= main_~q~0 0) (= main_~B~0 1) (= (* main_~B~0 2) main_~b~0))} is VALID [2022-04-08 11:44:04,252 INFO L272 TraceCheckUtils]: 17: Hoare triple {1224#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296)) (= main_~q~0 0) (= main_~B~0 1) (= (* main_~B~0 2) main_~b~0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1172#true} is VALID [2022-04-08 11:44:04,252 INFO L290 TraceCheckUtils]: 18: Hoare triple {1172#true} ~cond := #in~cond; {1172#true} is VALID [2022-04-08 11:44:04,252 INFO L290 TraceCheckUtils]: 19: Hoare triple {1172#true} assume !(0 == ~cond); {1172#true} is VALID [2022-04-08 11:44:04,252 INFO L290 TraceCheckUtils]: 20: Hoare triple {1172#true} assume true; {1172#true} is VALID [2022-04-08 11:44:04,254 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1172#true} {1224#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296)) (= main_~q~0 0) (= main_~B~0 1) (= (* main_~B~0 2) main_~b~0))} #80#return; {1224#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296)) (= main_~q~0 0) (= main_~B~0 1) (= (* main_~B~0 2) main_~b~0))} is VALID [2022-04-08 11:44:04,255 INFO L290 TraceCheckUtils]: 22: Hoare triple {1224#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296)) (= main_~q~0 0) (= main_~B~0 1) (= (* main_~B~0 2) main_~b~0))} 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); {1246#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (not (<= 2 (mod main_~r~0 4294967296))) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-08 11:44:04,257 INFO L290 TraceCheckUtils]: 23: Hoare triple {1246#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (not (<= 2 (mod main_~r~0 4294967296))) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1250#(and (= (+ main_~A~0 (* (- 1) main_~b~0)) main_~r~0) (= main_~b~0 1) (not (<= 2 (mod main_~A~0 4294967296))) (= (+ (- 1) main_~q~0) 0) (<= 1 (mod main_~A~0 4294967296)))} is VALID [2022-04-08 11:44:04,257 INFO L290 TraceCheckUtils]: 24: Hoare triple {1250#(and (= (+ main_~A~0 (* (- 1) main_~b~0)) main_~r~0) (= main_~b~0 1) (not (<= 2 (mod main_~A~0 4294967296))) (= (+ (- 1) main_~q~0) 0) (<= 1 (mod main_~A~0 4294967296)))} assume !false; {1250#(and (= (+ main_~A~0 (* (- 1) main_~b~0)) main_~r~0) (= main_~b~0 1) (not (<= 2 (mod main_~A~0 4294967296))) (= (+ (- 1) main_~q~0) 0) (<= 1 (mod main_~A~0 4294967296)))} is VALID [2022-04-08 11:44:04,273 INFO L272 TraceCheckUtils]: 25: Hoare triple {1250#(and (= (+ main_~A~0 (* (- 1) main_~b~0)) main_~r~0) (= main_~b~0 1) (not (<= 2 (mod main_~A~0 4294967296))) (= (+ (- 1) main_~q~0) 0) (<= 1 (mod main_~A~0 4294967296)))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1257#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:44:04,273 INFO L290 TraceCheckUtils]: 26: Hoare triple {1257#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1261#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:44:04,274 INFO L290 TraceCheckUtils]: 27: Hoare triple {1261#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1173#false} is VALID [2022-04-08 11:44:04,274 INFO L290 TraceCheckUtils]: 28: Hoare triple {1173#false} assume !false; {1173#false} is VALID [2022-04-08 11:44:04,274 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 11:44:04,274 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:44:15,119 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~b~0 4294967296))) (or (= (mod c_main_~A~0 4294967296) (mod (+ (* (div .cse0 2) (* c_main_~q~0 2)) c_main_~r~0) 4294967296)) (= (mod c_main_~B~0 4294967296) .cse0) (<= .cse0 (mod c_main_~r~0 4294967296)))) is different from true [2022-04-08 11:44:29,867 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (mod (* c_main_~b~0 2) 4294967296)) (.cse1 (mod c_main_~r~0 4294967296))) (or (= .cse0 (mod c_main_~B~0 4294967296)) (not (<= (mod c_main_~b~0 4294967296) .cse1)) (= (mod c_main_~A~0 4294967296) (mod (+ (* (div .cse0 2) (* c_main_~q~0 2)) c_main_~r~0) 4294967296)) (<= .cse0 .cse1))) is different from true [2022-04-08 11:44:34,172 INFO L290 TraceCheckUtils]: 28: Hoare triple {1173#false} assume !false; {1173#false} is VALID [2022-04-08 11:44:34,173 INFO L290 TraceCheckUtils]: 27: Hoare triple {1261#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1173#false} is VALID [2022-04-08 11:44:34,174 INFO L290 TraceCheckUtils]: 26: Hoare triple {1257#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1261#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:44:34,175 INFO L272 TraceCheckUtils]: 25: Hoare triple {1277#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1257#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:44:34,175 INFO L290 TraceCheckUtils]: 24: Hoare triple {1277#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} assume !false; {1277#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-08 11:44:36,184 WARN L290 TraceCheckUtils]: 23: Hoare triple {1277#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1277#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is UNKNOWN [2022-04-08 11:44:38,278 WARN L290 TraceCheckUtils]: 22: Hoare triple {1287#(or (= (mod main_~B~0 4294967296) (mod main_~b~0 4294967296)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296)))} 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); {1277#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is UNKNOWN [2022-04-08 11:44:38,280 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1172#true} {1287#(or (= (mod main_~B~0 4294967296) (mod main_~b~0 4294967296)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296)))} #80#return; {1287#(or (= (mod main_~B~0 4294967296) (mod main_~b~0 4294967296)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296)))} is VALID [2022-04-08 11:44:38,280 INFO L290 TraceCheckUtils]: 20: Hoare triple {1172#true} assume true; {1172#true} is VALID [2022-04-08 11:44:38,280 INFO L290 TraceCheckUtils]: 19: Hoare triple {1172#true} assume !(0 == ~cond); {1172#true} is VALID [2022-04-08 11:44:38,280 INFO L290 TraceCheckUtils]: 18: Hoare triple {1172#true} ~cond := #in~cond; {1172#true} is VALID [2022-04-08 11:44:38,280 INFO L272 TraceCheckUtils]: 17: Hoare triple {1287#(or (= (mod main_~B~0 4294967296) (mod main_~b~0 4294967296)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296)))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1172#true} is VALID [2022-04-08 11:44:38,281 INFO L290 TraceCheckUtils]: 16: Hoare triple {1287#(or (= (mod main_~B~0 4294967296) (mod main_~b~0 4294967296)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296)))} assume !false; {1287#(or (= (mod main_~B~0 4294967296) (mod main_~b~0 4294967296)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296)))} is VALID [2022-04-08 11:44:38,281 INFO L290 TraceCheckUtils]: 15: Hoare triple {1309#(or (= (mod main_~B~0 4294967296) (mod main_~b~0 4294967296)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1287#(or (= (mod main_~B~0 4294967296) (mod main_~b~0 4294967296)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296)))} is VALID [2022-04-08 11:44:38,282 INFO L290 TraceCheckUtils]: 14: Hoare triple {1309#(or (= (mod main_~B~0 4294967296) (mod main_~b~0 4294967296)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} assume !false; {1309#(or (= (mod main_~B~0 4294967296) (mod main_~b~0 4294967296)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-08 11:44:40,391 WARN L290 TraceCheckUtils]: 13: Hoare triple {1316#(or (= (mod main_~A~0 4294967296) (mod (+ (* (* main_~q~0 2) (div (mod (* main_~b~0 2) 4294967296) 2)) main_~r~0) 4294967296)) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (<= (mod (* main_~b~0 2) 4294967296) (mod main_~r~0 4294967296)) (= (mod (* main_~b~0 2) 4294967296) (mod main_~B~0 4294967296)))} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1309#(or (= (mod main_~B~0 4294967296) (mod main_~b~0 4294967296)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} is UNKNOWN [2022-04-08 11:44:40,392 INFO L290 TraceCheckUtils]: 12: Hoare triple {1316#(or (= (mod main_~A~0 4294967296) (mod (+ (* (* main_~q~0 2) (div (mod (* main_~b~0 2) 4294967296) 2)) main_~r~0) 4294967296)) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (<= (mod (* main_~b~0 2) 4294967296) (mod main_~r~0 4294967296)) (= (mod (* main_~b~0 2) 4294967296) (mod main_~B~0 4294967296)))} assume !false; {1316#(or (= (mod main_~A~0 4294967296) (mod (+ (* (* main_~q~0 2) (div (mod (* main_~b~0 2) 4294967296) 2)) main_~r~0) 4294967296)) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (<= (mod (* main_~b~0 2) 4294967296) (mod main_~r~0 4294967296)) (= (mod (* main_~b~0 2) 4294967296) (mod main_~B~0 4294967296)))} is VALID [2022-04-08 11:44:40,393 INFO L290 TraceCheckUtils]: 11: Hoare triple {1172#true} ~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1316#(or (= (mod main_~A~0 4294967296) (mod (+ (* (* main_~q~0 2) (div (mod (* main_~b~0 2) 4294967296) 2)) main_~r~0) 4294967296)) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (<= (mod (* main_~b~0 2) 4294967296) (mod main_~r~0 4294967296)) (= (mod (* main_~b~0 2) 4294967296) (mod main_~B~0 4294967296)))} is VALID [2022-04-08 11:44:40,393 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1172#true} {1172#true} #78#return; {1172#true} is VALID [2022-04-08 11:44:40,393 INFO L290 TraceCheckUtils]: 9: Hoare triple {1172#true} assume true; {1172#true} is VALID [2022-04-08 11:44:40,393 INFO L290 TraceCheckUtils]: 8: Hoare triple {1172#true} assume !(0 == ~cond); {1172#true} is VALID [2022-04-08 11:44:40,393 INFO L290 TraceCheckUtils]: 7: Hoare triple {1172#true} ~cond := #in~cond; {1172#true} is VALID [2022-04-08 11:44:40,393 INFO L272 TraceCheckUtils]: 6: Hoare triple {1172#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 10 then 1 else 0)); {1172#true} is VALID [2022-04-08 11:44:40,393 INFO L290 TraceCheckUtils]: 5: Hoare triple {1172#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {1172#true} is VALID [2022-04-08 11:44:40,393 INFO L272 TraceCheckUtils]: 4: Hoare triple {1172#true} call #t~ret2 := main(); {1172#true} is VALID [2022-04-08 11:44:40,393 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1172#true} {1172#true} #84#return; {1172#true} is VALID [2022-04-08 11:44:40,393 INFO L290 TraceCheckUtils]: 2: Hoare triple {1172#true} assume true; {1172#true} is VALID [2022-04-08 11:44:40,393 INFO L290 TraceCheckUtils]: 1: Hoare triple {1172#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); {1172#true} is VALID [2022-04-08 11:44:40,394 INFO L272 TraceCheckUtils]: 0: Hoare triple {1172#true} call ULTIMATE.init(); {1172#true} is VALID [2022-04-08 11:44:40,394 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-04-08 11:44:40,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:44:40,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672783456] [2022-04-08 11:44:40,394 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:44:40,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826286220] [2022-04-08 11:44:40,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [826286220] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:44:40,394 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:44:40,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2022-04-08 11:44:40,395 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:44:40,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1239034223] [2022-04-08 11:44:40,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1239034223] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:44:40,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:44:40,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 11:44:40,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337807319] [2022-04-08 11:44:40,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:44:40,396 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-04-08 11:44:40,396 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:44:40,396 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 11:44:40,520 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:44:40,520 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 11:44:40,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:44:40,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 11:44:40,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=83, Unknown=2, NotChecked=38, Total=156 [2022-04-08 11:44:40,521 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 11:44:43,243 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 11:44:44,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:44:44,338 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2022-04-08 11:44:44,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 11:44:44,338 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-04-08 11:44:44,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:44:44,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 11:44:44,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 62 transitions. [2022-04-08 11:44:44,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 11:44:44,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 62 transitions. [2022-04-08 11:44:44,343 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 62 transitions. [2022-04-08 11:44:44,537 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:44:44,539 INFO L225 Difference]: With dead ends: 72 [2022-04-08 11:44:44,539 INFO L226 Difference]: Without dead ends: 52 [2022-04-08 11:44:44,539 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=37, Invalid=101, Unknown=2, NotChecked=42, Total=182 [2022-04-08 11:44:44,540 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 8 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-04-08 11:44:44,540 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 148 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 107 Invalid, 1 Unknown, 0 Unchecked, 3.1s Time] [2022-04-08 11:44:44,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-08 11:44:44,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-08 11:44:44,584 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:44:44,584 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 52 states, 37 states have (on average 1.162162162162162) internal successors, (43), 38 states have internal predecessors, (43), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 11:44:44,584 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 52 states, 37 states have (on average 1.162162162162162) internal successors, (43), 38 states have internal predecessors, (43), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 11:44:44,585 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 52 states, 37 states have (on average 1.162162162162162) internal successors, (43), 38 states have internal predecessors, (43), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 11:44:44,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:44:44,587 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2022-04-08 11:44:44,587 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2022-04-08 11:44:44,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:44:44,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:44:44,588 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 37 states have (on average 1.162162162162162) internal successors, (43), 38 states have internal predecessors, (43), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 52 states. [2022-04-08 11:44:44,588 INFO L87 Difference]: Start difference. First operand has 52 states, 37 states have (on average 1.162162162162162) internal successors, (43), 38 states have internal predecessors, (43), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 52 states. [2022-04-08 11:44:44,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:44:44,590 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2022-04-08 11:44:44,590 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2022-04-08 11:44:44,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:44:44,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:44:44,590 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:44:44,590 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:44:44,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 37 states have (on average 1.162162162162162) internal successors, (43), 38 states have internal predecessors, (43), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 11:44:44,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2022-04-08 11:44:44,593 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 29 [2022-04-08 11:44:44,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:44:44,593 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2022-04-08 11:44:44,593 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 11:44:44,593 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 57 transitions. [2022-04-08 11:44:44,941 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:44:44,941 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2022-04-08 11:44:44,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-08 11:44:44,942 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:44:44,942 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:44:44,959 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:44:45,142 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:44:45,143 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:44:45,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:44:45,143 INFO L85 PathProgramCache]: Analyzing trace with hash -2129198620, now seen corresponding path program 3 times [2022-04-08 11:44:45,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:44:45,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [510811590] [2022-04-08 11:44:45,147 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:44:45,147 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:44:45,147 INFO L85 PathProgramCache]: Analyzing trace with hash -2129198620, now seen corresponding path program 4 times [2022-04-08 11:44:45,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:44:45,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233465981] [2022-04-08 11:44:45,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:44:45,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:44:45,160 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:44:45,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [680899321] [2022-04-08 11:44:45,161 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 11:44:45,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:44:45,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:44:45,162 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:44:45,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process