/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/divbin2_unwindbound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 12:32:07,432 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 12:32:07,433 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 12:32:07,478 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 12:32:07,478 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 12:32:07,479 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 12:32:07,479 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 12:32:07,481 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 12:32:07,482 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 12:32:07,482 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 12:32:07,483 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 12:32:07,483 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 12:32:07,484 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 12:32:07,484 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 12:32:07,485 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 12:32:07,485 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 12:32:07,486 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 12:32:07,486 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 12:32:07,487 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 12:32:07,488 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 12:32:07,489 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 12:32:07,496 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 12:32:07,497 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 12:32:07,498 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 12:32:07,498 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 12:32:07,500 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 12:32:07,500 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 12:32:07,500 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 12:32:07,500 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 12:32:07,501 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 12:32:07,501 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 12:32:07,501 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 12:32:07,502 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 12:32:07,502 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 12:32:07,503 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 12:32:07,503 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 12:32:07,503 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 12:32:07,504 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 12:32:07,504 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 12:32:07,504 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 12:32:07,504 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 12:32:07,507 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 12:32:07,508 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 12:32:07,525 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 12:32:07,525 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 12:32:07,526 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 12:32:07,526 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 12:32:07,526 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 12:32:07,526 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 12:32:07,527 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 12:32:07,527 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 12:32:07,527 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 12:32:07,527 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 12:32:07,527 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 12:32:07,527 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 12:32:07,527 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 12:32:07,527 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 12:32:07,527 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 12:32:07,527 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 12:32:07,528 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 12:32:07,528 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 12:32:07,528 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 12:32:07,528 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 12:32:07,528 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 12:32:07,528 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 12:32:07,528 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 12:32:07,528 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 12:32:07,528 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 12:32:07,528 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 12:32:07,529 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 12:32:07,529 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 12:32:07,529 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 12:32:07,529 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 12:32:07,529 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 12:32:07,529 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 12:32:07,529 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 12:32:07,529 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-27 12:32:07,685 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 12:32:07,713 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 12:32:07,715 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 12:32:07,716 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 12:32:07,717 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 12:32:07,717 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/divbin2_unwindbound2.i [2022-04-27 12:32:07,762 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4eb891eea/a943cbd129174c308893a2828b91f4c1/FLAGaafaf1d7f [2022-04-27 12:32:08,033 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 12:32:08,034 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin2_unwindbound2.i [2022-04-27 12:32:08,038 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4eb891eea/a943cbd129174c308893a2828b91f4c1/FLAGaafaf1d7f [2022-04-27 12:32:08,487 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4eb891eea/a943cbd129174c308893a2828b91f4c1 [2022-04-27 12:32:08,488 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 12:32:08,489 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 12:32:08,490 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 12:32:08,491 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 12:32:08,493 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 12:32:08,493 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 12:32:08" (1/1) ... [2022-04-27 12:32:08,494 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bf4b8a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:32:08, skipping insertion in model container [2022-04-27 12:32:08,494 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 12:32:08" (1/1) ... [2022-04-27 12:32:08,498 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 12:32:08,507 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 12:32:08,655 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin2_unwindbound2.i[951,964] [2022-04-27 12:32:08,676 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 12:32:08,683 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 12:32:08,694 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin2_unwindbound2.i[951,964] [2022-04-27 12:32:08,705 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 12:32:08,715 INFO L208 MainTranslator]: Completed translation [2022-04-27 12:32:08,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:32:08 WrapperNode [2022-04-27 12:32:08,715 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 12:32:08,716 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 12:32:08,716 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 12:32:08,716 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 12:32:08,723 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:32:08" (1/1) ... [2022-04-27 12:32:08,723 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:32:08" (1/1) ... [2022-04-27 12:32:08,727 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:32:08" (1/1) ... [2022-04-27 12:32:08,727 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:32:08" (1/1) ... [2022-04-27 12:32:08,736 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:32:08" (1/1) ... [2022-04-27 12:32:08,740 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:32:08" (1/1) ... [2022-04-27 12:32:08,743 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:32:08" (1/1) ... [2022-04-27 12:32:08,745 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 12:32:08,746 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 12:32:08,746 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 12:32:08,746 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 12:32:08,747 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:32:08" (1/1) ... [2022-04-27 12:32:08,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 12:32:08,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:32:08,766 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-27 12:32:08,779 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-27 12:32:08,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 12:32:08,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 12:32:08,796 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 12:32:08,796 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 12:32:08,797 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 12:32:08,797 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 12:32:08,797 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 12:32:08,797 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 12:32:08,797 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 12:32:08,798 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 12:32:08,798 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 12:32:08,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 12:32:08,798 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 12:32:08,798 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 12:32:08,800 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 12:32:08,800 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 12:32:08,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 12:32:08,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 12:32:08,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 12:32:08,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 12:32:08,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 12:32:08,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 12:32:08,853 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 12:32:08,854 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 12:32:08,962 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 12:32:08,966 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 12:32:08,966 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 12:32:08,967 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 12:32:08 BoogieIcfgContainer [2022-04-27 12:32:08,967 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 12:32:08,969 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 12:32:08,969 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 12:32:08,984 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 12:32:08,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 12:32:08" (1/3) ... [2022-04-27 12:32:08,984 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ba1e1f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 12:32:08, skipping insertion in model container [2022-04-27 12:32:08,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:32:08" (2/3) ... [2022-04-27 12:32:08,985 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ba1e1f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 12:32:08, skipping insertion in model container [2022-04-27 12:32:08,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 12:32:08" (3/3) ... [2022-04-27 12:32:08,986 INFO L111 eAbstractionObserver]: Analyzing ICFG divbin2_unwindbound2.i [2022-04-27 12:32:09,012 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 12:32:09,012 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 12:32:09,042 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 12:32:09,046 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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@1e7d1df0, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3688bea5 [2022-04-27 12:32:09,046 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 12:32:09,051 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 12:32:09,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 12:32:09,055 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:32:09,055 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:32:09,056 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:32:09,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:32:09,059 INFO L85 PathProgramCache]: Analyzing trace with hash -2126508982, now seen corresponding path program 1 times [2022-04-27 12:32:09,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:32:09,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843649773] [2022-04-27 12:32:09,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:32:09,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:32:09,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:32:09,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 12:32:09,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:32:09,217 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);~counter~0 := 0; {29#true} is VALID [2022-04-27 12:32:09,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-27 12:32:09,218 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29#true} {29#true} #82#return; {29#true} is VALID [2022-04-27 12:32:09,220 INFO L272 TraceCheckUtils]: 0: Hoare triple {29#true} call ULTIMATE.init(); {34#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 12:32:09,220 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);~counter~0 := 0; {29#true} is VALID [2022-04-27 12:32:09,221 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-27 12:32:09,221 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29#true} {29#true} #82#return; {29#true} is VALID [2022-04-27 12:32:09,221 INFO L272 TraceCheckUtils]: 4: Hoare triple {29#true} call #t~ret4 := main(); {29#true} is VALID [2022-04-27 12:32:09,222 INFO L290 TraceCheckUtils]: 5: Hoare triple {29#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {29#true} is VALID [2022-04-27 12:32:09,222 INFO L290 TraceCheckUtils]: 6: Hoare triple {29#true} assume !true; {30#false} is VALID [2022-04-27 12:32:09,222 INFO L290 TraceCheckUtils]: 7: Hoare triple {30#false} assume !true; {30#false} is VALID [2022-04-27 12:32:09,222 INFO L272 TraceCheckUtils]: 8: Hoare triple {30#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {30#false} is VALID [2022-04-27 12:32:09,223 INFO L290 TraceCheckUtils]: 9: Hoare triple {30#false} ~cond := #in~cond; {30#false} is VALID [2022-04-27 12:32:09,223 INFO L290 TraceCheckUtils]: 10: Hoare triple {30#false} assume 0 == ~cond; {30#false} is VALID [2022-04-27 12:32:09,223 INFO L290 TraceCheckUtils]: 11: Hoare triple {30#false} assume !false; {30#false} is VALID [2022-04-27 12:32:09,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:32:09,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:32:09,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843649773] [2022-04-27 12:32:09,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843649773] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:32:09,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:32:09,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 12:32:09,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137277229] [2022-04-27 12:32:09,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:32:09,231 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 12:32:09,233 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:32:09,235 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:32:09,253 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:32:09,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 12:32:09,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:32:09,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 12:32:09,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:32:09,272 INFO L87 Difference]: Start difference. First operand has 26 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:32:09,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:32:09,376 INFO L93 Difference]: Finished difference Result 44 states and 60 transitions. [2022-04-27 12:32:09,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 12:32:09,376 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 12:32:09,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:32:09,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:32:09,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-04-27 12:32:09,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:32:09,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-04-27 12:32:09,388 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 60 transitions. [2022-04-27 12:32:09,450 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:32:09,460 INFO L225 Difference]: With dead ends: 44 [2022-04-27 12:32:09,460 INFO L226 Difference]: Without dead ends: 22 [2022-04-27 12:32:09,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:32:09,465 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:32:09,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 34 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:32:09,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-27 12:32:09,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-04-27 12:32:09,491 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:32:09,491 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:32:09,492 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:32:09,492 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:32:09,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:32:09,497 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-04-27 12:32:09,497 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-27 12:32:09,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:32:09,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:32:09,499 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 22 states. [2022-04-27 12:32:09,499 INFO L87 Difference]: Start difference. First operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 22 states. [2022-04-27 12:32:09,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:32:09,502 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-04-27 12:32:09,502 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-27 12:32:09,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:32:09,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:32:09,503 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:32:09,503 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:32:09,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:32:09,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2022-04-27 12:32:09,507 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 12 [2022-04-27 12:32:09,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:32:09,508 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2022-04-27 12:32:09,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:32:09,511 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2022-04-27 12:32:09,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 12:32:09,516 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:32:09,517 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:32:09,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 12:32:09,518 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:32:09,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:32:09,519 INFO L85 PathProgramCache]: Analyzing trace with hash 941422680, now seen corresponding path program 1 times [2022-04-27 12:32:09,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:32:09,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792627701] [2022-04-27 12:32:09,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:32:09,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:32:09,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:32:09,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 12:32:09,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:32:09,607 INFO L290 TraceCheckUtils]: 0: Hoare triple {173#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);~counter~0 := 0; {171#(<= ~counter~0 0)} is VALID [2022-04-27 12:32:09,607 INFO L290 TraceCheckUtils]: 1: Hoare triple {171#(<= ~counter~0 0)} assume true; {171#(<= ~counter~0 0)} is VALID [2022-04-27 12:32:09,608 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {171#(<= ~counter~0 0)} {166#true} #82#return; {171#(<= ~counter~0 0)} is VALID [2022-04-27 12:32:09,608 INFO L272 TraceCheckUtils]: 0: Hoare triple {166#true} call ULTIMATE.init(); {173#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 12:32:09,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {173#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);~counter~0 := 0; {171#(<= ~counter~0 0)} is VALID [2022-04-27 12:32:09,609 INFO L290 TraceCheckUtils]: 2: Hoare triple {171#(<= ~counter~0 0)} assume true; {171#(<= ~counter~0 0)} is VALID [2022-04-27 12:32:09,609 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {171#(<= ~counter~0 0)} {166#true} #82#return; {171#(<= ~counter~0 0)} is VALID [2022-04-27 12:32:09,610 INFO L272 TraceCheckUtils]: 4: Hoare triple {171#(<= ~counter~0 0)} call #t~ret4 := main(); {171#(<= ~counter~0 0)} is VALID [2022-04-27 12:32:09,610 INFO L290 TraceCheckUtils]: 5: Hoare triple {171#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {171#(<= ~counter~0 0)} is VALID [2022-04-27 12:32:09,611 INFO L290 TraceCheckUtils]: 6: Hoare triple {171#(<= ~counter~0 0)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {172#(<= |main_#t~post2| 0)} is VALID [2022-04-27 12:32:09,611 INFO L290 TraceCheckUtils]: 7: Hoare triple {172#(<= |main_#t~post2| 0)} assume !(#t~post2 < 2);havoc #t~post2; {167#false} is VALID [2022-04-27 12:32:09,612 INFO L290 TraceCheckUtils]: 8: Hoare triple {167#false} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {167#false} is VALID [2022-04-27 12:32:09,612 INFO L290 TraceCheckUtils]: 9: Hoare triple {167#false} assume !(#t~post3 < 2);havoc #t~post3; {167#false} is VALID [2022-04-27 12:32:09,612 INFO L272 TraceCheckUtils]: 10: Hoare triple {167#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {167#false} is VALID [2022-04-27 12:32:09,613 INFO L290 TraceCheckUtils]: 11: Hoare triple {167#false} ~cond := #in~cond; {167#false} is VALID [2022-04-27 12:32:09,613 INFO L290 TraceCheckUtils]: 12: Hoare triple {167#false} assume 0 == ~cond; {167#false} is VALID [2022-04-27 12:32:09,613 INFO L290 TraceCheckUtils]: 13: Hoare triple {167#false} assume !false; {167#false} is VALID [2022-04-27 12:32:09,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:32:09,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:32:09,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792627701] [2022-04-27 12:32:09,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792627701] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:32:09,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:32:09,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 12:32:09,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167145836] [2022-04-27 12:32:09,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:32:09,615 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 12:32:09,615 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:32:09,616 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:32:09,626 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:32:09,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:32:09,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:32:09,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:32:09,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:32:09,628 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:32:09,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:32:09,727 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-27 12:32:09,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 12:32:09,728 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 12:32:09,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:32:09,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:32:09,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-04-27 12:32:09,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:32:09,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-04-27 12:32:09,733 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 44 transitions. [2022-04-27 12:32:09,761 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:32:09,763 INFO L225 Difference]: With dead ends: 35 [2022-04-27 12:32:09,763 INFO L226 Difference]: Without dead ends: 23 [2022-04-27 12:32:09,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 12:32:09,767 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 6 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:32:09,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 53 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:32:09,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-27 12:32:09,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-27 12:32:09,774 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:32:09,775 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:32:09,775 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:32:09,775 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:32:09,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:32:09,776 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-04-27 12:32:09,777 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-27 12:32:09,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:32:09,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:32:09,778 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 23 states. [2022-04-27 12:32:09,778 INFO L87 Difference]: Start difference. First operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 23 states. [2022-04-27 12:32:09,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:32:09,779 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-04-27 12:32:09,779 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-27 12:32:09,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:32:09,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:32:09,780 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:32:09,780 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:32:09,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:32:09,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2022-04-27 12:32:09,784 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 14 [2022-04-27 12:32:09,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:32:09,785 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2022-04-27 12:32:09,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:32:09,785 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-27 12:32:09,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 12:32:09,785 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:32:09,786 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:32:09,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 12:32:09,786 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:32:09,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:32:09,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1209133518, now seen corresponding path program 1 times [2022-04-27 12:32:09,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:32:09,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704760406] [2022-04-27 12:32:09,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:32:09,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:32:09,817 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:32:09,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [199569814] [2022-04-27 12:32:09,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:32:09,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:32:09,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:32:09,819 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-27 12:32:09,820 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-27 12:32:09,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:32:09,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 12:32:09,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:32:09,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:32:10,042 INFO L272 TraceCheckUtils]: 0: Hoare triple {303#true} call ULTIMATE.init(); {303#true} is VALID [2022-04-27 12:32:10,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {303#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);~counter~0 := 0; {311#(<= ~counter~0 0)} is VALID [2022-04-27 12:32:10,044 INFO L290 TraceCheckUtils]: 2: Hoare triple {311#(<= ~counter~0 0)} assume true; {311#(<= ~counter~0 0)} is VALID [2022-04-27 12:32:10,044 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {311#(<= ~counter~0 0)} {303#true} #82#return; {311#(<= ~counter~0 0)} is VALID [2022-04-27 12:32:10,045 INFO L272 TraceCheckUtils]: 4: Hoare triple {311#(<= ~counter~0 0)} call #t~ret4 := main(); {311#(<= ~counter~0 0)} is VALID [2022-04-27 12:32:10,045 INFO L290 TraceCheckUtils]: 5: Hoare triple {311#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {311#(<= ~counter~0 0)} is VALID [2022-04-27 12:32:10,046 INFO L290 TraceCheckUtils]: 6: Hoare triple {311#(<= ~counter~0 0)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {327#(<= ~counter~0 1)} is VALID [2022-04-27 12:32:10,047 INFO L290 TraceCheckUtils]: 7: Hoare triple {327#(<= ~counter~0 1)} assume !!(#t~post2 < 2);havoc #t~post2; {327#(<= ~counter~0 1)} is VALID [2022-04-27 12:32:10,047 INFO L290 TraceCheckUtils]: 8: Hoare triple {327#(<= ~counter~0 1)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {327#(<= ~counter~0 1)} is VALID [2022-04-27 12:32:10,047 INFO L290 TraceCheckUtils]: 9: Hoare triple {327#(<= ~counter~0 1)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {337#(<= |main_#t~post3| 1)} is VALID [2022-04-27 12:32:10,048 INFO L290 TraceCheckUtils]: 10: Hoare triple {337#(<= |main_#t~post3| 1)} assume !(#t~post3 < 2);havoc #t~post3; {304#false} is VALID [2022-04-27 12:32:10,048 INFO L272 TraceCheckUtils]: 11: Hoare triple {304#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {304#false} is VALID [2022-04-27 12:32:10,048 INFO L290 TraceCheckUtils]: 12: Hoare triple {304#false} ~cond := #in~cond; {304#false} is VALID [2022-04-27 12:32:10,048 INFO L290 TraceCheckUtils]: 13: Hoare triple {304#false} assume 0 == ~cond; {304#false} is VALID [2022-04-27 12:32:10,048 INFO L290 TraceCheckUtils]: 14: Hoare triple {304#false} assume !false; {304#false} is VALID [2022-04-27 12:32:10,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:32:10,049 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:32:10,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:32:10,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704760406] [2022-04-27 12:32:10,049 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:32:10,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [199569814] [2022-04-27 12:32:10,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [199569814] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:32:10,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:32:10,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 12:32:10,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98500069] [2022-04-27 12:32:10,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:32:10,050 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 12:32:10,050 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:32:10,050 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:32:10,062 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:32:10,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:32:10,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:32:10,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:32:10,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:32:10,063 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:32:10,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:32:10,132 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2022-04-27 12:32:10,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:32:10,132 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 12:32:10,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:32:10,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:32:10,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-27 12:32:10,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:32:10,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-27 12:32:10,138 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2022-04-27 12:32:10,189 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-27 12:32:10,190 INFO L225 Difference]: With dead ends: 34 [2022-04-27 12:32:10,191 INFO L226 Difference]: Without dead ends: 27 [2022-04-27 12:32:10,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:32:10,194 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 3 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:32:10,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 66 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:32:10,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-27 12:32:10,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-04-27 12:32:10,201 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:32:10,201 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 26 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:32:10,202 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 26 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:32:10,202 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 26 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:32:10,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:32:10,203 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2022-04-27 12:32:10,204 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-04-27 12:32:10,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:32:10,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:32:10,205 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 27 states. [2022-04-27 12:32:10,206 INFO L87 Difference]: Start difference. First operand has 26 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 27 states. [2022-04-27 12:32:10,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:32:10,210 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2022-04-27 12:32:10,211 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-04-27 12:32:10,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:32:10,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:32:10,211 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:32:10,212 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:32:10,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:32:10,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2022-04-27 12:32:10,213 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 15 [2022-04-27 12:32:10,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:32:10,214 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2022-04-27 12:32:10,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:32:10,214 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2022-04-27 12:32:10,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 12:32:10,217 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:32:10,217 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:32:10,233 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 12:32:10,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:32:10,423 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:32:10,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:32:10,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1207346058, now seen corresponding path program 1 times [2022-04-27 12:32:10,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:32:10,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819902844] [2022-04-27 12:32:10,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:32:10,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:32:10,435 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:32:10,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1251206317] [2022-04-27 12:32:10,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:32:10,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:32:10,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:32:10,436 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-27 12:32:10,437 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-27 12:32:10,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:32:10,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-27 12:32:10,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:32:10,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:32:10,725 INFO L272 TraceCheckUtils]: 0: Hoare triple {487#true} call ULTIMATE.init(); {487#true} is VALID [2022-04-27 12:32:10,725 INFO L290 TraceCheckUtils]: 1: Hoare triple {487#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);~counter~0 := 0; {487#true} is VALID [2022-04-27 12:32:10,728 INFO L290 TraceCheckUtils]: 2: Hoare triple {487#true} assume true; {487#true} is VALID [2022-04-27 12:32:10,728 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {487#true} {487#true} #82#return; {487#true} is VALID [2022-04-27 12:32:10,728 INFO L272 TraceCheckUtils]: 4: Hoare triple {487#true} call #t~ret4 := main(); {487#true} is VALID [2022-04-27 12:32:10,729 INFO L290 TraceCheckUtils]: 5: Hoare triple {487#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {507#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:32:10,729 INFO L290 TraceCheckUtils]: 6: Hoare triple {507#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {507#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:32:10,730 INFO L290 TraceCheckUtils]: 7: Hoare triple {507#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post2 < 2);havoc #t~post2; {507#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:32:10,730 INFO L290 TraceCheckUtils]: 8: Hoare triple {507#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {517#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:32:10,731 INFO L290 TraceCheckUtils]: 9: Hoare triple {517#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {517#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:32:10,731 INFO L290 TraceCheckUtils]: 10: Hoare triple {517#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post3 < 2);havoc #t~post3; {517#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:32:10,732 INFO L272 TraceCheckUtils]: 11: Hoare triple {517#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {527#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:32:10,733 INFO L290 TraceCheckUtils]: 12: Hoare triple {527#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {531#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:32:10,734 INFO L290 TraceCheckUtils]: 13: Hoare triple {531#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {488#false} is VALID [2022-04-27 12:32:10,734 INFO L290 TraceCheckUtils]: 14: Hoare triple {488#false} assume !false; {488#false} is VALID [2022-04-27 12:32:10,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:32:10,734 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:32:10,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:32:10,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819902844] [2022-04-27 12:32:10,734 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:32:10,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251206317] [2022-04-27 12:32:10,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1251206317] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:32:10,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:32:10,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 12:32:10,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511107476] [2022-04-27 12:32:10,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:32:10,735 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 12:32:10,736 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:32:10,736 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:32:10,749 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:32:10,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 12:32:10,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:32:10,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 12:32:10,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-27 12:32:10,750 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:32:10,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:32:10,881 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2022-04-27 12:32:10,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 12:32:10,881 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 12:32:10,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:32:10,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:32:10,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-04-27 12:32:10,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:32:10,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-04-27 12:32:10,884 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 42 transitions. [2022-04-27 12:32:10,919 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:32:10,920 INFO L225 Difference]: With dead ends: 35 [2022-04-27 12:32:10,920 INFO L226 Difference]: Without dead ends: 32 [2022-04-27 12:32:10,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-27 12:32:10,922 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 10 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:32:10,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 75 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:32:10,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-27 12:32:10,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-27 12:32:10,936 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:32:10,937 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 12:32:10,937 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 12:32:10,937 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 12:32:10,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:32:10,938 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2022-04-27 12:32:10,939 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-04-27 12:32:10,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:32:10,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:32:10,939 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 32 states. [2022-04-27 12:32:10,939 INFO L87 Difference]: Start difference. First operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 32 states. [2022-04-27 12:32:10,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:32:10,941 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2022-04-27 12:32:10,941 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-04-27 12:32:10,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:32:10,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:32:10,941 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:32:10,941 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:32:10,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 12:32:10,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-04-27 12:32:10,942 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 15 [2022-04-27 12:32:10,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:32:10,943 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-04-27 12:32:10,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:32:10,943 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-04-27 12:32:10,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 12:32:10,943 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:32:10,944 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:32:10,967 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-27 12:32:11,167 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,SelfDestructingSolverStorable3 [2022-04-27 12:32:11,168 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:32:11,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:32:11,168 INFO L85 PathProgramCache]: Analyzing trace with hash -352921097, now seen corresponding path program 1 times [2022-04-27 12:32:11,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:32:11,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040644576] [2022-04-27 12:32:11,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:32:11,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:32:11,185 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:32:11,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1650311742] [2022-04-27 12:32:11,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:32:11,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:32:11,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:32:11,187 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-27 12:32:11,188 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-27 12:32:11,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:32:11,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 12:32:11,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:32:11,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:32:11,304 INFO L272 TraceCheckUtils]: 0: Hoare triple {693#true} call ULTIMATE.init(); {693#true} is VALID [2022-04-27 12:32:11,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {693#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);~counter~0 := 0; {701#(<= ~counter~0 0)} is VALID [2022-04-27 12:32:11,305 INFO L290 TraceCheckUtils]: 2: Hoare triple {701#(<= ~counter~0 0)} assume true; {701#(<= ~counter~0 0)} is VALID [2022-04-27 12:32:11,305 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {701#(<= ~counter~0 0)} {693#true} #82#return; {701#(<= ~counter~0 0)} is VALID [2022-04-27 12:32:11,305 INFO L272 TraceCheckUtils]: 4: Hoare triple {701#(<= ~counter~0 0)} call #t~ret4 := main(); {701#(<= ~counter~0 0)} is VALID [2022-04-27 12:32:11,306 INFO L290 TraceCheckUtils]: 5: Hoare triple {701#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {701#(<= ~counter~0 0)} is VALID [2022-04-27 12:32:11,306 INFO L290 TraceCheckUtils]: 6: Hoare triple {701#(<= ~counter~0 0)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {717#(<= ~counter~0 1)} is VALID [2022-04-27 12:32:11,307 INFO L290 TraceCheckUtils]: 7: Hoare triple {717#(<= ~counter~0 1)} assume !!(#t~post2 < 2);havoc #t~post2; {717#(<= ~counter~0 1)} is VALID [2022-04-27 12:32:11,307 INFO L290 TraceCheckUtils]: 8: Hoare triple {717#(<= ~counter~0 1)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {717#(<= ~counter~0 1)} is VALID [2022-04-27 12:32:11,307 INFO L290 TraceCheckUtils]: 9: Hoare triple {717#(<= ~counter~0 1)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {727#(<= |main_#t~post2| 1)} is VALID [2022-04-27 12:32:11,308 INFO L290 TraceCheckUtils]: 10: Hoare triple {727#(<= |main_#t~post2| 1)} assume !(#t~post2 < 2);havoc #t~post2; {694#false} is VALID [2022-04-27 12:32:11,308 INFO L290 TraceCheckUtils]: 11: Hoare triple {694#false} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {694#false} is VALID [2022-04-27 12:32:11,308 INFO L290 TraceCheckUtils]: 12: Hoare triple {694#false} assume !(#t~post3 < 2);havoc #t~post3; {694#false} is VALID [2022-04-27 12:32:11,308 INFO L272 TraceCheckUtils]: 13: Hoare triple {694#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {694#false} is VALID [2022-04-27 12:32:11,308 INFO L290 TraceCheckUtils]: 14: Hoare triple {694#false} ~cond := #in~cond; {694#false} is VALID [2022-04-27 12:32:11,308 INFO L290 TraceCheckUtils]: 15: Hoare triple {694#false} assume 0 == ~cond; {694#false} is VALID [2022-04-27 12:32:11,308 INFO L290 TraceCheckUtils]: 16: Hoare triple {694#false} assume !false; {694#false} is VALID [2022-04-27 12:32:11,309 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:32:11,309 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:32:11,398 INFO L290 TraceCheckUtils]: 16: Hoare triple {694#false} assume !false; {694#false} is VALID [2022-04-27 12:32:11,399 INFO L290 TraceCheckUtils]: 15: Hoare triple {694#false} assume 0 == ~cond; {694#false} is VALID [2022-04-27 12:32:11,399 INFO L290 TraceCheckUtils]: 14: Hoare triple {694#false} ~cond := #in~cond; {694#false} is VALID [2022-04-27 12:32:11,399 INFO L272 TraceCheckUtils]: 13: Hoare triple {694#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {694#false} is VALID [2022-04-27 12:32:11,399 INFO L290 TraceCheckUtils]: 12: Hoare triple {694#false} assume !(#t~post3 < 2);havoc #t~post3; {694#false} is VALID [2022-04-27 12:32:11,399 INFO L290 TraceCheckUtils]: 11: Hoare triple {694#false} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {694#false} is VALID [2022-04-27 12:32:11,399 INFO L290 TraceCheckUtils]: 10: Hoare triple {727#(<= |main_#t~post2| 1)} assume !(#t~post2 < 2);havoc #t~post2; {694#false} is VALID [2022-04-27 12:32:11,400 INFO L290 TraceCheckUtils]: 9: Hoare triple {717#(<= ~counter~0 1)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {727#(<= |main_#t~post2| 1)} is VALID [2022-04-27 12:32:11,400 INFO L290 TraceCheckUtils]: 8: Hoare triple {717#(<= ~counter~0 1)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {717#(<= ~counter~0 1)} is VALID [2022-04-27 12:32:11,400 INFO L290 TraceCheckUtils]: 7: Hoare triple {717#(<= ~counter~0 1)} assume !!(#t~post2 < 2);havoc #t~post2; {717#(<= ~counter~0 1)} is VALID [2022-04-27 12:32:11,401 INFO L290 TraceCheckUtils]: 6: Hoare triple {701#(<= ~counter~0 0)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {717#(<= ~counter~0 1)} is VALID [2022-04-27 12:32:11,401 INFO L290 TraceCheckUtils]: 5: Hoare triple {701#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {701#(<= ~counter~0 0)} is VALID [2022-04-27 12:32:11,402 INFO L272 TraceCheckUtils]: 4: Hoare triple {701#(<= ~counter~0 0)} call #t~ret4 := main(); {701#(<= ~counter~0 0)} is VALID [2022-04-27 12:32:11,402 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {701#(<= ~counter~0 0)} {693#true} #82#return; {701#(<= ~counter~0 0)} is VALID [2022-04-27 12:32:11,402 INFO L290 TraceCheckUtils]: 2: Hoare triple {701#(<= ~counter~0 0)} assume true; {701#(<= ~counter~0 0)} is VALID [2022-04-27 12:32:11,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {693#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);~counter~0 := 0; {701#(<= ~counter~0 0)} is VALID [2022-04-27 12:32:11,403 INFO L272 TraceCheckUtils]: 0: Hoare triple {693#true} call ULTIMATE.init(); {693#true} is VALID [2022-04-27 12:32:11,403 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:32:11,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:32:11,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040644576] [2022-04-27 12:32:11,403 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:32:11,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650311742] [2022-04-27 12:32:11,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650311742] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:32:11,403 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:32:11,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2022-04-27 12:32:11,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646814442] [2022-04-27 12:32:11,404 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:32:11,404 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 12:32:11,404 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:32:11,404 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:32:11,415 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:32:11,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:32:11,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:32:11,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:32:11,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:32:11,416 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:32:11,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:32:11,487 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2022-04-27 12:32:11,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 12:32:11,487 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 12:32:11,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:32:11,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:32:11,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2022-04-27 12:32:11,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:32:11,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2022-04-27 12:32:11,491 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 49 transitions. [2022-04-27 12:32:11,531 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-27 12:32:11,532 INFO L225 Difference]: With dead ends: 46 [2022-04-27 12:32:11,532 INFO L226 Difference]: Without dead ends: 34 [2022-04-27 12:32:11,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 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-27 12:32:11,533 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 3 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:32:11,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 81 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:32:11,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-27 12:32:11,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-27 12:32:11,539 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:32:11,539 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 12:32:11,540 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 12:32:11,540 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 12:32:11,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:32:11,541 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2022-04-27 12:32:11,541 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2022-04-27 12:32:11,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:32:11,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:32:11,541 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 34 states. [2022-04-27 12:32:11,541 INFO L87 Difference]: Start difference. First operand has 34 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 34 states. [2022-04-27 12:32:11,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:32:11,542 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2022-04-27 12:32:11,542 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2022-04-27 12:32:11,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:32:11,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:32:11,543 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:32:11,543 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:32:11,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 12:32:11,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2022-04-27 12:32:11,544 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 17 [2022-04-27 12:32:11,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:32:11,544 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2022-04-27 12:32:11,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:32:11,544 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2022-04-27 12:32:11,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 12:32:11,545 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:32:11,545 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:32:11,563 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-27 12:32:11,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:32:11,759 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:32:11,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:32:11,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1615882355, now seen corresponding path program 1 times [2022-04-27 12:32:11,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:32:11,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054692920] [2022-04-27 12:32:11,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:32:11,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:32:11,772 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:32:11,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [807157560] [2022-04-27 12:32:11,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:32:11,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:32:11,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:32:11,773 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-27 12:32:11,774 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-27 12:32:11,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:32:11,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-27 12:32:11,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:32:11,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:32:12,061 INFO L272 TraceCheckUtils]: 0: Hoare triple {976#true} call ULTIMATE.init(); {976#true} is VALID [2022-04-27 12:32:12,062 INFO L290 TraceCheckUtils]: 1: Hoare triple {976#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);~counter~0 := 0; {976#true} is VALID [2022-04-27 12:32:12,062 INFO L290 TraceCheckUtils]: 2: Hoare triple {976#true} assume true; {976#true} is VALID [2022-04-27 12:32:12,062 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {976#true} {976#true} #82#return; {976#true} is VALID [2022-04-27 12:32:12,062 INFO L272 TraceCheckUtils]: 4: Hoare triple {976#true} call #t~ret4 := main(); {976#true} is VALID [2022-04-27 12:32:12,063 INFO L290 TraceCheckUtils]: 5: Hoare triple {976#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {996#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:32:12,063 INFO L290 TraceCheckUtils]: 6: Hoare triple {996#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {996#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:32:12,063 INFO L290 TraceCheckUtils]: 7: Hoare triple {996#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post2 < 2);havoc #t~post2; {996#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:32:12,066 INFO L290 TraceCheckUtils]: 8: Hoare triple {996#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1006#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 12:32:12,066 INFO L290 TraceCheckUtils]: 9: Hoare triple {1006#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {1006#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 12:32:12,067 INFO L290 TraceCheckUtils]: 10: Hoare triple {1006#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} assume !!(#t~post2 < 2);havoc #t~post2; {1006#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 12:32:12,067 INFO L290 TraceCheckUtils]: 11: Hoare triple {1006#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1006#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 12:32:12,068 INFO L290 TraceCheckUtils]: 12: Hoare triple {1006#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1006#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 12:32:12,068 INFO L290 TraceCheckUtils]: 13: Hoare triple {1006#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} assume !(#t~post3 < 2);havoc #t~post3; {1006#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 12:32:12,069 INFO L272 TraceCheckUtils]: 14: Hoare triple {1006#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1025#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:32:12,069 INFO L290 TraceCheckUtils]: 15: Hoare triple {1025#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1029#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:32:12,070 INFO L290 TraceCheckUtils]: 16: Hoare triple {1029#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {977#false} is VALID [2022-04-27 12:32:12,070 INFO L290 TraceCheckUtils]: 17: Hoare triple {977#false} assume !false; {977#false} is VALID [2022-04-27 12:32:12,070 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:32:12,070 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:32:12,415 INFO L290 TraceCheckUtils]: 17: Hoare triple {977#false} assume !false; {977#false} is VALID [2022-04-27 12:32:12,416 INFO L290 TraceCheckUtils]: 16: Hoare triple {1029#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {977#false} is VALID [2022-04-27 12:32:12,417 INFO L290 TraceCheckUtils]: 15: Hoare triple {1025#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1029#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:32:12,418 INFO L272 TraceCheckUtils]: 14: Hoare triple {1045#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1025#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:32:12,418 INFO L290 TraceCheckUtils]: 13: Hoare triple {1045#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} assume !(#t~post3 < 2);havoc #t~post3; {1045#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} is VALID [2022-04-27 12:32:12,419 INFO L290 TraceCheckUtils]: 12: Hoare triple {1045#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1045#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} is VALID [2022-04-27 12:32:12,420 INFO L290 TraceCheckUtils]: 11: Hoare triple {1045#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1045#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} is VALID [2022-04-27 12:32:12,421 INFO L290 TraceCheckUtils]: 10: Hoare triple {1045#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} assume !!(#t~post2 < 2);havoc #t~post2; {1045#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} is VALID [2022-04-27 12:32:12,431 INFO L290 TraceCheckUtils]: 9: Hoare triple {1045#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {1045#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} is VALID [2022-04-27 12:32:12,432 INFO L290 TraceCheckUtils]: 8: Hoare triple {1064#(or (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))))} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1045#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} is VALID [2022-04-27 12:32:12,435 INFO L290 TraceCheckUtils]: 7: Hoare triple {1064#(or (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))))} assume !!(#t~post2 < 2);havoc #t~post2; {1064#(or (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))))} is VALID [2022-04-27 12:32:12,436 INFO L290 TraceCheckUtils]: 6: Hoare triple {1064#(or (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))))} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {1064#(or (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))))} is VALID [2022-04-27 12:32:12,436 INFO L290 TraceCheckUtils]: 5: Hoare triple {976#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1064#(or (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))))} is VALID [2022-04-27 12:32:12,436 INFO L272 TraceCheckUtils]: 4: Hoare triple {976#true} call #t~ret4 := main(); {976#true} is VALID [2022-04-27 12:32:12,436 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {976#true} {976#true} #82#return; {976#true} is VALID [2022-04-27 12:32:12,436 INFO L290 TraceCheckUtils]: 2: Hoare triple {976#true} assume true; {976#true} is VALID [2022-04-27 12:32:12,436 INFO L290 TraceCheckUtils]: 1: Hoare triple {976#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);~counter~0 := 0; {976#true} is VALID [2022-04-27 12:32:12,437 INFO L272 TraceCheckUtils]: 0: Hoare triple {976#true} call ULTIMATE.init(); {976#true} is VALID [2022-04-27 12:32:12,437 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:32:12,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:32:12,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054692920] [2022-04-27 12:32:12,437 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:32:12,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807157560] [2022-04-27 12:32:12,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [807157560] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 12:32:12,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:32:12,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2022-04-27 12:32:12,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248694723] [2022-04-27 12:32:12,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:32:12,438 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-27 12:32:12,438 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:32:12,438 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:32:14,487 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 17 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 12:32:14,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 12:32:14,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:32:14,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 12:32:14,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-04-27 12:32:14,488 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:32:14,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:32:14,579 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-04-27 12:32:14,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 12:32:14,580 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-27 12:32:14,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:32:14,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:32:14,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-04-27 12:32:14,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:32:14,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-04-27 12:32:14,582 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 41 transitions. [2022-04-27 12:32:15,216 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:32:15,217 INFO L225 Difference]: With dead ends: 44 [2022-04-27 12:32:15,217 INFO L226 Difference]: Without dead ends: 37 [2022-04-27 12:32:15,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-04-27 12:32:15,218 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 11 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 16 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:32:15,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 100 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 16 Unchecked, 0.0s Time] [2022-04-27 12:32:15,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-27 12:32:15,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2022-04-27 12:32:15,232 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:32:15,233 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 36 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 12:32:15,233 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 36 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 12:32:15,233 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 36 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 12:32:15,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:32:15,235 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2022-04-27 12:32:15,235 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2022-04-27 12:32:15,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:32:15,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:32:15,235 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 37 states. [2022-04-27 12:32:15,235 INFO L87 Difference]: Start difference. First operand has 36 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 37 states. [2022-04-27 12:32:15,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:32:15,236 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2022-04-27 12:32:15,236 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2022-04-27 12:32:15,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:32:15,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:32:15,237 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:32:15,237 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:32:15,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 12:32:15,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2022-04-27 12:32:15,238 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 18 [2022-04-27 12:32:15,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:32:15,238 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2022-04-27 12:32:15,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:32:15,238 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2022-04-27 12:32:15,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 12:32:15,238 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:32:15,238 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:32:15,257 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-27 12:32:15,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:32:15,439 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:32:15,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:32:15,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1617669815, now seen corresponding path program 1 times [2022-04-27 12:32:15,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:32:15,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761552870] [2022-04-27 12:32:15,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:32:15,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:32:15,448 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:32:15,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1558034391] [2022-04-27 12:32:15,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:32:15,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:32:15,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:32:15,452 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-27 12:32:15,452 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-27 12:32:15,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:32:15,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 12:32:15,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:32:15,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:32:15,606 INFO L272 TraceCheckUtils]: 0: Hoare triple {1274#true} call ULTIMATE.init(); {1274#true} is VALID [2022-04-27 12:32:15,606 INFO L290 TraceCheckUtils]: 1: Hoare triple {1274#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);~counter~0 := 0; {1282#(<= 0 ~counter~0)} is VALID [2022-04-27 12:32:15,606 INFO L290 TraceCheckUtils]: 2: Hoare triple {1282#(<= 0 ~counter~0)} assume true; {1282#(<= 0 ~counter~0)} is VALID [2022-04-27 12:32:15,607 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1282#(<= 0 ~counter~0)} {1274#true} #82#return; {1282#(<= 0 ~counter~0)} is VALID [2022-04-27 12:32:15,619 INFO L272 TraceCheckUtils]: 4: Hoare triple {1282#(<= 0 ~counter~0)} call #t~ret4 := main(); {1282#(<= 0 ~counter~0)} is VALID [2022-04-27 12:32:15,620 INFO L290 TraceCheckUtils]: 5: Hoare triple {1282#(<= 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 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1282#(<= 0 ~counter~0)} is VALID [2022-04-27 12:32:15,620 INFO L290 TraceCheckUtils]: 6: Hoare triple {1282#(<= 0 ~counter~0)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {1298#(<= 1 ~counter~0)} is VALID [2022-04-27 12:32:15,620 INFO L290 TraceCheckUtils]: 7: Hoare triple {1298#(<= 1 ~counter~0)} assume !!(#t~post2 < 2);havoc #t~post2; {1298#(<= 1 ~counter~0)} is VALID [2022-04-27 12:32:15,621 INFO L290 TraceCheckUtils]: 8: Hoare triple {1298#(<= 1 ~counter~0)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1298#(<= 1 ~counter~0)} is VALID [2022-04-27 12:32:15,621 INFO L290 TraceCheckUtils]: 9: Hoare triple {1298#(<= 1 ~counter~0)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {1308#(<= 2 ~counter~0)} is VALID [2022-04-27 12:32:15,622 INFO L290 TraceCheckUtils]: 10: Hoare triple {1308#(<= 2 ~counter~0)} assume !!(#t~post2 < 2);havoc #t~post2; {1308#(<= 2 ~counter~0)} is VALID [2022-04-27 12:32:15,622 INFO L290 TraceCheckUtils]: 11: Hoare triple {1308#(<= 2 ~counter~0)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1308#(<= 2 ~counter~0)} is VALID [2022-04-27 12:32:15,622 INFO L290 TraceCheckUtils]: 12: Hoare triple {1308#(<= 2 ~counter~0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1318#(<= 2 |main_#t~post3|)} is VALID [2022-04-27 12:32:15,623 INFO L290 TraceCheckUtils]: 13: Hoare triple {1318#(<= 2 |main_#t~post3|)} assume !!(#t~post3 < 2);havoc #t~post3; {1275#false} is VALID [2022-04-27 12:32:15,623 INFO L272 TraceCheckUtils]: 14: Hoare triple {1275#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1275#false} is VALID [2022-04-27 12:32:15,623 INFO L290 TraceCheckUtils]: 15: Hoare triple {1275#false} ~cond := #in~cond; {1275#false} is VALID [2022-04-27 12:32:15,623 INFO L290 TraceCheckUtils]: 16: Hoare triple {1275#false} assume 0 == ~cond; {1275#false} is VALID [2022-04-27 12:32:15,623 INFO L290 TraceCheckUtils]: 17: Hoare triple {1275#false} assume !false; {1275#false} is VALID [2022-04-27 12:32:15,623 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:32:15,623 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:32:15,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:32:15,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761552870] [2022-04-27 12:32:15,624 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:32:15,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558034391] [2022-04-27 12:32:15,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1558034391] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:32:15,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:32:15,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 12:32:15,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781727474] [2022-04-27 12:32:15,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:32:15,624 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-27 12:32:15,625 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:32:15,625 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:32:15,638 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:32:15,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 12:32:15,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:32:15,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 12:32:15,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-27 12:32:15,639 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:32:15,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:32:15,731 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2022-04-27 12:32:15,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 12:32:15,732 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-27 12:32:15,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:32:15,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:32:15,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-04-27 12:32:15,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:32:15,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-04-27 12:32:15,734 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 47 transitions. [2022-04-27 12:32:15,765 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-27 12:32:15,766 INFO L225 Difference]: With dead ends: 46 [2022-04-27 12:32:15,766 INFO L226 Difference]: Without dead ends: 25 [2022-04-27 12:32:15,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 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-27 12:32:15,767 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 38 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:32:15,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 55 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:32:15,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-27 12:32:15,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-27 12:32:15,779 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:32:15,779 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:32:15,780 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:32:15,780 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:32:15,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:32:15,783 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-27 12:32:15,783 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-27 12:32:15,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:32:15,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:32:15,783 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 25 states. [2022-04-27 12:32:15,783 INFO L87 Difference]: Start difference. First operand has 25 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 25 states. [2022-04-27 12:32:15,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:32:15,784 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-27 12:32:15,784 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-27 12:32:15,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:32:15,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:32:15,785 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:32:15,785 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:32:15,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:32:15,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2022-04-27 12:32:15,785 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 18 [2022-04-27 12:32:15,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:32:15,786 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2022-04-27 12:32:15,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:32:15,786 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-27 12:32:15,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 12:32:15,786 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:32:15,787 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:32:15,805 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-27 12:32:16,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:32:16,004 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:32:16,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:32:16,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1626008211, now seen corresponding path program 1 times [2022-04-27 12:32:16,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:32:16,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735537325] [2022-04-27 12:32:16,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:32:16,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:32:16,020 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:32:16,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2104161492] [2022-04-27 12:32:16,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:32:16,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:32:16,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:32:16,022 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-27 12:32:16,023 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-27 12:32:16,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:32:16,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 12:32:16,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:32:16,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:32:16,125 INFO L272 TraceCheckUtils]: 0: Hoare triple {1479#true} call ULTIMATE.init(); {1479#true} is VALID [2022-04-27 12:32:16,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {1479#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);~counter~0 := 0; {1479#true} is VALID [2022-04-27 12:32:16,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {1479#true} assume true; {1479#true} is VALID [2022-04-27 12:32:16,126 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1479#true} {1479#true} #82#return; {1479#true} is VALID [2022-04-27 12:32:16,126 INFO L272 TraceCheckUtils]: 4: Hoare triple {1479#true} call #t~ret4 := main(); {1479#true} is VALID [2022-04-27 12:32:16,126 INFO L290 TraceCheckUtils]: 5: Hoare triple {1479#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1499#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-27 12:32:16,126 INFO L290 TraceCheckUtils]: 6: Hoare triple {1499#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {1499#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-27 12:32:16,127 INFO L290 TraceCheckUtils]: 7: Hoare triple {1499#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !!(#t~post2 < 2);havoc #t~post2; {1499#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-27 12:32:16,127 INFO L290 TraceCheckUtils]: 8: Hoare triple {1499#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1499#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-27 12:32:16,128 INFO L290 TraceCheckUtils]: 9: Hoare triple {1499#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1499#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-27 12:32:16,128 INFO L290 TraceCheckUtils]: 10: Hoare triple {1499#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !!(#t~post3 < 2);havoc #t~post3; {1499#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-27 12:32:16,128 INFO L272 TraceCheckUtils]: 11: Hoare triple {1499#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1479#true} is VALID [2022-04-27 12:32:16,128 INFO L290 TraceCheckUtils]: 12: Hoare triple {1479#true} ~cond := #in~cond; {1479#true} is VALID [2022-04-27 12:32:16,128 INFO L290 TraceCheckUtils]: 13: Hoare triple {1479#true} assume !(0 == ~cond); {1479#true} is VALID [2022-04-27 12:32:16,128 INFO L290 TraceCheckUtils]: 14: Hoare triple {1479#true} assume true; {1479#true} is VALID [2022-04-27 12:32:16,129 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1479#true} {1499#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} #78#return; {1499#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-27 12:32:16,129 INFO L290 TraceCheckUtils]: 16: Hoare triple {1499#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {1480#false} is VALID [2022-04-27 12:32:16,129 INFO L290 TraceCheckUtils]: 17: Hoare triple {1480#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1480#false} is VALID [2022-04-27 12:32:16,129 INFO L290 TraceCheckUtils]: 18: Hoare triple {1480#false} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1480#false} is VALID [2022-04-27 12:32:16,130 INFO L290 TraceCheckUtils]: 19: Hoare triple {1480#false} assume !(#t~post3 < 2);havoc #t~post3; {1480#false} is VALID [2022-04-27 12:32:16,130 INFO L272 TraceCheckUtils]: 20: Hoare triple {1480#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1480#false} is VALID [2022-04-27 12:32:16,130 INFO L290 TraceCheckUtils]: 21: Hoare triple {1480#false} ~cond := #in~cond; {1480#false} is VALID [2022-04-27 12:32:16,130 INFO L290 TraceCheckUtils]: 22: Hoare triple {1480#false} assume 0 == ~cond; {1480#false} is VALID [2022-04-27 12:32:16,130 INFO L290 TraceCheckUtils]: 23: Hoare triple {1480#false} assume !false; {1480#false} is VALID [2022-04-27 12:32:16,130 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:32:16,130 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:32:16,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:32:16,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735537325] [2022-04-27 12:32:16,130 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:32:16,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104161492] [2022-04-27 12:32:16,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104161492] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:32:16,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:32:16,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 12:32:16,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629430504] [2022-04-27 12:32:16,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:32:16,131 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-04-27 12:32:16,131 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:32:16,131 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:32:16,146 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:32:16,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 12:32:16,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:32:16,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 12:32:16,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:32:16,147 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:32:16,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:32:16,163 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-27 12:32:16,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 12:32:16,164 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-04-27 12:32:16,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:32:16,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:32:16,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2022-04-27 12:32:16,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:32:16,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2022-04-27 12:32:16,165 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 25 transitions. [2022-04-27 12:32:16,180 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:32:16,181 INFO L225 Difference]: With dead ends: 25 [2022-04-27 12:32:16,181 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 12:32:16,181 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:32:16,182 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:32:16,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:32:16,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 12:32:16,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 12:32:16,182 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:32:16,182 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-27 12:32:16,183 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-27 12:32:16,183 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-27 12:32:16,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:32:16,183 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 12:32:16,183 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 12:32:16,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:32:16,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:32:16,184 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-27 12:32:16,184 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-27 12:32:16,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:32:16,184 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 12:32:16,184 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 12:32:16,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:32:16,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:32:16,184 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:32:16,184 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:32:16,184 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-27 12:32:16,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 12:32:16,184 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2022-04-27 12:32:16,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:32:16,184 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 12:32:16,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:32:16,185 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 12:32:16,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:32:16,186 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 12:32:16,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-27 12:32:16,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:32:16,393 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 12:32:22,899 WARN L232 SmtUtils]: Spent 6.47s on a formula simplification. DAG size of input: 41 DAG size of output: 33 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-27 12:32:22,993 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-27 12:32:22,993 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-27 12:32:22,993 INFO L899 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-27 12:32:22,993 INFO L899 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2022-04-27 12:32:22,993 INFO L899 garLoopResultBuilder]: For program point L16-2(lines 15 17) no Hoare annotation was computed. [2022-04-27 12:32:22,993 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 15 17) no Hoare annotation was computed. [2022-04-27 12:32:22,993 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 15 17) no Hoare annotation was computed. [2022-04-27 12:32:22,993 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 26 50) no Hoare annotation was computed. [2022-04-27 12:32:22,993 INFO L899 garLoopResultBuilder]: For program point L48(line 48) no Hoare annotation was computed. [2022-04-27 12:32:22,993 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 26 50) no Hoare annotation was computed. [2022-04-27 12:32:22,993 INFO L899 garLoopResultBuilder]: For program point L38(lines 38 47) no Hoare annotation was computed. [2022-04-27 12:32:22,993 INFO L895 garLoopResultBuilder]: At program point L38-2(lines 38 47) the Hoare annotation is: (or (forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))) (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-27 12:32:22,993 INFO L899 garLoopResultBuilder]: For program point L34-1(lines 34 37) no Hoare annotation was computed. [2022-04-27 12:32:22,994 INFO L895 garLoopResultBuilder]: At program point L34-3(lines 34 37) the Hoare annotation is: (let ((.cse0 (forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))))) (or (and (<= 2 ~counter~0) .cse0) (not (<= |old(~counter~0)| 0)) (and (<= ~counter~0 1) .cse0 (<= 1 ~counter~0)) (and (= main_~A~0 main_~r~0) (<= 0 ~counter~0) (= main_~B~0 main_~b~0) (= main_~q~0 0) (= main_~B~0 1)) (not (<= 0 |old(~counter~0)|)))) [2022-04-27 12:32:22,994 INFO L895 garLoopResultBuilder]: At program point mainENTRY(lines 26 50) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (<= 0 ~counter~0) (<= ~counter~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-27 12:32:22,994 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 46) no Hoare annotation was computed. [2022-04-27 12:32:22,994 INFO L899 garLoopResultBuilder]: For program point L43-2(lines 26 50) no Hoare annotation was computed. [2022-04-27 12:32:22,994 INFO L895 garLoopResultBuilder]: At program point L39(line 39) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (<= 2 ~counter~0) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~B~0 main_~b~0) (= main_~q~0 0) (= main_~B~0 1)) (not (<= 0 |old(~counter~0)|))) [2022-04-27 12:32:22,994 INFO L899 garLoopResultBuilder]: For program point L39-1(lines 38 47) no Hoare annotation was computed. [2022-04-27 12:32:22,994 INFO L899 garLoopResultBuilder]: For program point L35(line 35) no Hoare annotation was computed. [2022-04-27 12:32:22,994 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 12:32:22,994 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-27 12:32:22,994 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 12:32:22,994 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 12:32:22,994 INFO L895 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (and (<= 0 ~counter~0) (<= ~counter~0 0)) [2022-04-27 12:32:22,994 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 12:32:22,994 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 12:32:22,994 INFO L899 garLoopResultBuilder]: For program point L19-2(lines 18 24) no Hoare annotation was computed. [2022-04-27 12:32:22,994 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 18 24) the Hoare annotation is: true [2022-04-27 12:32:22,995 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 18 24) no Hoare annotation was computed. [2022-04-27 12:32:22,995 INFO L899 garLoopResultBuilder]: For program point L20(lines 20 21) no Hoare annotation was computed. [2022-04-27 12:32:22,995 INFO L899 garLoopResultBuilder]: For program point L19(lines 19 22) no Hoare annotation was computed. [2022-04-27 12:32:22,995 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 21) no Hoare annotation was computed. [2022-04-27 12:32:22,997 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:32:23,004 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 12:32:23,007 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 12:32:23,007 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 12:32:23,007 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 12:32:23,012 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-27 12:32:23,013 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 12:32:23,013 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-27 12:32:23,013 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 12:32:23,013 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 12:32:23,014 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 12:32:23,014 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 12:32:23,014 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2022-04-27 12:32:23,014 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-27 12:32:23,014 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 12:32:23,014 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 12:32:23,014 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 12:32:23,014 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 12:32:23,014 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-04-27 12:32:23,014 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2022-04-27 12:32:23,014 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2022-04-27 12:32:23,014 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-27 12:32:23,014 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-27 12:32:23,014 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-04-27 12:32:23,014 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-04-27 12:32:23,014 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2022-04-27 12:32:23,014 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-27 12:32:23,015 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-27 12:32:23,015 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-27 12:32:23,015 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-27 12:32:23,015 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-27 12:32:23,015 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:32:23,015 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:32:23,015 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-27 12:32:23,015 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2022-04-27 12:32:23,015 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2022-04-27 12:32:23,015 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2022-04-27 12:32:23,015 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 12:32:23,015 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-04-27 12:32:23,015 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-04-27 12:32:23,015 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 12:32:23,015 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 12:32:23,018 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~b~0,QUANTIFIED] [2022-04-27 12:32:23,018 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~b~0,QUANTIFIED] [2022-04-27 12:32:23,021 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~b~0,QUANTIFIED] [2022-04-27 12:32:23,021 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~b~0,QUANTIFIED] [2022-04-27 12:32:23,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 12:32:23 BoogieIcfgContainer [2022-04-27 12:32:23,023 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 12:32:23,024 INFO L158 Benchmark]: Toolchain (without parser) took 14534.59ms. Allocated memory was 179.3MB in the beginning and 244.3MB in the end (delta: 65.0MB). Free memory was 128.4MB in the beginning and 126.5MB in the end (delta: 1.9MB). Peak memory consumption was 68.2MB. Max. memory is 8.0GB. [2022-04-27 12:32:23,024 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 179.3MB. Free memory was 145.0MB in the beginning and 144.9MB in the end (delta: 73.2kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 12:32:23,024 INFO L158 Benchmark]: CACSL2BoogieTranslator took 225.10ms. Allocated memory is still 179.3MB. Free memory was 128.2MB in the beginning and 154.3MB in the end (delta: -26.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 12:32:23,024 INFO L158 Benchmark]: Boogie Preprocessor took 28.97ms. Allocated memory is still 179.3MB. Free memory was 154.3MB in the beginning and 152.9MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 12:32:23,025 INFO L158 Benchmark]: RCFGBuilder took 221.58ms. Allocated memory is still 179.3MB. Free memory was 152.9MB in the beginning and 141.4MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 12:32:23,025 INFO L158 Benchmark]: TraceAbstraction took 14054.78ms. Allocated memory was 179.3MB in the beginning and 244.3MB in the end (delta: 65.0MB). Free memory was 140.8MB in the beginning and 126.5MB in the end (delta: 14.3MB). Peak memory consumption was 80.3MB. Max. memory is 8.0GB. [2022-04-27 12:32:23,026 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.25ms. Allocated memory is still 179.3MB. Free memory was 145.0MB in the beginning and 144.9MB in the end (delta: 73.2kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 225.10ms. Allocated memory is still 179.3MB. Free memory was 128.2MB in the beginning and 154.3MB in the end (delta: -26.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.97ms. Allocated memory is still 179.3MB. Free memory was 154.3MB in the beginning and 152.9MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 221.58ms. Allocated memory is still 179.3MB. Free memory was 152.9MB in the beginning and 141.4MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 14054.78ms. Allocated memory was 179.3MB in the beginning and 244.3MB in the end (delta: 65.0MB). Free memory was 140.8MB in the beginning and 126.5MB in the end (delta: 14.3MB). Peak memory consumption was 80.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~b~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~b~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~b~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~b~0,QUANTIFIED] * 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, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.0s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 78 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 77 mSDsluCounter, 487 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 16 IncrementalHoareTripleChecker+Unchecked, 295 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 141 IncrementalHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 192 mSDtfsCounter, 141 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 151 GetRequests, 119 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=6, InterpolantAutomatonStates: 41, 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, 8 MinimizatonAttempts, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 20 PreInvPairs, 25 NumberOfFragments, 149 HoareAnnotationTreeSize, 20 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 69 FormulaSimplificationTreeSizeReductionInter, 6.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 133 NumberOfCodeBlocks, 133 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 158 ConstructedInterpolants, 9 QuantifiedInterpolants, 617 SizeOfPredicates, 12 NumberOfNonLiveVariables, 485 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 10/17 InterpolantCoveringCapability, 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: 34]: Loop Invariant [2022-04-27 12:32:23,036 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~b~0,QUANTIFIED] [2022-04-27 12:32:23,036 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~b~0,QUANTIFIED] [2022-04-27 12:32:23,036 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~b~0,QUANTIFIED] [2022-04-27 12:32:23,036 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~b~0,QUANTIFIED] Derived loop invariant: ((((2 <= counter && (forall main_~b~0 : int :: A % 4294967296 == (r + main_~b~0 * q) % 4294967296)) || !(\old(counter) <= 0)) || ((counter <= 1 && (forall main_~b~0 : int :: A % 4294967296 == (r + main_~b~0 * q) % 4294967296)) && 1 <= counter)) || ((((A == r && 0 <= counter) && B == b) && q == 0) && B == 1)) || !(0 <= \old(counter)) RESULT: Ultimate proved your program to be correct! [2022-04-27 12:32:23,049 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...