/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/divbin_unwindbound5.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 12:37:46,723 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 12:37:46,725 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 12:37:46,775 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 12:37:46,775 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 12:37:46,776 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 12:37:46,781 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 12:37:46,785 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 12:37:46,786 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 12:37:46,786 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 12:37:46,787 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 12:37:46,787 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 12:37:46,788 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 12:37:46,788 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 12:37:46,789 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 12:37:46,789 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 12:37:46,790 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 12:37:46,790 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 12:37:46,791 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 12:37:46,792 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 12:37:46,793 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 12:37:46,797 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 12:37:46,799 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 12:37:46,800 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 12:37:46,802 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 12:37:46,809 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 12:37:46,809 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 12:37:46,809 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 12:37:46,810 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 12:37:46,810 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 12:37:46,811 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 12:37:46,811 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 12:37:46,811 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 12:37:46,812 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 12:37:46,812 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 12:37:46,813 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 12:37:46,813 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 12:37:46,813 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 12:37:46,813 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 12:37:46,814 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 12:37:46,814 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 12:37:46,819 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 12:37:46,820 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:37:46,843 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 12:37:46,843 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 12:37:46,843 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 12:37:46,843 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 12:37:46,844 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 12:37:46,844 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 12:37:46,844 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 12:37:46,844 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 12:37:46,844 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 12:37:46,844 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 12:37:46,844 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 12:37:46,844 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 12:37:46,845 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 12:37:46,845 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 12:37:46,845 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 12:37:46,845 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 12:37:46,845 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 12:37:46,845 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 12:37:46,845 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 12:37:46,845 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 12:37:46,845 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 12:37:46,845 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 12:37:46,845 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 12:37:46,845 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 12:37:46,846 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 12:37:46,846 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 12:37:46,846 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 12:37:46,846 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 12:37:46,846 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 12:37:46,846 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 12:37:46,846 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 12:37:46,846 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 12:37:46,846 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 12:37:46,846 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:37:47,021 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 12:37:47,047 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 12:37:47,048 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 12:37:47,049 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 12:37:47,050 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 12:37:47,050 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/divbin_unwindbound5.i [2022-04-27 12:37:47,092 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3617cffd1/11f0648ea14d4301811a00ab6cb7043a/FLAG1eea266ad [2022-04-27 12:37:47,484 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 12:37:47,484 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin_unwindbound5.i [2022-04-27 12:37:47,491 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3617cffd1/11f0648ea14d4301811a00ab6cb7043a/FLAG1eea266ad [2022-04-27 12:37:47,515 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3617cffd1/11f0648ea14d4301811a00ab6cb7043a [2022-04-27 12:37:47,517 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 12:37:47,519 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 12:37:47,521 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 12:37:47,521 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 12:37:47,523 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 12:37:47,524 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 12:37:47" (1/1) ... [2022-04-27 12:37:47,528 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78cb1008 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:37:47, skipping insertion in model container [2022-04-27 12:37:47,528 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 12:37:47" (1/1) ... [2022-04-27 12:37:47,546 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 12:37:47,564 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 12:37:47,705 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin_unwindbound5.i[950,963] [2022-04-27 12:37:47,716 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 12:37:47,722 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 12:37:47,731 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin_unwindbound5.i[950,963] [2022-04-27 12:37:47,736 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 12:37:47,745 INFO L208 MainTranslator]: Completed translation [2022-04-27 12:37:47,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:37:47 WrapperNode [2022-04-27 12:37:47,746 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 12:37:47,746 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 12:37:47,746 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 12:37:47,746 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 12:37:47,754 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:37:47" (1/1) ... [2022-04-27 12:37:47,754 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:37:47" (1/1) ... [2022-04-27 12:37:47,758 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:37:47" (1/1) ... [2022-04-27 12:37:47,758 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:37:47" (1/1) ... [2022-04-27 12:37:47,763 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:37:47" (1/1) ... [2022-04-27 12:37:47,766 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:37:47" (1/1) ... [2022-04-27 12:37:47,767 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:37:47" (1/1) ... [2022-04-27 12:37:47,768 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 12:37:47,769 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 12:37:47,769 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 12:37:47,769 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 12:37:47,770 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:37:47" (1/1) ... [2022-04-27 12:37:47,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 12:37:47,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:37:47,795 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:37:47,824 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:37:47,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 12:37:47,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 12:37:47,836 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 12:37:47,836 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 12:37:47,836 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 12:37:47,836 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 12:37:47,836 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 12:37:47,836 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 12:37:47,837 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 12:37:47,837 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 12:37:47,837 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 12:37:47,837 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 12:37:47,837 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 12:37:47,837 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 12:37:47,837 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 12:37:47,837 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 12:37:47,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 12:37:47,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 12:37:47,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 12:37:47,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 12:37:47,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 12:37:47,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 12:37:47,886 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 12:37:47,889 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 12:37:48,006 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 12:37:48,011 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 12:37:48,012 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 12:37:48,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 12:37:48 BoogieIcfgContainer [2022-04-27 12:37:48,013 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 12:37:48,014 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 12:37:48,014 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 12:37:48,017 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 12:37:48,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 12:37:47" (1/3) ... [2022-04-27 12:37:48,018 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62d0be65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 12:37:48, skipping insertion in model container [2022-04-27 12:37:48,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:37:47" (2/3) ... [2022-04-27 12:37:48,018 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62d0be65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 12:37:48, skipping insertion in model container [2022-04-27 12:37:48,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 12:37:48" (3/3) ... [2022-04-27 12:37:48,019 INFO L111 eAbstractionObserver]: Analyzing ICFG divbin_unwindbound5.i [2022-04-27 12:37:48,029 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 12:37:48,029 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 12:37:48,063 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 12:37:48,068 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@6820d314, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3e0cf0c3 [2022-04-27 12:37:48,068 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 12:37:48,087 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 12:37:48,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 12:37:48,093 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:37:48,093 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:37:48,093 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:37:48,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:37:48,097 INFO L85 PathProgramCache]: Analyzing trace with hash 878397729, now seen corresponding path program 1 times [2022-04-27 12:37:48,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:37:48,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898285830] [2022-04-27 12:37:48,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:37:48,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:37:48,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:37:48,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 12:37:48,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:37:48,244 INFO L290 TraceCheckUtils]: 0: Hoare triple {49#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {36#true} is VALID [2022-04-27 12:37:48,244 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume true; {36#true} is VALID [2022-04-27 12:37:48,244 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36#true} {36#true} #89#return; {36#true} is VALID [2022-04-27 12:37:48,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 12:37:48,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:37:48,251 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-04-27 12:37:48,252 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-04-27 12:37:48,252 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-27 12:37:48,252 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#false} {36#true} #81#return; {37#false} is VALID [2022-04-27 12:37:48,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 12:37:48,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:37:48,259 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-04-27 12:37:48,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-04-27 12:37:48,260 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-27 12:37:48,260 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#false} {37#false} #83#return; {37#false} is VALID [2022-04-27 12:37:48,261 INFO L272 TraceCheckUtils]: 0: Hoare triple {36#true} call ULTIMATE.init(); {49#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 12:37:48,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {49#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {36#true} is VALID [2022-04-27 12:37:48,261 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#true} assume true; {36#true} is VALID [2022-04-27 12:37:48,261 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#true} {36#true} #89#return; {36#true} is VALID [2022-04-27 12:37:48,261 INFO L272 TraceCheckUtils]: 4: Hoare triple {36#true} call #t~ret5 := main(); {36#true} is VALID [2022-04-27 12:37:48,262 INFO L290 TraceCheckUtils]: 5: Hoare triple {36#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {36#true} is VALID [2022-04-27 12:37:48,262 INFO L272 TraceCheckUtils]: 6: Hoare triple {36#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {36#true} is VALID [2022-04-27 12:37:48,262 INFO L290 TraceCheckUtils]: 7: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-04-27 12:37:48,262 INFO L290 TraceCheckUtils]: 8: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-04-27 12:37:48,262 INFO L290 TraceCheckUtils]: 9: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-27 12:37:48,263 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {37#false} {36#true} #81#return; {37#false} is VALID [2022-04-27 12:37:48,263 INFO L272 TraceCheckUtils]: 11: Hoare triple {37#false} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {36#true} is VALID [2022-04-27 12:37:48,263 INFO L290 TraceCheckUtils]: 12: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-04-27 12:37:48,263 INFO L290 TraceCheckUtils]: 13: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-04-27 12:37:48,263 INFO L290 TraceCheckUtils]: 14: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-27 12:37:48,264 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {37#false} {37#false} #83#return; {37#false} is VALID [2022-04-27 12:37:48,264 INFO L290 TraceCheckUtils]: 16: Hoare triple {37#false} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {37#false} is VALID [2022-04-27 12:37:48,264 INFO L290 TraceCheckUtils]: 17: Hoare triple {37#false} assume !true; {37#false} is VALID [2022-04-27 12:37:48,264 INFO L290 TraceCheckUtils]: 18: Hoare triple {37#false} assume !true; {37#false} is VALID [2022-04-27 12:37:48,264 INFO L272 TraceCheckUtils]: 19: Hoare triple {37#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {37#false} is VALID [2022-04-27 12:37:48,265 INFO L290 TraceCheckUtils]: 20: Hoare triple {37#false} ~cond := #in~cond; {37#false} is VALID [2022-04-27 12:37:48,265 INFO L290 TraceCheckUtils]: 21: Hoare triple {37#false} assume 0 == ~cond; {37#false} is VALID [2022-04-27 12:37:48,265 INFO L290 TraceCheckUtils]: 22: Hoare triple {37#false} assume !false; {37#false} is VALID [2022-04-27 12:37:48,265 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 12:37:48,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:37:48,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898285830] [2022-04-27 12:37:48,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898285830] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:37:48,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:37:48,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 12:37:48,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698673894] [2022-04-27 12:37:48,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:37:48,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-27 12:37:48,273 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:37:48,275 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:37:48,295 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:37:48,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 12:37:48,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:37:48,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 12:37:48,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:37:48,313 INFO L87 Difference]: Start difference. First operand has 33 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:37:48,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:37:48,411 INFO L93 Difference]: Finished difference Result 60 states and 84 transitions. [2022-04-27 12:37:48,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 12:37:48,412 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-27 12:37:48,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:37:48,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:37:48,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2022-04-27 12:37:48,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:37:48,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2022-04-27 12:37:48,421 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 84 transitions. [2022-04-27 12:37:48,490 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:37:48,496 INFO L225 Difference]: With dead ends: 60 [2022-04-27 12:37:48,497 INFO L226 Difference]: Without dead ends: 29 [2022-04-27 12:37:48,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:37:48,501 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:37:48,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 40 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:37:48,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-27 12:37:48,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2022-04-27 12:37:48,522 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:37:48,523 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 12:37:48,523 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 12:37:48,524 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 12:37:48,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:37:48,526 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-27 12:37:48,526 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-27 12:37:48,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:37:48,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:37:48,527 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 29 states. [2022-04-27 12:37:48,527 INFO L87 Difference]: Start difference. First operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 29 states. [2022-04-27 12:37:48,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:37:48,530 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-27 12:37:48,530 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-27 12:37:48,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:37:48,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:37:48,530 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:37:48,530 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:37:48,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 12:37:48,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2022-04-27 12:37:48,533 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 23 [2022-04-27 12:37:48,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:37:48,533 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-04-27 12:37:48,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:37:48,534 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-04-27 12:37:48,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-27 12:37:48,534 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:37:48,535 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:37:48,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 12:37:48,535 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:37:48,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:37:48,536 INFO L85 PathProgramCache]: Analyzing trace with hash 994169231, now seen corresponding path program 1 times [2022-04-27 12:37:48,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:37:48,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566786527] [2022-04-27 12:37:48,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:37:48,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:37:48,552 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:37:48,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1828586703] [2022-04-27 12:37:48,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:37:48,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:37:48,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:37:48,555 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:37:48,589 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:37:48,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:37:48,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 12:37:48,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:37:48,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:37:48,832 INFO L272 TraceCheckUtils]: 0: Hoare triple {227#true} call ULTIMATE.init(); {227#true} is VALID [2022-04-27 12:37:48,833 INFO L290 TraceCheckUtils]: 1: Hoare triple {227#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:37:48,833 INFO L290 TraceCheckUtils]: 2: Hoare triple {235#(<= ~counter~0 0)} assume true; {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:37:48,834 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {235#(<= ~counter~0 0)} {227#true} #89#return; {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:37:48,834 INFO L272 TraceCheckUtils]: 4: Hoare triple {235#(<= ~counter~0 0)} call #t~ret5 := main(); {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:37:48,835 INFO L290 TraceCheckUtils]: 5: Hoare triple {235#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:37:48,835 INFO L272 TraceCheckUtils]: 6: Hoare triple {235#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:37:48,836 INFO L290 TraceCheckUtils]: 7: Hoare triple {235#(<= ~counter~0 0)} ~cond := #in~cond; {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:37:48,836 INFO L290 TraceCheckUtils]: 8: Hoare triple {235#(<= ~counter~0 0)} assume !(0 == ~cond); {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:37:48,836 INFO L290 TraceCheckUtils]: 9: Hoare triple {235#(<= ~counter~0 0)} assume true; {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:37:48,837 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {235#(<= ~counter~0 0)} {235#(<= ~counter~0 0)} #81#return; {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:37:48,837 INFO L272 TraceCheckUtils]: 11: Hoare triple {235#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:37:48,838 INFO L290 TraceCheckUtils]: 12: Hoare triple {235#(<= ~counter~0 0)} ~cond := #in~cond; {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:37:48,838 INFO L290 TraceCheckUtils]: 13: Hoare triple {235#(<= ~counter~0 0)} assume !(0 == ~cond); {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:37:48,838 INFO L290 TraceCheckUtils]: 14: Hoare triple {235#(<= ~counter~0 0)} assume true; {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:37:48,839 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {235#(<= ~counter~0 0)} {235#(<= ~counter~0 0)} #83#return; {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:37:48,839 INFO L290 TraceCheckUtils]: 16: Hoare triple {235#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:37:48,840 INFO L290 TraceCheckUtils]: 17: Hoare triple {235#(<= ~counter~0 0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {284#(<= |main_#t~post3| 0)} is VALID [2022-04-27 12:37:48,840 INFO L290 TraceCheckUtils]: 18: Hoare triple {284#(<= |main_#t~post3| 0)} assume !(#t~post3 < 5);havoc #t~post3; {228#false} is VALID [2022-04-27 12:37:48,840 INFO L290 TraceCheckUtils]: 19: Hoare triple {228#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {228#false} is VALID [2022-04-27 12:37:48,841 INFO L290 TraceCheckUtils]: 20: Hoare triple {228#false} assume !(#t~post4 < 5);havoc #t~post4; {228#false} is VALID [2022-04-27 12:37:48,841 INFO L272 TraceCheckUtils]: 21: Hoare triple {228#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {228#false} is VALID [2022-04-27 12:37:48,841 INFO L290 TraceCheckUtils]: 22: Hoare triple {228#false} ~cond := #in~cond; {228#false} is VALID [2022-04-27 12:37:48,841 INFO L290 TraceCheckUtils]: 23: Hoare triple {228#false} assume 0 == ~cond; {228#false} is VALID [2022-04-27 12:37:48,841 INFO L290 TraceCheckUtils]: 24: Hoare triple {228#false} assume !false; {228#false} is VALID [2022-04-27 12:37:48,841 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 12:37:48,841 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:37:48,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:37:48,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566786527] [2022-04-27 12:37:48,842 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:37:48,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828586703] [2022-04-27 12:37:48,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828586703] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:37:48,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:37:48,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 12:37:48,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230697874] [2022-04-27 12:37:48,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:37:48,860 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-04-27 12:37:48,861 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:37:48,861 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:37:48,876 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:37:48,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 12:37:48,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:37:48,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 12:37:48,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 12:37:48,877 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:37:48,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:37:48,927 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2022-04-27 12:37:48,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 12:37:48,927 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-04-27 12:37:48,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:37:48,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:37:48,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-04-27 12:37:48,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:37:48,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-04-27 12:37:48,931 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 52 transitions. [2022-04-27 12:37:48,965 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:37:48,966 INFO L225 Difference]: With dead ends: 42 [2022-04-27 12:37:48,966 INFO L226 Difference]: Without dead ends: 30 [2022-04-27 12:37:48,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 12:37:48,967 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:37:48,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:37:48,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-27 12:37:48,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-27 12:37:48,974 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:37:48,974 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 12:37:48,974 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 12:37:48,975 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 12:37:48,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:37:48,976 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-04-27 12:37:48,976 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-27 12:37:48,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:37:48,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:37:48,977 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 30 states. [2022-04-27 12:37:48,977 INFO L87 Difference]: Start difference. First operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 30 states. [2022-04-27 12:37:48,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:37:48,978 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-04-27 12:37:48,979 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-27 12:37:48,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:37:48,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:37:48,979 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:37:48,979 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:37:48,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 12:37:48,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-04-27 12:37:48,980 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 25 [2022-04-27 12:37:48,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:37:48,981 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-04-27 12:37:48,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:37:48,981 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-27 12:37:48,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 12:37:48,981 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:37:48,981 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:37:49,003 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:37:49,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:37:49,199 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:37:49,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:37:49,199 INFO L85 PathProgramCache]: Analyzing trace with hash 422434646, now seen corresponding path program 1 times [2022-04-27 12:37:49,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:37:49,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534374227] [2022-04-27 12:37:49,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:37:49,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:37:49,216 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:37:49,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1363283780] [2022-04-27 12:37:49,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:37:49,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:37:49,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:37:49,218 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:37:49,219 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:37:49,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:37:49,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 12:37:49,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:37:49,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:37:49,419 INFO L272 TraceCheckUtils]: 0: Hoare triple {464#true} call ULTIMATE.init(); {464#true} is VALID [2022-04-27 12:37:49,420 INFO L290 TraceCheckUtils]: 1: Hoare triple {464#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {472#(<= ~counter~0 0)} is VALID [2022-04-27 12:37:49,420 INFO L290 TraceCheckUtils]: 2: Hoare triple {472#(<= ~counter~0 0)} assume true; {472#(<= ~counter~0 0)} is VALID [2022-04-27 12:37:49,421 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {472#(<= ~counter~0 0)} {464#true} #89#return; {472#(<= ~counter~0 0)} is VALID [2022-04-27 12:37:49,421 INFO L272 TraceCheckUtils]: 4: Hoare triple {472#(<= ~counter~0 0)} call #t~ret5 := main(); {472#(<= ~counter~0 0)} is VALID [2022-04-27 12:37:49,421 INFO L290 TraceCheckUtils]: 5: Hoare triple {472#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {472#(<= ~counter~0 0)} is VALID [2022-04-27 12:37:49,422 INFO L272 TraceCheckUtils]: 6: Hoare triple {472#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {472#(<= ~counter~0 0)} is VALID [2022-04-27 12:37:49,422 INFO L290 TraceCheckUtils]: 7: Hoare triple {472#(<= ~counter~0 0)} ~cond := #in~cond; {472#(<= ~counter~0 0)} is VALID [2022-04-27 12:37:49,422 INFO L290 TraceCheckUtils]: 8: Hoare triple {472#(<= ~counter~0 0)} assume !(0 == ~cond); {472#(<= ~counter~0 0)} is VALID [2022-04-27 12:37:49,423 INFO L290 TraceCheckUtils]: 9: Hoare triple {472#(<= ~counter~0 0)} assume true; {472#(<= ~counter~0 0)} is VALID [2022-04-27 12:37:49,423 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {472#(<= ~counter~0 0)} {472#(<= ~counter~0 0)} #81#return; {472#(<= ~counter~0 0)} is VALID [2022-04-27 12:37:49,424 INFO L272 TraceCheckUtils]: 11: Hoare triple {472#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {472#(<= ~counter~0 0)} is VALID [2022-04-27 12:37:49,424 INFO L290 TraceCheckUtils]: 12: Hoare triple {472#(<= ~counter~0 0)} ~cond := #in~cond; {472#(<= ~counter~0 0)} is VALID [2022-04-27 12:37:49,424 INFO L290 TraceCheckUtils]: 13: Hoare triple {472#(<= ~counter~0 0)} assume !(0 == ~cond); {472#(<= ~counter~0 0)} is VALID [2022-04-27 12:37:49,425 INFO L290 TraceCheckUtils]: 14: Hoare triple {472#(<= ~counter~0 0)} assume true; {472#(<= ~counter~0 0)} is VALID [2022-04-27 12:37:49,425 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {472#(<= ~counter~0 0)} {472#(<= ~counter~0 0)} #83#return; {472#(<= ~counter~0 0)} is VALID [2022-04-27 12:37:49,426 INFO L290 TraceCheckUtils]: 16: Hoare triple {472#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {472#(<= ~counter~0 0)} is VALID [2022-04-27 12:37:49,426 INFO L290 TraceCheckUtils]: 17: Hoare triple {472#(<= ~counter~0 0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {521#(<= ~counter~0 1)} is VALID [2022-04-27 12:37:49,427 INFO L290 TraceCheckUtils]: 18: Hoare triple {521#(<= ~counter~0 1)} assume !!(#t~post3 < 5);havoc #t~post3; {521#(<= ~counter~0 1)} is VALID [2022-04-27 12:37:49,427 INFO L290 TraceCheckUtils]: 19: Hoare triple {521#(<= ~counter~0 1)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {521#(<= ~counter~0 1)} is VALID [2022-04-27 12:37:49,427 INFO L290 TraceCheckUtils]: 20: Hoare triple {521#(<= ~counter~0 1)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {531#(<= |main_#t~post4| 1)} is VALID [2022-04-27 12:37:49,428 INFO L290 TraceCheckUtils]: 21: Hoare triple {531#(<= |main_#t~post4| 1)} assume !(#t~post4 < 5);havoc #t~post4; {465#false} is VALID [2022-04-27 12:37:49,428 INFO L272 TraceCheckUtils]: 22: Hoare triple {465#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {465#false} is VALID [2022-04-27 12:37:49,428 INFO L290 TraceCheckUtils]: 23: Hoare triple {465#false} ~cond := #in~cond; {465#false} is VALID [2022-04-27 12:37:49,428 INFO L290 TraceCheckUtils]: 24: Hoare triple {465#false} assume 0 == ~cond; {465#false} is VALID [2022-04-27 12:37:49,428 INFO L290 TraceCheckUtils]: 25: Hoare triple {465#false} assume !false; {465#false} is VALID [2022-04-27 12:37:49,428 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 12:37:49,428 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:37:49,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:37:49,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534374227] [2022-04-27 12:37:49,429 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:37:49,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363283780] [2022-04-27 12:37:49,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363283780] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:37:49,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:37:49,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 12:37:49,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371673334] [2022-04-27 12:37:49,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:37:49,430 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-04-27 12:37:49,430 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:37:49,430 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:37:49,446 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:37:49,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:37:49,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:37:49,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:37:49,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:37:49,447 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:37:51,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:37:51,613 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-27 12:37:51,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:37:51,613 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-04-27 12:37:51,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:37:51,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:37:51,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-04-27 12:37:51,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:37:51,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-04-27 12:37:51,616 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 48 transitions. [2022-04-27 12:37:51,656 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:37:51,657 INFO L225 Difference]: With dead ends: 41 [2022-04-27 12:37:51,657 INFO L226 Difference]: Without dead ends: 34 [2022-04-27 12:37:51,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:37:51,659 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 7 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:37:51,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 97 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:37:51,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-27 12:37:51,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2022-04-27 12:37:51,665 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:37:51,666 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 12:37:51,666 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 12:37:51,666 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 12:37:51,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:37:51,667 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2022-04-27 12:37:51,668 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-04-27 12:37:51,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:37:51,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:37:51,668 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-27 12:37:51,668 INFO L87 Difference]: Start difference. First operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-27 12:37:51,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:37:51,670 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2022-04-27 12:37:51,670 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-04-27 12:37:51,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:37:51,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:37:51,670 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:37:51,670 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:37:51,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 12:37:51,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2022-04-27 12:37:51,672 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 26 [2022-04-27 12:37:51,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:37:51,672 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2022-04-27 12:37:51,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:37:51,673 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2022-04-27 12:37:51,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 12:37:51,674 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:37:51,674 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:37:51,704 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:37:51,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-27 12:37:51,890 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:37:51,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:37:51,891 INFO L85 PathProgramCache]: Analyzing trace with hash 424222106, now seen corresponding path program 1 times [2022-04-27 12:37:51,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:37:51,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427234952] [2022-04-27 12:37:51,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:37:51,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:37:51,906 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:37:51,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1451469236] [2022-04-27 12:37:51,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:37:51,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:37:51,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:37:51,923 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:37:51,940 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:37:51,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:37:51,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-27 12:37:51,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:37:51,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:37:52,796 INFO L272 TraceCheckUtils]: 0: Hoare triple {715#true} call ULTIMATE.init(); {715#true} is VALID [2022-04-27 12:37:52,797 INFO L290 TraceCheckUtils]: 1: Hoare triple {715#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {715#true} is VALID [2022-04-27 12:37:52,797 INFO L290 TraceCheckUtils]: 2: Hoare triple {715#true} assume true; {715#true} is VALID [2022-04-27 12:37:52,797 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {715#true} {715#true} #89#return; {715#true} is VALID [2022-04-27 12:37:52,797 INFO L272 TraceCheckUtils]: 4: Hoare triple {715#true} call #t~ret5 := main(); {715#true} is VALID [2022-04-27 12:37:52,797 INFO L290 TraceCheckUtils]: 5: Hoare triple {715#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {715#true} is VALID [2022-04-27 12:37:52,797 INFO L272 TraceCheckUtils]: 6: Hoare triple {715#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {715#true} is VALID [2022-04-27 12:37:52,799 INFO L290 TraceCheckUtils]: 7: Hoare triple {715#true} ~cond := #in~cond; {741#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 12:37:52,799 INFO L290 TraceCheckUtils]: 8: Hoare triple {741#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {745#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:37:52,799 INFO L290 TraceCheckUtils]: 9: Hoare triple {745#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {745#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:37:52,800 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {745#(not (= |assume_abort_if_not_#in~cond| 0))} {715#true} #81#return; {752#(< (mod main_~B~0 4294967296) 2147483647)} is VALID [2022-04-27 12:37:52,800 INFO L272 TraceCheckUtils]: 11: Hoare triple {752#(< (mod main_~B~0 4294967296) 2147483647)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {715#true} is VALID [2022-04-27 12:37:52,800 INFO L290 TraceCheckUtils]: 12: Hoare triple {715#true} ~cond := #in~cond; {715#true} is VALID [2022-04-27 12:37:52,800 INFO L290 TraceCheckUtils]: 13: Hoare triple {715#true} assume !(0 == ~cond); {715#true} is VALID [2022-04-27 12:37:52,800 INFO L290 TraceCheckUtils]: 14: Hoare triple {715#true} assume true; {715#true} is VALID [2022-04-27 12:37:52,802 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {715#true} {752#(< (mod main_~B~0 4294967296) 2147483647)} #83#return; {752#(< (mod main_~B~0 4294967296) 2147483647)} is VALID [2022-04-27 12:37:52,802 INFO L290 TraceCheckUtils]: 16: Hoare triple {752#(< (mod main_~B~0 4294967296) 2147483647)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {771#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (< (mod main_~b~0 4294967296) 2147483647))} is VALID [2022-04-27 12:37:52,803 INFO L290 TraceCheckUtils]: 17: Hoare triple {771#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (< (mod main_~b~0 4294967296) 2147483647))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {771#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (< (mod main_~b~0 4294967296) 2147483647))} is VALID [2022-04-27 12:37:52,805 INFO L290 TraceCheckUtils]: 18: Hoare triple {771#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (< (mod main_~b~0 4294967296) 2147483647))} assume !!(#t~post3 < 5);havoc #t~post3; {771#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (< (mod main_~b~0 4294967296) 2147483647))} is VALID [2022-04-27 12:37:52,805 INFO L290 TraceCheckUtils]: 19: Hoare triple {771#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (< (mod main_~b~0 4294967296) 2147483647))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {781#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0) (< (mod main_~b~0 4294967296) 2147483647))} is VALID [2022-04-27 12:37:52,806 INFO L290 TraceCheckUtils]: 20: Hoare triple {781#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0) (< (mod main_~b~0 4294967296) 2147483647))} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {781#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0) (< (mod main_~b~0 4294967296) 2147483647))} is VALID [2022-04-27 12:37:52,806 INFO L290 TraceCheckUtils]: 21: Hoare triple {781#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0) (< (mod main_~b~0 4294967296) 2147483647))} assume !!(#t~post4 < 5);havoc #t~post4; {781#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0) (< (mod main_~b~0 4294967296) 2147483647))} is VALID [2022-04-27 12:37:52,807 INFO L272 TraceCheckUtils]: 22: Hoare triple {781#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0) (< (mod main_~b~0 4294967296) 2147483647))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {791#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:37:52,808 INFO L290 TraceCheckUtils]: 23: Hoare triple {791#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {795#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:37:52,808 INFO L290 TraceCheckUtils]: 24: Hoare triple {795#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {716#false} is VALID [2022-04-27 12:37:52,808 INFO L290 TraceCheckUtils]: 25: Hoare triple {716#false} assume !false; {716#false} is VALID [2022-04-27 12:37:52,809 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 12:37:52,809 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:37:53,219 INFO L290 TraceCheckUtils]: 25: Hoare triple {716#false} assume !false; {716#false} is VALID [2022-04-27 12:37:53,220 INFO L290 TraceCheckUtils]: 24: Hoare triple {795#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {716#false} is VALID [2022-04-27 12:37:53,220 INFO L290 TraceCheckUtils]: 23: Hoare triple {791#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {795#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:37:53,221 INFO L272 TraceCheckUtils]: 22: Hoare triple {811#(= (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)); {791#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:37:53,222 INFO L290 TraceCheckUtils]: 21: Hoare triple {811#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} assume !!(#t~post4 < 5);havoc #t~post4; {811#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 12:37:53,223 INFO L290 TraceCheckUtils]: 20: Hoare triple {811#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {811#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 12:37:53,227 INFO L290 TraceCheckUtils]: 19: Hoare triple {821#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {811#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 12:37:53,228 INFO L290 TraceCheckUtils]: 18: Hoare triple {821#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} assume !!(#t~post3 < 5);havoc #t~post3; {821#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-27 12:37:53,228 INFO L290 TraceCheckUtils]: 17: Hoare triple {821#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {821#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-27 12:37:53,229 INFO L290 TraceCheckUtils]: 16: Hoare triple {715#true} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {821#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-27 12:37:53,229 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {715#true} {715#true} #83#return; {715#true} is VALID [2022-04-27 12:37:53,229 INFO L290 TraceCheckUtils]: 14: Hoare triple {715#true} assume true; {715#true} is VALID [2022-04-27 12:37:53,229 INFO L290 TraceCheckUtils]: 13: Hoare triple {715#true} assume !(0 == ~cond); {715#true} is VALID [2022-04-27 12:37:53,229 INFO L290 TraceCheckUtils]: 12: Hoare triple {715#true} ~cond := #in~cond; {715#true} is VALID [2022-04-27 12:37:53,229 INFO L272 TraceCheckUtils]: 11: Hoare triple {715#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {715#true} is VALID [2022-04-27 12:37:53,229 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {715#true} {715#true} #81#return; {715#true} is VALID [2022-04-27 12:37:53,230 INFO L290 TraceCheckUtils]: 9: Hoare triple {715#true} assume true; {715#true} is VALID [2022-04-27 12:37:53,230 INFO L290 TraceCheckUtils]: 8: Hoare triple {715#true} assume !(0 == ~cond); {715#true} is VALID [2022-04-27 12:37:53,230 INFO L290 TraceCheckUtils]: 7: Hoare triple {715#true} ~cond := #in~cond; {715#true} is VALID [2022-04-27 12:37:53,230 INFO L272 TraceCheckUtils]: 6: Hoare triple {715#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {715#true} is VALID [2022-04-27 12:37:53,230 INFO L290 TraceCheckUtils]: 5: Hoare triple {715#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {715#true} is VALID [2022-04-27 12:37:53,230 INFO L272 TraceCheckUtils]: 4: Hoare triple {715#true} call #t~ret5 := main(); {715#true} is VALID [2022-04-27 12:37:53,230 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {715#true} {715#true} #89#return; {715#true} is VALID [2022-04-27 12:37:53,230 INFO L290 TraceCheckUtils]: 2: Hoare triple {715#true} assume true; {715#true} is VALID [2022-04-27 12:37:53,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {715#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {715#true} is VALID [2022-04-27 12:37:53,230 INFO L272 TraceCheckUtils]: 0: Hoare triple {715#true} call ULTIMATE.init(); {715#true} is VALID [2022-04-27 12:37:53,231 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 12:37:53,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:37:53,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427234952] [2022-04-27 12:37:53,231 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:37:53,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1451469236] [2022-04-27 12:37:53,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1451469236] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 12:37:53,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:37:53,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2022-04-27 12:37:53,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294992510] [2022-04-27 12:37:53,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:37:53,232 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-04-27 12:37:53,232 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:37:53,232 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:37:53,250 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:37:53,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 12:37:53,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:37:53,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 12:37:53,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-27 12:37:53,251 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:37:56,325 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:37:58,424 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:38:00,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:38:00,638 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2022-04-27 12:38:00,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:38:00,638 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-04-27 12:38:00,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:38:00,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:38:00,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-27 12:38:00,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:38:00,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-27 12:38:00,644 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 50 transitions. [2022-04-27 12:38:00,683 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:38:00,684 INFO L225 Difference]: With dead ends: 42 [2022-04-27 12:38:00,684 INFO L226 Difference]: Without dead ends: 39 [2022-04-27 12:38:00,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-04-27 12:38:00,685 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 11 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-04-27 12:38:00,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 126 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 2 Unknown, 0 Unchecked, 4.4s Time] [2022-04-27 12:38:00,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-27 12:38:00,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-27 12:38:00,692 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:38:00,692 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 12:38:00,693 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 12:38:00,693 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 12:38:00,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:38:00,694 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2022-04-27 12:38:00,694 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-04-27 12:38:00,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:38:00,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:38:00,695 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 39 states. [2022-04-27 12:38:00,695 INFO L87 Difference]: Start difference. First operand has 39 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 39 states. [2022-04-27 12:38:00,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:38:00,696 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2022-04-27 12:38:00,696 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-04-27 12:38:00,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:38:00,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:38:00,697 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:38:00,697 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:38:00,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 12:38:00,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2022-04-27 12:38:00,698 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 26 [2022-04-27 12:38:00,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:38:00,699 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2022-04-27 12:38:00,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:38:00,699 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-04-27 12:38:00,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 12:38:00,700 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:38:00,700 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:38:00,717 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:38:00,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:38:00,911 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:38:00,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:38:00,912 INFO L85 PathProgramCache]: Analyzing trace with hash -193375877, now seen corresponding path program 1 times [2022-04-27 12:38:00,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:38:00,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468321799] [2022-04-27 12:38:00,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:38:00,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:38:00,927 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:38:00,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2067483495] [2022-04-27 12:38:00,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:38:00,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:38:00,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:38:00,928 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:38:00,929 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:38:00,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:38:00,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 12:38:00,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:38:00,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:38:01,117 INFO L272 TraceCheckUtils]: 0: Hoare triple {1071#true} call ULTIMATE.init(); {1071#true} is VALID [2022-04-27 12:38:01,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {1071#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:38:01,118 INFO L290 TraceCheckUtils]: 2: Hoare triple {1079#(<= ~counter~0 0)} assume true; {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:38:01,118 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1079#(<= ~counter~0 0)} {1071#true} #89#return; {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:38:01,118 INFO L272 TraceCheckUtils]: 4: Hoare triple {1079#(<= ~counter~0 0)} call #t~ret5 := main(); {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:38:01,119 INFO L290 TraceCheckUtils]: 5: Hoare triple {1079#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:38:01,119 INFO L272 TraceCheckUtils]: 6: Hoare triple {1079#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:38:01,120 INFO L290 TraceCheckUtils]: 7: Hoare triple {1079#(<= ~counter~0 0)} ~cond := #in~cond; {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:38:01,121 INFO L290 TraceCheckUtils]: 8: Hoare triple {1079#(<= ~counter~0 0)} assume !(0 == ~cond); {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:38:01,121 INFO L290 TraceCheckUtils]: 9: Hoare triple {1079#(<= ~counter~0 0)} assume true; {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:38:01,122 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1079#(<= ~counter~0 0)} {1079#(<= ~counter~0 0)} #81#return; {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:38:01,122 INFO L272 TraceCheckUtils]: 11: Hoare triple {1079#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:38:01,125 INFO L290 TraceCheckUtils]: 12: Hoare triple {1079#(<= ~counter~0 0)} ~cond := #in~cond; {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:38:01,126 INFO L290 TraceCheckUtils]: 13: Hoare triple {1079#(<= ~counter~0 0)} assume !(0 == ~cond); {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:38:01,126 INFO L290 TraceCheckUtils]: 14: Hoare triple {1079#(<= ~counter~0 0)} assume true; {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:38:01,127 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1079#(<= ~counter~0 0)} {1079#(<= ~counter~0 0)} #83#return; {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:38:01,128 INFO L290 TraceCheckUtils]: 16: Hoare triple {1079#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:38:01,129 INFO L290 TraceCheckUtils]: 17: Hoare triple {1079#(<= ~counter~0 0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1128#(<= ~counter~0 1)} is VALID [2022-04-27 12:38:01,129 INFO L290 TraceCheckUtils]: 18: Hoare triple {1128#(<= ~counter~0 1)} assume !!(#t~post3 < 5);havoc #t~post3; {1128#(<= ~counter~0 1)} is VALID [2022-04-27 12:38:01,130 INFO L290 TraceCheckUtils]: 19: Hoare triple {1128#(<= ~counter~0 1)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1128#(<= ~counter~0 1)} is VALID [2022-04-27 12:38:01,130 INFO L290 TraceCheckUtils]: 20: Hoare triple {1128#(<= ~counter~0 1)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1138#(<= |main_#t~post3| 1)} is VALID [2022-04-27 12:38:01,130 INFO L290 TraceCheckUtils]: 21: Hoare triple {1138#(<= |main_#t~post3| 1)} assume !(#t~post3 < 5);havoc #t~post3; {1072#false} is VALID [2022-04-27 12:38:01,130 INFO L290 TraceCheckUtils]: 22: Hoare triple {1072#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {1072#false} is VALID [2022-04-27 12:38:01,130 INFO L290 TraceCheckUtils]: 23: Hoare triple {1072#false} assume !(#t~post4 < 5);havoc #t~post4; {1072#false} is VALID [2022-04-27 12:38:01,131 INFO L272 TraceCheckUtils]: 24: Hoare triple {1072#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1072#false} is VALID [2022-04-27 12:38:01,131 INFO L290 TraceCheckUtils]: 25: Hoare triple {1072#false} ~cond := #in~cond; {1072#false} is VALID [2022-04-27 12:38:01,131 INFO L290 TraceCheckUtils]: 26: Hoare triple {1072#false} assume 0 == ~cond; {1072#false} is VALID [2022-04-27 12:38:01,131 INFO L290 TraceCheckUtils]: 27: Hoare triple {1072#false} assume !false; {1072#false} is VALID [2022-04-27 12:38:01,131 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 12:38:01,131 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:38:01,356 INFO L290 TraceCheckUtils]: 27: Hoare triple {1072#false} assume !false; {1072#false} is VALID [2022-04-27 12:38:01,356 INFO L290 TraceCheckUtils]: 26: Hoare triple {1072#false} assume 0 == ~cond; {1072#false} is VALID [2022-04-27 12:38:01,356 INFO L290 TraceCheckUtils]: 25: Hoare triple {1072#false} ~cond := #in~cond; {1072#false} is VALID [2022-04-27 12:38:01,356 INFO L272 TraceCheckUtils]: 24: Hoare triple {1072#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1072#false} is VALID [2022-04-27 12:38:01,356 INFO L290 TraceCheckUtils]: 23: Hoare triple {1072#false} assume !(#t~post4 < 5);havoc #t~post4; {1072#false} is VALID [2022-04-27 12:38:01,357 INFO L290 TraceCheckUtils]: 22: Hoare triple {1072#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {1072#false} is VALID [2022-04-27 12:38:01,357 INFO L290 TraceCheckUtils]: 21: Hoare triple {1178#(< |main_#t~post3| 5)} assume !(#t~post3 < 5);havoc #t~post3; {1072#false} is VALID [2022-04-27 12:38:01,357 INFO L290 TraceCheckUtils]: 20: Hoare triple {1182#(< ~counter~0 5)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1178#(< |main_#t~post3| 5)} is VALID [2022-04-27 12:38:01,358 INFO L290 TraceCheckUtils]: 19: Hoare triple {1182#(< ~counter~0 5)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1182#(< ~counter~0 5)} is VALID [2022-04-27 12:38:01,359 INFO L290 TraceCheckUtils]: 18: Hoare triple {1182#(< ~counter~0 5)} assume !!(#t~post3 < 5);havoc #t~post3; {1182#(< ~counter~0 5)} is VALID [2022-04-27 12:38:01,359 INFO L290 TraceCheckUtils]: 17: Hoare triple {1192#(< ~counter~0 4)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1182#(< ~counter~0 5)} is VALID [2022-04-27 12:38:01,360 INFO L290 TraceCheckUtils]: 16: Hoare triple {1192#(< ~counter~0 4)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1192#(< ~counter~0 4)} is VALID [2022-04-27 12:38:01,361 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1071#true} {1192#(< ~counter~0 4)} #83#return; {1192#(< ~counter~0 4)} is VALID [2022-04-27 12:38:01,361 INFO L290 TraceCheckUtils]: 14: Hoare triple {1071#true} assume true; {1071#true} is VALID [2022-04-27 12:38:01,361 INFO L290 TraceCheckUtils]: 13: Hoare triple {1071#true} assume !(0 == ~cond); {1071#true} is VALID [2022-04-27 12:38:01,362 INFO L290 TraceCheckUtils]: 12: Hoare triple {1071#true} ~cond := #in~cond; {1071#true} is VALID [2022-04-27 12:38:01,362 INFO L272 TraceCheckUtils]: 11: Hoare triple {1192#(< ~counter~0 4)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1071#true} is VALID [2022-04-27 12:38:01,362 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1071#true} {1192#(< ~counter~0 4)} #81#return; {1192#(< ~counter~0 4)} is VALID [2022-04-27 12:38:01,363 INFO L290 TraceCheckUtils]: 9: Hoare triple {1071#true} assume true; {1071#true} is VALID [2022-04-27 12:38:01,363 INFO L290 TraceCheckUtils]: 8: Hoare triple {1071#true} assume !(0 == ~cond); {1071#true} is VALID [2022-04-27 12:38:01,363 INFO L290 TraceCheckUtils]: 7: Hoare triple {1071#true} ~cond := #in~cond; {1071#true} is VALID [2022-04-27 12:38:01,363 INFO L272 TraceCheckUtils]: 6: Hoare triple {1192#(< ~counter~0 4)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {1071#true} is VALID [2022-04-27 12:38:01,378 INFO L290 TraceCheckUtils]: 5: Hoare triple {1192#(< ~counter~0 4)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {1192#(< ~counter~0 4)} is VALID [2022-04-27 12:38:01,378 INFO L272 TraceCheckUtils]: 4: Hoare triple {1192#(< ~counter~0 4)} call #t~ret5 := main(); {1192#(< ~counter~0 4)} is VALID [2022-04-27 12:38:01,378 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1192#(< ~counter~0 4)} {1071#true} #89#return; {1192#(< ~counter~0 4)} is VALID [2022-04-27 12:38:01,379 INFO L290 TraceCheckUtils]: 2: Hoare triple {1192#(< ~counter~0 4)} assume true; {1192#(< ~counter~0 4)} is VALID [2022-04-27 12:38:01,379 INFO L290 TraceCheckUtils]: 1: Hoare triple {1071#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {1192#(< ~counter~0 4)} is VALID [2022-04-27 12:38:01,379 INFO L272 TraceCheckUtils]: 0: Hoare triple {1071#true} call ULTIMATE.init(); {1071#true} is VALID [2022-04-27 12:38:01,380 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 12:38:01,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:38:01,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468321799] [2022-04-27 12:38:01,380 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:38:01,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2067483495] [2022-04-27 12:38:01,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2067483495] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:38:01,381 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:38:01,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-27 12:38:01,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134076342] [2022-04-27 12:38:01,382 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:38:01,383 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 28 [2022-04-27 12:38:01,383 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:38:01,383 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 12:38:01,417 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:38:01,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 12:38:01,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:38:01,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 12:38:01,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-27 12:38:01,419 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 12:38:01,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:38:01,669 INFO L93 Difference]: Finished difference Result 73 states and 92 transitions. [2022-04-27 12:38:01,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 12:38:01,669 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 28 [2022-04-27 12:38:01,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:38:01,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 12:38:01,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 92 transitions. [2022-04-27 12:38:01,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 12:38:01,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 92 transitions. [2022-04-27 12:38:01,675 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 92 transitions. [2022-04-27 12:38:01,746 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:38:01,748 INFO L225 Difference]: With dead ends: 73 [2022-04-27 12:38:01,748 INFO L226 Difference]: Without dead ends: 61 [2022-04-27 12:38:01,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-27 12:38:01,749 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 34 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:38:01,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 149 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:38:01,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-27 12:38:01,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 47. [2022-04-27 12:38:01,762 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:38:01,762 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 47 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 36 states have internal predecessors, (44), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 12:38:01,763 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 47 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 36 states have internal predecessors, (44), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 12:38:01,763 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 47 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 36 states have internal predecessors, (44), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 12:38:01,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:38:01,765 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2022-04-27 12:38:01,765 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 74 transitions. [2022-04-27 12:38:01,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:38:01,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:38:01,766 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 36 states have internal predecessors, (44), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 61 states. [2022-04-27 12:38:01,766 INFO L87 Difference]: Start difference. First operand has 47 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 36 states have internal predecessors, (44), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 61 states. [2022-04-27 12:38:01,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:38:01,768 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2022-04-27 12:38:01,768 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 74 transitions. [2022-04-27 12:38:01,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:38:01,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:38:01,768 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:38:01,768 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:38:01,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 36 states have internal predecessors, (44), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 12:38:01,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2022-04-27 12:38:01,770 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 28 [2022-04-27 12:38:01,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:38:01,770 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2022-04-27 12:38:01,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 12:38:01,771 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2022-04-27 12:38:01,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 12:38:01,771 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:38:01,771 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:38:01,789 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:38:01,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:38:01,986 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:38:01,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:38:01,987 INFO L85 PathProgramCache]: Analyzing trace with hash -2031725334, now seen corresponding path program 1 times [2022-04-27 12:38:01,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:38:01,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521841182] [2022-04-27 12:38:01,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:38:01,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:38:02,009 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:38:02,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1430839471] [2022-04-27 12:38:02,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:38:02,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:38:02,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:38:02,021 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:38:02,022 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:38:02,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:38:02,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 12:38:02,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:38:02,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:38:02,260 INFO L272 TraceCheckUtils]: 0: Hoare triple {1534#true} call ULTIMATE.init(); {1534#true} is VALID [2022-04-27 12:38:02,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {1534#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {1542#(<= ~counter~0 0)} is VALID [2022-04-27 12:38:02,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {1542#(<= ~counter~0 0)} assume true; {1542#(<= ~counter~0 0)} is VALID [2022-04-27 12:38:02,262 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1542#(<= ~counter~0 0)} {1534#true} #89#return; {1542#(<= ~counter~0 0)} is VALID [2022-04-27 12:38:02,263 INFO L272 TraceCheckUtils]: 4: Hoare triple {1542#(<= ~counter~0 0)} call #t~ret5 := main(); {1542#(<= ~counter~0 0)} is VALID [2022-04-27 12:38:02,263 INFO L290 TraceCheckUtils]: 5: Hoare triple {1542#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {1542#(<= ~counter~0 0)} is VALID [2022-04-27 12:38:02,264 INFO L272 TraceCheckUtils]: 6: Hoare triple {1542#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {1542#(<= ~counter~0 0)} is VALID [2022-04-27 12:38:02,267 INFO L290 TraceCheckUtils]: 7: Hoare triple {1542#(<= ~counter~0 0)} ~cond := #in~cond; {1542#(<= ~counter~0 0)} is VALID [2022-04-27 12:38:02,267 INFO L290 TraceCheckUtils]: 8: Hoare triple {1542#(<= ~counter~0 0)} assume !(0 == ~cond); {1542#(<= ~counter~0 0)} is VALID [2022-04-27 12:38:02,268 INFO L290 TraceCheckUtils]: 9: Hoare triple {1542#(<= ~counter~0 0)} assume true; {1542#(<= ~counter~0 0)} is VALID [2022-04-27 12:38:02,268 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1542#(<= ~counter~0 0)} {1542#(<= ~counter~0 0)} #81#return; {1542#(<= ~counter~0 0)} is VALID [2022-04-27 12:38:02,269 INFO L272 TraceCheckUtils]: 11: Hoare triple {1542#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1542#(<= ~counter~0 0)} is VALID [2022-04-27 12:38:02,269 INFO L290 TraceCheckUtils]: 12: Hoare triple {1542#(<= ~counter~0 0)} ~cond := #in~cond; {1542#(<= ~counter~0 0)} is VALID [2022-04-27 12:38:02,270 INFO L290 TraceCheckUtils]: 13: Hoare triple {1542#(<= ~counter~0 0)} assume !(0 == ~cond); {1542#(<= ~counter~0 0)} is VALID [2022-04-27 12:38:02,270 INFO L290 TraceCheckUtils]: 14: Hoare triple {1542#(<= ~counter~0 0)} assume true; {1542#(<= ~counter~0 0)} is VALID [2022-04-27 12:38:02,271 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1542#(<= ~counter~0 0)} {1542#(<= ~counter~0 0)} #83#return; {1542#(<= ~counter~0 0)} is VALID [2022-04-27 12:38:02,271 INFO L290 TraceCheckUtils]: 16: Hoare triple {1542#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1542#(<= ~counter~0 0)} is VALID [2022-04-27 12:38:02,272 INFO L290 TraceCheckUtils]: 17: Hoare triple {1542#(<= ~counter~0 0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1591#(<= ~counter~0 1)} is VALID [2022-04-27 12:38:02,272 INFO L290 TraceCheckUtils]: 18: Hoare triple {1591#(<= ~counter~0 1)} assume !!(#t~post3 < 5);havoc #t~post3; {1591#(<= ~counter~0 1)} is VALID [2022-04-27 12:38:02,272 INFO L290 TraceCheckUtils]: 19: Hoare triple {1591#(<= ~counter~0 1)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1591#(<= ~counter~0 1)} is VALID [2022-04-27 12:38:02,273 INFO L290 TraceCheckUtils]: 20: Hoare triple {1591#(<= ~counter~0 1)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1601#(<= ~counter~0 2)} is VALID [2022-04-27 12:38:02,273 INFO L290 TraceCheckUtils]: 21: Hoare triple {1601#(<= ~counter~0 2)} assume !!(#t~post3 < 5);havoc #t~post3; {1601#(<= ~counter~0 2)} is VALID [2022-04-27 12:38:02,274 INFO L290 TraceCheckUtils]: 22: Hoare triple {1601#(<= ~counter~0 2)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1601#(<= ~counter~0 2)} is VALID [2022-04-27 12:38:02,274 INFO L290 TraceCheckUtils]: 23: Hoare triple {1601#(<= ~counter~0 2)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {1611#(<= |main_#t~post4| 2)} is VALID [2022-04-27 12:38:02,275 INFO L290 TraceCheckUtils]: 24: Hoare triple {1611#(<= |main_#t~post4| 2)} assume !(#t~post4 < 5);havoc #t~post4; {1535#false} is VALID [2022-04-27 12:38:02,275 INFO L272 TraceCheckUtils]: 25: Hoare triple {1535#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1535#false} is VALID [2022-04-27 12:38:02,275 INFO L290 TraceCheckUtils]: 26: Hoare triple {1535#false} ~cond := #in~cond; {1535#false} is VALID [2022-04-27 12:38:02,275 INFO L290 TraceCheckUtils]: 27: Hoare triple {1535#false} assume 0 == ~cond; {1535#false} is VALID [2022-04-27 12:38:02,275 INFO L290 TraceCheckUtils]: 28: Hoare triple {1535#false} assume !false; {1535#false} is VALID [2022-04-27 12:38:02,275 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 12:38:02,275 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:38:02,499 INFO L290 TraceCheckUtils]: 28: Hoare triple {1535#false} assume !false; {1535#false} is VALID [2022-04-27 12:38:02,499 INFO L290 TraceCheckUtils]: 27: Hoare triple {1535#false} assume 0 == ~cond; {1535#false} is VALID [2022-04-27 12:38:02,500 INFO L290 TraceCheckUtils]: 26: Hoare triple {1535#false} ~cond := #in~cond; {1535#false} is VALID [2022-04-27 12:38:02,500 INFO L272 TraceCheckUtils]: 25: Hoare triple {1535#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1535#false} is VALID [2022-04-27 12:38:02,500 INFO L290 TraceCheckUtils]: 24: Hoare triple {1639#(< |main_#t~post4| 5)} assume !(#t~post4 < 5);havoc #t~post4; {1535#false} is VALID [2022-04-27 12:38:02,500 INFO L290 TraceCheckUtils]: 23: Hoare triple {1643#(< ~counter~0 5)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {1639#(< |main_#t~post4| 5)} is VALID [2022-04-27 12:38:02,501 INFO L290 TraceCheckUtils]: 22: Hoare triple {1643#(< ~counter~0 5)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1643#(< ~counter~0 5)} is VALID [2022-04-27 12:38:02,501 INFO L290 TraceCheckUtils]: 21: Hoare triple {1643#(< ~counter~0 5)} assume !!(#t~post3 < 5);havoc #t~post3; {1643#(< ~counter~0 5)} is VALID [2022-04-27 12:38:02,502 INFO L290 TraceCheckUtils]: 20: Hoare triple {1653#(< ~counter~0 4)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1643#(< ~counter~0 5)} is VALID [2022-04-27 12:38:02,502 INFO L290 TraceCheckUtils]: 19: Hoare triple {1653#(< ~counter~0 4)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1653#(< ~counter~0 4)} is VALID [2022-04-27 12:38:02,502 INFO L290 TraceCheckUtils]: 18: Hoare triple {1653#(< ~counter~0 4)} assume !!(#t~post3 < 5);havoc #t~post3; {1653#(< ~counter~0 4)} is VALID [2022-04-27 12:38:02,503 INFO L290 TraceCheckUtils]: 17: Hoare triple {1601#(<= ~counter~0 2)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1653#(< ~counter~0 4)} is VALID [2022-04-27 12:38:02,503 INFO L290 TraceCheckUtils]: 16: Hoare triple {1601#(<= ~counter~0 2)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1601#(<= ~counter~0 2)} is VALID [2022-04-27 12:38:02,504 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1534#true} {1601#(<= ~counter~0 2)} #83#return; {1601#(<= ~counter~0 2)} is VALID [2022-04-27 12:38:02,504 INFO L290 TraceCheckUtils]: 14: Hoare triple {1534#true} assume true; {1534#true} is VALID [2022-04-27 12:38:02,504 INFO L290 TraceCheckUtils]: 13: Hoare triple {1534#true} assume !(0 == ~cond); {1534#true} is VALID [2022-04-27 12:38:02,504 INFO L290 TraceCheckUtils]: 12: Hoare triple {1534#true} ~cond := #in~cond; {1534#true} is VALID [2022-04-27 12:38:02,504 INFO L272 TraceCheckUtils]: 11: Hoare triple {1601#(<= ~counter~0 2)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1534#true} is VALID [2022-04-27 12:38:02,504 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1534#true} {1601#(<= ~counter~0 2)} #81#return; {1601#(<= ~counter~0 2)} is VALID [2022-04-27 12:38:02,505 INFO L290 TraceCheckUtils]: 9: Hoare triple {1534#true} assume true; {1534#true} is VALID [2022-04-27 12:38:02,505 INFO L290 TraceCheckUtils]: 8: Hoare triple {1534#true} assume !(0 == ~cond); {1534#true} is VALID [2022-04-27 12:38:02,505 INFO L290 TraceCheckUtils]: 7: Hoare triple {1534#true} ~cond := #in~cond; {1534#true} is VALID [2022-04-27 12:38:02,505 INFO L272 TraceCheckUtils]: 6: Hoare triple {1601#(<= ~counter~0 2)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {1534#true} is VALID [2022-04-27 12:38:02,509 INFO L290 TraceCheckUtils]: 5: Hoare triple {1601#(<= ~counter~0 2)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {1601#(<= ~counter~0 2)} is VALID [2022-04-27 12:38:02,510 INFO L272 TraceCheckUtils]: 4: Hoare triple {1601#(<= ~counter~0 2)} call #t~ret5 := main(); {1601#(<= ~counter~0 2)} is VALID [2022-04-27 12:38:02,510 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1601#(<= ~counter~0 2)} {1534#true} #89#return; {1601#(<= ~counter~0 2)} is VALID [2022-04-27 12:38:02,511 INFO L290 TraceCheckUtils]: 2: Hoare triple {1601#(<= ~counter~0 2)} assume true; {1601#(<= ~counter~0 2)} is VALID [2022-04-27 12:38:02,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {1534#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {1601#(<= ~counter~0 2)} is VALID [2022-04-27 12:38:02,511 INFO L272 TraceCheckUtils]: 0: Hoare triple {1534#true} call ULTIMATE.init(); {1534#true} is VALID [2022-04-27 12:38:02,512 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 12:38:02,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:38:02,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521841182] [2022-04-27 12:38:02,512 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:38:02,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430839471] [2022-04-27 12:38:02,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1430839471] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:38:02,512 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:38:02,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-04-27 12:38:02,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853411487] [2022-04-27 12:38:02,512 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:38:02,513 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 29 [2022-04-27 12:38:02,513 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:38:02,513 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 12:38:02,545 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:38:02,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 12:38:02,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:38:02,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 12:38:02,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-27 12:38:02,546 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 12:38:02,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:38:02,820 INFO L93 Difference]: Finished difference Result 83 states and 100 transitions. [2022-04-27 12:38:02,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 12:38:02,820 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 29 [2022-04-27 12:38:02,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:38:02,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 12:38:02,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 100 transitions. [2022-04-27 12:38:02,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 12:38:02,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 100 transitions. [2022-04-27 12:38:02,824 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 100 transitions. [2022-04-27 12:38:02,896 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:38:02,899 INFO L225 Difference]: With dead ends: 83 [2022-04-27 12:38:02,899 INFO L226 Difference]: Without dead ends: 76 [2022-04-27 12:38:02,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-04-27 12:38:02,900 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 60 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:38:02,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 164 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 12:38:02,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-27 12:38:02,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 71. [2022-04-27 12:38:02,916 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:38:02,916 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 71 states, 53 states have (on average 1.320754716981132) internal successors, (70), 56 states have internal predecessors, (70), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 12:38:02,917 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 71 states, 53 states have (on average 1.320754716981132) internal successors, (70), 56 states have internal predecessors, (70), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 12:38:02,917 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 71 states, 53 states have (on average 1.320754716981132) internal successors, (70), 56 states have internal predecessors, (70), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 12:38:02,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:38:02,919 INFO L93 Difference]: Finished difference Result 76 states and 91 transitions. [2022-04-27 12:38:02,919 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 91 transitions. [2022-04-27 12:38:02,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:38:02,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:38:02,920 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 53 states have (on average 1.320754716981132) internal successors, (70), 56 states have internal predecessors, (70), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 76 states. [2022-04-27 12:38:02,920 INFO L87 Difference]: Start difference. First operand has 71 states, 53 states have (on average 1.320754716981132) internal successors, (70), 56 states have internal predecessors, (70), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 76 states. [2022-04-27 12:38:02,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:38:02,922 INFO L93 Difference]: Finished difference Result 76 states and 91 transitions. [2022-04-27 12:38:02,922 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 91 transitions. [2022-04-27 12:38:02,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:38:02,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:38:02,923 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:38:02,923 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:38:02,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 53 states have (on average 1.320754716981132) internal successors, (70), 56 states have internal predecessors, (70), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 12:38:02,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 88 transitions. [2022-04-27 12:38:02,925 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 88 transitions. Word has length 29 [2022-04-27 12:38:02,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:38:02,925 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 88 transitions. [2022-04-27 12:38:02,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 12:38:02,926 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 88 transitions. [2022-04-27 12:38:02,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 12:38:02,926 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:38:02,926 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:38:02,943 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:38:03,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:38:03,144 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:38:03,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:38:03,144 INFO L85 PathProgramCache]: Analyzing trace with hash -2029937874, now seen corresponding path program 1 times [2022-04-27 12:38:03,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:38:03,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300369196] [2022-04-27 12:38:03,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:38:03,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:38:03,159 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:38:03,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1381930311] [2022-04-27 12:38:03,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:38:03,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:38:03,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:38:03,160 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:38:03,161 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:38:03,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:38:03,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-27 12:38:03,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:38:03,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:38:03,751 INFO L272 TraceCheckUtils]: 0: Hoare triple {2077#true} call ULTIMATE.init(); {2077#true} is VALID [2022-04-27 12:38:03,751 INFO L290 TraceCheckUtils]: 1: Hoare triple {2077#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {2077#true} is VALID [2022-04-27 12:38:03,752 INFO L290 TraceCheckUtils]: 2: Hoare triple {2077#true} assume true; {2077#true} is VALID [2022-04-27 12:38:03,752 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2077#true} {2077#true} #89#return; {2077#true} is VALID [2022-04-27 12:38:03,752 INFO L272 TraceCheckUtils]: 4: Hoare triple {2077#true} call #t~ret5 := main(); {2077#true} is VALID [2022-04-27 12:38:03,752 INFO L290 TraceCheckUtils]: 5: Hoare triple {2077#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {2077#true} is VALID [2022-04-27 12:38:03,752 INFO L272 TraceCheckUtils]: 6: Hoare triple {2077#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {2077#true} is VALID [2022-04-27 12:38:03,752 INFO L290 TraceCheckUtils]: 7: Hoare triple {2077#true} ~cond := #in~cond; {2077#true} is VALID [2022-04-27 12:38:03,752 INFO L290 TraceCheckUtils]: 8: Hoare triple {2077#true} assume !(0 == ~cond); {2077#true} is VALID [2022-04-27 12:38:03,752 INFO L290 TraceCheckUtils]: 9: Hoare triple {2077#true} assume true; {2077#true} is VALID [2022-04-27 12:38:03,752 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2077#true} {2077#true} #81#return; {2077#true} is VALID [2022-04-27 12:38:03,752 INFO L272 TraceCheckUtils]: 11: Hoare triple {2077#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2077#true} is VALID [2022-04-27 12:38:03,753 INFO L290 TraceCheckUtils]: 12: Hoare triple {2077#true} ~cond := #in~cond; {2118#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 12:38:03,753 INFO L290 TraceCheckUtils]: 13: Hoare triple {2118#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2122#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:38:03,754 INFO L290 TraceCheckUtils]: 14: Hoare triple {2122#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2122#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:38:03,755 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2122#(not (= |assume_abort_if_not_#in~cond| 0))} {2077#true} #83#return; {2129#(<= 1 (mod main_~B~0 4294967296))} is VALID [2022-04-27 12:38:03,755 INFO L290 TraceCheckUtils]: 16: Hoare triple {2129#(<= 1 (mod main_~B~0 4294967296))} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {2133#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~b~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 12:38:03,756 INFO L290 TraceCheckUtils]: 17: Hoare triple {2133#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~b~0 4294967296)) (= main_~q~0 0))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2133#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~b~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 12:38:03,756 INFO L290 TraceCheckUtils]: 18: Hoare triple {2133#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~b~0 4294967296)) (= main_~q~0 0))} assume !!(#t~post3 < 5);havoc #t~post3; {2133#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~b~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 12:38:03,757 INFO L290 TraceCheckUtils]: 19: Hoare triple {2133#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~b~0 4294967296)) (= main_~q~0 0))} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {2143#(and (= main_~A~0 main_~r~0) (< (div (+ (- 1) (mod main_~r~0 4294967296)) (- 4294967296)) 1) (= main_~q~0 0))} is VALID [2022-04-27 12:38:03,757 INFO L290 TraceCheckUtils]: 20: Hoare triple {2143#(and (= main_~A~0 main_~r~0) (< (div (+ (- 1) (mod main_~r~0 4294967296)) (- 4294967296)) 1) (= main_~q~0 0))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2143#(and (= main_~A~0 main_~r~0) (< (div (+ (- 1) (mod main_~r~0 4294967296)) (- 4294967296)) 1) (= main_~q~0 0))} is VALID [2022-04-27 12:38:03,758 INFO L290 TraceCheckUtils]: 21: Hoare triple {2143#(and (= main_~A~0 main_~r~0) (< (div (+ (- 1) (mod main_~r~0 4294967296)) (- 4294967296)) 1) (= main_~q~0 0))} assume !!(#t~post3 < 5);havoc #t~post3; {2143#(and (= main_~A~0 main_~r~0) (< (div (+ (- 1) (mod main_~r~0 4294967296)) (- 4294967296)) 1) (= main_~q~0 0))} is VALID [2022-04-27 12:38:03,758 INFO L290 TraceCheckUtils]: 22: Hoare triple {2143#(and (= main_~A~0 main_~r~0) (< (div (+ (- 1) (mod main_~r~0 4294967296)) (- 4294967296)) 1) (= main_~q~0 0))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {2143#(and (= main_~A~0 main_~r~0) (< (div (+ (- 1) (mod main_~r~0 4294967296)) (- 4294967296)) 1) (= main_~q~0 0))} is VALID [2022-04-27 12:38:03,759 INFO L290 TraceCheckUtils]: 23: Hoare triple {2143#(and (= main_~A~0 main_~r~0) (< (div (+ (- 1) (mod main_~r~0 4294967296)) (- 4294967296)) 1) (= main_~q~0 0))} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2143#(and (= main_~A~0 main_~r~0) (< (div (+ (- 1) (mod main_~r~0 4294967296)) (- 4294967296)) 1) (= main_~q~0 0))} is VALID [2022-04-27 12:38:03,759 INFO L290 TraceCheckUtils]: 24: Hoare triple {2143#(and (= main_~A~0 main_~r~0) (< (div (+ (- 1) (mod main_~r~0 4294967296)) (- 4294967296)) 1) (= main_~q~0 0))} assume !!(#t~post4 < 5);havoc #t~post4; {2143#(and (= main_~A~0 main_~r~0) (< (div (+ (- 1) (mod main_~r~0 4294967296)) (- 4294967296)) 1) (= main_~q~0 0))} is VALID [2022-04-27 12:38:03,760 INFO L272 TraceCheckUtils]: 25: Hoare triple {2143#(and (= main_~A~0 main_~r~0) (< (div (+ (- 1) (mod main_~r~0 4294967296)) (- 4294967296)) 1) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2162#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:38:03,760 INFO L290 TraceCheckUtils]: 26: Hoare triple {2162#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2166#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:38:03,761 INFO L290 TraceCheckUtils]: 27: Hoare triple {2166#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2078#false} is VALID [2022-04-27 12:38:03,761 INFO L290 TraceCheckUtils]: 28: Hoare triple {2078#false} assume !false; {2078#false} is VALID [2022-04-27 12:38:03,761 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 12:38:03,761 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:38:04,297 INFO L290 TraceCheckUtils]: 28: Hoare triple {2078#false} assume !false; {2078#false} is VALID [2022-04-27 12:38:04,297 INFO L290 TraceCheckUtils]: 27: Hoare triple {2166#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2078#false} is VALID [2022-04-27 12:38:04,298 INFO L290 TraceCheckUtils]: 26: Hoare triple {2162#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2166#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:38:04,299 INFO L272 TraceCheckUtils]: 25: Hoare triple {2182#(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)); {2162#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:38:04,300 INFO L290 TraceCheckUtils]: 24: Hoare triple {2182#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} assume !!(#t~post4 < 5);havoc #t~post4; {2182#(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:38:04,300 INFO L290 TraceCheckUtils]: 23: Hoare triple {2182#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2182#(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:38:04,301 INFO L290 TraceCheckUtils]: 22: Hoare triple {2182#(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); {2182#(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:38:04,301 INFO L290 TraceCheckUtils]: 21: Hoare triple {2182#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} assume !!(#t~post3 < 5);havoc #t~post3; {2182#(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:38:04,302 INFO L290 TraceCheckUtils]: 20: Hoare triple {2182#(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; {2182#(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:38:04,302 INFO L290 TraceCheckUtils]: 19: Hoare triple {2201#(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; {2182#(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:38:04,303 INFO L290 TraceCheckUtils]: 18: Hoare triple {2201#(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~post3 < 5);havoc #t~post3; {2201#(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:38:04,304 INFO L290 TraceCheckUtils]: 17: Hoare triple {2201#(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~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2201#(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:38:04,304 INFO L290 TraceCheckUtils]: 16: Hoare triple {2077#true} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {2201#(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:38:04,304 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2077#true} {2077#true} #83#return; {2077#true} is VALID [2022-04-27 12:38:04,304 INFO L290 TraceCheckUtils]: 14: Hoare triple {2077#true} assume true; {2077#true} is VALID [2022-04-27 12:38:04,304 INFO L290 TraceCheckUtils]: 13: Hoare triple {2077#true} assume !(0 == ~cond); {2077#true} is VALID [2022-04-27 12:38:04,304 INFO L290 TraceCheckUtils]: 12: Hoare triple {2077#true} ~cond := #in~cond; {2077#true} is VALID [2022-04-27 12:38:04,304 INFO L272 TraceCheckUtils]: 11: Hoare triple {2077#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2077#true} is VALID [2022-04-27 12:38:04,305 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2077#true} {2077#true} #81#return; {2077#true} is VALID [2022-04-27 12:38:04,305 INFO L290 TraceCheckUtils]: 9: Hoare triple {2077#true} assume true; {2077#true} is VALID [2022-04-27 12:38:04,305 INFO L290 TraceCheckUtils]: 8: Hoare triple {2077#true} assume !(0 == ~cond); {2077#true} is VALID [2022-04-27 12:38:04,305 INFO L290 TraceCheckUtils]: 7: Hoare triple {2077#true} ~cond := #in~cond; {2077#true} is VALID [2022-04-27 12:38:04,305 INFO L272 TraceCheckUtils]: 6: Hoare triple {2077#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {2077#true} is VALID [2022-04-27 12:38:04,305 INFO L290 TraceCheckUtils]: 5: Hoare triple {2077#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {2077#true} is VALID [2022-04-27 12:38:04,305 INFO L272 TraceCheckUtils]: 4: Hoare triple {2077#true} call #t~ret5 := main(); {2077#true} is VALID [2022-04-27 12:38:04,305 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2077#true} {2077#true} #89#return; {2077#true} is VALID [2022-04-27 12:38:04,305 INFO L290 TraceCheckUtils]: 2: Hoare triple {2077#true} assume true; {2077#true} is VALID [2022-04-27 12:38:04,305 INFO L290 TraceCheckUtils]: 1: Hoare triple {2077#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {2077#true} is VALID [2022-04-27 12:38:04,305 INFO L272 TraceCheckUtils]: 0: Hoare triple {2077#true} call ULTIMATE.init(); {2077#true} is VALID [2022-04-27 12:38:04,305 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 12:38:04,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:38:04,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300369196] [2022-04-27 12:38:04,306 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:38:04,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381930311] [2022-04-27 12:38:04,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1381930311] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 12:38:04,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:38:04,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2022-04-27 12:38:04,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115223423] [2022-04-27 12:38:04,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:38:04,307 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2022-04-27 12:38:04,307 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:38:04,307 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:38:06,353 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 25 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 12:38:06,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 12:38:06,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:38:06,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 12:38:06,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-04-27 12:38:06,355 INFO L87 Difference]: Start difference. First operand 71 states and 88 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:38:06,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:38:06,513 INFO L93 Difference]: Finished difference Result 97 states and 117 transitions. [2022-04-27 12:38:06,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 12:38:06,514 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2022-04-27 12:38:06,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:38:06,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:38:06,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2022-04-27 12:38:06,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:38:06,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2022-04-27 12:38:06,516 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 49 transitions. [2022-04-27 12:38:08,588 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 48 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 12:38:08,591 INFO L225 Difference]: With dead ends: 97 [2022-04-27 12:38:08,591 INFO L226 Difference]: Without dead ends: 95 [2022-04-27 12:38:08,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-04-27 12:38:08,595 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 11 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 18 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:38:08,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 129 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 18 Unchecked, 0.0s Time] [2022-04-27 12:38:08,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-04-27 12:38:08,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2022-04-27 12:38:08,635 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:38:08,637 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand has 94 states, 70 states have (on average 1.2571428571428571) internal successors, (88), 76 states have internal predecessors, (88), 14 states have call successors, (14), 10 states have call predecessors, (14), 9 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:38:08,640 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand has 94 states, 70 states have (on average 1.2571428571428571) internal successors, (88), 76 states have internal predecessors, (88), 14 states have call successors, (14), 10 states have call predecessors, (14), 9 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:38:08,640 INFO L87 Difference]: Start difference. First operand 95 states. Second operand has 94 states, 70 states have (on average 1.2571428571428571) internal successors, (88), 76 states have internal predecessors, (88), 14 states have call successors, (14), 10 states have call predecessors, (14), 9 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:38:08,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:38:08,644 INFO L93 Difference]: Finished difference Result 95 states and 113 transitions. [2022-04-27 12:38:08,644 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 113 transitions. [2022-04-27 12:38:08,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:38:08,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:38:08,646 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 70 states have (on average 1.2571428571428571) internal successors, (88), 76 states have internal predecessors, (88), 14 states have call successors, (14), 10 states have call predecessors, (14), 9 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) Second operand 95 states. [2022-04-27 12:38:08,646 INFO L87 Difference]: Start difference. First operand has 94 states, 70 states have (on average 1.2571428571428571) internal successors, (88), 76 states have internal predecessors, (88), 14 states have call successors, (14), 10 states have call predecessors, (14), 9 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) Second operand 95 states. [2022-04-27 12:38:08,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:38:08,655 INFO L93 Difference]: Finished difference Result 95 states and 113 transitions. [2022-04-27 12:38:08,655 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 113 transitions. [2022-04-27 12:38:08,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:38:08,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:38:08,655 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:38:08,655 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:38:08,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 70 states have (on average 1.2571428571428571) internal successors, (88), 76 states have internal predecessors, (88), 14 states have call successors, (14), 10 states have call predecessors, (14), 9 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:38:08,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 112 transitions. [2022-04-27 12:38:08,681 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 112 transitions. Word has length 29 [2022-04-27 12:38:08,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:38:08,682 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 112 transitions. [2022-04-27 12:38:08,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:38:08,683 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 112 transitions. [2022-04-27 12:38:08,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-27 12:38:08,684 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:38:08,684 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:38:08,725 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:38:08,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:38:08,909 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:38:08,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:38:08,909 INFO L85 PathProgramCache]: Analyzing trace with hash 223058363, now seen corresponding path program 1 times [2022-04-27 12:38:08,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:38:08,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617710015] [2022-04-27 12:38:08,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:38:08,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:38:08,926 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:38:08,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2050568361] [2022-04-27 12:38:08,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:38:08,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:38:08,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:38:08,935 INFO L229 MonitoredProcess]: Starting monitored process 8 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:38:08,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-27 12:38:08,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:38:08,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 12:38:08,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:38:08,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:38:09,225 INFO L272 TraceCheckUtils]: 0: Hoare triple {2703#true} call ULTIMATE.init(); {2703#true} is VALID [2022-04-27 12:38:09,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {2703#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {2703#true} is VALID [2022-04-27 12:38:09,225 INFO L290 TraceCheckUtils]: 2: Hoare triple {2703#true} assume true; {2703#true} is VALID [2022-04-27 12:38:09,226 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2703#true} {2703#true} #89#return; {2703#true} is VALID [2022-04-27 12:38:09,226 INFO L272 TraceCheckUtils]: 4: Hoare triple {2703#true} call #t~ret5 := main(); {2703#true} is VALID [2022-04-27 12:38:09,226 INFO L290 TraceCheckUtils]: 5: Hoare triple {2703#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {2703#true} is VALID [2022-04-27 12:38:09,226 INFO L272 TraceCheckUtils]: 6: Hoare triple {2703#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {2703#true} is VALID [2022-04-27 12:38:09,226 INFO L290 TraceCheckUtils]: 7: Hoare triple {2703#true} ~cond := #in~cond; {2703#true} is VALID [2022-04-27 12:38:09,226 INFO L290 TraceCheckUtils]: 8: Hoare triple {2703#true} assume !(0 == ~cond); {2703#true} is VALID [2022-04-27 12:38:09,226 INFO L290 TraceCheckUtils]: 9: Hoare triple {2703#true} assume true; {2703#true} is VALID [2022-04-27 12:38:09,226 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2703#true} {2703#true} #81#return; {2703#true} is VALID [2022-04-27 12:38:09,226 INFO L272 TraceCheckUtils]: 11: Hoare triple {2703#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2703#true} is VALID [2022-04-27 12:38:09,226 INFO L290 TraceCheckUtils]: 12: Hoare triple {2703#true} ~cond := #in~cond; {2703#true} is VALID [2022-04-27 12:38:09,226 INFO L290 TraceCheckUtils]: 13: Hoare triple {2703#true} assume !(0 == ~cond); {2703#true} is VALID [2022-04-27 12:38:09,226 INFO L290 TraceCheckUtils]: 14: Hoare triple {2703#true} assume true; {2703#true} is VALID [2022-04-27 12:38:09,227 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2703#true} {2703#true} #83#return; {2703#true} is VALID [2022-04-27 12:38:09,227 INFO L290 TraceCheckUtils]: 16: Hoare triple {2703#true} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {2703#true} is VALID [2022-04-27 12:38:09,227 INFO L290 TraceCheckUtils]: 17: Hoare triple {2703#true} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2703#true} is VALID [2022-04-27 12:38:09,227 INFO L290 TraceCheckUtils]: 18: Hoare triple {2703#true} assume !!(#t~post3 < 5);havoc #t~post3; {2703#true} is VALID [2022-04-27 12:38:09,227 INFO L290 TraceCheckUtils]: 19: Hoare triple {2703#true} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {2703#true} is VALID [2022-04-27 12:38:09,227 INFO L290 TraceCheckUtils]: 20: Hoare triple {2703#true} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2703#true} is VALID [2022-04-27 12:38:09,227 INFO L290 TraceCheckUtils]: 21: Hoare triple {2703#true} assume !!(#t~post3 < 5);havoc #t~post3; {2703#true} is VALID [2022-04-27 12:38:09,227 INFO L290 TraceCheckUtils]: 22: Hoare triple {2703#true} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {2703#true} is VALID [2022-04-27 12:38:09,227 INFO L290 TraceCheckUtils]: 23: Hoare triple {2703#true} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2703#true} is VALID [2022-04-27 12:38:09,227 INFO L290 TraceCheckUtils]: 24: Hoare triple {2703#true} assume !!(#t~post4 < 5);havoc #t~post4; {2703#true} is VALID [2022-04-27 12:38:09,227 INFO L272 TraceCheckUtils]: 25: Hoare triple {2703#true} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2703#true} is VALID [2022-04-27 12:38:09,228 INFO L290 TraceCheckUtils]: 26: Hoare triple {2703#true} ~cond := #in~cond; {2786#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:38:09,228 INFO L290 TraceCheckUtils]: 27: Hoare triple {2786#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2790#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:38:09,229 INFO L290 TraceCheckUtils]: 28: Hoare triple {2790#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2790#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:38:09,230 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2790#(not (= |__VERIFIER_assert_#in~cond| 0))} {2703#true} #85#return; {2797#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 12:38:09,230 INFO L290 TraceCheckUtils]: 30: Hoare triple {2797#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} assume !(~b~0 % 4294967296 != ~B~0 % 4294967296); {2797#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 12:38:09,231 INFO L272 TraceCheckUtils]: 31: Hoare triple {2797#(= (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)); {2804#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2022-04-27 12:38:09,231 INFO L290 TraceCheckUtils]: 32: Hoare triple {2804#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {2808#(= __VERIFIER_assert_~cond 1)} is VALID [2022-04-27 12:38:09,231 INFO L290 TraceCheckUtils]: 33: Hoare triple {2808#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {2704#false} is VALID [2022-04-27 12:38:09,231 INFO L290 TraceCheckUtils]: 34: Hoare triple {2704#false} assume !false; {2704#false} is VALID [2022-04-27 12:38:09,232 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-27 12:38:09,232 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:38:10,088 INFO L290 TraceCheckUtils]: 34: Hoare triple {2704#false} assume !false; {2704#false} is VALID [2022-04-27 12:38:10,088 INFO L290 TraceCheckUtils]: 33: Hoare triple {2818#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2704#false} is VALID [2022-04-27 12:38:10,089 INFO L290 TraceCheckUtils]: 32: Hoare triple {2790#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2818#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 12:38:10,089 INFO L272 TraceCheckUtils]: 31: Hoare triple {2797#(= (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)); {2790#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:38:10,089 INFO L290 TraceCheckUtils]: 30: Hoare triple {2797#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} assume !(~b~0 % 4294967296 != ~B~0 % 4294967296); {2797#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 12:38:10,090 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2790#(not (= |__VERIFIER_assert_#in~cond| 0))} {2703#true} #85#return; {2797#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 12:38:10,090 INFO L290 TraceCheckUtils]: 28: Hoare triple {2790#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2790#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:38:10,091 INFO L290 TraceCheckUtils]: 27: Hoare triple {2840#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2790#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:38:10,091 INFO L290 TraceCheckUtils]: 26: Hoare triple {2703#true} ~cond := #in~cond; {2840#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 12:38:10,091 INFO L272 TraceCheckUtils]: 25: Hoare triple {2703#true} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2703#true} is VALID [2022-04-27 12:38:10,091 INFO L290 TraceCheckUtils]: 24: Hoare triple {2703#true} assume !!(#t~post4 < 5);havoc #t~post4; {2703#true} is VALID [2022-04-27 12:38:10,091 INFO L290 TraceCheckUtils]: 23: Hoare triple {2703#true} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2703#true} is VALID [2022-04-27 12:38:10,091 INFO L290 TraceCheckUtils]: 22: Hoare triple {2703#true} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {2703#true} is VALID [2022-04-27 12:38:10,092 INFO L290 TraceCheckUtils]: 21: Hoare triple {2703#true} assume !!(#t~post3 < 5);havoc #t~post3; {2703#true} is VALID [2022-04-27 12:38:10,092 INFO L290 TraceCheckUtils]: 20: Hoare triple {2703#true} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2703#true} is VALID [2022-04-27 12:38:10,092 INFO L290 TraceCheckUtils]: 19: Hoare triple {2703#true} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {2703#true} is VALID [2022-04-27 12:38:10,092 INFO L290 TraceCheckUtils]: 18: Hoare triple {2703#true} assume !!(#t~post3 < 5);havoc #t~post3; {2703#true} is VALID [2022-04-27 12:38:10,092 INFO L290 TraceCheckUtils]: 17: Hoare triple {2703#true} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2703#true} is VALID [2022-04-27 12:38:10,092 INFO L290 TraceCheckUtils]: 16: Hoare triple {2703#true} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {2703#true} is VALID [2022-04-27 12:38:10,092 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2703#true} {2703#true} #83#return; {2703#true} is VALID [2022-04-27 12:38:10,092 INFO L290 TraceCheckUtils]: 14: Hoare triple {2703#true} assume true; {2703#true} is VALID [2022-04-27 12:38:10,092 INFO L290 TraceCheckUtils]: 13: Hoare triple {2703#true} assume !(0 == ~cond); {2703#true} is VALID [2022-04-27 12:38:10,092 INFO L290 TraceCheckUtils]: 12: Hoare triple {2703#true} ~cond := #in~cond; {2703#true} is VALID [2022-04-27 12:38:10,092 INFO L272 TraceCheckUtils]: 11: Hoare triple {2703#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2703#true} is VALID [2022-04-27 12:38:10,093 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2703#true} {2703#true} #81#return; {2703#true} is VALID [2022-04-27 12:38:10,093 INFO L290 TraceCheckUtils]: 9: Hoare triple {2703#true} assume true; {2703#true} is VALID [2022-04-27 12:38:10,093 INFO L290 TraceCheckUtils]: 8: Hoare triple {2703#true} assume !(0 == ~cond); {2703#true} is VALID [2022-04-27 12:38:10,093 INFO L290 TraceCheckUtils]: 7: Hoare triple {2703#true} ~cond := #in~cond; {2703#true} is VALID [2022-04-27 12:38:10,094 INFO L272 TraceCheckUtils]: 6: Hoare triple {2703#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {2703#true} is VALID [2022-04-27 12:38:10,094 INFO L290 TraceCheckUtils]: 5: Hoare triple {2703#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {2703#true} is VALID [2022-04-27 12:38:10,095 INFO L272 TraceCheckUtils]: 4: Hoare triple {2703#true} call #t~ret5 := main(); {2703#true} is VALID [2022-04-27 12:38:10,095 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2703#true} {2703#true} #89#return; {2703#true} is VALID [2022-04-27 12:38:10,096 INFO L290 TraceCheckUtils]: 2: Hoare triple {2703#true} assume true; {2703#true} is VALID [2022-04-27 12:38:10,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {2703#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {2703#true} is VALID [2022-04-27 12:38:10,096 INFO L272 TraceCheckUtils]: 0: Hoare triple {2703#true} call ULTIMATE.init(); {2703#true} is VALID [2022-04-27 12:38:10,096 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-27 12:38:10,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:38:10,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617710015] [2022-04-27 12:38:10,096 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:38:10,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2050568361] [2022-04-27 12:38:10,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2050568361] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:38:10,096 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:38:10,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2022-04-27 12:38:10,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827743396] [2022-04-27 12:38:10,097 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:38:10,097 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 35 [2022-04-27 12:38:10,097 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:38:10,097 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 12:38:10,123 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:38:10,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 12:38:10,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:38:10,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 12:38:10,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-27 12:38:10,125 INFO L87 Difference]: Start difference. First operand 94 states and 112 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 12:38:13,012 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:38:15,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:38:15,577 INFO L93 Difference]: Finished difference Result 109 states and 126 transitions. [2022-04-27 12:38:15,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 12:38:15,578 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 35 [2022-04-27 12:38:15,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:38:15,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 12:38:15,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 48 transitions. [2022-04-27 12:38:15,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 12:38:15,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 48 transitions. [2022-04-27 12:38:15,581 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 48 transitions. [2022-04-27 12:38:15,621 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:38:15,623 INFO L225 Difference]: With dead ends: 109 [2022-04-27 12:38:15,623 INFO L226 Difference]: Without dead ends: 92 [2022-04-27 12:38:15,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-04-27 12:38:15,624 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 24 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-27 12:38:15,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 139 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 61 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-27 12:38:15,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-04-27 12:38:15,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-04-27 12:38:15,652 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:38:15,652 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand has 92 states, 70 states have (on average 1.2142857142857142) internal successors, (85), 74 states have internal predecessors, (85), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:38:15,652 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand has 92 states, 70 states have (on average 1.2142857142857142) internal successors, (85), 74 states have internal predecessors, (85), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:38:15,653 INFO L87 Difference]: Start difference. First operand 92 states. Second operand has 92 states, 70 states have (on average 1.2142857142857142) internal successors, (85), 74 states have internal predecessors, (85), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:38:15,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:38:15,655 INFO L93 Difference]: Finished difference Result 92 states and 107 transitions. [2022-04-27 12:38:15,655 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 107 transitions. [2022-04-27 12:38:15,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:38:15,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:38:15,656 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 70 states have (on average 1.2142857142857142) internal successors, (85), 74 states have internal predecessors, (85), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) Second operand 92 states. [2022-04-27 12:38:15,656 INFO L87 Difference]: Start difference. First operand has 92 states, 70 states have (on average 1.2142857142857142) internal successors, (85), 74 states have internal predecessors, (85), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) Second operand 92 states. [2022-04-27 12:38:15,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:38:15,658 INFO L93 Difference]: Finished difference Result 92 states and 107 transitions. [2022-04-27 12:38:15,658 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 107 transitions. [2022-04-27 12:38:15,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:38:15,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:38:15,658 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:38:15,658 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:38:15,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 70 states have (on average 1.2142857142857142) internal successors, (85), 74 states have internal predecessors, (85), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:38:15,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 107 transitions. [2022-04-27 12:38:15,660 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 107 transitions. Word has length 35 [2022-04-27 12:38:15,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:38:15,661 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 107 transitions. [2022-04-27 12:38:15,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 12:38:15,661 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 107 transitions. [2022-04-27 12:38:15,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-27 12:38:15,661 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:38:15,661 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:38:15,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-27 12:38:15,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:38:15,862 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:38:15,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:38:15,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1731935178, now seen corresponding path program 1 times [2022-04-27 12:38:15,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:38:15,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672636214] [2022-04-27 12:38:15,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:38:15,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:38:15,883 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:38:15,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1120864316] [2022-04-27 12:38:15,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:38:15,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:38:15,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:38:15,890 INFO L229 MonitoredProcess]: Starting monitored process 9 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:38:15,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-27 12:38:15,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:38:15,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-27 12:38:15,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:38:15,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:38:16,053 INFO L272 TraceCheckUtils]: 0: Hoare triple {3370#true} call ULTIMATE.init(); {3370#true} is VALID [2022-04-27 12:38:16,054 INFO L290 TraceCheckUtils]: 1: Hoare triple {3370#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {3370#true} is VALID [2022-04-27 12:38:16,054 INFO L290 TraceCheckUtils]: 2: Hoare triple {3370#true} assume true; {3370#true} is VALID [2022-04-27 12:38:16,054 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3370#true} {3370#true} #89#return; {3370#true} is VALID [2022-04-27 12:38:16,054 INFO L272 TraceCheckUtils]: 4: Hoare triple {3370#true} call #t~ret5 := main(); {3370#true} is VALID [2022-04-27 12:38:16,054 INFO L290 TraceCheckUtils]: 5: Hoare triple {3370#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {3370#true} is VALID [2022-04-27 12:38:16,054 INFO L272 TraceCheckUtils]: 6: Hoare triple {3370#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {3370#true} is VALID [2022-04-27 12:38:16,054 INFO L290 TraceCheckUtils]: 7: Hoare triple {3370#true} ~cond := #in~cond; {3370#true} is VALID [2022-04-27 12:38:16,054 INFO L290 TraceCheckUtils]: 8: Hoare triple {3370#true} assume !(0 == ~cond); {3370#true} is VALID [2022-04-27 12:38:16,054 INFO L290 TraceCheckUtils]: 9: Hoare triple {3370#true} assume true; {3370#true} is VALID [2022-04-27 12:38:16,054 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3370#true} {3370#true} #81#return; {3370#true} is VALID [2022-04-27 12:38:16,054 INFO L272 TraceCheckUtils]: 11: Hoare triple {3370#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {3370#true} is VALID [2022-04-27 12:38:16,054 INFO L290 TraceCheckUtils]: 12: Hoare triple {3370#true} ~cond := #in~cond; {3370#true} is VALID [2022-04-27 12:38:16,055 INFO L290 TraceCheckUtils]: 13: Hoare triple {3370#true} assume !(0 == ~cond); {3370#true} is VALID [2022-04-27 12:38:16,055 INFO L290 TraceCheckUtils]: 14: Hoare triple {3370#true} assume true; {3370#true} is VALID [2022-04-27 12:38:16,055 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3370#true} {3370#true} #83#return; {3370#true} is VALID [2022-04-27 12:38:16,059 INFO L290 TraceCheckUtils]: 16: Hoare triple {3370#true} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {3423#(= main_~B~0 main_~b~0)} is VALID [2022-04-27 12:38:16,059 INFO L290 TraceCheckUtils]: 17: Hoare triple {3423#(= main_~B~0 main_~b~0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {3423#(= main_~B~0 main_~b~0)} is VALID [2022-04-27 12:38:16,060 INFO L290 TraceCheckUtils]: 18: Hoare triple {3423#(= main_~B~0 main_~b~0)} assume !!(#t~post3 < 5);havoc #t~post3; {3423#(= main_~B~0 main_~b~0)} is VALID [2022-04-27 12:38:16,060 INFO L290 TraceCheckUtils]: 19: Hoare triple {3423#(= main_~B~0 main_~b~0)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {3423#(= main_~B~0 main_~b~0)} is VALID [2022-04-27 12:38:16,060 INFO L290 TraceCheckUtils]: 20: Hoare triple {3423#(= main_~B~0 main_~b~0)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {3423#(= main_~B~0 main_~b~0)} is VALID [2022-04-27 12:38:16,061 INFO L290 TraceCheckUtils]: 21: Hoare triple {3423#(= main_~B~0 main_~b~0)} assume !!(#t~post4 < 5);havoc #t~post4; {3423#(= main_~B~0 main_~b~0)} is VALID [2022-04-27 12:38:16,061 INFO L272 TraceCheckUtils]: 22: Hoare triple {3423#(= main_~B~0 main_~b~0)} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {3370#true} is VALID [2022-04-27 12:38:16,061 INFO L290 TraceCheckUtils]: 23: Hoare triple {3370#true} ~cond := #in~cond; {3370#true} is VALID [2022-04-27 12:38:16,061 INFO L290 TraceCheckUtils]: 24: Hoare triple {3370#true} assume !(0 == ~cond); {3370#true} is VALID [2022-04-27 12:38:16,061 INFO L290 TraceCheckUtils]: 25: Hoare triple {3370#true} assume true; {3370#true} is VALID [2022-04-27 12:38:16,065 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3370#true} {3423#(= main_~B~0 main_~b~0)} #85#return; {3423#(= main_~B~0 main_~b~0)} is VALID [2022-04-27 12:38:16,065 INFO L290 TraceCheckUtils]: 27: Hoare triple {3423#(= main_~B~0 main_~b~0)} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {3371#false} is VALID [2022-04-27 12:38:16,065 INFO L290 TraceCheckUtils]: 28: Hoare triple {3371#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {3371#false} is VALID [2022-04-27 12:38:16,065 INFO L290 TraceCheckUtils]: 29: Hoare triple {3371#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {3371#false} is VALID [2022-04-27 12:38:16,065 INFO L290 TraceCheckUtils]: 30: Hoare triple {3371#false} assume !!(#t~post4 < 5);havoc #t~post4; {3371#false} is VALID [2022-04-27 12:38:16,065 INFO L272 TraceCheckUtils]: 31: Hoare triple {3371#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {3371#false} is VALID [2022-04-27 12:38:16,066 INFO L290 TraceCheckUtils]: 32: Hoare triple {3371#false} ~cond := #in~cond; {3371#false} is VALID [2022-04-27 12:38:16,066 INFO L290 TraceCheckUtils]: 33: Hoare triple {3371#false} assume 0 == ~cond; {3371#false} is VALID [2022-04-27 12:38:16,066 INFO L290 TraceCheckUtils]: 34: Hoare triple {3371#false} assume !false; {3371#false} is VALID [2022-04-27 12:38:16,066 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 12:38:16,066 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:38:16,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:38:16,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672636214] [2022-04-27 12:38:16,066 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:38:16,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120864316] [2022-04-27 12:38:16,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1120864316] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:38:16,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:38:16,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 12:38:16,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227043628] [2022-04-27 12:38:16,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:38:16,067 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2022-04-27 12:38:16,067 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:38:16,067 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 12:38:16,091 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:38:16,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 12:38:16,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:38:16,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 12:38:16,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:38:16,092 INFO L87 Difference]: Start difference. First operand 92 states and 107 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 12:38:18,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:38:18,285 INFO L93 Difference]: Finished difference Result 117 states and 137 transitions. [2022-04-27 12:38:18,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 12:38:18,285 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2022-04-27 12:38:18,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:38:18,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 12:38:18,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2022-04-27 12:38:18,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 12:38:18,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2022-04-27 12:38:18,288 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 56 transitions. [2022-04-27 12:38:18,338 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:38:18,339 INFO L225 Difference]: With dead ends: 117 [2022-04-27 12:38:18,339 INFO L226 Difference]: Without dead ends: 76 [2022-04-27 12:38:18,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:38:18,340 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:38:18,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:38:18,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-27 12:38:18,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-04-27 12:38:18,356 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:38:18,357 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 76 states, 58 states have (on average 1.206896551724138) internal successors, (70), 61 states have internal predecessors, (70), 10 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 12:38:18,357 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 76 states, 58 states have (on average 1.206896551724138) internal successors, (70), 61 states have internal predecessors, (70), 10 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 12:38:18,357 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 76 states, 58 states have (on average 1.206896551724138) internal successors, (70), 61 states have internal predecessors, (70), 10 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 12:38:18,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:38:18,360 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2022-04-27 12:38:18,360 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 88 transitions. [2022-04-27 12:38:18,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:38:18,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:38:18,360 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 58 states have (on average 1.206896551724138) internal successors, (70), 61 states have internal predecessors, (70), 10 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) Second operand 76 states. [2022-04-27 12:38:18,361 INFO L87 Difference]: Start difference. First operand has 76 states, 58 states have (on average 1.206896551724138) internal successors, (70), 61 states have internal predecessors, (70), 10 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) Second operand 76 states. [2022-04-27 12:38:18,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:38:18,365 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2022-04-27 12:38:18,365 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 88 transitions. [2022-04-27 12:38:18,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:38:18,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:38:18,365 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:38:18,365 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:38:18,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 58 states have (on average 1.206896551724138) internal successors, (70), 61 states have internal predecessors, (70), 10 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 12:38:18,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 88 transitions. [2022-04-27 12:38:18,368 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 88 transitions. Word has length 35 [2022-04-27 12:38:18,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:38:18,368 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 88 transitions. [2022-04-27 12:38:18,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 12:38:18,368 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 88 transitions. [2022-04-27 12:38:18,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-27 12:38:18,369 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:38:18,369 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:38:18,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-04-27 12:38:18,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-27 12:38:18,593 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:38:18,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:38:18,593 INFO L85 PathProgramCache]: Analyzing trace with hash -585153905, now seen corresponding path program 2 times [2022-04-27 12:38:18,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:38:18,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632690985] [2022-04-27 12:38:18,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:38:18,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:38:18,611 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:38:18,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1710677135] [2022-04-27 12:38:18,612 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 12:38:18,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:38:18,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:38:18,620 INFO L229 MonitoredProcess]: Starting monitored process 10 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:38:18,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-27 12:38:18,682 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-27 12:38:18,682 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:38:18,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 12:38:18,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:38:18,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:38:18,911 INFO L272 TraceCheckUtils]: 0: Hoare triple {3877#true} call ULTIMATE.init(); {3877#true} is VALID [2022-04-27 12:38:18,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {3877#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {3877#true} is VALID [2022-04-27 12:38:18,911 INFO L290 TraceCheckUtils]: 2: Hoare triple {3877#true} assume true; {3877#true} is VALID [2022-04-27 12:38:18,911 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3877#true} {3877#true} #89#return; {3877#true} is VALID [2022-04-27 12:38:18,911 INFO L272 TraceCheckUtils]: 4: Hoare triple {3877#true} call #t~ret5 := main(); {3877#true} is VALID [2022-04-27 12:38:18,912 INFO L290 TraceCheckUtils]: 5: Hoare triple {3877#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {3877#true} is VALID [2022-04-27 12:38:18,912 INFO L272 TraceCheckUtils]: 6: Hoare triple {3877#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {3877#true} is VALID [2022-04-27 12:38:18,912 INFO L290 TraceCheckUtils]: 7: Hoare triple {3877#true} ~cond := #in~cond; {3877#true} is VALID [2022-04-27 12:38:18,912 INFO L290 TraceCheckUtils]: 8: Hoare triple {3877#true} assume !(0 == ~cond); {3877#true} is VALID [2022-04-27 12:38:18,912 INFO L290 TraceCheckUtils]: 9: Hoare triple {3877#true} assume true; {3877#true} is VALID [2022-04-27 12:38:18,912 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3877#true} {3877#true} #81#return; {3877#true} is VALID [2022-04-27 12:38:18,912 INFO L272 TraceCheckUtils]: 11: Hoare triple {3877#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {3877#true} is VALID [2022-04-27 12:38:18,912 INFO L290 TraceCheckUtils]: 12: Hoare triple {3877#true} ~cond := #in~cond; {3877#true} is VALID [2022-04-27 12:38:18,912 INFO L290 TraceCheckUtils]: 13: Hoare triple {3877#true} assume !(0 == ~cond); {3877#true} is VALID [2022-04-27 12:38:18,912 INFO L290 TraceCheckUtils]: 14: Hoare triple {3877#true} assume true; {3877#true} is VALID [2022-04-27 12:38:18,912 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3877#true} {3877#true} #83#return; {3877#true} is VALID [2022-04-27 12:38:18,913 INFO L290 TraceCheckUtils]: 16: Hoare triple {3877#true} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {3930#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:38:18,913 INFO L290 TraceCheckUtils]: 17: Hoare triple {3930#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {3930#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:38:18,914 INFO L290 TraceCheckUtils]: 18: Hoare triple {3930#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post3 < 5);havoc #t~post3; {3930#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:38:18,914 INFO L290 TraceCheckUtils]: 19: Hoare triple {3930#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {3930#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:38:18,914 INFO L290 TraceCheckUtils]: 20: Hoare triple {3930#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {3930#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:38:18,915 INFO L290 TraceCheckUtils]: 21: Hoare triple {3930#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post3 < 5);havoc #t~post3; {3930#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:38:18,915 INFO L290 TraceCheckUtils]: 22: Hoare triple {3930#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {3930#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:38:18,916 INFO L290 TraceCheckUtils]: 23: Hoare triple {3930#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {3930#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:38:18,916 INFO L290 TraceCheckUtils]: 24: Hoare triple {3930#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post3 < 5);havoc #t~post3; {3930#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:38:18,917 INFO L290 TraceCheckUtils]: 25: Hoare triple {3930#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {3930#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:38:18,917 INFO L290 TraceCheckUtils]: 26: Hoare triple {3930#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {3930#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:38:18,918 INFO L290 TraceCheckUtils]: 27: Hoare triple {3930#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post3 < 5);havoc #t~post3; {3930#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:38:18,918 INFO L290 TraceCheckUtils]: 28: Hoare triple {3930#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {3930#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:38:18,918 INFO L290 TraceCheckUtils]: 29: Hoare triple {3930#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {3930#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:38:18,919 INFO L290 TraceCheckUtils]: 30: Hoare triple {3930#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(#t~post3 < 5);havoc #t~post3; {3930#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:38:18,919 INFO L290 TraceCheckUtils]: 31: Hoare triple {3930#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {3930#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:38:18,920 INFO L290 TraceCheckUtils]: 32: Hoare triple {3930#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(#t~post4 < 5);havoc #t~post4; {3930#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:38:18,920 INFO L272 TraceCheckUtils]: 33: Hoare triple {3930#(and (= 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)); {3982#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:38:18,921 INFO L290 TraceCheckUtils]: 34: Hoare triple {3982#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3986#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:38:18,921 INFO L290 TraceCheckUtils]: 35: Hoare triple {3986#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3878#false} is VALID [2022-04-27 12:38:18,921 INFO L290 TraceCheckUtils]: 36: Hoare triple {3878#false} assume !false; {3878#false} is VALID [2022-04-27 12:38:18,921 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-27 12:38:18,921 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:38:18,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:38:18,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632690985] [2022-04-27 12:38:18,922 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:38:18,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710677135] [2022-04-27 12:38:18,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1710677135] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:38:18,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:38:18,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 12:38:18,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830511648] [2022-04-27 12:38:18,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:38:18,924 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2022-04-27 12:38:18,924 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:38:18,925 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:38:18,945 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:38:18,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:38:18,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:38:18,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:38:18,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:38:18,946 INFO L87 Difference]: Start difference. First operand 76 states and 88 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:38:19,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:38:19,367 INFO L93 Difference]: Finished difference Result 99 states and 115 transitions. [2022-04-27 12:38:19,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:38:19,367 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2022-04-27 12:38:19,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:38:19,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:38:19,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-27 12:38:19,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:38:19,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-27 12:38:19,369 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2022-04-27 12:38:19,553 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:38:19,555 INFO L225 Difference]: With dead ends: 99 [2022-04-27 12:38:19,555 INFO L226 Difference]: Without dead ends: 96 [2022-04-27 12:38:19,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 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:38:19,556 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 8 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 12:38:19,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 93 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 12:38:19,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-27 12:38:19,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 77. [2022-04-27 12:38:19,575 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:38:19,576 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 77 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 60 states have internal predecessors, (71), 10 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 12:38:19,576 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 77 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 60 states have internal predecessors, (71), 10 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 12:38:19,576 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 77 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 60 states have internal predecessors, (71), 10 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 12:38:19,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:38:19,578 INFO L93 Difference]: Finished difference Result 96 states and 109 transitions. [2022-04-27 12:38:19,578 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 109 transitions. [2022-04-27 12:38:19,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:38:19,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:38:19,580 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 60 states have internal predecessors, (71), 10 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 96 states. [2022-04-27 12:38:19,580 INFO L87 Difference]: Start difference. First operand has 77 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 60 states have internal predecessors, (71), 10 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 96 states. [2022-04-27 12:38:19,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:38:19,583 INFO L93 Difference]: Finished difference Result 96 states and 109 transitions. [2022-04-27 12:38:19,583 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 109 transitions. [2022-04-27 12:38:19,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:38:19,583 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:38:19,583 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:38:19,583 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:38:19,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 60 states have internal predecessors, (71), 10 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 12:38:19,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 89 transitions. [2022-04-27 12:38:19,597 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 89 transitions. Word has length 37 [2022-04-27 12:38:19,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:38:19,598 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 89 transitions. [2022-04-27 12:38:19,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:38:19,598 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 89 transitions. [2022-04-27 12:38:19,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-27 12:38:19,599 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:38:19,599 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:38:19,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-27 12:38:19,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-27 12:38:19,819 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:38:19,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:38:19,842 INFO L85 PathProgramCache]: Analyzing trace with hash 817777954, now seen corresponding path program 1 times [2022-04-27 12:38:19,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:38:19,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921660605] [2022-04-27 12:38:19,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:38:19,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:38:19,858 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:38:19,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2080701178] [2022-04-27 12:38:19,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:38:19,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:38:19,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:38:19,859 INFO L229 MonitoredProcess]: Starting monitored process 11 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:38:19,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process