/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_valuebound20.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 14:17:39,551 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 14:17:39,552 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 14:17:39,569 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 14:17:39,569 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 14:17:39,570 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 14:17:39,571 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 14:17:39,572 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 14:17:39,573 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 14:17:39,574 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 14:17:39,575 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 14:17:39,575 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 14:17:39,576 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 14:17:39,576 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 14:17:39,577 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 14:17:39,577 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 14:17:39,578 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 14:17:39,578 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 14:17:39,579 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 14:17:39,581 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 14:17:39,582 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 14:17:39,582 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 14:17:39,583 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 14:17:39,583 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 14:17:39,584 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 14:17:39,586 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 14:17:39,586 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 14:17:39,586 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 14:17:39,587 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 14:17:39,587 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 14:17:39,587 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 14:17:39,587 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 14:17:39,588 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 14:17:39,588 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 14:17:39,589 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 14:17:39,589 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 14:17:39,589 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 14:17:39,590 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 14:17:39,590 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 14:17:39,590 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 14:17:39,591 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 14:17:39,591 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 14:17:39,592 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 14:17:39,597 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 14:17:39,597 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 14:17:39,598 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 14:17:39,598 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 14:17:39,598 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 14:17:39,599 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 14:17:39,599 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 14:17:39,599 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 14:17:39,599 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 14:17:39,599 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 14:17:39,599 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 14:17:39,599 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 14:17:39,599 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 14:17:39,599 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 14:17:39,599 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 14:17:39,599 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 14:17:39,600 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 14:17:39,600 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 14:17:39,600 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 14:17:39,600 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 14:17:39,600 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 14:17:39,600 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 14:17:39,600 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-15 14:17:39,790 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 14:17:39,809 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 14:17:39,810 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 14:17:39,811 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 14:17:39,812 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 14:17:39,813 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/divbin2_valuebound20.i [2022-04-15 14:17:39,871 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9e7d3500/3f5a59412409473bb41a2cc738ab992d/FLAG9419a2dcd [2022-04-15 14:17:40,139 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 14:17:40,139 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin2_valuebound20.i [2022-04-15 14:17:40,143 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9e7d3500/3f5a59412409473bb41a2cc738ab992d/FLAG9419a2dcd [2022-04-15 14:17:40,584 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9e7d3500/3f5a59412409473bb41a2cc738ab992d [2022-04-15 14:17:40,586 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 14:17:40,587 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 14:17:40,600 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 14:17:40,600 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 14:17:40,603 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 14:17:40,604 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 02:17:40" (1/1) ... [2022-04-15 14:17:40,604 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e0c8452 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:17:40, skipping insertion in model container [2022-04-15 14:17:40,604 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 02:17:40" (1/1) ... [2022-04-15 14:17:40,609 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 14:17:40,620 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 14:17:40,736 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_valuebound20.i[951,964] [2022-04-15 14:17:40,747 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 14:17:40,763 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 14:17:40,772 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_valuebound20.i[951,964] [2022-04-15 14:17:40,776 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 14:17:40,785 INFO L208 MainTranslator]: Completed translation [2022-04-15 14:17:40,786 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:17:40 WrapperNode [2022-04-15 14:17:40,786 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 14:17:40,786 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 14:17:40,786 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 14:17:40,787 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 14:17:40,801 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:17:40" (1/1) ... [2022-04-15 14:17:40,802 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:17:40" (1/1) ... [2022-04-15 14:17:40,806 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:17:40" (1/1) ... [2022-04-15 14:17:40,806 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:17:40" (1/1) ... [2022-04-15 14:17:40,810 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:17:40" (1/1) ... [2022-04-15 14:17:40,813 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:17:40" (1/1) ... [2022-04-15 14:17:40,814 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:17:40" (1/1) ... [2022-04-15 14:17:40,815 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 14:17:40,816 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 14:17:40,816 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 14:17:40,816 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 14:17:40,817 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:17:40" (1/1) ... [2022-04-15 14:17:40,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 14:17:40,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:17:40,841 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-15 14:17:40,850 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-15 14:17:40,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 14:17:40,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 14:17:40,869 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 14:17:40,870 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 14:17:40,870 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 14:17:40,870 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 14:17:40,870 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 14:17:40,870 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 14:17:40,871 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 14:17:40,871 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 14:17:40,871 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 14:17:40,872 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 14:17:40,872 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-15 14:17:40,872 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 14:17:40,872 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 14:17:40,874 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 14:17:40,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 14:17:40,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 14:17:40,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 14:17:40,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 14:17:40,875 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 14:17:40,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 14:17:40,921 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 14:17:40,922 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 14:17:41,024 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 14:17:41,029 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 14:17:41,029 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 14:17:41,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 02:17:41 BoogieIcfgContainer [2022-04-15 14:17:41,031 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 14:17:41,032 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 14:17:41,032 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 14:17:41,036 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 14:17:41,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 02:17:40" (1/3) ... [2022-04-15 14:17:41,037 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c777b09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 02:17:41, skipping insertion in model container [2022-04-15 14:17:41,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:17:40" (2/3) ... [2022-04-15 14:17:41,038 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c777b09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 02:17:41, skipping insertion in model container [2022-04-15 14:17:41,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 02:17:41" (3/3) ... [2022-04-15 14:17:41,039 INFO L111 eAbstractionObserver]: Analyzing ICFG divbin2_valuebound20.i [2022-04-15 14:17:41,042 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 14:17:41,042 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 14:17:41,111 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 14:17:41,123 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-15 14:17:41,123 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 14:17:41,184 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-15 14:17:41,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 14:17:41,189 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:17:41,190 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-15 14:17:41,190 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:17:41,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:17:41,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1171333446, now seen corresponding path program 1 times [2022-04-15 14:17:41,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:17:41,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [46232819] [2022-04-15 14:17:41,215 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:17:41,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1171333446, now seen corresponding path program 2 times [2022-04-15 14:17:41,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:17:41,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468202971] [2022-04-15 14:17:41,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:17:41,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:17:41,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:17:41,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 14:17:41,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:17:41,356 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-15 14:17:41,356 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-15 14:17:41,357 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} #84#return; {33#true} is VALID [2022-04-15 14:17:41,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 14:17:41,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:17:41,364 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-15 14:17:41,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-15 14:17:41,365 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-15 14:17:41,365 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#false} {33#true} #78#return; {34#false} is VALID [2022-04-15 14:17:41,366 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-15 14:17:41,366 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-15 14:17:41,366 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-15 14:17:41,367 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #84#return; {33#true} is VALID [2022-04-15 14:17:41,367 INFO L272 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret2 := main(); {33#true} is VALID [2022-04-15 14:17:41,367 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-15 14:17:41,367 INFO L272 TraceCheckUtils]: 6: Hoare triple {33#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 20 then 1 else 0)); {33#true} is VALID [2022-04-15 14:17:41,367 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-15 14:17:41,368 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-15 14:17:41,368 INFO L290 TraceCheckUtils]: 9: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-15 14:17:41,368 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {34#false} {33#true} #78#return; {34#false} is VALID [2022-04-15 14:17:41,369 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-15 14:17:41,369 INFO L290 TraceCheckUtils]: 12: Hoare triple {34#false} assume !true; {34#false} is VALID [2022-04-15 14:17:41,369 INFO L290 TraceCheckUtils]: 13: Hoare triple {34#false} assume !true; {34#false} is VALID [2022-04-15 14:17:41,369 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-15 14:17:41,369 INFO L290 TraceCheckUtils]: 15: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2022-04-15 14:17:41,370 INFO L290 TraceCheckUtils]: 16: Hoare triple {34#false} assume 0 == ~cond; {34#false} is VALID [2022-04-15 14:17:41,370 INFO L290 TraceCheckUtils]: 17: Hoare triple {34#false} assume !false; {34#false} is VALID [2022-04-15 14:17:41,370 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-15 14:17:41,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:17:41,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468202971] [2022-04-15 14:17:41,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468202971] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:17:41,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:17:41,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 14:17:41,374 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:17:41,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [46232819] [2022-04-15 14:17:41,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [46232819] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:17:41,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:17:41,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 14:17:41,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538833501] [2022-04-15 14:17:41,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:17:41,379 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-15 14:17:41,380 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:17:41,382 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-15 14:17:41,401 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-15 14:17:41,401 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 14:17:41,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:17:41,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 14:17:41,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 14:17:41,417 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-15 14:17:41,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:17:41,523 INFO L93 Difference]: Finished difference Result 51 states and 70 transitions. [2022-04-15 14:17:41,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 14:17:41,524 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-15 14:17:41,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:17:41,525 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-15 14:17:41,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-04-15 14:17:41,531 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-15 14:17:41,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-04-15 14:17:41,536 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 70 transitions. [2022-04-15 14:17:41,601 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-15 14:17:41,607 INFO L225 Difference]: With dead ends: 51 [2022-04-15 14:17:41,607 INFO L226 Difference]: Without dead ends: 25 [2022-04-15 14:17:41,609 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-15 14:17:41,612 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-15 14:17:41,613 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-15 14:17:41,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-15 14:17:41,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-15 14:17:41,634 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:17:41,635 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-15 14:17:41,636 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-15 14:17:41,636 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-15 14:17:41,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:17:41,639 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-15 14:17:41,639 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-15 14:17:41,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:17:41,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:17:41,640 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-15 14:17:41,640 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-15 14:17:41,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:17:41,643 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-15 14:17:41,643 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-15 14:17:41,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:17:41,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:17:41,643 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:17:41,643 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:17:41,644 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-15 14:17:41,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-04-15 14:17:41,646 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 18 [2022-04-15 14:17:41,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:17:41,647 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-04-15 14:17:41,647 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-15 14:17:41,647 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 28 transitions. [2022-04-15 14:17:41,671 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-15 14:17:41,672 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-15 14:17:41,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 14:17:41,672 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:17:41,672 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-15 14:17:41,673 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 14:17:41,673 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:17:41,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:17:41,673 INFO L85 PathProgramCache]: Analyzing trace with hash -73515422, now seen corresponding path program 1 times [2022-04-15 14:17:41,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:17:41,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [617033882] [2022-04-15 14:17:41,674 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:17:41,674 INFO L85 PathProgramCache]: Analyzing trace with hash -73515422, now seen corresponding path program 2 times [2022-04-15 14:17:41,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:17:41,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349991246] [2022-04-15 14:17:41,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:17:41,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:17:41,688 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:17:41,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1188195519] [2022-04-15 14:17:41,689 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:17:41,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:17:41,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:17:41,700 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-15 14:17:41,706 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-15 14:17:41,747 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 14:17:41,748 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:17:41,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 14:17:41,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:17:41,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:17:42,055 INFO L272 TraceCheckUtils]: 0: Hoare triple {247#true} call ULTIMATE.init(); {247#true} is VALID [2022-04-15 14:17:42,056 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-15 14:17:42,056 INFO L290 TraceCheckUtils]: 2: Hoare triple {247#true} assume true; {247#true} is VALID [2022-04-15 14:17:42,056 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {247#true} {247#true} #84#return; {247#true} is VALID [2022-04-15 14:17:42,056 INFO L272 TraceCheckUtils]: 4: Hoare triple {247#true} call #t~ret2 := main(); {247#true} is VALID [2022-04-15 14:17:42,056 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-15 14:17:42,056 INFO L272 TraceCheckUtils]: 6: Hoare triple {247#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 20 then 1 else 0)); {247#true} is VALID [2022-04-15 14:17:42,057 INFO L290 TraceCheckUtils]: 7: Hoare triple {247#true} ~cond := #in~cond; {247#true} is VALID [2022-04-15 14:17:42,057 INFO L290 TraceCheckUtils]: 8: Hoare triple {247#true} assume !(0 == ~cond); {247#true} is VALID [2022-04-15 14:17:42,057 INFO L290 TraceCheckUtils]: 9: Hoare triple {247#true} assume true; {247#true} is VALID [2022-04-15 14:17:42,057 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {247#true} {247#true} #78#return; {247#true} is VALID [2022-04-15 14:17:42,058 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-15 14:17:42,058 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-15 14:17:42,060 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-15 14:17:42,060 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-15 14:17:42,062 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-15 14:17:42,062 INFO L290 TraceCheckUtils]: 16: Hoare triple {299#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {303#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 14:17:42,063 INFO L290 TraceCheckUtils]: 17: Hoare triple {303#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {248#false} is VALID [2022-04-15 14:17:42,063 INFO L290 TraceCheckUtils]: 18: Hoare triple {248#false} assume !false; {248#false} is VALID [2022-04-15 14:17:42,063 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-15 14:17:42,063 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 14:17:42,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:17:42,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349991246] [2022-04-15 14:17:42,064 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:17:42,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188195519] [2022-04-15 14:17:42,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188195519] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:17:42,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:17:42,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 14:17:42,066 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:17:42,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [617033882] [2022-04-15 14:17:42,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [617033882] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:17:42,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:17:42,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 14:17:42,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298905538] [2022-04-15 14:17:42,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:17:42,068 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-15 14:17:42,069 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:17:42,069 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-15 14:17:42,083 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-15 14:17:42,083 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 14:17:42,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:17:42,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 14:17:42,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-15 14:17:42,084 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-15 14:17:44,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:17:44,366 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-04-15 14:17:44,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 14:17:44,367 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-15 14:17:44,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:17:44,367 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-15 14:17:44,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-04-15 14:17:44,369 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-15 14:17:44,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-04-15 14:17:44,371 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 42 transitions. [2022-04-15 14:17:44,413 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-15 14:17:44,414 INFO L225 Difference]: With dead ends: 37 [2022-04-15 14:17:44,415 INFO L226 Difference]: Without dead ends: 34 [2022-04-15 14:17:44,415 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-15 14:17:44,416 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-15 14:17:44,416 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-15 14:17:44,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-15 14:17:44,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-15 14:17:44,427 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:17:44,427 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-15 14:17:44,428 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-15 14:17:44,428 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-15 14:17:44,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:17:44,430 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-15 14:17:44,430 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-15 14:17:44,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:17:44,430 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:17:44,430 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-15 14:17:44,431 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-15 14:17:44,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:17:44,432 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-15 14:17:44,432 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-15 14:17:44,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:17:44,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:17:44,433 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:17:44,433 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:17:44,433 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-15 14:17:44,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2022-04-15 14:17:44,435 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 19 [2022-04-15 14:17:44,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:17:44,435 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2022-04-15 14:17:44,435 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-15 14:17:44,436 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 38 transitions. [2022-04-15 14:17:44,526 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-15 14:17:44,526 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-15 14:17:44,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 14:17:44,533 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:17:44,533 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-15 14:17:44,551 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-15 14:17:44,744 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-15 14:17:44,744 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:17:44,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:17:44,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1211706883, now seen corresponding path program 1 times [2022-04-15 14:17:44,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:17:44,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [44430610] [2022-04-15 14:17:44,810 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 14:17:44,811 INFO L85 PathProgramCache]: Analyzing trace with hash -2069278597, now seen corresponding path program 1 times [2022-04-15 14:17:44,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:17:44,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506363624] [2022-04-15 14:17:44,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:17:44,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:17:44,823 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:17:44,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1396534196] [2022-04-15 14:17:44,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:17:44,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:17:44,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:17:44,824 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-15 14:17:44,825 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-15 14:17:44,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:17:44,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 14:17:44,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:17:44,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:17:45,160 INFO L272 TraceCheckUtils]: 0: Hoare triple {521#true} call ULTIMATE.init(); {521#true} is VALID [2022-04-15 14:17:45,160 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-15 14:17:45,161 INFO L290 TraceCheckUtils]: 2: Hoare triple {521#true} assume true; {521#true} is VALID [2022-04-15 14:17:45,161 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {521#true} {521#true} #84#return; {521#true} is VALID [2022-04-15 14:17:45,161 INFO L272 TraceCheckUtils]: 4: Hoare triple {521#true} call #t~ret2 := main(); {521#true} is VALID [2022-04-15 14:17:45,161 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-15 14:17:45,161 INFO L272 TraceCheckUtils]: 6: Hoare triple {521#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 20 then 1 else 0)); {521#true} is VALID [2022-04-15 14:17:45,165 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-15 14:17:45,166 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-15 14:17:45,166 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-15 14:17:45,167 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) 20)} is VALID [2022-04-15 14:17:45,169 INFO L290 TraceCheckUtils]: 11: Hoare triple {558#(<= (mod main_~A~0 4294967296) 20)} ~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {562#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 20) (= main_~q~0 0))} is VALID [2022-04-15 14:17:45,170 INFO L290 TraceCheckUtils]: 12: Hoare triple {562#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 20) (= main_~q~0 0))} [88] L34-2-->L35_primed: Formula: (or (= v_main_~r~0_In_1 v_main_~r~0_In_1) (and (= v_main_~r~0_In_1 0) (= (mod v_main_~b~0_Out_2 2) 0) (<= (mod (div (- v_main_~b~0_Out_2) (- 2)) 4294967296) (mod v_main_~r~0_In_1 4294967296)))) InVars {main_~r~0=v_main_~r~0_In_1} OutVars{main_~b~0=v_main_~b~0_Out_2, main_~r~0=v_main_~r~0_In_1} AuxVars[] AssignedVars[main_~b~0] {562#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 20) (= main_~q~0 0))} is VALID [2022-04-15 14:17:45,170 INFO L290 TraceCheckUtils]: 13: Hoare triple {562#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 20) (= main_~q~0 0))} [87] L35_primed-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {562#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 20) (= main_~q~0 0))} is VALID [2022-04-15 14:17:45,171 INFO L290 TraceCheckUtils]: 14: Hoare triple {562#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 20) (= main_~q~0 0))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {562#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 20) (= main_~q~0 0))} is VALID [2022-04-15 14:17:45,173 INFO L290 TraceCheckUtils]: 15: Hoare triple {562#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 20) (= main_~q~0 0))} assume !false; {562#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 20) (= main_~q~0 0))} is VALID [2022-04-15 14:17:45,173 INFO L272 TraceCheckUtils]: 16: Hoare triple {562#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 20) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {578#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 14:17:45,174 INFO L290 TraceCheckUtils]: 17: Hoare triple {578#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {582#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 14:17:45,174 INFO L290 TraceCheckUtils]: 18: Hoare triple {582#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {522#false} is VALID [2022-04-15 14:17:45,174 INFO L290 TraceCheckUtils]: 19: Hoare triple {522#false} assume !false; {522#false} is VALID [2022-04-15 14:17:45,175 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-15 14:17:45,175 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 14:17:45,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:17:45,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506363624] [2022-04-15 14:17:45,175 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:17:45,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396534196] [2022-04-15 14:17:45,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1396534196] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:17:45,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:17:45,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 14:17:45,221 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:17:45,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [44430610] [2022-04-15 14:17:45,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [44430610] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:17:45,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:17:45,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 14:17:45,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930079514] [2022-04-15 14:17:45,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:17:45,223 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 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-15 14:17:45,224 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:17:45,224 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 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-15 14:17:45,241 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:17:45,242 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 14:17:45,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:17:45,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 14:17:45,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-04-15 14:17:45,243 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 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-15 14:17:49,760 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-15 14:17:51,839 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 14:17:53,921 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 14:17:56,005 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 14:17:58,088 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 14:17:58,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:17:58,280 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2022-04-15 14:17:58,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 14:17:58,280 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 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-15 14:17:58,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:17:58,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 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-15 14:17:58,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-15 14:17:58,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 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-15 14:17:58,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-15 14:17:58,284 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 50 transitions. [2022-04-15 14:17:58,341 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:17:58,343 INFO L225 Difference]: With dead ends: 49 [2022-04-15 14:17:58,343 INFO L226 Difference]: Without dead ends: 45 [2022-04-15 14:17:58,343 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-15 14:17:58,344 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 25 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 6 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2022-04-15 14:17:58,344 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 106 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 119 Invalid, 5 Unknown, 0 Unchecked, 10.6s Time] [2022-04-15 14:17:58,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-15 14:17:58,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 33. [2022-04-15 14:17:58,370 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:17:58,370 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 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-15 14:17:58,370 INFO L74 IsIncluded]: Start isIncluded. First operand 45 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-15 14:17:58,371 INFO L87 Difference]: Start difference. First operand 45 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-15 14:17:58,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:17:58,372 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-15 14:17:58,373 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-15 14:17:58,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:17:58,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:17:58,373 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 45 states. [2022-04-15 14:17:58,373 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 45 states. [2022-04-15 14:17:58,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:17:58,375 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-15 14:17:58,375 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-15 14:17:58,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:17:58,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:17:58,376 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:17:58,376 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:17:58,376 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-15 14:17:58,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2022-04-15 14:17:58,377 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 21 [2022-04-15 14:17:58,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:17:58,377 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2022-04-15 14:17:58,377 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 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-15 14:17:58,378 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 37 transitions. [2022-04-15 14:17:58,430 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-15 14:17:58,430 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-04-15 14:17:58,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 14:17:58,431 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:17:58,431 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-15 14:17:58,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 14:17:58,631 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-15 14:17:58,633 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:17:58,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:17:58,633 INFO L85 PathProgramCache]: Analyzing trace with hash 947727214, now seen corresponding path program 1 times [2022-04-15 14:17:58,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:17:58,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1390024936] [2022-04-15 14:17:58,634 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 14:17:58,634 INFO L85 PathProgramCache]: Analyzing trace with hash 947727214, now seen corresponding path program 2 times [2022-04-15 14:17:58,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:17:58,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920500022] [2022-04-15 14:17:58,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:17:58,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:17:58,673 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:17:58,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [199919566] [2022-04-15 14:17:58,673 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:17:58,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:17:58,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:17:58,675 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-15 14:17:58,677 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-15 14:17:58,716 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 14:17:58,716 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:17:58,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 14:17:58,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:17:58,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:17:58,818 INFO L272 TraceCheckUtils]: 0: Hoare triple {847#true} call ULTIMATE.init(); {847#true} is VALID [2022-04-15 14:17:58,819 INFO L290 TraceCheckUtils]: 1: Hoare triple {847#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); {847#true} is VALID [2022-04-15 14:17:58,819 INFO L290 TraceCheckUtils]: 2: Hoare triple {847#true} assume true; {847#true} is VALID [2022-04-15 14:17:58,819 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {847#true} {847#true} #84#return; {847#true} is VALID [2022-04-15 14:17:58,819 INFO L272 TraceCheckUtils]: 4: Hoare triple {847#true} call #t~ret2 := main(); {847#true} is VALID [2022-04-15 14:17:58,819 INFO L290 TraceCheckUtils]: 5: Hoare triple {847#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {847#true} is VALID [2022-04-15 14:17:58,819 INFO L272 TraceCheckUtils]: 6: Hoare triple {847#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 20 then 1 else 0)); {847#true} is VALID [2022-04-15 14:17:58,819 INFO L290 TraceCheckUtils]: 7: Hoare triple {847#true} ~cond := #in~cond; {847#true} is VALID [2022-04-15 14:17:58,820 INFO L290 TraceCheckUtils]: 8: Hoare triple {847#true} assume !(0 == ~cond); {847#true} is VALID [2022-04-15 14:17:58,820 INFO L290 TraceCheckUtils]: 9: Hoare triple {847#true} assume true; {847#true} is VALID [2022-04-15 14:17:58,820 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {847#true} {847#true} #78#return; {847#true} is VALID [2022-04-15 14:17:58,823 INFO L290 TraceCheckUtils]: 11: Hoare triple {847#true} ~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {885#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-15 14:17:58,823 INFO L290 TraceCheckUtils]: 12: Hoare triple {885#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !false; {885#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-15 14:17:58,824 INFO L290 TraceCheckUtils]: 13: Hoare triple {885#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {885#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-15 14:17:58,824 INFO L290 TraceCheckUtils]: 14: Hoare triple {885#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !false; {885#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-15 14:17:58,824 INFO L272 TraceCheckUtils]: 15: Hoare triple {885#(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)); {847#true} is VALID [2022-04-15 14:17:58,825 INFO L290 TraceCheckUtils]: 16: Hoare triple {847#true} ~cond := #in~cond; {847#true} is VALID [2022-04-15 14:17:58,825 INFO L290 TraceCheckUtils]: 17: Hoare triple {847#true} assume !(0 == ~cond); {847#true} is VALID [2022-04-15 14:17:58,825 INFO L290 TraceCheckUtils]: 18: Hoare triple {847#true} assume true; {847#true} is VALID [2022-04-15 14:17:58,826 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {847#true} {885#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} #80#return; {885#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-15 14:17:58,827 INFO L290 TraceCheckUtils]: 20: Hoare triple {885#(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); {848#false} is VALID [2022-04-15 14:17:58,827 INFO L290 TraceCheckUtils]: 21: Hoare triple {848#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {848#false} is VALID [2022-04-15 14:17:58,827 INFO L290 TraceCheckUtils]: 22: Hoare triple {848#false} assume !false; {848#false} is VALID [2022-04-15 14:17:58,827 INFO L272 TraceCheckUtils]: 23: Hoare triple {848#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {848#false} is VALID [2022-04-15 14:17:58,827 INFO L290 TraceCheckUtils]: 24: Hoare triple {848#false} ~cond := #in~cond; {848#false} is VALID [2022-04-15 14:17:58,827 INFO L290 TraceCheckUtils]: 25: Hoare triple {848#false} assume 0 == ~cond; {848#false} is VALID [2022-04-15 14:17:58,827 INFO L290 TraceCheckUtils]: 26: Hoare triple {848#false} assume !false; {848#false} is VALID [2022-04-15 14:17:58,827 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-15 14:17:58,828 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 14:17:58,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:17:58,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920500022] [2022-04-15 14:17:58,828 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:17:58,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [199919566] [2022-04-15 14:17:58,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [199919566] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:17:58,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:17:58,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 14:17:58,828 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:17:58,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1390024936] [2022-04-15 14:17:58,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1390024936] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:17:58,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:17:58,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 14:17:58,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318105383] [2022-04-15 14:17:58,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:17:58,829 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-15 14:17:58,829 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:17:58,829 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-15 14:17:58,853 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-15 14:17:58,853 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 14:17:58,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:17:58,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 14:17:58,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 14:17:58,854 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-15 14:17:58,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:17:58,935 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2022-04-15 14:17:58,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 14:17:58,935 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-15 14:17:58,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:17:58,935 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-15 14:17:58,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-04-15 14:17:58,939 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-15 14:17:58,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-04-15 14:17:58,940 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 48 transitions. [2022-04-15 14:17:58,973 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-15 14:17:58,974 INFO L225 Difference]: With dead ends: 57 [2022-04-15 14:17:58,975 INFO L226 Difference]: Without dead ends: 35 [2022-04-15 14:17:58,975 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-15 14:17:58,975 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-15 14:17:58,976 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-15 14:17:58,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-15 14:17:58,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-15 14:17:58,995 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:17:58,995 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-15 14:17:58,996 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-15 14:17:58,996 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-15 14:17:58,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:17:58,997 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-04-15 14:17:58,997 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-15 14:17:58,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:17:58,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:17:58,998 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-15 14:17:58,998 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-15 14:17:58,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:17:58,999 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-04-15 14:17:58,999 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-15 14:17:58,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:17:58,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:17:58,999 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:17:58,999 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:17:58,999 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-15 14:17:59,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2022-04-15 14:17:59,000 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 27 [2022-04-15 14:17:59,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:17:59,001 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2022-04-15 14:17:59,001 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-15 14:17:59,001 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 39 transitions. [2022-04-15 14:17:59,045 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-15 14:17:59,046 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-15 14:17:59,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 14:17:59,046 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:17:59,046 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-15 14:17:59,083 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-15 14:17:59,247 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-15 14:17:59,247 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:17:59,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:17:59,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1574040585, now seen corresponding path program 1 times [2022-04-15 14:17:59,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:17:59,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [705733065] [2022-04-15 14:17:59,287 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 14:17:59,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1205839047, now seen corresponding path program 1 times [2022-04-15 14:17:59,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:17:59,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689213759] [2022-04-15 14:17:59,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:17:59,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:17:59,326 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:17:59,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [504660839] [2022-04-15 14:17:59,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:17:59,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:17:59,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:17:59,330 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-15 14:17:59,331 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-15 14:17:59,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:17:59,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 14:17:59,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:17:59,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:17:59,838 INFO L272 TraceCheckUtils]: 0: Hoare triple {1184#true} call ULTIMATE.init(); {1184#true} is VALID [2022-04-15 14:17:59,839 INFO L290 TraceCheckUtils]: 1: Hoare triple {1184#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); {1184#true} is VALID [2022-04-15 14:17:59,839 INFO L290 TraceCheckUtils]: 2: Hoare triple {1184#true} assume true; {1184#true} is VALID [2022-04-15 14:17:59,839 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1184#true} {1184#true} #84#return; {1184#true} is VALID [2022-04-15 14:17:59,839 INFO L272 TraceCheckUtils]: 4: Hoare triple {1184#true} call #t~ret2 := main(); {1184#true} is VALID [2022-04-15 14:17:59,839 INFO L290 TraceCheckUtils]: 5: Hoare triple {1184#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {1184#true} is VALID [2022-04-15 14:17:59,839 INFO L272 TraceCheckUtils]: 6: Hoare triple {1184#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 20 then 1 else 0)); {1184#true} is VALID [2022-04-15 14:17:59,840 INFO L290 TraceCheckUtils]: 7: Hoare triple {1184#true} ~cond := #in~cond; {1210#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 14:17:59,840 INFO L290 TraceCheckUtils]: 8: Hoare triple {1210#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1214#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 14:17:59,840 INFO L290 TraceCheckUtils]: 9: Hoare triple {1214#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1214#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 14:17:59,841 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1214#(not (= |assume_abort_if_not_#in~cond| 0))} {1184#true} #78#return; {1221#(<= (mod main_~A~0 4294967296) 20)} is VALID [2022-04-15 14:17:59,841 INFO L290 TraceCheckUtils]: 11: Hoare triple {1221#(<= (mod main_~A~0 4294967296) 20)} ~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1225#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 20) (= main_~q~0 0))} is VALID [2022-04-15 14:17:59,842 INFO L290 TraceCheckUtils]: 12: Hoare triple {1225#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 20) (= main_~q~0 0))} [90] L34-2-->L35_primed: Formula: (or (and (= (mod v_main_~b~0_Out_4 2) 0) (= v_main_~r~0_In_2 0) (<= (mod (div (- v_main_~b~0_Out_4) (- 2)) 4294967296) (mod v_main_~r~0_In_2 4294967296))) (= v_main_~r~0_In_2 v_main_~r~0_In_2)) InVars {main_~r~0=v_main_~r~0_In_2} OutVars{main_~b~0=v_main_~b~0_Out_4, main_~r~0=v_main_~r~0_In_2} AuxVars[] AssignedVars[main_~b~0] {1225#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 20) (= main_~q~0 0))} is VALID [2022-04-15 14:17:59,842 INFO L290 TraceCheckUtils]: 13: Hoare triple {1225#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 20) (= main_~q~0 0))} [89] L35_primed-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1225#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 20) (= main_~q~0 0))} is VALID [2022-04-15 14:17:59,843 INFO L290 TraceCheckUtils]: 14: Hoare triple {1225#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 20) (= main_~q~0 0))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1225#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 20) (= main_~q~0 0))} is VALID [2022-04-15 14:17:59,843 INFO L290 TraceCheckUtils]: 15: Hoare triple {1225#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 20) (= main_~q~0 0))} assume !false; {1225#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 20) (= main_~q~0 0))} is VALID [2022-04-15 14:17:59,843 INFO L272 TraceCheckUtils]: 16: Hoare triple {1225#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 20) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1184#true} is VALID [2022-04-15 14:17:59,843 INFO L290 TraceCheckUtils]: 17: Hoare triple {1184#true} ~cond := #in~cond; {1184#true} is VALID [2022-04-15 14:17:59,843 INFO L290 TraceCheckUtils]: 18: Hoare triple {1184#true} assume !(0 == ~cond); {1184#true} is VALID [2022-04-15 14:17:59,843 INFO L290 TraceCheckUtils]: 19: Hoare triple {1184#true} assume true; {1184#true} is VALID [2022-04-15 14:17:59,844 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1184#true} {1225#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 20) (= main_~q~0 0))} #80#return; {1225#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 20) (= main_~q~0 0))} is VALID [2022-04-15 14:17:59,845 INFO L290 TraceCheckUtils]: 21: Hoare triple {1225#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 20) (= main_~q~0 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); {1225#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 20) (= main_~q~0 0))} is VALID [2022-04-15 14:17:59,845 INFO L290 TraceCheckUtils]: 22: Hoare triple {1225#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 20) (= main_~q~0 0))} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1259#(and (= (+ main_~A~0 (* (- 1) main_~b~0)) main_~r~0) (<= (mod main_~A~0 4294967296) 20) (= (+ (- 1) main_~q~0) 0))} is VALID [2022-04-15 14:17:59,845 INFO L290 TraceCheckUtils]: 23: Hoare triple {1259#(and (= (+ main_~A~0 (* (- 1) main_~b~0)) main_~r~0) (<= (mod main_~A~0 4294967296) 20) (= (+ (- 1) main_~q~0) 0))} assume !false; {1259#(and (= (+ main_~A~0 (* (- 1) main_~b~0)) main_~r~0) (<= (mod main_~A~0 4294967296) 20) (= (+ (- 1) main_~q~0) 0))} is VALID [2022-04-15 14:17:59,847 INFO L272 TraceCheckUtils]: 24: Hoare triple {1259#(and (= (+ main_~A~0 (* (- 1) main_~b~0)) main_~r~0) (<= (mod main_~A~0 4294967296) 20) (= (+ (- 1) main_~q~0) 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1266#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 14:17:59,848 INFO L290 TraceCheckUtils]: 25: Hoare triple {1266#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1270#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 14:17:59,848 INFO L290 TraceCheckUtils]: 26: Hoare triple {1270#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1185#false} is VALID [2022-04-15 14:17:59,848 INFO L290 TraceCheckUtils]: 27: Hoare triple {1185#false} assume !false; {1185#false} is VALID [2022-04-15 14:17:59,848 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 14:17:59,848 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 14:18:00,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:18:00,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689213759] [2022-04-15 14:18:00,239 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:18:00,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [504660839] [2022-04-15 14:18:00,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [504660839] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 14:18:00,239 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 14:18:00,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-15 14:18:00,283 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:18:00,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [705733065] [2022-04-15 14:18:00,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [705733065] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:18:00,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:18:00,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 14:18:00,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978043249] [2022-04-15 14:18:00,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:18:00,284 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-04-15 14:18:00,284 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:18:00,284 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 14:18:00,309 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-15 14:18:00,309 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 14:18:00,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:18:00,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 14:18:00,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-04-15 14:18:00,310 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 14:18:00,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:18:00,836 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2022-04-15 14:18:00,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 14:18:00,836 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-04-15 14:18:00,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:18:00,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 14:18:00,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 51 transitions. [2022-04-15 14:18:00,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 14:18:00,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 51 transitions. [2022-04-15 14:18:00,839 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 51 transitions. [2022-04-15 14:18:00,900 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:18:00,901 INFO L225 Difference]: With dead ends: 48 [2022-04-15 14:18:00,901 INFO L226 Difference]: Without dead ends: 45 [2022-04-15 14:18:00,902 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-04-15 14:18:00,902 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 26 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 14:18:00,902 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 108 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 14:18:00,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-15 14:18:00,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2022-04-15 14:18:00,946 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:18:00,946 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 42 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 30 states have internal predecessors, (34), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 14:18:00,947 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 42 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 30 states have internal predecessors, (34), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 14:18:00,947 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 42 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 30 states have internal predecessors, (34), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 14:18:00,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:18:00,949 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2022-04-15 14:18:00,949 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2022-04-15 14:18:00,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:18:00,953 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:18:00,953 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 30 states have internal predecessors, (34), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 45 states. [2022-04-15 14:18:00,954 INFO L87 Difference]: Start difference. First operand has 42 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 30 states have internal predecessors, (34), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 45 states. [2022-04-15 14:18:00,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:18:00,955 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2022-04-15 14:18:00,956 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2022-04-15 14:18:00,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:18:00,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:18:00,956 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:18:00,956 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:18:00,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 30 states have internal predecessors, (34), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 14:18:00,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2022-04-15 14:18:00,962 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 29 [2022-04-15 14:18:00,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:18:00,962 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2022-04-15 14:18:00,963 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 14:18:00,963 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 46 transitions. [2022-04-15 14:18:01,021 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:18:01,021 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-04-15 14:18:01,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-15 14:18:01,022 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:18:01,022 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 14:18:01,039 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-15 14:18:01,231 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-15 14:18:01,232 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:18:01,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:18:01,232 INFO L85 PathProgramCache]: Analyzing trace with hash -758101483, now seen corresponding path program 2 times [2022-04-15 14:18:01,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:18:01,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [753529537] [2022-04-15 14:18:01,281 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 14:18:01,282 INFO L85 PathProgramCache]: Analyzing trace with hash 56536339, now seen corresponding path program 1 times [2022-04-15 14:18:01,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:18:01,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546244995] [2022-04-15 14:18:01,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:18:01,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:18:01,291 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:18:01,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1161612135] [2022-04-15 14:18:01,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:18:01,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:18:01,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:18:01,292 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-15 14:18:01,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process