/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_valuebound1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 11:43:21,627 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 11:43:21,630 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 11:43:21,673 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 11:43:21,674 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 11:43:21,675 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 11:43:21,679 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 11:43:21,685 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 11:43:21,687 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 11:43:21,688 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 11:43:21,689 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 11:43:21,691 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 11:43:21,691 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 11:43:21,697 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 11:43:21,698 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 11:43:21,699 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 11:43:21,700 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 11:43:21,700 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 11:43:21,701 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 11:43:21,703 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 11:43:21,704 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 11:43:21,710 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 11:43:21,712 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 11:43:21,713 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 11:43:21,715 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 11:43:21,719 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 11:43:21,719 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 11:43:21,719 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 11:43:21,720 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 11:43:21,720 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 11:43:21,721 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 11:43:21,722 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 11:43:21,722 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 11:43:21,723 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 11:43:21,723 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 11:43:21,724 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 11:43:21,724 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 11:43:21,725 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 11:43:21,725 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 11:43:21,725 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 11:43:21,726 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 11:43:21,728 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 11:43:21,728 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 11:43:21,737 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 11:43:21,737 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 11:43:21,738 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 11:43:21,738 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 11:43:21,738 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 11:43:21,739 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 11:43:21,739 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 11:43:21,739 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 11:43:21,739 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 11:43:21,739 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 11:43:21,739 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 11:43:21,740 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 11:43:21,740 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 11:43:21,740 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 11:43:21,740 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 11:43:21,740 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 11:43:21,740 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 11:43:21,740 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 11:43:21,741 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 11:43:21,741 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 11:43:21,741 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 11:43:21,741 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 11:43:21,741 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 11:43:21,968 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 11:43:21,992 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 11:43:21,994 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 11:43:21,995 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 11:43:21,996 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 11:43:21,998 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/divbin2_valuebound1.i [2022-04-08 11:43:22,052 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbe0f2e73/9445728321264c5faf2155e73a54e08c/FLAG21307ad76 [2022-04-08 11:43:22,396 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 11:43:22,397 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin2_valuebound1.i [2022-04-08 11:43:22,402 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbe0f2e73/9445728321264c5faf2155e73a54e08c/FLAG21307ad76 [2022-04-08 11:43:22,805 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbe0f2e73/9445728321264c5faf2155e73a54e08c [2022-04-08 11:43:22,807 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 11:43:22,809 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 11:43:22,812 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 11:43:22,812 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 11:43:22,819 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 11:43:22,821 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 11:43:22" (1/1) ... [2022-04-08 11:43:22,822 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@776d548c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:43:22, skipping insertion in model container [2022-04-08 11:43:22,822 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 11:43:22" (1/1) ... [2022-04-08 11:43:22,828 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 11:43:22,840 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 11:43:23,076 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_valuebound1.i[951,964] [2022-04-08 11:43:23,104 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 11:43:23,115 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 11:43:23,142 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_valuebound1.i[951,964] [2022-04-08 11:43:23,148 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 11:43:23,165 INFO L208 MainTranslator]: Completed translation [2022-04-08 11:43:23,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:43:23 WrapperNode [2022-04-08 11:43:23,166 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 11:43:23,167 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 11:43:23,167 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 11:43:23,167 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 11:43:23,177 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:43:23" (1/1) ... [2022-04-08 11:43:23,178 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:43:23" (1/1) ... [2022-04-08 11:43:23,183 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:43:23" (1/1) ... [2022-04-08 11:43:23,184 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:43:23" (1/1) ... [2022-04-08 11:43:23,188 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:43:23" (1/1) ... [2022-04-08 11:43:23,193 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:43:23" (1/1) ... [2022-04-08 11:43:23,194 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:43:23" (1/1) ... [2022-04-08 11:43:23,196 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 11:43:23,197 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 11:43:23,197 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 11:43:23,197 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 11:43:23,200 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:43:23" (1/1) ... [2022-04-08 11:43:23,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 11:43:23,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:43:23,233 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 11:43:23,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 11:43:23,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 11:43:23,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 11:43:23,273 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 11:43:23,273 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 11:43:23,273 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 11:43:23,273 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 11:43:23,273 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 11:43:23,273 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 11:43:23,273 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-08 11:43:23,274 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-08 11:43:23,274 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 11:43:23,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 11:43:23,274 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-08 11:43:23,274 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 11:43:23,274 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 11:43:23,274 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 11:43:23,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 11:43:23,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 11:43:23,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 11:43:23,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 11:43:23,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 11:43:23,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 11:43:23,332 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 11:43:23,333 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 11:43:23,469 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 11:43:23,475 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 11:43:23,476 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-08 11:43:23,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 11:43:23 BoogieIcfgContainer [2022-04-08 11:43:23,478 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 11:43:23,479 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 11:43:23,479 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 11:43:23,483 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 11:43:23,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 11:43:22" (1/3) ... [2022-04-08 11:43:23,484 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cd0adae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 11:43:23, skipping insertion in model container [2022-04-08 11:43:23,484 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:43:23" (2/3) ... [2022-04-08 11:43:23,484 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cd0adae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 11:43:23, skipping insertion in model container [2022-04-08 11:43:23,484 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 11:43:23" (3/3) ... [2022-04-08 11:43:23,485 INFO L111 eAbstractionObserver]: Analyzing ICFG divbin2_valuebound1.i [2022-04-08 11:43:23,490 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 11:43:23,490 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 11:43:23,542 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 11:43:23,552 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 11:43:23,552 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 11:43:23,580 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 11:43:23,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 11:43:23,590 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:43:23,590 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:43:23,591 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:43:23,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:43:23,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1171333446, now seen corresponding path program 1 times [2022-04-08 11:43:23,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:43:23,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1297148795] [2022-04-08 11:43:23,617 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:43:23,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1171333446, now seen corresponding path program 2 times [2022-04-08 11:43:23,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:43:23,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181379305] [2022-04-08 11:43:23,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:43:23,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:43:23,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:43:23,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 11:43:23,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:43:23,776 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {33#true} is VALID [2022-04-08 11:43:23,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-08 11:43:23,777 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} #84#return; {33#true} is VALID [2022-04-08 11:43:23,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 11:43:23,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:43:23,787 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-08 11:43:23,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-08 11:43:23,788 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-08 11:43:23,788 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#false} {33#true} #78#return; {34#false} is VALID [2022-04-08 11:43:23,790 INFO L272 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {42#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 11:43:23,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {33#true} is VALID [2022-04-08 11:43:23,790 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-08 11:43:23,791 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #84#return; {33#true} is VALID [2022-04-08 11:43:23,791 INFO L272 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret2 := main(); {33#true} is VALID [2022-04-08 11:43:23,791 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {33#true} is VALID [2022-04-08 11:43:23,791 INFO L272 TraceCheckUtils]: 6: Hoare triple {33#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 1 then 1 else 0)); {33#true} is VALID [2022-04-08 11:43:23,792 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-08 11:43:23,793 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-08 11:43:23,793 INFO L290 TraceCheckUtils]: 9: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-08 11:43:23,793 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {34#false} {33#true} #78#return; {34#false} is VALID [2022-04-08 11:43:23,793 INFO L290 TraceCheckUtils]: 11: Hoare triple {34#false} ~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {34#false} is VALID [2022-04-08 11:43:23,794 INFO L290 TraceCheckUtils]: 12: Hoare triple {34#false} assume !true; {34#false} is VALID [2022-04-08 11:43:23,794 INFO L290 TraceCheckUtils]: 13: Hoare triple {34#false} assume !true; {34#false} is VALID [2022-04-08 11:43:23,794 INFO L272 TraceCheckUtils]: 14: Hoare triple {34#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {34#false} is VALID [2022-04-08 11:43:23,800 INFO L290 TraceCheckUtils]: 15: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2022-04-08 11:43:23,800 INFO L290 TraceCheckUtils]: 16: Hoare triple {34#false} assume 0 == ~cond; {34#false} is VALID [2022-04-08 11:43:23,800 INFO L290 TraceCheckUtils]: 17: Hoare triple {34#false} assume !false; {34#false} is VALID [2022-04-08 11:43:23,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 11:43:23,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:43:23,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181379305] [2022-04-08 11:43:23,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181379305] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:43:23,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:43:23,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 11:43:23,805 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:43:23,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1297148795] [2022-04-08 11:43:23,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1297148795] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:43:23,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:43:23,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 11:43:23,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89043334] [2022-04-08 11:43:23,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:43:23,816 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-08 11:43:23,818 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:43:23,822 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 11:43:23,875 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:43:23,875 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 11:43:23,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:43:23,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 11:43:23,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 11:43:23,901 INFO L87 Difference]: Start difference. First operand has 30 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 11:43:24,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:43:24,063 INFO L93 Difference]: Finished difference Result 51 states and 70 transitions. [2022-04-08 11:43:24,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 11:43:24,064 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-08 11:43:24,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:43:24,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 11:43:24,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-04-08 11:43:24,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 11:43:24,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-04-08 11:43:24,080 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 70 transitions. [2022-04-08 11:43:24,158 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:43:24,166 INFO L225 Difference]: With dead ends: 51 [2022-04-08 11:43:24,166 INFO L226 Difference]: Without dead ends: 25 [2022-04-08 11:43:24,169 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 11:43:24,173 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 11:43:24,174 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 33 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 11:43:24,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-08 11:43:24,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-08 11:43:24,201 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:43:24,202 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 11:43:24,203 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 11:43:24,203 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 11:43:24,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:43:24,207 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-08 11:43:24,207 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-08 11:43:24,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:43:24,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:43:24,208 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-08 11:43:24,209 INFO L87 Difference]: Start difference. First operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-08 11:43:24,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:43:24,212 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-08 11:43:24,212 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-08 11:43:24,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:43:24,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:43:24,213 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:43:24,213 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:43:24,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 11:43:24,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-04-08 11:43:24,217 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 18 [2022-04-08 11:43:24,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:43:24,218 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-04-08 11:43:24,218 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 11:43:24,218 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 28 transitions. [2022-04-08 11:43:24,250 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:43:24,250 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-08 11:43:24,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-08 11:43:24,251 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:43:24,251 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:43:24,251 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 11:43:24,251 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:43:24,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:43:24,252 INFO L85 PathProgramCache]: Analyzing trace with hash -73515422, now seen corresponding path program 1 times [2022-04-08 11:43:24,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:43:24,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [825350077] [2022-04-08 11:43:24,254 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:43:24,254 INFO L85 PathProgramCache]: Analyzing trace with hash -73515422, now seen corresponding path program 2 times [2022-04-08 11:43:24,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:43:24,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633345452] [2022-04-08 11:43:24,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:43:24,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:43:24,273 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:43:24,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [624924502] [2022-04-08 11:43:24,274 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:43:24,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:43:24,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:43:24,279 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 11:43:24,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 11:43:24,341 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 11:43:24,341 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:43:24,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-08 11:43:24,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:43:24,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:43:24,953 INFO L272 TraceCheckUtils]: 0: Hoare triple {247#true} call ULTIMATE.init(); {247#true} is VALID [2022-04-08 11:43:24,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {247#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {247#true} is VALID [2022-04-08 11:43:24,954 INFO L290 TraceCheckUtils]: 2: Hoare triple {247#true} assume true; {247#true} is VALID [2022-04-08 11:43:24,954 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {247#true} {247#true} #84#return; {247#true} is VALID [2022-04-08 11:43:24,954 INFO L272 TraceCheckUtils]: 4: Hoare triple {247#true} call #t~ret2 := main(); {247#true} is VALID [2022-04-08 11:43:24,955 INFO L290 TraceCheckUtils]: 5: Hoare triple {247#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {247#true} is VALID [2022-04-08 11:43:24,955 INFO L272 TraceCheckUtils]: 6: Hoare triple {247#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 1 then 1 else 0)); {247#true} is VALID [2022-04-08 11:43:24,955 INFO L290 TraceCheckUtils]: 7: Hoare triple {247#true} ~cond := #in~cond; {273#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 11:43:24,957 INFO L290 TraceCheckUtils]: 8: Hoare triple {273#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {277#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 11:43:24,957 INFO L290 TraceCheckUtils]: 9: Hoare triple {277#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {277#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 11:43:24,958 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {277#(not (= |assume_abort_if_not_#in~cond| 0))} {247#true} #78#return; {284#(<= (mod main_~A~0 4294967296) 1)} is VALID [2022-04-08 11:43:24,959 INFO L290 TraceCheckUtils]: 11: Hoare triple {284#(<= (mod main_~A~0 4294967296) 1)} ~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {288#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (= main_~q~0 0))} is VALID [2022-04-08 11:43:24,960 INFO L290 TraceCheckUtils]: 12: Hoare triple {288#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (= main_~q~0 0))} assume !false; {288#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (= main_~q~0 0))} is VALID [2022-04-08 11:43:24,962 INFO L290 TraceCheckUtils]: 13: Hoare triple {288#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (= main_~q~0 0))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {295#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (< (mod main_~r~0 4294967296) (mod main_~b~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-08 11:43:24,962 INFO L290 TraceCheckUtils]: 14: Hoare triple {295#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (< (mod main_~r~0 4294967296) (mod main_~b~0 4294967296)) (= main_~q~0 0))} assume !false; {295#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (< (mod main_~r~0 4294967296) (mod main_~b~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-08 11:43:24,963 INFO L272 TraceCheckUtils]: 15: Hoare triple {295#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (< (mod main_~r~0 4294967296) (mod main_~b~0 4294967296)) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {302#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:43:24,964 INFO L290 TraceCheckUtils]: 16: Hoare triple {302#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {306#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:43:24,964 INFO L290 TraceCheckUtils]: 17: Hoare triple {306#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {248#false} is VALID [2022-04-08 11:43:24,965 INFO L290 TraceCheckUtils]: 18: Hoare triple {248#false} assume !false; {248#false} is VALID [2022-04-08 11:43:24,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 11:43:24,965 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 11:43:24,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:43:24,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633345452] [2022-04-08 11:43:24,966 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:43:24,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624924502] [2022-04-08 11:43:24,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624924502] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:43:24,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:43:24,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 11:43:24,969 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:43:24,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [825350077] [2022-04-08 11:43:24,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [825350077] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:43:24,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:43:24,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 11:43:24,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362522869] [2022-04-08 11:43:24,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:43:24,972 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 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 19 [2022-04-08 11:43:24,972 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:43:24,973 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 11:43:24,993 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:43:24,993 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 11:43:24,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:43:24,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 11:43:24,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-04-08 11:43:24,995 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 11:43:25,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:43:25,347 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-04-08 11:43:25,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 11:43:25,348 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 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 19 [2022-04-08 11:43:25,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:43:25,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 11:43:25,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 42 transitions. [2022-04-08 11:43:25,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 11:43:25,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 42 transitions. [2022-04-08 11:43:25,354 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 42 transitions. [2022-04-08 11:43:25,401 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:43:25,403 INFO L225 Difference]: With dead ends: 37 [2022-04-08 11:43:25,403 INFO L226 Difference]: Without dead ends: 34 [2022-04-08 11:43:25,404 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-08 11:43:25,405 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 21 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 11:43:25,406 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 104 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 11:43:25,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-08 11:43:25,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-08 11:43:25,440 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:43:25,441 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 11:43:25,442 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 11:43:25,444 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 11:43:25,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:43:25,451 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-08 11:43:25,451 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-08 11:43:25,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:43:25,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:43:25,452 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-08 11:43:25,452 INFO L87 Difference]: Start difference. First operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-08 11:43:25,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:43:25,456 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-08 11:43:25,456 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-08 11:43:25,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:43:25,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:43:25,458 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:43:25,458 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:43:25,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 11:43:25,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2022-04-08 11:43:25,465 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 19 [2022-04-08 11:43:25,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:43:25,465 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2022-04-08 11:43:25,466 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 11:43:25,466 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 38 transitions. [2022-04-08 11:43:25,514 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:43:25,515 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-08 11:43:25,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-08 11:43:25,521 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:43:25,522 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:43:25,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-08 11:43:25,735 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:43:25,736 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:43:25,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:43:25,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1211706883, now seen corresponding path program 1 times [2022-04-08 11:43:25,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:43:25,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1489588888] [2022-04-08 11:43:25,761 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:43:25,762 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:43:25,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1211706883, now seen corresponding path program 2 times [2022-04-08 11:43:25,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:43:25,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161737169] [2022-04-08 11:43:25,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:43:25,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:43:25,781 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:43:25,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2099464997] [2022-04-08 11:43:25,781 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:43:25,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:43:25,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:43:25,783 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 11:43:25,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-08 11:43:25,829 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 11:43:25,830 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:43:25,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-08 11:43:25,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:43:25,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:43:26,146 INFO L272 TraceCheckUtils]: 0: Hoare triple {526#true} call ULTIMATE.init(); {526#true} is VALID [2022-04-08 11:43:26,147 INFO L290 TraceCheckUtils]: 1: Hoare triple {526#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); {526#true} is VALID [2022-04-08 11:43:26,147 INFO L290 TraceCheckUtils]: 2: Hoare triple {526#true} assume true; {526#true} is VALID [2022-04-08 11:43:26,147 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {526#true} {526#true} #84#return; {526#true} is VALID [2022-04-08 11:43:26,147 INFO L272 TraceCheckUtils]: 4: Hoare triple {526#true} call #t~ret2 := main(); {526#true} is VALID [2022-04-08 11:43:26,147 INFO L290 TraceCheckUtils]: 5: Hoare triple {526#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {526#true} is VALID [2022-04-08 11:43:26,147 INFO L272 TraceCheckUtils]: 6: Hoare triple {526#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 1 then 1 else 0)); {526#true} is VALID [2022-04-08 11:43:26,148 INFO L290 TraceCheckUtils]: 7: Hoare triple {526#true} ~cond := #in~cond; {552#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 11:43:26,149 INFO L290 TraceCheckUtils]: 8: Hoare triple {552#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {556#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 11:43:26,149 INFO L290 TraceCheckUtils]: 9: Hoare triple {556#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {556#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 11:43:26,150 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {556#(not (= |assume_abort_if_not_#in~cond| 0))} {526#true} #78#return; {563#(<= (mod main_~A~0 4294967296) 1)} is VALID [2022-04-08 11:43:26,151 INFO L290 TraceCheckUtils]: 11: Hoare triple {563#(<= (mod main_~A~0 4294967296) 1)} ~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {567#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (= main_~q~0 0))} is VALID [2022-04-08 11:43:26,151 INFO L290 TraceCheckUtils]: 12: Hoare triple {567#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (= main_~q~0 0))} assume !false; {567#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (= main_~q~0 0))} is VALID [2022-04-08 11:43:26,152 INFO L290 TraceCheckUtils]: 13: Hoare triple {567#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (= main_~q~0 0))} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {567#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (= main_~q~0 0))} is VALID [2022-04-08 11:43:26,152 INFO L290 TraceCheckUtils]: 14: Hoare triple {567#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (= main_~q~0 0))} assume !false; {567#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (= main_~q~0 0))} is VALID [2022-04-08 11:43:26,153 INFO L290 TraceCheckUtils]: 15: Hoare triple {567#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (= main_~q~0 0))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {567#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (= main_~q~0 0))} is VALID [2022-04-08 11:43:26,154 INFO L290 TraceCheckUtils]: 16: Hoare triple {567#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (= main_~q~0 0))} assume !false; {567#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (= main_~q~0 0))} is VALID [2022-04-08 11:43:26,155 INFO L272 TraceCheckUtils]: 17: Hoare triple {567#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {586#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:43:26,155 INFO L290 TraceCheckUtils]: 18: Hoare triple {586#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {590#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:43:26,156 INFO L290 TraceCheckUtils]: 19: Hoare triple {590#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {527#false} is VALID [2022-04-08 11:43:26,156 INFO L290 TraceCheckUtils]: 20: Hoare triple {527#false} assume !false; {527#false} is VALID [2022-04-08 11:43:26,157 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 11:43:26,157 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 11:43:26,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:43:26,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161737169] [2022-04-08 11:43:26,157 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:43:26,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099464997] [2022-04-08 11:43:26,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2099464997] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:43:26,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:43:26,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 11:43:26,158 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:43:26,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1489588888] [2022-04-08 11:43:26,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1489588888] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:43:26,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:43:26,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 11:43:26,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090194165] [2022-04-08 11:43:26,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:43:26,159 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-04-08 11:43:26,159 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:43:26,159 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 11:43:26,179 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:43:26,180 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 11:43:26,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:43:26,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 11:43:26,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-08 11:43:26,181 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 11:43:26,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:43:26,514 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-08 11:43:26,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 11:43:26,515 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-04-08 11:43:26,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:43:26,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 11:43:26,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 41 transitions. [2022-04-08 11:43:26,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 11:43:26,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 41 transitions. [2022-04-08 11:43:26,520 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 41 transitions. [2022-04-08 11:43:26,564 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:43:26,565 INFO L225 Difference]: With dead ends: 45 [2022-04-08 11:43:26,566 INFO L226 Difference]: Without dead ends: 42 [2022-04-08 11:43:26,566 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-08 11:43:26,567 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 19 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 11:43:26,567 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 98 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 11:43:26,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-08 11:43:26,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 33. [2022-04-08 11:43:26,605 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:43:26,605 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 33 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 11:43:26,605 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 33 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 11:43:26,606 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 33 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 11:43:26,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:43:26,612 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-04-08 11:43:26,612 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-08 11:43:26,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:43:26,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:43:26,617 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 42 states. [2022-04-08 11:43:26,618 INFO L87 Difference]: Start difference. First operand has 33 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 42 states. [2022-04-08 11:43:26,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:43:26,622 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-04-08 11:43:26,622 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-08 11:43:26,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:43:26,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:43:26,623 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:43:26,624 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:43:26,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 11:43:26,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2022-04-08 11:43:26,626 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 21 [2022-04-08 11:43:26,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:43:26,626 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2022-04-08 11:43:26,626 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 11:43:26,626 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 37 transitions. [2022-04-08 11:43:26,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:43:26,673 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-04-08 11:43:26,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 11:43:26,675 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:43:26,675 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:43:26,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-08 11:43:26,891 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-08 11:43:26,892 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:43:26,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:43:26,892 INFO L85 PathProgramCache]: Analyzing trace with hash 947727214, now seen corresponding path program 1 times [2022-04-08 11:43:26,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:43:26,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1993333211] [2022-04-08 11:43:26,893 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:43:26,893 INFO L85 PathProgramCache]: Analyzing trace with hash 947727214, now seen corresponding path program 2 times [2022-04-08 11:43:26,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:43:26,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888255586] [2022-04-08 11:43:26,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:43:26,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:43:26,928 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:43:26,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1437860784] [2022-04-08 11:43:26,929 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:43:26,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:43:26,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:43:26,930 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 11:43:26,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-08 11:43:26,982 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:43:26,983 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:43:26,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 11:43:26,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:43:26,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:43:27,109 INFO L272 TraceCheckUtils]: 0: Hoare triple {840#true} call ULTIMATE.init(); {840#true} is VALID [2022-04-08 11:43:27,110 INFO L290 TraceCheckUtils]: 1: Hoare triple {840#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); {840#true} is VALID [2022-04-08 11:43:27,110 INFO L290 TraceCheckUtils]: 2: Hoare triple {840#true} assume true; {840#true} is VALID [2022-04-08 11:43:27,110 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {840#true} {840#true} #84#return; {840#true} is VALID [2022-04-08 11:43:27,110 INFO L272 TraceCheckUtils]: 4: Hoare triple {840#true} call #t~ret2 := main(); {840#true} is VALID [2022-04-08 11:43:27,110 INFO L290 TraceCheckUtils]: 5: Hoare triple {840#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {840#true} is VALID [2022-04-08 11:43:27,111 INFO L272 TraceCheckUtils]: 6: Hoare triple {840#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 1 then 1 else 0)); {840#true} is VALID [2022-04-08 11:43:27,111 INFO L290 TraceCheckUtils]: 7: Hoare triple {840#true} ~cond := #in~cond; {840#true} is VALID [2022-04-08 11:43:27,111 INFO L290 TraceCheckUtils]: 8: Hoare triple {840#true} assume !(0 == ~cond); {840#true} is VALID [2022-04-08 11:43:27,112 INFO L290 TraceCheckUtils]: 9: Hoare triple {840#true} assume true; {840#true} is VALID [2022-04-08 11:43:27,112 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {840#true} {840#true} #78#return; {840#true} is VALID [2022-04-08 11:43:27,115 INFO L290 TraceCheckUtils]: 11: Hoare triple {840#true} ~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {878#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-08 11:43:27,116 INFO L290 TraceCheckUtils]: 12: Hoare triple {878#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !false; {878#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-08 11:43:27,117 INFO L290 TraceCheckUtils]: 13: Hoare triple {878#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {878#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-08 11:43:27,117 INFO L290 TraceCheckUtils]: 14: Hoare triple {878#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !false; {878#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-08 11:43:27,117 INFO L272 TraceCheckUtils]: 15: Hoare triple {878#(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)); {840#true} is VALID [2022-04-08 11:43:27,118 INFO L290 TraceCheckUtils]: 16: Hoare triple {840#true} ~cond := #in~cond; {840#true} is VALID [2022-04-08 11:43:27,118 INFO L290 TraceCheckUtils]: 17: Hoare triple {840#true} assume !(0 == ~cond); {840#true} is VALID [2022-04-08 11:43:27,118 INFO L290 TraceCheckUtils]: 18: Hoare triple {840#true} assume true; {840#true} is VALID [2022-04-08 11:43:27,120 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {840#true} {878#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} #80#return; {878#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-08 11:43:27,120 INFO L290 TraceCheckUtils]: 20: Hoare triple {878#(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); {841#false} is VALID [2022-04-08 11:43:27,121 INFO L290 TraceCheckUtils]: 21: Hoare triple {841#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {841#false} is VALID [2022-04-08 11:43:27,121 INFO L290 TraceCheckUtils]: 22: Hoare triple {841#false} assume !false; {841#false} is VALID [2022-04-08 11:43:27,121 INFO L272 TraceCheckUtils]: 23: Hoare triple {841#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {841#false} is VALID [2022-04-08 11:43:27,121 INFO L290 TraceCheckUtils]: 24: Hoare triple {841#false} ~cond := #in~cond; {841#false} is VALID [2022-04-08 11:43:27,122 INFO L290 TraceCheckUtils]: 25: Hoare triple {841#false} assume 0 == ~cond; {841#false} is VALID [2022-04-08 11:43:27,122 INFO L290 TraceCheckUtils]: 26: Hoare triple {841#false} assume !false; {841#false} is VALID [2022-04-08 11:43:27,122 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 11:43:27,122 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 11:43:27,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:43:27,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888255586] [2022-04-08 11:43:27,123 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:43:27,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437860784] [2022-04-08 11:43:27,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1437860784] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:43:27,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:43:27,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 11:43:27,124 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:43:27,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1993333211] [2022-04-08 11:43:27,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1993333211] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:43:27,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:43:27,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 11:43:27,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458968519] [2022-04-08 11:43:27,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:43:27,125 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2022-04-08 11:43:27,125 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:43:27,125 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 11:43:27,149 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:43:27,149 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 11:43:27,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:43:27,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 11:43:27,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 11:43:27,150 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 11:43:27,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:43:27,230 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2022-04-08 11:43:27,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 11:43:27,231 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2022-04-08 11:43:27,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:43:27,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 11:43:27,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-04-08 11:43:27,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 11:43:27,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-04-08 11:43:27,235 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 48 transitions. [2022-04-08 11:43:27,275 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:43:27,276 INFO L225 Difference]: With dead ends: 57 [2022-04-08 11:43:27,276 INFO L226 Difference]: Without dead ends: 35 [2022-04-08 11:43:27,277 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 11:43:27,278 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 11:43:27,278 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 11:43:27,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-08 11:43:27,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-08 11:43:27,297 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:43:27,297 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 11:43:27,298 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 11:43:27,298 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 11:43:27,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:43:27,299 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-04-08 11:43:27,300 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-08 11:43:27,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:43:27,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:43:27,300 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 35 states. [2022-04-08 11:43:27,301 INFO L87 Difference]: Start difference. First operand has 35 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 35 states. [2022-04-08 11:43:27,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:43:27,302 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-04-08 11:43:27,302 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-08 11:43:27,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:43:27,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:43:27,303 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:43:27,303 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:43:27,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 11:43:27,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2022-04-08 11:43:27,305 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 27 [2022-04-08 11:43:27,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:43:27,305 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2022-04-08 11:43:27,305 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 11:43:27,306 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 39 transitions. [2022-04-08 11:43:27,355 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:43:27,356 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-08 11:43:27,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 11:43:27,356 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:43:27,357 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:43:27,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-08 11:43:27,567 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:43:27,568 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:43:27,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:43:27,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1574040585, now seen corresponding path program 1 times [2022-04-08 11:43:27,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:43:27,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1214012915] [2022-04-08 11:43:27,574 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:43:27,574 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:43:27,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1574040585, now seen corresponding path program 2 times [2022-04-08 11:43:27,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:43:27,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540061379] [2022-04-08 11:43:27,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:43:27,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:43:27,589 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:43:27,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1300233115] [2022-04-08 11:43:27,589 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:43:27,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:43:27,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:43:27,591 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 11:43:27,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-08 11:43:27,645 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:43:27,646 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:43:27,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-08 11:43:27,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:43:27,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:43:28,529 INFO L272 TraceCheckUtils]: 0: Hoare triple {1177#true} call ULTIMATE.init(); {1177#true} is VALID [2022-04-08 11:43:28,529 INFO L290 TraceCheckUtils]: 1: Hoare triple {1177#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); {1177#true} is VALID [2022-04-08 11:43:28,530 INFO L290 TraceCheckUtils]: 2: Hoare triple {1177#true} assume true; {1177#true} is VALID [2022-04-08 11:43:28,530 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1177#true} {1177#true} #84#return; {1177#true} is VALID [2022-04-08 11:43:28,530 INFO L272 TraceCheckUtils]: 4: Hoare triple {1177#true} call #t~ret2 := main(); {1177#true} is VALID [2022-04-08 11:43:28,530 INFO L290 TraceCheckUtils]: 5: Hoare triple {1177#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {1177#true} is VALID [2022-04-08 11:43:28,530 INFO L272 TraceCheckUtils]: 6: Hoare triple {1177#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 1 then 1 else 0)); {1177#true} is VALID [2022-04-08 11:43:28,531 INFO L290 TraceCheckUtils]: 7: Hoare triple {1177#true} ~cond := #in~cond; {1203#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 11:43:28,531 INFO L290 TraceCheckUtils]: 8: Hoare triple {1203#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1207#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 11:43:28,532 INFO L290 TraceCheckUtils]: 9: Hoare triple {1207#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1207#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 11:43:28,534 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1207#(not (= |assume_abort_if_not_#in~cond| 0))} {1177#true} #78#return; {1214#(<= (mod main_~A~0 4294967296) 1)} is VALID [2022-04-08 11:43:28,536 INFO L290 TraceCheckUtils]: 11: Hoare triple {1214#(<= (mod main_~A~0 4294967296) 1)} ~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1218#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (= main_~q~0 0))} is VALID [2022-04-08 11:43:28,536 INFO L290 TraceCheckUtils]: 12: Hoare triple {1218#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (= main_~q~0 0))} assume !false; {1218#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (= main_~q~0 0))} is VALID [2022-04-08 11:43:28,537 INFO L290 TraceCheckUtils]: 13: Hoare triple {1218#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (= main_~q~0 0))} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1225#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-08 11:43:28,537 INFO L290 TraceCheckUtils]: 14: Hoare triple {1225#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} assume !false; {1225#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-08 11:43:28,538 INFO L290 TraceCheckUtils]: 15: Hoare triple {1225#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1225#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-08 11:43:28,539 INFO L290 TraceCheckUtils]: 16: Hoare triple {1225#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} assume !false; {1225#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-08 11:43:28,539 INFO L272 TraceCheckUtils]: 17: Hoare triple {1225#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1177#true} is VALID [2022-04-08 11:43:28,539 INFO L290 TraceCheckUtils]: 18: Hoare triple {1177#true} ~cond := #in~cond; {1177#true} is VALID [2022-04-08 11:43:28,539 INFO L290 TraceCheckUtils]: 19: Hoare triple {1177#true} assume !(0 == ~cond); {1177#true} is VALID [2022-04-08 11:43:28,539 INFO L290 TraceCheckUtils]: 20: Hoare triple {1177#true} assume true; {1177#true} is VALID [2022-04-08 11:43:28,540 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1177#true} {1225#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} #80#return; {1225#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-08 11:43:28,541 INFO L290 TraceCheckUtils]: 22: Hoare triple {1225#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (<= 1 (mod main_~r~0 4294967296)) (= 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); {1253#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-08 11:43:28,542 INFO L290 TraceCheckUtils]: 23: Hoare triple {1253#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1257#(and (= (+ main_~A~0 (* (- 1) main_~b~0)) main_~r~0) (= main_~b~0 1) (<= (mod main_~A~0 4294967296) 1) (= (+ (- 1) main_~q~0) 0) (<= 1 (mod main_~A~0 4294967296)))} is VALID [2022-04-08 11:43:28,543 INFO L290 TraceCheckUtils]: 24: Hoare triple {1257#(and (= (+ main_~A~0 (* (- 1) main_~b~0)) main_~r~0) (= main_~b~0 1) (<= (mod main_~A~0 4294967296) 1) (= (+ (- 1) main_~q~0) 0) (<= 1 (mod main_~A~0 4294967296)))} assume !false; {1257#(and (= (+ main_~A~0 (* (- 1) main_~b~0)) main_~r~0) (= main_~b~0 1) (<= (mod main_~A~0 4294967296) 1) (= (+ (- 1) main_~q~0) 0) (<= 1 (mod main_~A~0 4294967296)))} is VALID [2022-04-08 11:43:28,549 INFO L272 TraceCheckUtils]: 25: Hoare triple {1257#(and (= (+ main_~A~0 (* (- 1) main_~b~0)) main_~r~0) (= main_~b~0 1) (<= (mod main_~A~0 4294967296) 1) (= (+ (- 1) main_~q~0) 0) (<= 1 (mod main_~A~0 4294967296)))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1264#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:43:28,550 INFO L290 TraceCheckUtils]: 26: Hoare triple {1264#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1268#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:43:28,550 INFO L290 TraceCheckUtils]: 27: Hoare triple {1268#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1178#false} is VALID [2022-04-08 11:43:28,550 INFO L290 TraceCheckUtils]: 28: Hoare triple {1178#false} assume !false; {1178#false} is VALID [2022-04-08 11:43:28,551 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 11:43:28,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:43:54,096 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 (mod (* c_main_~b~0 2) 4294967296)) (.cse0 (mod c_main_~r~0 4294967296))) (or (not (<= (mod c_main_~b~0 4294967296) .cse0)) (= (mod c_main_~A~0 4294967296) (mod (+ (* (div .cse1 2) (* c_main_~q~0 2)) c_main_~r~0) 4294967296)) (<= .cse1 .cse0))) is different from true [2022-04-08 11:44:02,894 INFO L290 TraceCheckUtils]: 28: Hoare triple {1178#false} assume !false; {1178#false} is VALID [2022-04-08 11:44:02,895 INFO L290 TraceCheckUtils]: 27: Hoare triple {1268#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1178#false} is VALID [2022-04-08 11:44:02,895 INFO L290 TraceCheckUtils]: 26: Hoare triple {1264#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1268#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:44:02,896 INFO L272 TraceCheckUtils]: 25: Hoare triple {1284#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1264#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:44:02,897 INFO L290 TraceCheckUtils]: 24: Hoare triple {1284#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} assume !false; {1284#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-08 11:44:04,905 WARN L290 TraceCheckUtils]: 23: Hoare triple {1284#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1284#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is UNKNOWN [2022-04-08 11:44:06,908 WARN L290 TraceCheckUtils]: 22: Hoare triple {1294#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296))} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {1284#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is UNKNOWN [2022-04-08 11:44:06,909 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1177#true} {1294#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296))} #80#return; {1294#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296))} is VALID [2022-04-08 11:44:06,909 INFO L290 TraceCheckUtils]: 20: Hoare triple {1177#true} assume true; {1177#true} is VALID [2022-04-08 11:44:06,909 INFO L290 TraceCheckUtils]: 19: Hoare triple {1177#true} assume !(0 == ~cond); {1177#true} is VALID [2022-04-08 11:44:06,909 INFO L290 TraceCheckUtils]: 18: Hoare triple {1177#true} ~cond := #in~cond; {1177#true} is VALID [2022-04-08 11:44:06,909 INFO L272 TraceCheckUtils]: 17: Hoare triple {1294#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1177#true} is VALID [2022-04-08 11:44:06,910 INFO L290 TraceCheckUtils]: 16: Hoare triple {1294#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296))} assume !false; {1294#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296))} is VALID [2022-04-08 11:44:06,911 INFO L290 TraceCheckUtils]: 15: Hoare triple {1316#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1294#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296))} is VALID [2022-04-08 11:44:06,911 INFO L290 TraceCheckUtils]: 14: Hoare triple {1316#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} assume !false; {1316#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-08 11:44:09,054 WARN L290 TraceCheckUtils]: 13: Hoare triple {1323#(or (= (mod main_~A~0 4294967296) (mod (+ (* (* main_~q~0 2) (div (mod (* main_~b~0 2) 4294967296) 2)) main_~r~0) 4294967296)) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (<= (mod (* main_~b~0 2) 4294967296) (mod main_~r~0 4294967296)))} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1316#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} is UNKNOWN [2022-04-08 11:44:09,055 INFO L290 TraceCheckUtils]: 12: Hoare triple {1323#(or (= (mod main_~A~0 4294967296) (mod (+ (* (* main_~q~0 2) (div (mod (* main_~b~0 2) 4294967296) 2)) main_~r~0) 4294967296)) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (<= (mod (* main_~b~0 2) 4294967296) (mod main_~r~0 4294967296)))} assume !false; {1323#(or (= (mod main_~A~0 4294967296) (mod (+ (* (* main_~q~0 2) (div (mod (* main_~b~0 2) 4294967296) 2)) main_~r~0) 4294967296)) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (<= (mod (* main_~b~0 2) 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-08 11:44:09,055 INFO L290 TraceCheckUtils]: 11: Hoare triple {1177#true} ~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1323#(or (= (mod main_~A~0 4294967296) (mod (+ (* (* main_~q~0 2) (div (mod (* main_~b~0 2) 4294967296) 2)) main_~r~0) 4294967296)) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (<= (mod (* main_~b~0 2) 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-08 11:44:09,055 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1177#true} {1177#true} #78#return; {1177#true} is VALID [2022-04-08 11:44:09,055 INFO L290 TraceCheckUtils]: 9: Hoare triple {1177#true} assume true; {1177#true} is VALID [2022-04-08 11:44:09,056 INFO L290 TraceCheckUtils]: 8: Hoare triple {1177#true} assume !(0 == ~cond); {1177#true} is VALID [2022-04-08 11:44:09,056 INFO L290 TraceCheckUtils]: 7: Hoare triple {1177#true} ~cond := #in~cond; {1177#true} is VALID [2022-04-08 11:44:09,056 INFO L272 TraceCheckUtils]: 6: Hoare triple {1177#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 1 then 1 else 0)); {1177#true} is VALID [2022-04-08 11:44:09,056 INFO L290 TraceCheckUtils]: 5: Hoare triple {1177#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {1177#true} is VALID [2022-04-08 11:44:09,056 INFO L272 TraceCheckUtils]: 4: Hoare triple {1177#true} call #t~ret2 := main(); {1177#true} is VALID [2022-04-08 11:44:09,056 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1177#true} {1177#true} #84#return; {1177#true} is VALID [2022-04-08 11:44:09,056 INFO L290 TraceCheckUtils]: 2: Hoare triple {1177#true} assume true; {1177#true} is VALID [2022-04-08 11:44:09,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {1177#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); {1177#true} is VALID [2022-04-08 11:44:09,056 INFO L272 TraceCheckUtils]: 0: Hoare triple {1177#true} call ULTIMATE.init(); {1177#true} is VALID [2022-04-08 11:44:09,057 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-04-08 11:44:09,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:44:09,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540061379] [2022-04-08 11:44:09,057 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:44:09,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300233115] [2022-04-08 11:44:09,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1300233115] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:44:09,057 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:44:09,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 15 [2022-04-08 11:44:09,058 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:44:09,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1214012915] [2022-04-08 11:44:09,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1214012915] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:44:09,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:44:09,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 11:44:09,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604715125] [2022-04-08 11:44:09,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:44:09,059 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 9 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-08 11:44:09,059 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:44:09,059 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 9 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-08 11:44:09,117 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:44:09,117 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 11:44:09,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:44:09,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 11:44:09,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=138, Unknown=5, NotChecked=24, Total=210 [2022-04-08 11:44:09,118 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 9 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-08 11:44:11,910 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 11:44:13,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:44:13,144 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2022-04-08 11:44:13,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 11:44:13,145 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 9 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-08 11:44:13,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:44:13,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 9 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-08 11:44:13,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 62 transitions. [2022-04-08 11:44:13,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 9 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-08 11:44:13,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 62 transitions. [2022-04-08 11:44:13,150 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 62 transitions. [2022-04-08 11:44:13,384 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:44:13,385 INFO L225 Difference]: With dead ends: 64 [2022-04-08 11:44:13,385 INFO L226 Difference]: Without dead ends: 42 [2022-04-08 11:44:13,386 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=51, Invalid=188, Unknown=5, NotChecked=28, Total=272 [2022-04-08 11:44:13,387 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 19 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-04-08 11:44:13,387 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 129 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 141 Invalid, 1 Unknown, 0 Unchecked, 3.5s Time] [2022-04-08 11:44:13,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-08 11:44:13,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-04-08 11:44:13,417 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:44:13,417 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 42 states, 29 states have (on average 1.103448275862069) internal successors, (32), 30 states have internal predecessors, (32), 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-08 11:44:13,417 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 42 states, 29 states have (on average 1.103448275862069) internal successors, (32), 30 states have internal predecessors, (32), 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-08 11:44:13,417 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 42 states, 29 states have (on average 1.103448275862069) internal successors, (32), 30 states have internal predecessors, (32), 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-08 11:44:13,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:44:13,419 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2022-04-08 11:44:13,419 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2022-04-08 11:44:13,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:44:13,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:44:13,420 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 29 states have (on average 1.103448275862069) internal successors, (32), 30 states have internal predecessors, (32), 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 42 states. [2022-04-08 11:44:13,420 INFO L87 Difference]: Start difference. First operand has 42 states, 29 states have (on average 1.103448275862069) internal successors, (32), 30 states have internal predecessors, (32), 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 42 states. [2022-04-08 11:44:13,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:44:13,421 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2022-04-08 11:44:13,421 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2022-04-08 11:44:13,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:44:13,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:44:13,422 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:44:13,422 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:44:13,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 29 states have (on average 1.103448275862069) internal successors, (32), 30 states have internal predecessors, (32), 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-08 11:44:13,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2022-04-08 11:44:13,423 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 29 [2022-04-08 11:44:13,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:44:13,424 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2022-04-08 11:44:13,424 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 9 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-08 11:44:13,424 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 44 transitions. [2022-04-08 11:44:13,591 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:44:13,591 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2022-04-08 11:44:13,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-08 11:44:13,592 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:44:13,592 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-08 11:44:13,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-08 11:44:13,803 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:44:13,803 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:44:13,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:44:13,804 INFO L85 PathProgramCache]: Analyzing trace with hash -758101483, now seen corresponding path program 3 times [2022-04-08 11:44:13,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:44:13,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [688189591] [2022-04-08 11:44:13,808 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:44:13,808 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:44:13,808 INFO L85 PathProgramCache]: Analyzing trace with hash -758101483, now seen corresponding path program 4 times [2022-04-08 11:44:13,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:44:13,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450359942] [2022-04-08 11:44:13,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:44:13,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:44:13,830 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:44:13,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2129525773] [2022-04-08 11:44:13,831 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 11:44:13,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:44:13,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:44:13,835 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 11:44:13,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process