/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/divbin_unwindbound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 11:52:08,359 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 11:52:08,368 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 11:52:08,409 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 11:52:08,409 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 11:52:08,410 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 11:52:08,411 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 11:52:08,412 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 11:52:08,413 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 11:52:08,414 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 11:52:08,414 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 11:52:08,415 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 11:52:08,415 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 11:52:08,416 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 11:52:08,416 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 11:52:08,417 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 11:52:08,418 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 11:52:08,418 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 11:52:08,419 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 11:52:08,420 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 11:52:08,421 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 11:52:08,428 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 11:52:08,429 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 11:52:08,430 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 11:52:08,430 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 11:52:08,432 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 11:52:08,432 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 11:52:08,432 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 11:52:08,433 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 11:52:08,433 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 11:52:08,434 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 11:52:08,434 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 11:52:08,434 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 11:52:08,435 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 11:52:08,435 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 11:52:08,436 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 11:52:08,436 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 11:52:08,442 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 11:52:08,443 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 11:52:08,443 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 11:52:08,444 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 11:52:08,446 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 11:52:08,447 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 11:52:08,457 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 11:52:08,457 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 11:52:08,458 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 11:52:08,458 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 11:52:08,458 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 11:52:08,458 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 11:52:08,458 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 11:52:08,458 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 11:52:08,458 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 11:52:08,458 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 11:52:08,458 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 11:52:08,459 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 11:52:08,459 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 11:52:08,459 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 11:52:08,459 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 11:52:08,459 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 11:52:08,459 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 11:52:08,459 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 11:52:08,459 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 11:52:08,459 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 11:52:08,459 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 11:52:08,459 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 11:52:08,459 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-28 11:52:08,627 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 11:52:08,646 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 11:52:08,648 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 11:52:08,648 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 11:52:08,649 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 11:52:08,650 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/divbin_unwindbound2.i [2022-04-28 11:52:08,689 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21e4741f8/805325e066d04ffb8be023aad4adb6d8/FLAGc6d96c88a [2022-04-28 11:52:09,029 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 11:52:09,030 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin_unwindbound2.i [2022-04-28 11:52:09,034 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21e4741f8/805325e066d04ffb8be023aad4adb6d8/FLAGc6d96c88a [2022-04-28 11:52:09,472 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21e4741f8/805325e066d04ffb8be023aad4adb6d8 [2022-04-28 11:52:09,474 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 11:52:09,475 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 11:52:09,478 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 11:52:09,478 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 11:52:09,492 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 11:52:09,493 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 11:52:09" (1/1) ... [2022-04-28 11:52:09,494 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ab96b75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:52:09, skipping insertion in model container [2022-04-28 11:52:09,494 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 11:52:09" (1/1) ... [2022-04-28 11:52:09,498 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 11:52:09,508 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 11:52:09,656 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/divbin_unwindbound2.i[950,963] [2022-04-28 11:52:09,686 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 11:52:09,698 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 11:52:09,709 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/divbin_unwindbound2.i[950,963] [2022-04-28 11:52:09,718 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 11:52:09,728 INFO L208 MainTranslator]: Completed translation [2022-04-28 11:52:09,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:52:09 WrapperNode [2022-04-28 11:52:09,729 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 11:52:09,730 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 11:52:09,730 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 11:52:09,730 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 11:52:09,738 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:52:09" (1/1) ... [2022-04-28 11:52:09,738 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:52:09" (1/1) ... [2022-04-28 11:52:09,746 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:52:09" (1/1) ... [2022-04-28 11:52:09,746 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:52:09" (1/1) ... [2022-04-28 11:52:09,759 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:52:09" (1/1) ... [2022-04-28 11:52:09,762 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:52:09" (1/1) ... [2022-04-28 11:52:09,763 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:52:09" (1/1) ... [2022-04-28 11:52:09,764 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 11:52:09,765 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 11:52:09,765 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 11:52:09,765 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 11:52:09,768 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:52:09" (1/1) ... [2022-04-28 11:52:09,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 11:52:09,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:52:09,791 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-28 11:52:09,800 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-28 11:52:09,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 11:52:09,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 11:52:09,818 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 11:52:09,818 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 11:52:09,818 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 11:52:09,818 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 11:52:09,818 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 11:52:09,818 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 11:52:09,818 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-28 11:52:09,818 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-28 11:52:09,819 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 11:52:09,819 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 11:52:09,819 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-28 11:52:09,819 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 11:52:09,819 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 11:52:09,819 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 11:52:09,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 11:52:09,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 11:52:09,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 11:52:09,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 11:52:09,819 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 11:52:09,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 11:52:09,864 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 11:52:09,865 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 11:52:09,987 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 11:52:09,992 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 11:52:09,992 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-28 11:52:09,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 11:52:09 BoogieIcfgContainer [2022-04-28 11:52:09,994 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 11:52:09,995 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 11:52:09,995 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 11:52:10,011 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 11:52:10,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 11:52:09" (1/3) ... [2022-04-28 11:52:10,012 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45a1e289 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 11:52:10, skipping insertion in model container [2022-04-28 11:52:10,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:52:09" (2/3) ... [2022-04-28 11:52:10,013 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45a1e289 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 11:52:10, skipping insertion in model container [2022-04-28 11:52:10,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 11:52:09" (3/3) ... [2022-04-28 11:52:10,014 INFO L111 eAbstractionObserver]: Analyzing ICFG divbin_unwindbound2.i [2022-04-28 11:52:10,023 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 11:52:10,024 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 11:52:10,075 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 11:52:10,086 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@9b0cf06, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@34825537 [2022-04-28 11:52:10,086 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 11:52:10,095 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 11:52:10,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 11:52:10,101 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:52:10,101 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:52:10,102 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:52:10,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:52:10,105 INFO L85 PathProgramCache]: Analyzing trace with hash 878397729, now seen corresponding path program 1 times [2022-04-28 11:52:10,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:52:10,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1734494717] [2022-04-28 11:52:10,139 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:52:10,139 INFO L85 PathProgramCache]: Analyzing trace with hash 878397729, now seen corresponding path program 2 times [2022-04-28 11:52:10,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:52:10,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045182052] [2022-04-28 11:52:10,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:52:10,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:52:10,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:52:10,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 11:52:10,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:52:10,336 INFO L290 TraceCheckUtils]: 0: Hoare triple {49#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {36#true} is VALID [2022-04-28 11:52:10,336 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume true; {36#true} is VALID [2022-04-28 11:52:10,337 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36#true} {36#true} #89#return; {36#true} is VALID [2022-04-28 11:52:10,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 11:52:10,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:52:10,344 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-04-28 11:52:10,345 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-04-28 11:52:10,345 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-28 11:52:10,345 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#false} {36#true} #81#return; {37#false} is VALID [2022-04-28 11:52:10,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 11:52:10,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:52:10,352 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-04-28 11:52:10,353 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-04-28 11:52:10,353 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-28 11:52:10,353 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#false} {37#false} #83#return; {37#false} is VALID [2022-04-28 11:52:10,354 INFO L272 TraceCheckUtils]: 0: Hoare triple {36#true} call ULTIMATE.init(); {49#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 11:52:10,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {49#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {36#true} is VALID [2022-04-28 11:52:10,355 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#true} assume true; {36#true} is VALID [2022-04-28 11:52:10,355 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#true} {36#true} #89#return; {36#true} is VALID [2022-04-28 11:52:10,355 INFO L272 TraceCheckUtils]: 4: Hoare triple {36#true} call #t~ret5 := main(); {36#true} is VALID [2022-04-28 11:52:10,355 INFO L290 TraceCheckUtils]: 5: Hoare triple {36#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {36#true} is VALID [2022-04-28 11:52:10,355 INFO L272 TraceCheckUtils]: 6: Hoare triple {36#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {36#true} is VALID [2022-04-28 11:52:10,356 INFO L290 TraceCheckUtils]: 7: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-04-28 11:52:10,356 INFO L290 TraceCheckUtils]: 8: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-04-28 11:52:10,356 INFO L290 TraceCheckUtils]: 9: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-28 11:52:10,356 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {37#false} {36#true} #81#return; {37#false} is VALID [2022-04-28 11:52:10,357 INFO L272 TraceCheckUtils]: 11: Hoare triple {37#false} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {36#true} is VALID [2022-04-28 11:52:10,357 INFO L290 TraceCheckUtils]: 12: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-04-28 11:52:10,357 INFO L290 TraceCheckUtils]: 13: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-04-28 11:52:10,357 INFO L290 TraceCheckUtils]: 14: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-28 11:52:10,357 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {37#false} {37#false} #83#return; {37#false} is VALID [2022-04-28 11:52:10,358 INFO L290 TraceCheckUtils]: 16: Hoare triple {37#false} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {37#false} is VALID [2022-04-28 11:52:10,358 INFO L290 TraceCheckUtils]: 17: Hoare triple {37#false} assume !true; {37#false} is VALID [2022-04-28 11:52:10,358 INFO L290 TraceCheckUtils]: 18: Hoare triple {37#false} assume !true; {37#false} is VALID [2022-04-28 11:52:10,358 INFO L272 TraceCheckUtils]: 19: Hoare triple {37#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {37#false} is VALID [2022-04-28 11:52:10,358 INFO L290 TraceCheckUtils]: 20: Hoare triple {37#false} ~cond := #in~cond; {37#false} is VALID [2022-04-28 11:52:10,359 INFO L290 TraceCheckUtils]: 21: Hoare triple {37#false} assume 0 == ~cond; {37#false} is VALID [2022-04-28 11:52:10,359 INFO L290 TraceCheckUtils]: 22: Hoare triple {37#false} assume !false; {37#false} is VALID [2022-04-28 11:52:10,359 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 11:52:10,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:52:10,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045182052] [2022-04-28 11:52:10,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045182052] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:52:10,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:52:10,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 11:52:10,363 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:52:10,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1734494717] [2022-04-28 11:52:10,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1734494717] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:52:10,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:52:10,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 11:52:10,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96349959] [2022-04-28 11:52:10,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:52:10,368 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-28 11:52:10,369 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:52:10,371 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:52:10,392 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-28 11:52:10,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 11:52:10,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:52:10,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 11:52:10,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 11:52:10,409 INFO L87 Difference]: Start difference. First operand has 33 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:52:10,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:52:10,543 INFO L93 Difference]: Finished difference Result 60 states and 84 transitions. [2022-04-28 11:52:10,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 11:52:10,544 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-28 11:52:10,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:52:10,545 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:52:10,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2022-04-28 11:52:10,556 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:52:10,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2022-04-28 11:52:10,559 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 84 transitions. [2022-04-28 11:52:10,637 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:52:10,643 INFO L225 Difference]: With dead ends: 60 [2022-04-28 11:52:10,643 INFO L226 Difference]: Without dead ends: 29 [2022-04-28 11:52:10,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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-28 11:52:10,648 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:52:10,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 40 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:52:10,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-28 11:52:10,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2022-04-28 11:52:10,670 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:52:10,671 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 11:52:10,672 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 11:52:10,672 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 11:52:10,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:52:10,675 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-28 11:52:10,675 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-28 11:52:10,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:52:10,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:52:10,676 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 29 states. [2022-04-28 11:52:10,677 INFO L87 Difference]: Start difference. First operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 29 states. [2022-04-28 11:52:10,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:52:10,679 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-28 11:52:10,679 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-28 11:52:10,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:52:10,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:52:10,680 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:52:10,680 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:52:10,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 11:52:10,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2022-04-28 11:52:10,683 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 23 [2022-04-28 11:52:10,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:52:10,683 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-04-28 11:52:10,683 INFO L496 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:52:10,684 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 34 transitions. [2022-04-28 11:52:10,711 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:52:10,712 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-04-28 11:52:10,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 11:52:10,713 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:52:10,713 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:52:10,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 11:52:10,714 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:52:10,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:52:10,716 INFO L85 PathProgramCache]: Analyzing trace with hash 994169231, now seen corresponding path program 1 times [2022-04-28 11:52:10,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:52:10,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1322573398] [2022-04-28 11:52:10,718 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:52:10,718 INFO L85 PathProgramCache]: Analyzing trace with hash 994169231, now seen corresponding path program 2 times [2022-04-28 11:52:10,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:52:10,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488259549] [2022-04-28 11:52:10,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:52:10,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:52:10,750 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:52:10,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [833019156] [2022-04-28 11:52:10,750 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:52:10,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:52:10,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:52:10,752 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-28 11:52:10,753 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-28 11:52:10,796 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 11:52:10,796 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:52:10,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 11:52:10,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:52:10,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:52:11,009 INFO L272 TraceCheckUtils]: 0: Hoare triple {286#true} call ULTIMATE.init(); {286#true} is VALID [2022-04-28 11:52:11,010 INFO L290 TraceCheckUtils]: 1: Hoare triple {286#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(9, 2);~counter~0 := 0; {294#(<= ~counter~0 0)} is VALID [2022-04-28 11:52:11,011 INFO L290 TraceCheckUtils]: 2: Hoare triple {294#(<= ~counter~0 0)} assume true; {294#(<= ~counter~0 0)} is VALID [2022-04-28 11:52:11,012 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {294#(<= ~counter~0 0)} {286#true} #89#return; {294#(<= ~counter~0 0)} is VALID [2022-04-28 11:52:11,012 INFO L272 TraceCheckUtils]: 4: Hoare triple {294#(<= ~counter~0 0)} call #t~ret5 := main(); {294#(<= ~counter~0 0)} is VALID [2022-04-28 11:52:11,012 INFO L290 TraceCheckUtils]: 5: Hoare triple {294#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {294#(<= ~counter~0 0)} is VALID [2022-04-28 11:52:11,013 INFO L272 TraceCheckUtils]: 6: Hoare triple {294#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {294#(<= ~counter~0 0)} is VALID [2022-04-28 11:52:11,013 INFO L290 TraceCheckUtils]: 7: Hoare triple {294#(<= ~counter~0 0)} ~cond := #in~cond; {294#(<= ~counter~0 0)} is VALID [2022-04-28 11:52:11,014 INFO L290 TraceCheckUtils]: 8: Hoare triple {294#(<= ~counter~0 0)} assume !(0 == ~cond); {294#(<= ~counter~0 0)} is VALID [2022-04-28 11:52:11,015 INFO L290 TraceCheckUtils]: 9: Hoare triple {294#(<= ~counter~0 0)} assume true; {294#(<= ~counter~0 0)} is VALID [2022-04-28 11:52:11,016 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {294#(<= ~counter~0 0)} {294#(<= ~counter~0 0)} #81#return; {294#(<= ~counter~0 0)} is VALID [2022-04-28 11:52:11,017 INFO L272 TraceCheckUtils]: 11: Hoare triple {294#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {294#(<= ~counter~0 0)} is VALID [2022-04-28 11:52:11,017 INFO L290 TraceCheckUtils]: 12: Hoare triple {294#(<= ~counter~0 0)} ~cond := #in~cond; {294#(<= ~counter~0 0)} is VALID [2022-04-28 11:52:11,018 INFO L290 TraceCheckUtils]: 13: Hoare triple {294#(<= ~counter~0 0)} assume !(0 == ~cond); {294#(<= ~counter~0 0)} is VALID [2022-04-28 11:52:11,021 INFO L290 TraceCheckUtils]: 14: Hoare triple {294#(<= ~counter~0 0)} assume true; {294#(<= ~counter~0 0)} is VALID [2022-04-28 11:52:11,022 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {294#(<= ~counter~0 0)} {294#(<= ~counter~0 0)} #83#return; {294#(<= ~counter~0 0)} is VALID [2022-04-28 11:52:11,022 INFO L290 TraceCheckUtils]: 16: Hoare triple {294#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {294#(<= ~counter~0 0)} is VALID [2022-04-28 11:52:11,023 INFO L290 TraceCheckUtils]: 17: Hoare triple {294#(<= ~counter~0 0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {343#(<= |main_#t~post3| 0)} is VALID [2022-04-28 11:52:11,025 INFO L290 TraceCheckUtils]: 18: Hoare triple {343#(<= |main_#t~post3| 0)} assume !(#t~post3 < 2);havoc #t~post3; {287#false} is VALID [2022-04-28 11:52:11,025 INFO L290 TraceCheckUtils]: 19: Hoare triple {287#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {287#false} is VALID [2022-04-28 11:52:11,025 INFO L290 TraceCheckUtils]: 20: Hoare triple {287#false} assume !(#t~post4 < 2);havoc #t~post4; {287#false} is VALID [2022-04-28 11:52:11,026 INFO L272 TraceCheckUtils]: 21: Hoare triple {287#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {287#false} is VALID [2022-04-28 11:52:11,026 INFO L290 TraceCheckUtils]: 22: Hoare triple {287#false} ~cond := #in~cond; {287#false} is VALID [2022-04-28 11:52:11,026 INFO L290 TraceCheckUtils]: 23: Hoare triple {287#false} assume 0 == ~cond; {287#false} is VALID [2022-04-28 11:52:11,026 INFO L290 TraceCheckUtils]: 24: Hoare triple {287#false} assume !false; {287#false} is VALID [2022-04-28 11:52:11,026 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 11:52:11,027 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:52:11,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:52:11,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488259549] [2022-04-28 11:52:11,027 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:52:11,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833019156] [2022-04-28 11:52:11,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833019156] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:52:11,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:52:11,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 11:52:11,028 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:52:11,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1322573398] [2022-04-28 11:52:11,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1322573398] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:52:11,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:52:11,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 11:52:11,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468742848] [2022-04-28 11:52:11,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:52:11,030 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-04-28 11:52:11,030 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:52:11,030 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:52:11,049 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:52:11,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 11:52:11,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:52:11,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 11:52:11,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 11:52:11,051 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:52:11,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:52:11,126 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2022-04-28 11:52:11,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 11:52:11,126 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-04-28 11:52:11,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:52:11,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:52:11,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-04-28 11:52:11,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:52:11,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-04-28 11:52:11,136 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 52 transitions. [2022-04-28 11:52:11,180 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:52:11,183 INFO L225 Difference]: With dead ends: 42 [2022-04-28 11:52:11,183 INFO L226 Difference]: Without dead ends: 30 [2022-04-28 11:52:11,183 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 11:52:11,185 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:52:11,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:52:11,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-28 11:52:11,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-28 11:52:11,206 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:52:11,207 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 11:52:11,207 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 11:52:11,208 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 11:52:11,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:52:11,211 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-04-28 11:52:11,211 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-28 11:52:11,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:52:11,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:52:11,216 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 30 states. [2022-04-28 11:52:11,219 INFO L87 Difference]: Start difference. First operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 30 states. [2022-04-28 11:52:11,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:52:11,225 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-04-28 11:52:11,225 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-28 11:52:11,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:52:11,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:52:11,225 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:52:11,225 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:52:11,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 11:52:11,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-04-28 11:52:11,227 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 25 [2022-04-28 11:52:11,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:52:11,227 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-04-28 11:52:11,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:52:11,227 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 36 transitions. [2022-04-28 11:52:11,261 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:52:11,261 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-28 11:52:11,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 11:52:11,266 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:52:11,266 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:52:11,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 11:52:11,483 WARN L477 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-28 11:52:11,484 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:52:11,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:52:11,484 INFO L85 PathProgramCache]: Analyzing trace with hash 422434646, now seen corresponding path program 1 times [2022-04-28 11:52:11,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:52:11,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [144344033] [2022-04-28 11:52:11,485 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:52:11,485 INFO L85 PathProgramCache]: Analyzing trace with hash 422434646, now seen corresponding path program 2 times [2022-04-28 11:52:11,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:52:11,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030230618] [2022-04-28 11:52:11,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:52:11,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:52:11,517 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:52:11,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1244491967] [2022-04-28 11:52:11,518 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:52:11,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:52:11,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:52:11,519 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-28 11:52:11,520 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-28 11:52:11,558 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 11:52:11,558 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:52:11,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 11:52:11,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:52:11,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:52:11,721 INFO L272 TraceCheckUtils]: 0: Hoare triple {568#true} call ULTIMATE.init(); {568#true} is VALID [2022-04-28 11:52:11,721 INFO L290 TraceCheckUtils]: 1: Hoare triple {568#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(9, 2);~counter~0 := 0; {576#(<= ~counter~0 0)} is VALID [2022-04-28 11:52:11,722 INFO L290 TraceCheckUtils]: 2: Hoare triple {576#(<= ~counter~0 0)} assume true; {576#(<= ~counter~0 0)} is VALID [2022-04-28 11:52:11,722 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {576#(<= ~counter~0 0)} {568#true} #89#return; {576#(<= ~counter~0 0)} is VALID [2022-04-28 11:52:11,723 INFO L272 TraceCheckUtils]: 4: Hoare triple {576#(<= ~counter~0 0)} call #t~ret5 := main(); {576#(<= ~counter~0 0)} is VALID [2022-04-28 11:52:11,724 INFO L290 TraceCheckUtils]: 5: Hoare triple {576#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {576#(<= ~counter~0 0)} is VALID [2022-04-28 11:52:11,724 INFO L272 TraceCheckUtils]: 6: Hoare triple {576#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {576#(<= ~counter~0 0)} is VALID [2022-04-28 11:52:11,724 INFO L290 TraceCheckUtils]: 7: Hoare triple {576#(<= ~counter~0 0)} ~cond := #in~cond; {576#(<= ~counter~0 0)} is VALID [2022-04-28 11:52:11,725 INFO L290 TraceCheckUtils]: 8: Hoare triple {576#(<= ~counter~0 0)} assume !(0 == ~cond); {576#(<= ~counter~0 0)} is VALID [2022-04-28 11:52:11,725 INFO L290 TraceCheckUtils]: 9: Hoare triple {576#(<= ~counter~0 0)} assume true; {576#(<= ~counter~0 0)} is VALID [2022-04-28 11:52:11,725 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {576#(<= ~counter~0 0)} {576#(<= ~counter~0 0)} #81#return; {576#(<= ~counter~0 0)} is VALID [2022-04-28 11:52:11,726 INFO L272 TraceCheckUtils]: 11: Hoare triple {576#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {576#(<= ~counter~0 0)} is VALID [2022-04-28 11:52:11,726 INFO L290 TraceCheckUtils]: 12: Hoare triple {576#(<= ~counter~0 0)} ~cond := #in~cond; {576#(<= ~counter~0 0)} is VALID [2022-04-28 11:52:11,727 INFO L290 TraceCheckUtils]: 13: Hoare triple {576#(<= ~counter~0 0)} assume !(0 == ~cond); {576#(<= ~counter~0 0)} is VALID [2022-04-28 11:52:11,727 INFO L290 TraceCheckUtils]: 14: Hoare triple {576#(<= ~counter~0 0)} assume true; {576#(<= ~counter~0 0)} is VALID [2022-04-28 11:52:11,727 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {576#(<= ~counter~0 0)} {576#(<= ~counter~0 0)} #83#return; {576#(<= ~counter~0 0)} is VALID [2022-04-28 11:52:11,728 INFO L290 TraceCheckUtils]: 16: Hoare triple {576#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {576#(<= ~counter~0 0)} is VALID [2022-04-28 11:52:11,729 INFO L290 TraceCheckUtils]: 17: Hoare triple {576#(<= ~counter~0 0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {625#(<= ~counter~0 1)} is VALID [2022-04-28 11:52:11,729 INFO L290 TraceCheckUtils]: 18: Hoare triple {625#(<= ~counter~0 1)} assume !!(#t~post3 < 2);havoc #t~post3; {625#(<= ~counter~0 1)} is VALID [2022-04-28 11:52:11,730 INFO L290 TraceCheckUtils]: 19: Hoare triple {625#(<= ~counter~0 1)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {625#(<= ~counter~0 1)} is VALID [2022-04-28 11:52:11,730 INFO L290 TraceCheckUtils]: 20: Hoare triple {625#(<= ~counter~0 1)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {635#(<= |main_#t~post4| 1)} is VALID [2022-04-28 11:52:11,730 INFO L290 TraceCheckUtils]: 21: Hoare triple {635#(<= |main_#t~post4| 1)} assume !(#t~post4 < 2);havoc #t~post4; {569#false} is VALID [2022-04-28 11:52:11,731 INFO L272 TraceCheckUtils]: 22: Hoare triple {569#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {569#false} is VALID [2022-04-28 11:52:11,731 INFO L290 TraceCheckUtils]: 23: Hoare triple {569#false} ~cond := #in~cond; {569#false} is VALID [2022-04-28 11:52:11,731 INFO L290 TraceCheckUtils]: 24: Hoare triple {569#false} assume 0 == ~cond; {569#false} is VALID [2022-04-28 11:52:11,731 INFO L290 TraceCheckUtils]: 25: Hoare triple {569#false} assume !false; {569#false} is VALID [2022-04-28 11:52:11,731 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 11:52:11,731 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:52:11,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:52:11,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030230618] [2022-04-28 11:52:11,732 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:52:11,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244491967] [2022-04-28 11:52:11,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1244491967] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:52:11,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:52:11,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:52:11,732 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:52:11,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [144344033] [2022-04-28 11:52:11,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [144344033] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:52:11,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:52:11,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:52:11,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617175839] [2022-04-28 11:52:11,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:52:11,733 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-04-28 11:52:11,733 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:52:11,733 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:52:11,749 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:52:11,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:52:11,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:52:11,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:52:11,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:52:11,750 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:52:11,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:52:11,828 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-28 11:52:11,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 11:52:11,828 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-04-28 11:52:11,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:52:11,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:52:11,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-04-28 11:52:11,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:52:11,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-04-28 11:52:11,832 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 48 transitions. [2022-04-28 11:52:11,861 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-28 11:52:11,862 INFO L225 Difference]: With dead ends: 41 [2022-04-28 11:52:11,862 INFO L226 Difference]: Without dead ends: 34 [2022-04-28 11:52:11,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:52:11,863 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 7 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:52:11,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 82 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:52:11,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-28 11:52:11,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2022-04-28 11:52:11,875 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:52:11,876 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 11:52:11,876 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 11:52:11,876 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 11:52:11,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:52:11,878 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2022-04-28 11:52:11,878 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-04-28 11:52:11,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:52:11,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:52:11,878 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-28 11:52:11,879 INFO L87 Difference]: Start difference. First operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-28 11:52:11,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:52:11,880 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2022-04-28 11:52:11,880 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-04-28 11:52:11,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:52:11,880 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:52:11,880 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:52:11,880 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:52:11,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 11:52:11,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2022-04-28 11:52:11,882 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 26 [2022-04-28 11:52:11,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:52:11,882 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2022-04-28 11:52:11,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:52:11,882 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 40 transitions. [2022-04-28 11:52:11,914 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:52:11,915 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2022-04-28 11:52:11,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 11:52:11,915 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:52:11,915 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:52:11,932 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-28 11:52:12,131 WARN L477 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-28 11:52:12,132 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:52:12,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:52:12,132 INFO L85 PathProgramCache]: Analyzing trace with hash 424222106, now seen corresponding path program 1 times [2022-04-28 11:52:12,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:52:12,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [537151411] [2022-04-28 11:52:12,134 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:52:12,134 INFO L85 PathProgramCache]: Analyzing trace with hash 424222106, now seen corresponding path program 2 times [2022-04-28 11:52:12,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:52:12,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200198605] [2022-04-28 11:52:12,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:52:12,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:52:12,169 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:52:12,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1445634904] [2022-04-28 11:52:12,169 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:52:12,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:52:12,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:52:12,171 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-28 11:52:12,180 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-28 11:52:12,234 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 11:52:12,235 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:52:12,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 11:52:12,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:52:12,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:52:12,647 INFO L272 TraceCheckUtils]: 0: Hoare triple {866#true} call ULTIMATE.init(); {866#true} is VALID [2022-04-28 11:52:12,647 INFO L290 TraceCheckUtils]: 1: Hoare triple {866#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(9, 2);~counter~0 := 0; {866#true} is VALID [2022-04-28 11:52:12,648 INFO L290 TraceCheckUtils]: 2: Hoare triple {866#true} assume true; {866#true} is VALID [2022-04-28 11:52:12,648 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {866#true} {866#true} #89#return; {866#true} is VALID [2022-04-28 11:52:12,648 INFO L272 TraceCheckUtils]: 4: Hoare triple {866#true} call #t~ret5 := main(); {866#true} is VALID [2022-04-28 11:52:12,649 INFO L290 TraceCheckUtils]: 5: Hoare triple {866#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {866#true} is VALID [2022-04-28 11:52:12,649 INFO L272 TraceCheckUtils]: 6: Hoare triple {866#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {866#true} is VALID [2022-04-28 11:52:12,649 INFO L290 TraceCheckUtils]: 7: Hoare triple {866#true} ~cond := #in~cond; {866#true} is VALID [2022-04-28 11:52:12,649 INFO L290 TraceCheckUtils]: 8: Hoare triple {866#true} assume !(0 == ~cond); {866#true} is VALID [2022-04-28 11:52:12,649 INFO L290 TraceCheckUtils]: 9: Hoare triple {866#true} assume true; {866#true} is VALID [2022-04-28 11:52:12,649 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {866#true} {866#true} #81#return; {866#true} is VALID [2022-04-28 11:52:12,649 INFO L272 TraceCheckUtils]: 11: Hoare triple {866#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {866#true} is VALID [2022-04-28 11:52:12,649 INFO L290 TraceCheckUtils]: 12: Hoare triple {866#true} ~cond := #in~cond; {866#true} is VALID [2022-04-28 11:52:12,650 INFO L290 TraceCheckUtils]: 13: Hoare triple {866#true} assume !(0 == ~cond); {866#true} is VALID [2022-04-28 11:52:12,650 INFO L290 TraceCheckUtils]: 14: Hoare triple {866#true} assume true; {866#true} is VALID [2022-04-28 11:52:12,650 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {866#true} {866#true} #83#return; {866#true} is VALID [2022-04-28 11:52:12,650 INFO L290 TraceCheckUtils]: 16: Hoare triple {866#true} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {919#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:52:12,653 INFO L290 TraceCheckUtils]: 17: Hoare triple {919#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {919#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:52:12,653 INFO L290 TraceCheckUtils]: 18: Hoare triple {919#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post3 < 2);havoc #t~post3; {919#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:52:12,654 INFO L290 TraceCheckUtils]: 19: Hoare triple {919#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {929#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:52:12,654 INFO L290 TraceCheckUtils]: 20: Hoare triple {929#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {929#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:52:12,655 INFO L290 TraceCheckUtils]: 21: Hoare triple {929#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post4 < 2);havoc #t~post4; {929#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:52:12,656 INFO L272 TraceCheckUtils]: 22: Hoare triple {929#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {939#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:52:12,656 INFO L290 TraceCheckUtils]: 23: Hoare triple {939#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {943#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:52:12,656 INFO L290 TraceCheckUtils]: 24: Hoare triple {943#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {867#false} is VALID [2022-04-28 11:52:12,657 INFO L290 TraceCheckUtils]: 25: Hoare triple {867#false} assume !false; {867#false} is VALID [2022-04-28 11:52:12,657 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 11:52:12,657 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:52:12,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:52:12,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200198605] [2022-04-28 11:52:12,657 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:52:12,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445634904] [2022-04-28 11:52:12,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1445634904] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:52:12,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:52:12,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 11:52:12,658 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:52:12,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [537151411] [2022-04-28 11:52:12,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [537151411] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:52:12,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:52:12,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 11:52:12,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968963472] [2022-04-28 11:52:12,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:52:12,659 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-04-28 11:52:12,659 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:52:12,659 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 11:52:12,674 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:52:12,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 11:52:12,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:52:12,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 11:52:12,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-28 11:52:12,675 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 11:52:14,818 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-28 11:52:14,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:52:14,958 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2022-04-28 11:52:14,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 11:52:14,958 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-04-28 11:52:14,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:52:14,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 11:52:14,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2022-04-28 11:52:14,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 11:52:14,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2022-04-28 11:52:14,961 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 57 transitions. [2022-04-28 11:52:15,009 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:52:15,010 INFO L225 Difference]: With dead ends: 50 [2022-04-28 11:52:15,011 INFO L226 Difference]: Without dead ends: 46 [2022-04-28 11:52:15,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-28 11:52:15,011 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 18 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:52:15,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 104 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 48 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-04-28 11:52:15,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-28 11:52:15,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2022-04-28 11:52:15,030 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:52:15,030 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 39 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 11:52:15,030 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 39 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 11:52:15,030 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 39 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 11:52:15,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:52:15,032 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2022-04-28 11:52:15,032 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2022-04-28 11:52:15,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:52:15,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:52:15,032 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 46 states. [2022-04-28 11:52:15,033 INFO L87 Difference]: Start difference. First operand has 39 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 46 states. [2022-04-28 11:52:15,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:52:15,034 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2022-04-28 11:52:15,034 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2022-04-28 11:52:15,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:52:15,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:52:15,035 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:52:15,035 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:52:15,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 11:52:15,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2022-04-28 11:52:15,036 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 26 [2022-04-28 11:52:15,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:52:15,036 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2022-04-28 11:52:15,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 11:52:15,036 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 46 transitions. [2022-04-28 11:52:15,081 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:52:15,081 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-04-28 11:52:15,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 11:52:15,081 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:52:15,082 INFO L195 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1] [2022-04-28 11:52:15,106 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-28 11:52:15,282 WARN L477 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-28 11:52:15,283 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:52:15,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:52:15,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1733722638, now seen corresponding path program 1 times [2022-04-28 11:52:15,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:52:15,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2067206185] [2022-04-28 11:52:15,284 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:52:15,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1733722638, now seen corresponding path program 2 times [2022-04-28 11:52:15,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:52:15,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126802406] [2022-04-28 11:52:15,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:52:15,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:52:15,310 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:52:15,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1901063446] [2022-04-28 11:52:15,310 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:52:15,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:52:15,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:52:15,311 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-28 11:52:15,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 11:52:15,363 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:52:15,363 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:52:15,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-28 11:52:15,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:52:15,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:52:15,454 INFO L272 TraceCheckUtils]: 0: Hoare triple {1221#true} call ULTIMATE.init(); {1221#true} is VALID [2022-04-28 11:52:15,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {1221#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(9, 2);~counter~0 := 0; {1221#true} is VALID [2022-04-28 11:52:15,455 INFO L290 TraceCheckUtils]: 2: Hoare triple {1221#true} assume true; {1221#true} is VALID [2022-04-28 11:52:15,455 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1221#true} {1221#true} #89#return; {1221#true} is VALID [2022-04-28 11:52:15,455 INFO L272 TraceCheckUtils]: 4: Hoare triple {1221#true} call #t~ret5 := main(); {1221#true} is VALID [2022-04-28 11:52:15,455 INFO L290 TraceCheckUtils]: 5: Hoare triple {1221#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {1221#true} is VALID [2022-04-28 11:52:15,455 INFO L272 TraceCheckUtils]: 6: Hoare triple {1221#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {1221#true} is VALID [2022-04-28 11:52:15,455 INFO L290 TraceCheckUtils]: 7: Hoare triple {1221#true} ~cond := #in~cond; {1221#true} is VALID [2022-04-28 11:52:15,455 INFO L290 TraceCheckUtils]: 8: Hoare triple {1221#true} assume !(0 == ~cond); {1221#true} is VALID [2022-04-28 11:52:15,456 INFO L290 TraceCheckUtils]: 9: Hoare triple {1221#true} assume true; {1221#true} is VALID [2022-04-28 11:52:15,456 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1221#true} {1221#true} #81#return; {1221#true} is VALID [2022-04-28 11:52:15,456 INFO L272 TraceCheckUtils]: 11: Hoare triple {1221#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1221#true} is VALID [2022-04-28 11:52:15,456 INFO L290 TraceCheckUtils]: 12: Hoare triple {1221#true} ~cond := #in~cond; {1221#true} is VALID [2022-04-28 11:52:15,456 INFO L290 TraceCheckUtils]: 13: Hoare triple {1221#true} assume !(0 == ~cond); {1221#true} is VALID [2022-04-28 11:52:15,456 INFO L290 TraceCheckUtils]: 14: Hoare triple {1221#true} assume true; {1221#true} is VALID [2022-04-28 11:52:15,456 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1221#true} {1221#true} #83#return; {1221#true} is VALID [2022-04-28 11:52:15,457 INFO L290 TraceCheckUtils]: 16: Hoare triple {1221#true} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1274#(= main_~B~0 main_~b~0)} is VALID [2022-04-28 11:52:15,457 INFO L290 TraceCheckUtils]: 17: Hoare triple {1274#(= main_~B~0 main_~b~0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1274#(= main_~B~0 main_~b~0)} is VALID [2022-04-28 11:52:15,457 INFO L290 TraceCheckUtils]: 18: Hoare triple {1274#(= main_~B~0 main_~b~0)} assume !!(#t~post3 < 2);havoc #t~post3; {1274#(= main_~B~0 main_~b~0)} is VALID [2022-04-28 11:52:15,458 INFO L290 TraceCheckUtils]: 19: Hoare triple {1274#(= main_~B~0 main_~b~0)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1274#(= main_~B~0 main_~b~0)} is VALID [2022-04-28 11:52:15,458 INFO L290 TraceCheckUtils]: 20: Hoare triple {1274#(= main_~B~0 main_~b~0)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {1274#(= main_~B~0 main_~b~0)} is VALID [2022-04-28 11:52:15,458 INFO L290 TraceCheckUtils]: 21: Hoare triple {1274#(= main_~B~0 main_~b~0)} assume !!(#t~post4 < 2);havoc #t~post4; {1274#(= main_~B~0 main_~b~0)} is VALID [2022-04-28 11:52:15,459 INFO L272 TraceCheckUtils]: 22: Hoare triple {1274#(= main_~B~0 main_~b~0)} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1221#true} is VALID [2022-04-28 11:52:15,459 INFO L290 TraceCheckUtils]: 23: Hoare triple {1221#true} ~cond := #in~cond; {1221#true} is VALID [2022-04-28 11:52:15,459 INFO L290 TraceCheckUtils]: 24: Hoare triple {1221#true} assume !(0 == ~cond); {1221#true} is VALID [2022-04-28 11:52:15,459 INFO L290 TraceCheckUtils]: 25: Hoare triple {1221#true} assume true; {1221#true} is VALID [2022-04-28 11:52:15,459 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1221#true} {1274#(= main_~B~0 main_~b~0)} #85#return; {1274#(= main_~B~0 main_~b~0)} is VALID [2022-04-28 11:52:15,460 INFO L290 TraceCheckUtils]: 27: Hoare triple {1274#(= main_~B~0 main_~b~0)} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {1222#false} is VALID [2022-04-28 11:52:15,460 INFO L290 TraceCheckUtils]: 28: Hoare triple {1222#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1222#false} is VALID [2022-04-28 11:52:15,460 INFO L290 TraceCheckUtils]: 29: Hoare triple {1222#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {1222#false} is VALID [2022-04-28 11:52:15,460 INFO L290 TraceCheckUtils]: 30: Hoare triple {1222#false} assume !(#t~post4 < 2);havoc #t~post4; {1222#false} is VALID [2022-04-28 11:52:15,460 INFO L272 TraceCheckUtils]: 31: Hoare triple {1222#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1222#false} is VALID [2022-04-28 11:52:15,461 INFO L290 TraceCheckUtils]: 32: Hoare triple {1222#false} ~cond := #in~cond; {1222#false} is VALID [2022-04-28 11:52:15,461 INFO L290 TraceCheckUtils]: 33: Hoare triple {1222#false} assume 0 == ~cond; {1222#false} is VALID [2022-04-28 11:52:15,461 INFO L290 TraceCheckUtils]: 34: Hoare triple {1222#false} assume !false; {1222#false} is VALID [2022-04-28 11:52:15,461 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 11:52:15,461 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:52:15,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:52:15,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126802406] [2022-04-28 11:52:15,461 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:52:15,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901063446] [2022-04-28 11:52:15,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1901063446] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:52:15,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:52:15,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 11:52:15,462 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:52:15,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2067206185] [2022-04-28 11:52:15,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2067206185] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:52:15,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:52:15,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 11:52:15,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994107018] [2022-04-28 11:52:15,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:52:15,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2022-04-28 11:52:15,463 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:52:15,463 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 11:52:15,482 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:52:15,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 11:52:15,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:52:15,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 11:52:15,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 11:52:15,483 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 11:52:15,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:52:15,587 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2022-04-28 11:52:15,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 11:52:15,588 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2022-04-28 11:52:15,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:52:15,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 11:52:15,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2022-04-28 11:52:15,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 11:52:15,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2022-04-28 11:52:15,590 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 58 transitions. [2022-04-28 11:52:15,644 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:52:15,645 INFO L225 Difference]: With dead ends: 65 [2022-04-28 11:52:15,645 INFO L226 Difference]: Without dead ends: 40 [2022-04-28 11:52:15,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 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-28 11:52:15,646 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:52:15,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:52:15,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-28 11:52:15,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-04-28 11:52:15,663 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:52:15,663 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 40 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 11:52:15,664 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 40 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 11:52:15,664 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 40 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 11:52:15,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:52:15,665 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2022-04-28 11:52:15,665 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-04-28 11:52:15,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:52:15,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:52:15,666 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 40 states. [2022-04-28 11:52:15,666 INFO L87 Difference]: Start difference. First operand has 40 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 40 states. [2022-04-28 11:52:15,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:52:15,667 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2022-04-28 11:52:15,667 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-04-28 11:52:15,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:52:15,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:52:15,667 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:52:15,667 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:52:15,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 11:52:15,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2022-04-28 11:52:15,669 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 35 [2022-04-28 11:52:15,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:52:15,669 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2022-04-28 11:52:15,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 11:52:15,669 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 47 transitions. [2022-04-28 11:52:15,718 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:52:15,718 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-04-28 11:52:15,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 11:52:15,719 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:52:15,719 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1] [2022-04-28 11:52:15,738 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-28 11:52:15,936 WARN L477 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-28 11:52:15,936 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:52:15,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:52:15,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1874551443, now seen corresponding path program 1 times [2022-04-28 11:52:15,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:52:15,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [936752032] [2022-04-28 11:52:15,937 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:52:15,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1874551443, now seen corresponding path program 2 times [2022-04-28 11:52:15,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:52:15,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381784300] [2022-04-28 11:52:15,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:52:15,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:52:15,953 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:52:15,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1584943820] [2022-04-28 11:52:15,954 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:52:15,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:52:15,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:52:15,973 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-28 11:52:15,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-28 11:52:16,015 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:52:16,016 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:52:16,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 11:52:16,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:52:16,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:52:16,174 INFO L272 TraceCheckUtils]: 0: Hoare triple {1618#true} call ULTIMATE.init(); {1618#true} is VALID [2022-04-28 11:52:16,174 INFO L290 TraceCheckUtils]: 1: Hoare triple {1618#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(9, 2);~counter~0 := 0; {1626#(<= ~counter~0 0)} is VALID [2022-04-28 11:52:16,175 INFO L290 TraceCheckUtils]: 2: Hoare triple {1626#(<= ~counter~0 0)} assume true; {1626#(<= ~counter~0 0)} is VALID [2022-04-28 11:52:16,175 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1626#(<= ~counter~0 0)} {1618#true} #89#return; {1626#(<= ~counter~0 0)} is VALID [2022-04-28 11:52:16,176 INFO L272 TraceCheckUtils]: 4: Hoare triple {1626#(<= ~counter~0 0)} call #t~ret5 := main(); {1626#(<= ~counter~0 0)} is VALID [2022-04-28 11:52:16,176 INFO L290 TraceCheckUtils]: 5: Hoare triple {1626#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {1626#(<= ~counter~0 0)} is VALID [2022-04-28 11:52:16,176 INFO L272 TraceCheckUtils]: 6: Hoare triple {1626#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {1626#(<= ~counter~0 0)} is VALID [2022-04-28 11:52:16,177 INFO L290 TraceCheckUtils]: 7: Hoare triple {1626#(<= ~counter~0 0)} ~cond := #in~cond; {1626#(<= ~counter~0 0)} is VALID [2022-04-28 11:52:16,177 INFO L290 TraceCheckUtils]: 8: Hoare triple {1626#(<= ~counter~0 0)} assume !(0 == ~cond); {1626#(<= ~counter~0 0)} is VALID [2022-04-28 11:52:16,177 INFO L290 TraceCheckUtils]: 9: Hoare triple {1626#(<= ~counter~0 0)} assume true; {1626#(<= ~counter~0 0)} is VALID [2022-04-28 11:52:16,178 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1626#(<= ~counter~0 0)} {1626#(<= ~counter~0 0)} #81#return; {1626#(<= ~counter~0 0)} is VALID [2022-04-28 11:52:16,178 INFO L272 TraceCheckUtils]: 11: Hoare triple {1626#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1626#(<= ~counter~0 0)} is VALID [2022-04-28 11:52:16,178 INFO L290 TraceCheckUtils]: 12: Hoare triple {1626#(<= ~counter~0 0)} ~cond := #in~cond; {1626#(<= ~counter~0 0)} is VALID [2022-04-28 11:52:16,179 INFO L290 TraceCheckUtils]: 13: Hoare triple {1626#(<= ~counter~0 0)} assume !(0 == ~cond); {1626#(<= ~counter~0 0)} is VALID [2022-04-28 11:52:16,179 INFO L290 TraceCheckUtils]: 14: Hoare triple {1626#(<= ~counter~0 0)} assume true; {1626#(<= ~counter~0 0)} is VALID [2022-04-28 11:52:16,179 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1626#(<= ~counter~0 0)} {1626#(<= ~counter~0 0)} #83#return; {1626#(<= ~counter~0 0)} is VALID [2022-04-28 11:52:16,180 INFO L290 TraceCheckUtils]: 16: Hoare triple {1626#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1626#(<= ~counter~0 0)} is VALID [2022-04-28 11:52:16,180 INFO L290 TraceCheckUtils]: 17: Hoare triple {1626#(<= ~counter~0 0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1675#(<= ~counter~0 1)} is VALID [2022-04-28 11:52:16,181 INFO L290 TraceCheckUtils]: 18: Hoare triple {1675#(<= ~counter~0 1)} assume !!(#t~post3 < 2);havoc #t~post3; {1675#(<= ~counter~0 1)} is VALID [2022-04-28 11:52:16,181 INFO L290 TraceCheckUtils]: 19: Hoare triple {1675#(<= ~counter~0 1)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1675#(<= ~counter~0 1)} is VALID [2022-04-28 11:52:16,181 INFO L290 TraceCheckUtils]: 20: Hoare triple {1675#(<= ~counter~0 1)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1685#(<= |main_#t~post3| 1)} is VALID [2022-04-28 11:52:16,182 INFO L290 TraceCheckUtils]: 21: Hoare triple {1685#(<= |main_#t~post3| 1)} assume !(#t~post3 < 2);havoc #t~post3; {1619#false} is VALID [2022-04-28 11:52:16,182 INFO L290 TraceCheckUtils]: 22: Hoare triple {1619#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {1619#false} is VALID [2022-04-28 11:52:16,182 INFO L290 TraceCheckUtils]: 23: Hoare triple {1619#false} assume !!(#t~post4 < 2);havoc #t~post4; {1619#false} is VALID [2022-04-28 11:52:16,182 INFO L272 TraceCheckUtils]: 24: Hoare triple {1619#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1619#false} is VALID [2022-04-28 11:52:16,182 INFO L290 TraceCheckUtils]: 25: Hoare triple {1619#false} ~cond := #in~cond; {1619#false} is VALID [2022-04-28 11:52:16,182 INFO L290 TraceCheckUtils]: 26: Hoare triple {1619#false} assume !(0 == ~cond); {1619#false} is VALID [2022-04-28 11:52:16,182 INFO L290 TraceCheckUtils]: 27: Hoare triple {1619#false} assume true; {1619#false} is VALID [2022-04-28 11:52:16,182 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1619#false} {1619#false} #85#return; {1619#false} is VALID [2022-04-28 11:52:16,183 INFO L290 TraceCheckUtils]: 29: Hoare triple {1619#false} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {1619#false} is VALID [2022-04-28 11:52:16,183 INFO L290 TraceCheckUtils]: 30: Hoare triple {1619#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1619#false} is VALID [2022-04-28 11:52:16,183 INFO L290 TraceCheckUtils]: 31: Hoare triple {1619#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {1619#false} is VALID [2022-04-28 11:52:16,183 INFO L290 TraceCheckUtils]: 32: Hoare triple {1619#false} assume !(#t~post4 < 2);havoc #t~post4; {1619#false} is VALID [2022-04-28 11:52:16,183 INFO L272 TraceCheckUtils]: 33: Hoare triple {1619#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1619#false} is VALID [2022-04-28 11:52:16,183 INFO L290 TraceCheckUtils]: 34: Hoare triple {1619#false} ~cond := #in~cond; {1619#false} is VALID [2022-04-28 11:52:16,183 INFO L290 TraceCheckUtils]: 35: Hoare triple {1619#false} assume 0 == ~cond; {1619#false} is VALID [2022-04-28 11:52:16,183 INFO L290 TraceCheckUtils]: 36: Hoare triple {1619#false} assume !false; {1619#false} is VALID [2022-04-28 11:52:16,184 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-28 11:52:16,184 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:52:16,355 INFO L290 TraceCheckUtils]: 36: Hoare triple {1619#false} assume !false; {1619#false} is VALID [2022-04-28 11:52:16,355 INFO L290 TraceCheckUtils]: 35: Hoare triple {1619#false} assume 0 == ~cond; {1619#false} is VALID [2022-04-28 11:52:16,355 INFO L290 TraceCheckUtils]: 34: Hoare triple {1619#false} ~cond := #in~cond; {1619#false} is VALID [2022-04-28 11:52:16,355 INFO L272 TraceCheckUtils]: 33: Hoare triple {1619#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1619#false} is VALID [2022-04-28 11:52:16,355 INFO L290 TraceCheckUtils]: 32: Hoare triple {1619#false} assume !(#t~post4 < 2);havoc #t~post4; {1619#false} is VALID [2022-04-28 11:52:16,355 INFO L290 TraceCheckUtils]: 31: Hoare triple {1619#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {1619#false} is VALID [2022-04-28 11:52:16,355 INFO L290 TraceCheckUtils]: 30: Hoare triple {1619#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1619#false} is VALID [2022-04-28 11:52:16,355 INFO L290 TraceCheckUtils]: 29: Hoare triple {1619#false} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {1619#false} is VALID [2022-04-28 11:52:16,356 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1618#true} {1619#false} #85#return; {1619#false} is VALID [2022-04-28 11:52:16,356 INFO L290 TraceCheckUtils]: 27: Hoare triple {1618#true} assume true; {1618#true} is VALID [2022-04-28 11:52:16,356 INFO L290 TraceCheckUtils]: 26: Hoare triple {1618#true} assume !(0 == ~cond); {1618#true} is VALID [2022-04-28 11:52:16,356 INFO L290 TraceCheckUtils]: 25: Hoare triple {1618#true} ~cond := #in~cond; {1618#true} is VALID [2022-04-28 11:52:16,356 INFO L272 TraceCheckUtils]: 24: Hoare triple {1619#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1618#true} is VALID [2022-04-28 11:52:16,356 INFO L290 TraceCheckUtils]: 23: Hoare triple {1619#false} assume !!(#t~post4 < 2);havoc #t~post4; {1619#false} is VALID [2022-04-28 11:52:16,356 INFO L290 TraceCheckUtils]: 22: Hoare triple {1619#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {1619#false} is VALID [2022-04-28 11:52:16,358 INFO L290 TraceCheckUtils]: 21: Hoare triple {1685#(<= |main_#t~post3| 1)} assume !(#t~post3 < 2);havoc #t~post3; {1619#false} is VALID [2022-04-28 11:52:16,362 INFO L290 TraceCheckUtils]: 20: Hoare triple {1675#(<= ~counter~0 1)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1685#(<= |main_#t~post3| 1)} is VALID [2022-04-28 11:52:16,362 INFO L290 TraceCheckUtils]: 19: Hoare triple {1675#(<= ~counter~0 1)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1675#(<= ~counter~0 1)} is VALID [2022-04-28 11:52:16,362 INFO L290 TraceCheckUtils]: 18: Hoare triple {1675#(<= ~counter~0 1)} assume !!(#t~post3 < 2);havoc #t~post3; {1675#(<= ~counter~0 1)} is VALID [2022-04-28 11:52:16,363 INFO L290 TraceCheckUtils]: 17: Hoare triple {1626#(<= ~counter~0 0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1675#(<= ~counter~0 1)} is VALID [2022-04-28 11:52:16,363 INFO L290 TraceCheckUtils]: 16: Hoare triple {1626#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1626#(<= ~counter~0 0)} is VALID [2022-04-28 11:52:16,364 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1618#true} {1626#(<= ~counter~0 0)} #83#return; {1626#(<= ~counter~0 0)} is VALID [2022-04-28 11:52:16,364 INFO L290 TraceCheckUtils]: 14: Hoare triple {1618#true} assume true; {1618#true} is VALID [2022-04-28 11:52:16,364 INFO L290 TraceCheckUtils]: 13: Hoare triple {1618#true} assume !(0 == ~cond); {1618#true} is VALID [2022-04-28 11:52:16,364 INFO L290 TraceCheckUtils]: 12: Hoare triple {1618#true} ~cond := #in~cond; {1618#true} is VALID [2022-04-28 11:52:16,364 INFO L272 TraceCheckUtils]: 11: Hoare triple {1626#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1618#true} is VALID [2022-04-28 11:52:16,369 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1618#true} {1626#(<= ~counter~0 0)} #81#return; {1626#(<= ~counter~0 0)} is VALID [2022-04-28 11:52:16,369 INFO L290 TraceCheckUtils]: 9: Hoare triple {1618#true} assume true; {1618#true} is VALID [2022-04-28 11:52:16,369 INFO L290 TraceCheckUtils]: 8: Hoare triple {1618#true} assume !(0 == ~cond); {1618#true} is VALID [2022-04-28 11:52:16,369 INFO L290 TraceCheckUtils]: 7: Hoare triple {1618#true} ~cond := #in~cond; {1618#true} is VALID [2022-04-28 11:52:16,369 INFO L272 TraceCheckUtils]: 6: Hoare triple {1626#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {1618#true} is VALID [2022-04-28 11:52:16,369 INFO L290 TraceCheckUtils]: 5: Hoare triple {1626#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {1626#(<= ~counter~0 0)} is VALID [2022-04-28 11:52:16,370 INFO L272 TraceCheckUtils]: 4: Hoare triple {1626#(<= ~counter~0 0)} call #t~ret5 := main(); {1626#(<= ~counter~0 0)} is VALID [2022-04-28 11:52:16,370 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1626#(<= ~counter~0 0)} {1618#true} #89#return; {1626#(<= ~counter~0 0)} is VALID [2022-04-28 11:52:16,370 INFO L290 TraceCheckUtils]: 2: Hoare triple {1626#(<= ~counter~0 0)} assume true; {1626#(<= ~counter~0 0)} is VALID [2022-04-28 11:52:16,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {1618#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(9, 2);~counter~0 := 0; {1626#(<= ~counter~0 0)} is VALID [2022-04-28 11:52:16,371 INFO L272 TraceCheckUtils]: 0: Hoare triple {1618#true} call ULTIMATE.init(); {1618#true} is VALID [2022-04-28 11:52:16,371 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 11:52:16,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:52:16,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381784300] [2022-04-28 11:52:16,372 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:52:16,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584943820] [2022-04-28 11:52:16,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1584943820] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:52:16,372 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:52:16,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2022-04-28 11:52:16,372 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:52:16,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [936752032] [2022-04-28 11:52:16,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [936752032] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:52:16,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:52:16,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:52:16,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853086156] [2022-04-28 11:52:16,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:52:16,373 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 37 [2022-04-28 11:52:16,373 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:52:16,373 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 11:52:16,393 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:52:16,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:52:16,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:52:16,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:52:16,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:52:16,394 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 11:52:16,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:52:16,512 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2022-04-28 11:52:16,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 11:52:16,512 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 37 [2022-04-28 11:52:16,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:52:16,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 11:52:16,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2022-04-28 11:52:16,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 11:52:16,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2022-04-28 11:52:16,515 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 55 transitions. [2022-04-28 11:52:16,554 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:52:16,555 INFO L225 Difference]: With dead ends: 63 [2022-04-28 11:52:16,555 INFO L226 Difference]: Without dead ends: 42 [2022-04-28 11:52:16,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-28 11:52:16,556 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 6 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:52:16,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 99 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:52:16,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-28 11:52:16,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-04-28 11:52:16,575 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:52:16,576 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 42 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 11:52:16,576 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 42 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 11:52:16,576 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 42 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 11:52:16,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:52:16,577 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2022-04-28 11:52:16,577 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2022-04-28 11:52:16,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:52:16,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:52:16,578 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 42 states. [2022-04-28 11:52:16,578 INFO L87 Difference]: Start difference. First operand has 42 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 42 states. [2022-04-28 11:52:16,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:52:16,579 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2022-04-28 11:52:16,579 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2022-04-28 11:52:16,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:52:16,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:52:16,580 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:52:16,580 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:52:16,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 11:52:16,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2022-04-28 11:52:16,581 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 37 [2022-04-28 11:52:16,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:52:16,581 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2022-04-28 11:52:16,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 11:52:16,581 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 49 transitions. [2022-04-28 11:52:16,627 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:52:16,628 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2022-04-28 11:52:16,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-28 11:52:16,628 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:52:16,628 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1] [2022-04-28 11:52:16,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 11:52:16,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:52:16,839 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:52:16,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:52:16,840 INFO L85 PathProgramCache]: Analyzing trace with hash 815990494, now seen corresponding path program 1 times [2022-04-28 11:52:16,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:52:16,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1809606655] [2022-04-28 11:52:16,840 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:52:16,840 INFO L85 PathProgramCache]: Analyzing trace with hash 815990494, now seen corresponding path program 2 times [2022-04-28 11:52:16,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:52:16,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843955518] [2022-04-28 11:52:16,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:52:16,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:52:16,877 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:52:16,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1348829632] [2022-04-28 11:52:16,877 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:52:16,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:52:16,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:52:16,879 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:52:16,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-28 11:52:16,919 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:52:16,919 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:52:16,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 11:52:16,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:52:16,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:52:17,095 INFO L272 TraceCheckUtils]: 0: Hoare triple {2140#true} call ULTIMATE.init(); {2140#true} is VALID [2022-04-28 11:52:17,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {2140#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(9, 2);~counter~0 := 0; {2148#(<= 0 ~counter~0)} is VALID [2022-04-28 11:52:17,096 INFO L290 TraceCheckUtils]: 2: Hoare triple {2148#(<= 0 ~counter~0)} assume true; {2148#(<= 0 ~counter~0)} is VALID [2022-04-28 11:52:17,096 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2148#(<= 0 ~counter~0)} {2140#true} #89#return; {2148#(<= 0 ~counter~0)} is VALID [2022-04-28 11:52:17,096 INFO L272 TraceCheckUtils]: 4: Hoare triple {2148#(<= 0 ~counter~0)} call #t~ret5 := main(); {2148#(<= 0 ~counter~0)} is VALID [2022-04-28 11:52:17,097 INFO L290 TraceCheckUtils]: 5: Hoare triple {2148#(<= 0 ~counter~0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {2148#(<= 0 ~counter~0)} is VALID [2022-04-28 11:52:17,097 INFO L272 TraceCheckUtils]: 6: Hoare triple {2148#(<= 0 ~counter~0)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {2148#(<= 0 ~counter~0)} is VALID [2022-04-28 11:52:17,097 INFO L290 TraceCheckUtils]: 7: Hoare triple {2148#(<= 0 ~counter~0)} ~cond := #in~cond; {2148#(<= 0 ~counter~0)} is VALID [2022-04-28 11:52:17,098 INFO L290 TraceCheckUtils]: 8: Hoare triple {2148#(<= 0 ~counter~0)} assume !(0 == ~cond); {2148#(<= 0 ~counter~0)} is VALID [2022-04-28 11:52:17,098 INFO L290 TraceCheckUtils]: 9: Hoare triple {2148#(<= 0 ~counter~0)} assume true; {2148#(<= 0 ~counter~0)} is VALID [2022-04-28 11:52:17,098 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2148#(<= 0 ~counter~0)} {2148#(<= 0 ~counter~0)} #81#return; {2148#(<= 0 ~counter~0)} is VALID [2022-04-28 11:52:17,099 INFO L272 TraceCheckUtils]: 11: Hoare triple {2148#(<= 0 ~counter~0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2148#(<= 0 ~counter~0)} is VALID [2022-04-28 11:52:17,099 INFO L290 TraceCheckUtils]: 12: Hoare triple {2148#(<= 0 ~counter~0)} ~cond := #in~cond; {2148#(<= 0 ~counter~0)} is VALID [2022-04-28 11:52:17,100 INFO L290 TraceCheckUtils]: 13: Hoare triple {2148#(<= 0 ~counter~0)} assume !(0 == ~cond); {2148#(<= 0 ~counter~0)} is VALID [2022-04-28 11:52:17,100 INFO L290 TraceCheckUtils]: 14: Hoare triple {2148#(<= 0 ~counter~0)} assume true; {2148#(<= 0 ~counter~0)} is VALID [2022-04-28 11:52:17,100 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2148#(<= 0 ~counter~0)} {2148#(<= 0 ~counter~0)} #83#return; {2148#(<= 0 ~counter~0)} is VALID [2022-04-28 11:52:17,101 INFO L290 TraceCheckUtils]: 16: Hoare triple {2148#(<= 0 ~counter~0)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {2148#(<= 0 ~counter~0)} is VALID [2022-04-28 11:52:17,101 INFO L290 TraceCheckUtils]: 17: Hoare triple {2148#(<= 0 ~counter~0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2197#(<= 1 ~counter~0)} is VALID [2022-04-28 11:52:17,101 INFO L290 TraceCheckUtils]: 18: Hoare triple {2197#(<= 1 ~counter~0)} assume !!(#t~post3 < 2);havoc #t~post3; {2197#(<= 1 ~counter~0)} is VALID [2022-04-28 11:52:17,102 INFO L290 TraceCheckUtils]: 19: Hoare triple {2197#(<= 1 ~counter~0)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {2197#(<= 1 ~counter~0)} is VALID [2022-04-28 11:52:17,102 INFO L290 TraceCheckUtils]: 20: Hoare triple {2197#(<= 1 ~counter~0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2207#(<= 2 ~counter~0)} is VALID [2022-04-28 11:52:17,102 INFO L290 TraceCheckUtils]: 21: Hoare triple {2207#(<= 2 ~counter~0)} assume !!(#t~post3 < 2);havoc #t~post3; {2207#(<= 2 ~counter~0)} is VALID [2022-04-28 11:52:17,103 INFO L290 TraceCheckUtils]: 22: Hoare triple {2207#(<= 2 ~counter~0)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {2207#(<= 2 ~counter~0)} is VALID [2022-04-28 11:52:17,103 INFO L290 TraceCheckUtils]: 23: Hoare triple {2207#(<= 2 ~counter~0)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2217#(<= 2 |main_#t~post4|)} is VALID [2022-04-28 11:52:17,103 INFO L290 TraceCheckUtils]: 24: Hoare triple {2217#(<= 2 |main_#t~post4|)} assume !!(#t~post4 < 2);havoc #t~post4; {2141#false} is VALID [2022-04-28 11:52:17,104 INFO L272 TraceCheckUtils]: 25: Hoare triple {2141#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2141#false} is VALID [2022-04-28 11:52:17,104 INFO L290 TraceCheckUtils]: 26: Hoare triple {2141#false} ~cond := #in~cond; {2141#false} is VALID [2022-04-28 11:52:17,104 INFO L290 TraceCheckUtils]: 27: Hoare triple {2141#false} assume !(0 == ~cond); {2141#false} is VALID [2022-04-28 11:52:17,104 INFO L290 TraceCheckUtils]: 28: Hoare triple {2141#false} assume true; {2141#false} is VALID [2022-04-28 11:52:17,104 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2141#false} {2141#false} #85#return; {2141#false} is VALID [2022-04-28 11:52:17,104 INFO L290 TraceCheckUtils]: 30: Hoare triple {2141#false} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {2141#false} is VALID [2022-04-28 11:52:17,104 INFO L290 TraceCheckUtils]: 31: Hoare triple {2141#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {2141#false} is VALID [2022-04-28 11:52:17,104 INFO L290 TraceCheckUtils]: 32: Hoare triple {2141#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2141#false} is VALID [2022-04-28 11:52:17,104 INFO L290 TraceCheckUtils]: 33: Hoare triple {2141#false} assume !(#t~post4 < 2);havoc #t~post4; {2141#false} is VALID [2022-04-28 11:52:17,104 INFO L272 TraceCheckUtils]: 34: Hoare triple {2141#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2141#false} is VALID [2022-04-28 11:52:17,105 INFO L290 TraceCheckUtils]: 35: Hoare triple {2141#false} ~cond := #in~cond; {2141#false} is VALID [2022-04-28 11:52:17,105 INFO L290 TraceCheckUtils]: 36: Hoare triple {2141#false} assume 0 == ~cond; {2141#false} is VALID [2022-04-28 11:52:17,105 INFO L290 TraceCheckUtils]: 37: Hoare triple {2141#false} assume !false; {2141#false} is VALID [2022-04-28 11:52:17,105 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 11:52:17,105 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:52:17,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:52:17,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843955518] [2022-04-28 11:52:17,105 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:52:17,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348829632] [2022-04-28 11:52:17,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1348829632] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:52:17,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:52:17,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 11:52:17,106 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:52:17,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1809606655] [2022-04-28 11:52:17,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1809606655] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:52:17,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:52:17,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 11:52:17,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928908490] [2022-04-28 11:52:17,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:52:17,106 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 38 [2022-04-28 11:52:17,107 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:52:17,107 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 11:52:17,130 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:52:17,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 11:52:17,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:52:17,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 11:52:17,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-28 11:52:17,131 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 11:52:17,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:52:17,235 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-04-28 11:52:17,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 11:52:17,235 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 38 [2022-04-28 11:52:17,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:52:17,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 11:52:17,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-28 11:52:17,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 11:52:17,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-28 11:52:17,237 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 40 transitions. [2022-04-28 11:52:17,267 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:52:17,267 INFO L225 Difference]: With dead ends: 44 [2022-04-28 11:52:17,267 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 11:52:17,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-28 11:52:17,268 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 6 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:52:17,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 56 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:52:17,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 11:52:17,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 11:52:17,269 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:52:17,269 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 11:52:17,269 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 11:52:17,269 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 11:52:17,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:52:17,269 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 11:52:17,269 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 11:52:17,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:52:17,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:52:17,270 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 11:52:17,270 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 11:52:17,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:52:17,270 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 11:52:17,270 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 11:52:17,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:52:17,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:52:17,270 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:52:17,270 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:52:17,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 11:52:17,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 11:52:17,270 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2022-04-28 11:52:17,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:52:17,270 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 11:52:17,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 11:52:17,271 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 11:52:17,271 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:52:17,271 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 11:52:17,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:52:17,273 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 11:52:17,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-28 11:52:17,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:52:17,492 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 11:52:17,947 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-28 11:52:17,947 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-28 11:52:17,947 INFO L899 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-28 11:52:17,947 INFO L902 garLoopResultBuilder]: At program point L16(line 16) the Hoare annotation is: true [2022-04-28 11:52:17,947 INFO L902 garLoopResultBuilder]: At program point L16-2(lines 15 17) the Hoare annotation is: true [2022-04-28 11:52:17,947 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 15 17) the Hoare annotation is: true [2022-04-28 11:52:17,948 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notEXIT(lines 15 17) the Hoare annotation is: true [2022-04-28 11:52:17,948 INFO L895 garLoopResultBuilder]: At program point L31(line 31) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (<= 0 ~counter~0) (<= ~counter~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-28 11:52:17,948 INFO L895 garLoopResultBuilder]: At program point L31-1(line 31) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (<= 0 ~counter~0) (<= ~counter~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-28 11:52:17,948 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 26 52) the Hoare annotation is: true [2022-04-28 11:52:17,948 INFO L902 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: true [2022-04-28 11:52:17,948 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 26 52) the Hoare annotation is: true [2022-04-28 11:52:17,948 INFO L895 garLoopResultBuilder]: At program point L40(lines 40 49) the Hoare annotation is: (let ((.cse0 (= main_~A~0 main_~r~0)) (.cse1 (= main_~q~0 0))) (or (and .cse0 (= main_~B~0 main_~b~0) .cse1) (not (<= |old(~counter~0)| 0)) (and (<= 2 ~counter~0) .cse0 .cse1 (<= 2 |main_#t~post4|)) (not (<= 0 |old(~counter~0)|)))) [2022-04-28 11:52:17,948 INFO L895 garLoopResultBuilder]: At program point L40-2(lines 40 49) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (= main_~A~0 main_~r~0) (= main_~q~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-28 11:52:17,948 INFO L895 garLoopResultBuilder]: At program point L36-1(lines 36 39) the Hoare annotation is: (let ((.cse0 (= main_~A~0 main_~r~0)) (.cse1 (= main_~q~0 0))) (or (and .cse0 (<= |main_#t~post3| 0) (<= 1 ~counter~0) (= main_~B~0 main_~b~0) .cse1) (and (<= 2 ~counter~0) .cse0 .cse1) (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|)))) [2022-04-28 11:52:17,948 INFO L895 garLoopResultBuilder]: At program point L36-3(lines 36 39) the Hoare annotation is: (let ((.cse0 (= main_~A~0 main_~r~0)) (.cse1 (= main_~q~0 0))) (or (not (<= |old(~counter~0)| 0)) (and .cse0 (<= 0 ~counter~0) (= main_~B~0 main_~b~0) .cse1) (and .cse0 (<= 1 ~counter~0) .cse1) (not (<= 0 |old(~counter~0)|)))) [2022-04-28 11:52:17,948 INFO L895 garLoopResultBuilder]: At program point L32(line 32) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (<= 0 ~counter~0) (<= ~counter~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-28 11:52:17,948 INFO L895 garLoopResultBuilder]: At program point mainENTRY(lines 26 52) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (<= 0 ~counter~0) (<= ~counter~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-28 11:52:17,948 INFO L895 garLoopResultBuilder]: At program point L45(lines 45 48) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-28 11:52:17,948 INFO L895 garLoopResultBuilder]: At program point L45-2(lines 26 52) the Hoare annotation is: (let ((.cse0 (= main_~A~0 main_~r~0)) (.cse1 (= main_~q~0 0))) (or (and .cse0 (= main_~B~0 main_~b~0) .cse1) (and (<= 2 ~counter~0) .cse0 .cse1) (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|)))) [2022-04-28 11:52:17,949 INFO L895 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: (or (and (= main_~A~0 main_~r~0) (= main_~B~0 main_~b~0) (= main_~q~0 0)) (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-28 11:52:17,949 INFO L895 garLoopResultBuilder]: At program point L41-1(lines 40 49) the Hoare annotation is: (or (and (= main_~A~0 main_~r~0) (= main_~B~0 main_~b~0) (= main_~q~0 0)) (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-28 11:52:17,949 INFO L895 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (let ((.cse0 (= main_~A~0 main_~r~0)) (.cse1 (= main_~q~0 0))) (or (and (<= 2 ~counter~0) .cse0 .cse1) (not (<= |old(~counter~0)| 0)) (and .cse0 (<= 1 ~counter~0) (= main_~B~0 main_~b~0) .cse1) (not (<= 0 |old(~counter~0)|)))) [2022-04-28 11:52:17,949 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (and (<= 0 ~counter~0) (<= ~counter~0 0)) [2022-04-28 11:52:17,949 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 11:52:17,949 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (and (<= 0 ~counter~0) (<= ~counter~0 0)) [2022-04-28 11:52:17,949 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 11:52:17,949 INFO L895 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (and (<= 0 ~counter~0) (<= ~counter~0 0)) [2022-04-28 11:52:17,949 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 11:52:17,949 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 11:52:17,949 INFO L895 garLoopResultBuilder]: At program point L19-2(lines 18 24) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-28 11:52:17,949 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 18 24) the Hoare annotation is: true [2022-04-28 11:52:17,949 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 18 24) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-28 11:52:17,949 INFO L895 garLoopResultBuilder]: At program point L20(lines 20 21) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 11:52:17,949 INFO L895 garLoopResultBuilder]: At program point L19(lines 19 22) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-28 11:52:17,949 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 21) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 11:52:17,952 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2] [2022-04-28 11:52:17,953 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 11:52:17,955 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 11:52:17,955 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 11:52:17,959 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-28 11:52:17,984 INFO L163 areAnnotationChecker]: CFG has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 11:52:18,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 11:52:17 BoogieIcfgContainer [2022-04-28 11:52:18,001 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 11:52:18,002 INFO L158 Benchmark]: Toolchain (without parser) took 8526.58ms. Allocated memory was 185.6MB in the beginning and 223.3MB in the end (delta: 37.7MB). Free memory was 137.8MB in the beginning and 122.2MB in the end (delta: 15.6MB). Peak memory consumption was 54.4MB. Max. memory is 8.0GB. [2022-04-28 11:52:18,002 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 185.6MB. Free memory was 154.1MB in the beginning and 154.0MB in the end (delta: 140.1kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 11:52:18,002 INFO L158 Benchmark]: CACSL2BoogieTranslator took 251.37ms. Allocated memory is still 185.6MB. Free memory was 137.6MB in the beginning and 161.8MB in the end (delta: -24.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 11:52:18,002 INFO L158 Benchmark]: Boogie Preprocessor took 34.51ms. Allocated memory is still 185.6MB. Free memory was 161.4MB in the beginning and 160.1MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 11:52:18,002 INFO L158 Benchmark]: RCFGBuilder took 228.98ms. Allocated memory is still 185.6MB. Free memory was 160.1MB in the beginning and 148.6MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 11:52:18,002 INFO L158 Benchmark]: TraceAbstraction took 8005.62ms. Allocated memory was 185.6MB in the beginning and 223.3MB in the end (delta: 37.7MB). Free memory was 147.8MB in the beginning and 122.2MB in the end (delta: 25.6MB). Peak memory consumption was 64.2MB. Max. memory is 8.0GB. [2022-04-28 11:52:18,004 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 185.6MB. Free memory was 154.1MB in the beginning and 154.0MB in the end (delta: 140.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 251.37ms. Allocated memory is still 185.6MB. Free memory was 137.6MB in the beginning and 161.8MB in the end (delta: -24.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.51ms. Allocated memory is still 185.6MB. Free memory was 161.4MB in the beginning and 160.1MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 228.98ms. Allocated memory is still 185.6MB. Free memory was 160.1MB in the beginning and 148.6MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 8005.62ms. Allocated memory was 185.6MB in the beginning and 223.3MB in the end (delta: 37.7MB). Free memory was 147.8MB in the beginning and 122.2MB in the end (delta: 25.6MB). Peak memory consumption was 64.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 21]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.9s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 51 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 47 mSDsluCounter, 517 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 305 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 133 IncrementalHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 212 mSDtfsCounter, 133 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 231 GetRequests, 209 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=6, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 33 LocationsWithAnnotation, 137 PreInvPairs, 184 NumberOfFragments, 361 HoareAnnotationTreeSize, 137 FomulaSimplifications, 3 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 33 FomulaSimplificationsInter, 332 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: ((!(\old(counter) <= 0) || (((A == r && 0 <= counter) && B == b) && q == 0)) || ((A == r && 1 <= counter) && q == 0)) || !(0 <= \old(counter)) - ProcedureContractResult [Line: 15]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not: 1 - ProcedureContractResult [Line: 26]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 18]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: !(1 <= \old(cond)) || 1 <= cond RESULT: Ultimate proved your program to be correct! [2022-04-28 11:52:18,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...