/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/divbin2_valuebound100.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 12:32:43,672 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 12:32:43,674 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 12:32:43,717 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 12:32:43,717 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 12:32:43,718 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 12:32:43,720 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 12:32:43,721 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 12:32:43,723 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 12:32:43,725 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 12:32:43,726 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 12:32:43,727 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 12:32:43,728 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 12:32:43,728 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 12:32:43,729 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 12:32:43,730 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 12:32:43,731 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 12:32:43,731 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 12:32:43,733 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 12:32:43,734 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 12:32:43,736 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 12:32:43,737 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 12:32:43,738 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 12:32:43,739 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 12:32:43,739 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 12:32:43,742 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 12:32:43,742 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 12:32:43,742 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 12:32:43,743 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 12:32:43,744 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 12:32:43,744 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 12:32:43,745 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 12:32:43,745 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 12:32:43,746 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 12:32:43,747 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 12:32:43,747 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 12:32:43,748 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 12:32:43,748 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 12:32:43,748 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 12:32:43,749 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 12:32:43,749 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 12:32:43,752 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 12:32:43,752 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 12:32:43,785 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 12:32:43,785 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 12:32:43,785 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 12:32:43,786 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 12:32:43,786 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 12:32:43,786 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 12:32:43,787 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 12:32:43,787 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 12:32:43,787 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 12:32:43,787 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 12:32:43,787 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 12:32:43,788 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 12:32:43,788 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 12:32:43,788 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 12:32:43,788 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 12:32:43,788 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 12:32:43,788 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 12:32:43,788 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 12:32:43,788 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 12:32:43,788 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 12:32:43,789 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 12:32:43,789 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 12:32:43,789 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 12:32:43,789 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 12:32:43,789 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 12:32:43,789 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 12:32:43,789 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 12:32:43,790 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 12:32:43,790 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 12:32:43,790 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 12:32:43,790 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 12:32:43,790 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 12:32:43,790 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 12:32:43,790 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 12:32:43,992 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 12:32:44,013 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 12:32:44,015 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 12:32:44,017 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 12:32:44,018 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 12:32:44,019 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/divbin2_valuebound100.i [2022-04-27 12:32:44,083 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/845bb081a/0857887fe8de403786b055ef6ab8ac46/FLAG87911e4b3 [2022-04-27 12:32:44,482 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 12:32:44,482 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin2_valuebound100.i [2022-04-27 12:32:44,490 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/845bb081a/0857887fe8de403786b055ef6ab8ac46/FLAG87911e4b3 [2022-04-27 12:32:44,509 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/845bb081a/0857887fe8de403786b055ef6ab8ac46 [2022-04-27 12:32:44,512 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 12:32:44,514 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 12:32:44,515 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 12:32:44,515 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 12:32:44,518 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 12:32:44,519 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 12:32:44" (1/1) ... [2022-04-27 12:32:44,520 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a3a2407 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:32:44, skipping insertion in model container [2022-04-27 12:32:44,521 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 12:32:44" (1/1) ... [2022-04-27 12:32:44,542 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 12:32:44,555 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 12:32:44,733 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin2_valuebound100.i[951,964] [2022-04-27 12:32:44,747 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 12:32:44,758 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 12:32:44,769 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin2_valuebound100.i[951,964] [2022-04-27 12:32:44,775 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 12:32:44,786 INFO L208 MainTranslator]: Completed translation [2022-04-27 12:32:44,786 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:32:44 WrapperNode [2022-04-27 12:32:44,787 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 12:32:44,787 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 12:32:44,787 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 12:32:44,787 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 12:32:44,795 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:32:44" (1/1) ... [2022-04-27 12:32:44,795 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:32:44" (1/1) ... [2022-04-27 12:32:44,800 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:32:44" (1/1) ... [2022-04-27 12:32:44,800 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:32:44" (1/1) ... [2022-04-27 12:32:44,806 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:32:44" (1/1) ... [2022-04-27 12:32:44,811 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:32:44" (1/1) ... [2022-04-27 12:32:44,812 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:32:44" (1/1) ... [2022-04-27 12:32:44,813 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 12:32:44,814 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 12:32:44,815 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 12:32:44,815 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 12:32:44,816 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:32:44" (1/1) ... [2022-04-27 12:32:44,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 12:32:44,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:32:44,849 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 12:32:44,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 12:32:44,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 12:32:44,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 12:32:44,892 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 12:32:44,893 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 12:32:44,895 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 12:32:44,895 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 12:32:44,895 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 12:32:44,895 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 12:32:44,895 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 12:32:44,895 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 12:32:44,895 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 12:32:44,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 12:32:44,896 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 12:32:44,896 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 12:32:44,896 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 12:32:44,897 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 12:32:44,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 12:32:44,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 12:32:44,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 12:32:44,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 12:32:44,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 12:32:44,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 12:32:44,951 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 12:32:44,952 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 12:32:45,111 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 12:32:45,118 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 12:32:45,118 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 12:32:45,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 12:32:45 BoogieIcfgContainer [2022-04-27 12:32:45,119 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 12:32:45,133 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 12:32:45,133 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 12:32:45,136 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 12:32:45,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 12:32:44" (1/3) ... [2022-04-27 12:32:45,137 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14991753 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 12:32:45, skipping insertion in model container [2022-04-27 12:32:45,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:32:44" (2/3) ... [2022-04-27 12:32:45,137 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14991753 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 12:32:45, skipping insertion in model container [2022-04-27 12:32:45,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 12:32:45" (3/3) ... [2022-04-27 12:32:45,139 INFO L111 eAbstractionObserver]: Analyzing ICFG divbin2_valuebound100.i [2022-04-27 12:32:45,154 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 12:32:45,155 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 12:32:45,208 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 12:32:45,213 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@236ad48a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5d2fcafe [2022-04-27 12:32:45,213 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 12:32:45,220 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 12:32:45,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 12:32:45,227 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:32:45,227 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:32:45,228 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:32:45,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:32:45,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1171333446, now seen corresponding path program 1 times [2022-04-27 12:32:45,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:32:45,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010977297] [2022-04-27 12:32:45,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:32:45,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:32:45,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:32:45,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 12:32:45,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:32:45,395 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {33#true} is VALID [2022-04-27 12:32:45,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-27 12:32:45,396 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} #84#return; {33#true} is VALID [2022-04-27 12:32:45,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 12:32:45,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:32:45,406 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-27 12:32:45,407 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-27 12:32:45,407 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-27 12:32:45,407 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#false} {33#true} #78#return; {34#false} is VALID [2022-04-27 12:32:45,408 INFO L272 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {42#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 12:32:45,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {33#true} is VALID [2022-04-27 12:32:45,409 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-27 12:32:45,409 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #84#return; {33#true} is VALID [2022-04-27 12:32:45,409 INFO L272 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret2 := main(); {33#true} is VALID [2022-04-27 12:32:45,410 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {33#true} is VALID [2022-04-27 12:32:45,410 INFO L272 TraceCheckUtils]: 6: Hoare triple {33#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 100 then 1 else 0)); {33#true} is VALID [2022-04-27 12:32:45,410 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-27 12:32:45,411 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-27 12:32:45,411 INFO L290 TraceCheckUtils]: 9: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-27 12:32:45,411 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {34#false} {33#true} #78#return; {34#false} is VALID [2022-04-27 12:32:45,411 INFO L290 TraceCheckUtils]: 11: Hoare triple {34#false} ~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {34#false} is VALID [2022-04-27 12:32:45,412 INFO L290 TraceCheckUtils]: 12: Hoare triple {34#false} assume !true; {34#false} is VALID [2022-04-27 12:32:45,412 INFO L290 TraceCheckUtils]: 13: Hoare triple {34#false} assume !true; {34#false} is VALID [2022-04-27 12:32:45,412 INFO L272 TraceCheckUtils]: 14: Hoare triple {34#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {34#false} is VALID [2022-04-27 12:32:45,412 INFO L290 TraceCheckUtils]: 15: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2022-04-27 12:32:45,413 INFO L290 TraceCheckUtils]: 16: Hoare triple {34#false} assume 0 == ~cond; {34#false} is VALID [2022-04-27 12:32:45,413 INFO L290 TraceCheckUtils]: 17: Hoare triple {34#false} assume !false; {34#false} is VALID [2022-04-27 12:32:45,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:32:45,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:32:45,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010977297] [2022-04-27 12:32:45,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010977297] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:32:45,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:32:45,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 12:32:45,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134210902] [2022-04-27 12:32:45,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:32:45,422 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-27 12:32:45,424 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:32:45,427 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:32:45,449 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:32:45,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 12:32:45,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:32:45,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 12:32:45,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:32:45,470 INFO L87 Difference]: Start difference. First operand has 30 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:32:45,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:32:45,570 INFO L93 Difference]: Finished difference Result 51 states and 70 transitions. [2022-04-27 12:32:45,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 12:32:45,570 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-27 12:32:45,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:32:45,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:32:45,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-04-27 12:32:45,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:32:45,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-04-27 12:32:45,583 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 70 transitions. [2022-04-27 12:32:45,688 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:32:45,698 INFO L225 Difference]: With dead ends: 51 [2022-04-27 12:32:45,698 INFO L226 Difference]: Without dead ends: 25 [2022-04-27 12:32:45,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:32:45,707 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:32:45,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 33 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:32:45,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-27 12:32:45,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-27 12:32:45,749 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:32:45,750 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 12:32:45,751 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 12:32:45,752 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 12:32:45,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:32:45,758 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-27 12:32:45,758 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-27 12:32:45,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:32:45,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:32:45,761 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-27 12:32:45,762 INFO L87 Difference]: Start difference. First operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-27 12:32:45,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:32:45,771 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-27 12:32:45,771 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-27 12:32:45,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:32:45,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:32:45,772 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:32:45,772 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:32:45,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 12:32:45,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-04-27 12:32:45,775 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 18 [2022-04-27 12:32:45,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:32:45,776 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-04-27 12:32:45,776 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:32:45,776 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-27 12:32:45,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-27 12:32:45,777 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:32:45,777 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:32:45,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 12:32:45,777 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:32:45,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:32:45,778 INFO L85 PathProgramCache]: Analyzing trace with hash -73515422, now seen corresponding path program 1 times [2022-04-27 12:32:45,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:32:45,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567065812] [2022-04-27 12:32:45,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:32:45,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:32:45,810 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:32:45,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [725337304] [2022-04-27 12:32:45,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:32:45,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:32:45,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:32:45,815 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:32:45,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 12:32:45,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:32:45,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 12:32:45,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:32:45,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:32:46,247 INFO L272 TraceCheckUtils]: 0: Hoare triple {195#true} call ULTIMATE.init(); {195#true} is VALID [2022-04-27 12:32:46,248 INFO L290 TraceCheckUtils]: 1: Hoare triple {195#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {195#true} is VALID [2022-04-27 12:32:46,248 INFO L290 TraceCheckUtils]: 2: Hoare triple {195#true} assume true; {195#true} is VALID [2022-04-27 12:32:46,248 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {195#true} {195#true} #84#return; {195#true} is VALID [2022-04-27 12:32:46,248 INFO L272 TraceCheckUtils]: 4: Hoare triple {195#true} call #t~ret2 := main(); {195#true} is VALID [2022-04-27 12:32:46,248 INFO L290 TraceCheckUtils]: 5: Hoare triple {195#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {195#true} is VALID [2022-04-27 12:32:46,248 INFO L272 TraceCheckUtils]: 6: Hoare triple {195#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 100 then 1 else 0)); {195#true} is VALID [2022-04-27 12:32:46,249 INFO L290 TraceCheckUtils]: 7: Hoare triple {195#true} ~cond := #in~cond; {195#true} is VALID [2022-04-27 12:32:46,249 INFO L290 TraceCheckUtils]: 8: Hoare triple {195#true} assume !(0 == ~cond); {195#true} is VALID [2022-04-27 12:32:46,249 INFO L290 TraceCheckUtils]: 9: Hoare triple {195#true} assume true; {195#true} is VALID [2022-04-27 12:32:46,249 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {195#true} {195#true} #78#return; {195#true} is VALID [2022-04-27 12:32:46,250 INFO L290 TraceCheckUtils]: 11: Hoare triple {195#true} ~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {233#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:32:46,251 INFO L290 TraceCheckUtils]: 12: Hoare triple {233#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !false; {233#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:32:46,251 INFO L290 TraceCheckUtils]: 13: Hoare triple {233#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {240#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:32:46,252 INFO L290 TraceCheckUtils]: 14: Hoare triple {240#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !false; {240#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:32:46,253 INFO L272 TraceCheckUtils]: 15: Hoare triple {240#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {247#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:32:46,254 INFO L290 TraceCheckUtils]: 16: Hoare triple {247#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {251#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:32:46,254 INFO L290 TraceCheckUtils]: 17: Hoare triple {251#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {196#false} is VALID [2022-04-27 12:32:46,254 INFO L290 TraceCheckUtils]: 18: Hoare triple {196#false} assume !false; {196#false} is VALID [2022-04-27 12:32:46,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:32:46,255 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:32:46,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:32:46,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567065812] [2022-04-27 12:32:46,256 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:32:46,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725337304] [2022-04-27 12:32:46,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [725337304] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:32:46,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:32:46,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 12:32:46,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130701747] [2022-04-27 12:32:46,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:32:46,258 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-04-27 12:32:46,258 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:32:46,259 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:32:46,276 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:32:46,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 12:32:46,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:32:46,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 12:32:46,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-27 12:32:46,277 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:32:46,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:32:46,506 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-04-27 12:32:46,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 12:32:46,507 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-04-27 12:32:46,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:32:46,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:32:46,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-04-27 12:32:46,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:32:46,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-04-27 12:32:46,511 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 42 transitions. [2022-04-27 12:32:46,562 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:32:46,564 INFO L225 Difference]: With dead ends: 37 [2022-04-27 12:32:46,564 INFO L226 Difference]: Without dead ends: 34 [2022-04-27 12:32:46,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-27 12:32:46,566 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 8 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:32:46,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 92 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 12:32:46,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-27 12:32:46,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-27 12:32:46,577 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:32:46,578 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 12:32:46,580 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 12:32:46,582 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 12:32:46,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:32:46,588 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-27 12:32:46,589 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-27 12:32:46,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:32:46,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:32:46,590 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-27 12:32:46,590 INFO L87 Difference]: Start difference. First operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-27 12:32:46,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:32:46,594 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-27 12:32:46,594 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-27 12:32:46,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:32:46,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:32:46,596 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:32:46,596 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:32:46,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 12:32:46,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2022-04-27 12:32:46,604 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 19 [2022-04-27 12:32:46,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:32:46,604 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2022-04-27 12:32:46,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:32:46,605 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-27 12:32:46,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 12:32:46,607 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:32:46,607 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:32:46,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 12:32:46,831 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:32:46,832 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:32:46,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:32:46,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1211706883, now seen corresponding path program 1 times [2022-04-27 12:32:46,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:32:46,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938918580] [2022-04-27 12:32:46,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:32:46,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:32:46,853 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:32:46,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [62531773] [2022-04-27 12:32:46,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:32:46,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:32:46,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:32:46,860 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:32:46,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 12:32:46,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:32:46,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 12:32:46,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:32:46,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:32:47,341 INFO L272 TraceCheckUtils]: 0: Hoare triple {425#true} call ULTIMATE.init(); {425#true} is VALID [2022-04-27 12:32:47,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {425#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {425#true} is VALID [2022-04-27 12:32:47,341 INFO L290 TraceCheckUtils]: 2: Hoare triple {425#true} assume true; {425#true} is VALID [2022-04-27 12:32:47,341 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {425#true} {425#true} #84#return; {425#true} is VALID [2022-04-27 12:32:47,342 INFO L272 TraceCheckUtils]: 4: Hoare triple {425#true} call #t~ret2 := main(); {425#true} is VALID [2022-04-27 12:32:47,342 INFO L290 TraceCheckUtils]: 5: Hoare triple {425#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {425#true} is VALID [2022-04-27 12:32:47,342 INFO L272 TraceCheckUtils]: 6: Hoare triple {425#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 100 then 1 else 0)); {425#true} is VALID [2022-04-27 12:32:47,343 INFO L290 TraceCheckUtils]: 7: Hoare triple {425#true} ~cond := #in~cond; {451#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 12:32:47,343 INFO L290 TraceCheckUtils]: 8: Hoare triple {451#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {455#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:32:47,344 INFO L290 TraceCheckUtils]: 9: Hoare triple {455#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {455#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:32:47,344 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {455#(not (= |assume_abort_if_not_#in~cond| 0))} {425#true} #78#return; {462#(<= (mod main_~A~0 4294967296) 100)} is VALID [2022-04-27 12:32:47,345 INFO L290 TraceCheckUtils]: 11: Hoare triple {462#(<= (mod main_~A~0 4294967296) 100)} ~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {466#(and (<= (mod main_~A~0 4294967296) 100) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:32:47,346 INFO L290 TraceCheckUtils]: 12: Hoare triple {466#(and (<= (mod main_~A~0 4294967296) 100) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !false; {466#(and (<= (mod main_~A~0 4294967296) 100) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:32:47,346 INFO L290 TraceCheckUtils]: 13: Hoare triple {466#(and (<= (mod main_~A~0 4294967296) 100) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {466#(and (<= (mod main_~A~0 4294967296) 100) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:32:47,347 INFO L290 TraceCheckUtils]: 14: Hoare triple {466#(and (<= (mod main_~A~0 4294967296) 100) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !false; {466#(and (<= (mod main_~A~0 4294967296) 100) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:32:47,348 INFO L290 TraceCheckUtils]: 15: Hoare triple {466#(and (<= (mod main_~A~0 4294967296) 100) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {466#(and (<= (mod main_~A~0 4294967296) 100) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:32:47,348 INFO L290 TraceCheckUtils]: 16: Hoare triple {466#(and (<= (mod main_~A~0 4294967296) 100) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !false; {466#(and (<= (mod main_~A~0 4294967296) 100) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:32:47,349 INFO L272 TraceCheckUtils]: 17: Hoare triple {466#(and (<= (mod main_~A~0 4294967296) 100) (= 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)); {485#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:32:47,350 INFO L290 TraceCheckUtils]: 18: Hoare triple {485#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {489#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:32:47,350 INFO L290 TraceCheckUtils]: 19: Hoare triple {489#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {426#false} is VALID [2022-04-27 12:32:47,351 INFO L290 TraceCheckUtils]: 20: Hoare triple {426#false} assume !false; {426#false} is VALID [2022-04-27 12:32:47,351 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 12:32:47,351 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:32:47,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:32:47,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938918580] [2022-04-27 12:32:47,351 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:32:47,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62531773] [2022-04-27 12:32:47,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [62531773] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:32:47,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:32:47,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-27 12:32:47,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013322887] [2022-04-27 12:32:47,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:32:47,353 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-04-27 12:32:47,353 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:32:47,353 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:32:47,374 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:32:47,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 12:32:47,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:32:47,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 12:32:47,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-27 12:32:47,376 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:32:47,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:32:47,648 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-27 12:32:47,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 12:32:47,649 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-04-27 12:32:47,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:32:47,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:32:47,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 41 transitions. [2022-04-27 12:32:47,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:32:47,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 41 transitions. [2022-04-27 12:32:47,653 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 41 transitions. [2022-04-27 12:32:47,692 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:32:47,694 INFO L225 Difference]: With dead ends: 45 [2022-04-27 12:32:47,694 INFO L226 Difference]: Without dead ends: 42 [2022-04-27 12:32:47,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-27 12:32:47,695 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 19 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:32:47,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 98 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 12:32:47,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-27 12:32:47,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 33. [2022-04-27 12:32:47,704 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:32:47,705 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 33 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 12:32:47,705 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 33 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 12:32:47,705 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 33 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 12:32:47,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:32:47,707 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-04-27 12:32:47,707 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-27 12:32:47,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:32:47,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:32:47,708 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 42 states. [2022-04-27 12:32:47,708 INFO L87 Difference]: Start difference. First operand has 33 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 42 states. [2022-04-27 12:32:47,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:32:47,710 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-04-27 12:32:47,710 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-27 12:32:47,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:32:47,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:32:47,711 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:32:47,711 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:32:47,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 12:32:47,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2022-04-27 12:32:47,713 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 21 [2022-04-27 12:32:47,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:32:47,713 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2022-04-27 12:32:47,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:32:47,713 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-04-27 12:32:47,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 12:32:47,714 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:32:47,714 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, 1] [2022-04-27 12:32:47,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 12:32:47,927 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:32:47,928 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:32:47,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:32:47,928 INFO L85 PathProgramCache]: Analyzing trace with hash 947727214, now seen corresponding path program 1 times [2022-04-27 12:32:47,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:32:47,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115376953] [2022-04-27 12:32:47,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:32:47,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:32:47,944 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:32:47,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1046283564] [2022-04-27 12:32:47,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:32:47,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:32:47,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:32:47,946 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:32:47,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 12:32:47,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:32:47,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 12:32:47,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:32:47,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:32:48,111 INFO L272 TraceCheckUtils]: 0: Hoare triple {689#true} call ULTIMATE.init(); {689#true} is VALID [2022-04-27 12:32:48,111 INFO L290 TraceCheckUtils]: 1: Hoare triple {689#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {689#true} is VALID [2022-04-27 12:32:48,111 INFO L290 TraceCheckUtils]: 2: Hoare triple {689#true} assume true; {689#true} is VALID [2022-04-27 12:32:48,111 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {689#true} {689#true} #84#return; {689#true} is VALID [2022-04-27 12:32:48,112 INFO L272 TraceCheckUtils]: 4: Hoare triple {689#true} call #t~ret2 := main(); {689#true} is VALID [2022-04-27 12:32:48,112 INFO L290 TraceCheckUtils]: 5: Hoare triple {689#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {689#true} is VALID [2022-04-27 12:32:48,112 INFO L272 TraceCheckUtils]: 6: Hoare triple {689#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 100 then 1 else 0)); {689#true} is VALID [2022-04-27 12:32:48,113 INFO L290 TraceCheckUtils]: 7: Hoare triple {689#true} ~cond := #in~cond; {689#true} is VALID [2022-04-27 12:32:48,113 INFO L290 TraceCheckUtils]: 8: Hoare triple {689#true} assume !(0 == ~cond); {689#true} is VALID [2022-04-27 12:32:48,114 INFO L290 TraceCheckUtils]: 9: Hoare triple {689#true} assume true; {689#true} is VALID [2022-04-27 12:32:48,120 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {689#true} {689#true} #78#return; {689#true} is VALID [2022-04-27 12:32:48,121 INFO L290 TraceCheckUtils]: 11: Hoare triple {689#true} ~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {727#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-27 12:32:48,122 INFO L290 TraceCheckUtils]: 12: Hoare triple {727#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !false; {727#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-27 12:32:48,123 INFO L290 TraceCheckUtils]: 13: Hoare triple {727#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {727#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-27 12:32:48,123 INFO L290 TraceCheckUtils]: 14: Hoare triple {727#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !false; {727#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-27 12:32:48,123 INFO L272 TraceCheckUtils]: 15: Hoare triple {727#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {689#true} is VALID [2022-04-27 12:32:48,124 INFO L290 TraceCheckUtils]: 16: Hoare triple {689#true} ~cond := #in~cond; {689#true} is VALID [2022-04-27 12:32:48,124 INFO L290 TraceCheckUtils]: 17: Hoare triple {689#true} assume !(0 == ~cond); {689#true} is VALID [2022-04-27 12:32:48,124 INFO L290 TraceCheckUtils]: 18: Hoare triple {689#true} assume true; {689#true} is VALID [2022-04-27 12:32:48,127 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {689#true} {727#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} #80#return; {727#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-27 12:32:48,128 INFO L290 TraceCheckUtils]: 20: Hoare triple {727#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {690#false} is VALID [2022-04-27 12:32:48,128 INFO L290 TraceCheckUtils]: 21: Hoare triple {690#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {690#false} is VALID [2022-04-27 12:32:48,128 INFO L290 TraceCheckUtils]: 22: Hoare triple {690#false} assume !false; {690#false} is VALID [2022-04-27 12:32:48,128 INFO L272 TraceCheckUtils]: 23: Hoare triple {690#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {690#false} is VALID [2022-04-27 12:32:48,128 INFO L290 TraceCheckUtils]: 24: Hoare triple {690#false} ~cond := #in~cond; {690#false} is VALID [2022-04-27 12:32:48,129 INFO L290 TraceCheckUtils]: 25: Hoare triple {690#false} assume 0 == ~cond; {690#false} is VALID [2022-04-27 12:32:48,129 INFO L290 TraceCheckUtils]: 26: Hoare triple {690#false} assume !false; {690#false} is VALID [2022-04-27 12:32:48,129 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:32:48,129 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:32:48,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:32:48,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115376953] [2022-04-27 12:32:48,130 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:32:48,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046283564] [2022-04-27 12:32:48,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046283564] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:32:48,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:32:48,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 12:32:48,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905384709] [2022-04-27 12:32:48,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:32:48,131 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2022-04-27 12:32:48,131 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:32:48,131 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:32:48,156 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:32:48,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 12:32:48,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:32:48,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 12:32:48,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:32:48,158 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:32:48,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:32:48,237 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2022-04-27 12:32:48,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 12:32:48,237 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2022-04-27 12:32:48,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:32:48,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:32:48,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-04-27 12:32:48,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:32:48,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-04-27 12:32:48,241 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 48 transitions. [2022-04-27 12:32:48,287 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:32:48,288 INFO L225 Difference]: With dead ends: 57 [2022-04-27 12:32:48,289 INFO L226 Difference]: Without dead ends: 35 [2022-04-27 12:32:48,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:32:48,290 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:32:48,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:32:48,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-27 12:32:48,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-27 12:32:48,299 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:32:48,299 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 12:32:48,299 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 12:32:48,300 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 12:32:48,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:32:48,301 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-04-27 12:32:48,301 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-27 12:32:48,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:32:48,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:32:48,302 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 35 states. [2022-04-27 12:32:48,303 INFO L87 Difference]: Start difference. First operand has 35 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 35 states. [2022-04-27 12:32:48,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:32:48,304 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-04-27 12:32:48,304 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-27 12:32:48,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:32:48,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:32:48,305 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:32:48,305 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:32:48,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 12:32:48,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2022-04-27 12:32:48,306 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 27 [2022-04-27 12:32:48,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:32:48,307 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2022-04-27 12:32:48,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:32:48,307 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-27 12:32:48,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 12:32:48,308 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:32:48,308 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, 1] [2022-04-27 12:32:48,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 12:32:48,531 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:32:48,532 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:32:48,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:32:48,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1574040585, now seen corresponding path program 1 times [2022-04-27 12:32:48,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:32:48,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416808999] [2022-04-27 12:32:48,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:32:48,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:32:48,546 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:32:48,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [411158492] [2022-04-27 12:32:48,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:32:48,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:32:48,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:32:48,548 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:32:48,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 12:32:48,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:32:48,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-27 12:32:48,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:32:48,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:32:49,590 INFO L272 TraceCheckUtils]: 0: Hoare triple {966#true} call ULTIMATE.init(); {966#true} is VALID [2022-04-27 12:32:49,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {966#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {966#true} is VALID [2022-04-27 12:32:49,590 INFO L290 TraceCheckUtils]: 2: Hoare triple {966#true} assume true; {966#true} is VALID [2022-04-27 12:32:49,590 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {966#true} {966#true} #84#return; {966#true} is VALID [2022-04-27 12:32:49,590 INFO L272 TraceCheckUtils]: 4: Hoare triple {966#true} call #t~ret2 := main(); {966#true} is VALID [2022-04-27 12:32:49,591 INFO L290 TraceCheckUtils]: 5: Hoare triple {966#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {966#true} is VALID [2022-04-27 12:32:49,591 INFO L272 TraceCheckUtils]: 6: Hoare triple {966#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 100 then 1 else 0)); {966#true} is VALID [2022-04-27 12:32:49,591 INFO L290 TraceCheckUtils]: 7: Hoare triple {966#true} ~cond := #in~cond; {992#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 12:32:49,592 INFO L290 TraceCheckUtils]: 8: Hoare triple {992#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {996#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:32:49,592 INFO L290 TraceCheckUtils]: 9: Hoare triple {996#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {996#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:32:49,593 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {996#(not (= |assume_abort_if_not_#in~cond| 0))} {966#true} #78#return; {1003#(<= (mod main_~A~0 4294967296) 100)} is VALID [2022-04-27 12:32:49,593 INFO L290 TraceCheckUtils]: 11: Hoare triple {1003#(<= (mod main_~A~0 4294967296) 100)} ~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1007#(and (= main_~b~0 1) (<= (mod main_~A~0 4294967296) 100) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:32:49,594 INFO L290 TraceCheckUtils]: 12: Hoare triple {1007#(and (= main_~b~0 1) (<= (mod main_~A~0 4294967296) 100) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !false; {1007#(and (= main_~b~0 1) (<= (mod main_~A~0 4294967296) 100) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:32:49,595 INFO L290 TraceCheckUtils]: 13: Hoare triple {1007#(and (= main_~b~0 1) (<= (mod main_~A~0 4294967296) 100) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1014#(and (<= (mod main_~A~0 4294967296) 100) (= main_~b~0 2) (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 12:32:49,595 INFO L290 TraceCheckUtils]: 14: Hoare triple {1014#(and (<= (mod main_~A~0 4294967296) 100) (= main_~b~0 2) (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} assume !false; {1014#(and (<= (mod main_~A~0 4294967296) 100) (= main_~b~0 2) (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 12:32:49,596 INFO L290 TraceCheckUtils]: 15: Hoare triple {1014#(and (<= (mod main_~A~0 4294967296) 100) (= main_~b~0 2) (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1021#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (< (mod main_~r~0 4294967296) (mod main_~b~0 4294967296)) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 12:32:49,596 INFO L290 TraceCheckUtils]: 16: Hoare triple {1021#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (< (mod main_~r~0 4294967296) (mod main_~b~0 4294967296)) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} assume !false; {1021#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (< (mod main_~r~0 4294967296) (mod main_~b~0 4294967296)) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 12:32:49,597 INFO L272 TraceCheckUtils]: 17: Hoare triple {1021#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (< (mod main_~r~0 4294967296) (mod main_~b~0 4294967296)) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {966#true} is VALID [2022-04-27 12:32:49,597 INFO L290 TraceCheckUtils]: 18: Hoare triple {966#true} ~cond := #in~cond; {966#true} is VALID [2022-04-27 12:32:49,597 INFO L290 TraceCheckUtils]: 19: Hoare triple {966#true} assume !(0 == ~cond); {966#true} is VALID [2022-04-27 12:32:49,597 INFO L290 TraceCheckUtils]: 20: Hoare triple {966#true} assume true; {966#true} is VALID [2022-04-27 12:32:49,598 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {966#true} {1021#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (< (mod main_~r~0 4294967296) (mod main_~b~0 4294967296)) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} #80#return; {1021#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (< (mod main_~r~0 4294967296) (mod main_~b~0 4294967296)) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 12:32:49,599 INFO L290 TraceCheckUtils]: 22: Hoare triple {1021#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (< (mod main_~r~0 4294967296) (mod main_~b~0 4294967296)) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {1043#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (< (mod main_~r~0 4294967296) 2) (= main_~q~0 0))} is VALID [2022-04-27 12:32:49,599 INFO L290 TraceCheckUtils]: 23: Hoare triple {1043#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (< (mod main_~r~0 4294967296) 2) (= main_~q~0 0))} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1047#(and (= (+ main_~A~0 (* (- 1) main_~b~0)) main_~r~0) (= main_~b~0 1) (= (+ (- 1) main_~q~0) 0) (< (mod main_~A~0 4294967296) 2) (<= 1 (mod main_~A~0 4294967296)))} is VALID [2022-04-27 12:32:49,600 INFO L290 TraceCheckUtils]: 24: Hoare triple {1047#(and (= (+ main_~A~0 (* (- 1) main_~b~0)) main_~r~0) (= main_~b~0 1) (= (+ (- 1) main_~q~0) 0) (< (mod main_~A~0 4294967296) 2) (<= 1 (mod main_~A~0 4294967296)))} assume !false; {1047#(and (= (+ main_~A~0 (* (- 1) main_~b~0)) main_~r~0) (= main_~b~0 1) (= (+ (- 1) main_~q~0) 0) (< (mod main_~A~0 4294967296) 2) (<= 1 (mod main_~A~0 4294967296)))} is VALID [2022-04-27 12:32:49,602 INFO L272 TraceCheckUtils]: 25: Hoare triple {1047#(and (= (+ main_~A~0 (* (- 1) main_~b~0)) main_~r~0) (= main_~b~0 1) (= (+ (- 1) main_~q~0) 0) (< (mod main_~A~0 4294967296) 2) (<= 1 (mod main_~A~0 4294967296)))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1054#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:32:49,602 INFO L290 TraceCheckUtils]: 26: Hoare triple {1054#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1058#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:32:49,603 INFO L290 TraceCheckUtils]: 27: Hoare triple {1058#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {967#false} is VALID [2022-04-27 12:32:49,603 INFO L290 TraceCheckUtils]: 28: Hoare triple {967#false} assume !false; {967#false} is VALID [2022-04-27 12:32:49,603 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:32:49,603 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:32:56,227 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~b~0 4294967296))) (or (= (mod c_main_~A~0 4294967296) (mod (+ (* (div .cse0 2) (* c_main_~q~0 2)) c_main_~r~0) 4294967296)) (<= .cse0 (mod c_main_~r~0 4294967296)))) is different from true [2022-04-27 12:33:13,297 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 (mod (* c_main_~b~0 2) 4294967296)) (.cse0 (mod c_main_~r~0 4294967296))) (or (not (<= (mod c_main_~b~0 4294967296) .cse0)) (= (mod c_main_~A~0 4294967296) (mod (+ (* (div .cse1 2) (* c_main_~q~0 2)) c_main_~r~0) 4294967296)) (<= .cse1 .cse0))) is different from true [2022-04-27 12:33:26,375 INFO L290 TraceCheckUtils]: 28: Hoare triple {967#false} assume !false; {967#false} is VALID [2022-04-27 12:33:26,376 INFO L290 TraceCheckUtils]: 27: Hoare triple {1058#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {967#false} is VALID [2022-04-27 12:33:26,376 INFO L290 TraceCheckUtils]: 26: Hoare triple {1054#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1058#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:33:26,377 INFO L272 TraceCheckUtils]: 25: Hoare triple {1074#(= (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)); {1054#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:33:26,378 INFO L290 TraceCheckUtils]: 24: Hoare triple {1074#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} assume !false; {1074#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 12:33:28,391 WARN L290 TraceCheckUtils]: 23: Hoare triple {1074#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1074#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is UNKNOWN [2022-04-27 12:33:30,442 WARN L290 TraceCheckUtils]: 22: Hoare triple {1084#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296))} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {1074#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is UNKNOWN [2022-04-27 12:33:30,443 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {966#true} {1084#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296))} #80#return; {1084#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296))} is VALID [2022-04-27 12:33:30,443 INFO L290 TraceCheckUtils]: 20: Hoare triple {966#true} assume true; {966#true} is VALID [2022-04-27 12:33:30,443 INFO L290 TraceCheckUtils]: 19: Hoare triple {966#true} assume !(0 == ~cond); {966#true} is VALID [2022-04-27 12:33:30,443 INFO L290 TraceCheckUtils]: 18: Hoare triple {966#true} ~cond := #in~cond; {966#true} is VALID [2022-04-27 12:33:30,443 INFO L272 TraceCheckUtils]: 17: Hoare triple {1084#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {966#true} is VALID [2022-04-27 12:33:30,444 INFO L290 TraceCheckUtils]: 16: Hoare triple {1084#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296))} assume !false; {1084#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296))} is VALID [2022-04-27 12:33:30,444 INFO L290 TraceCheckUtils]: 15: Hoare triple {1106#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1084#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296))} is VALID [2022-04-27 12:33:30,445 INFO L290 TraceCheckUtils]: 14: Hoare triple {1106#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} assume !false; {1106#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-27 12:33:32,558 WARN L290 TraceCheckUtils]: 13: Hoare triple {1113#(or (= (mod main_~A~0 4294967296) (mod (+ (* (* main_~q~0 2) (div (mod (* main_~b~0 2) 4294967296) 2)) main_~r~0) 4294967296)) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (<= (mod (* main_~b~0 2) 4294967296) (mod main_~r~0 4294967296)))} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1106#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} is UNKNOWN [2022-04-27 12:33:32,559 INFO L290 TraceCheckUtils]: 12: Hoare triple {1113#(or (= (mod main_~A~0 4294967296) (mod (+ (* (* main_~q~0 2) (div (mod (* main_~b~0 2) 4294967296) 2)) main_~r~0) 4294967296)) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (<= (mod (* main_~b~0 2) 4294967296) (mod main_~r~0 4294967296)))} assume !false; {1113#(or (= (mod main_~A~0 4294967296) (mod (+ (* (* main_~q~0 2) (div (mod (* main_~b~0 2) 4294967296) 2)) main_~r~0) 4294967296)) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (<= (mod (* main_~b~0 2) 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-27 12:33:32,560 INFO L290 TraceCheckUtils]: 11: Hoare triple {966#true} ~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1113#(or (= (mod main_~A~0 4294967296) (mod (+ (* (* main_~q~0 2) (div (mod (* main_~b~0 2) 4294967296) 2)) main_~r~0) 4294967296)) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (<= (mod (* main_~b~0 2) 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-27 12:33:32,560 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {966#true} {966#true} #78#return; {966#true} is VALID [2022-04-27 12:33:32,560 INFO L290 TraceCheckUtils]: 9: Hoare triple {966#true} assume true; {966#true} is VALID [2022-04-27 12:33:32,560 INFO L290 TraceCheckUtils]: 8: Hoare triple {966#true} assume !(0 == ~cond); {966#true} is VALID [2022-04-27 12:33:32,560 INFO L290 TraceCheckUtils]: 7: Hoare triple {966#true} ~cond := #in~cond; {966#true} is VALID [2022-04-27 12:33:32,560 INFO L272 TraceCheckUtils]: 6: Hoare triple {966#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 100 then 1 else 0)); {966#true} is VALID [2022-04-27 12:33:32,560 INFO L290 TraceCheckUtils]: 5: Hoare triple {966#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {966#true} is VALID [2022-04-27 12:33:32,561 INFO L272 TraceCheckUtils]: 4: Hoare triple {966#true} call #t~ret2 := main(); {966#true} is VALID [2022-04-27 12:33:32,561 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {966#true} {966#true} #84#return; {966#true} is VALID [2022-04-27 12:33:32,561 INFO L290 TraceCheckUtils]: 2: Hoare triple {966#true} assume true; {966#true} is VALID [2022-04-27 12:33:32,561 INFO L290 TraceCheckUtils]: 1: Hoare triple {966#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {966#true} is VALID [2022-04-27 12:33:32,561 INFO L272 TraceCheckUtils]: 0: Hoare triple {966#true} call ULTIMATE.init(); {966#true} is VALID [2022-04-27 12:33:32,561 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-04-27 12:33:32,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:33:32,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416808999] [2022-04-27 12:33:32,561 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:33:32,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [411158492] [2022-04-27 12:33:32,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [411158492] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:33:32,562 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:33:32,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 16 [2022-04-27 12:33:32,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687832481] [2022-04-27 12:33:32,562 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:33:32,562 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0625) internal successors, (33), 14 states have internal predecessors, (33), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 29 [2022-04-27 12:33:32,563 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:33:32,563 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.0625) internal successors, (33), 14 states have internal predecessors, (33), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 12:33:38,786 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 42 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-27 12:33:38,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-27 12:33:38,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:33:38,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-27 12:33:38,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=142, Unknown=3, NotChecked=50, Total=240 [2022-04-27 12:33:38,787 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 16 states, 16 states have (on average 2.0625) internal successors, (33), 14 states have internal predecessors, (33), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 12:33:56,506 WARN L232 SmtUtils]: Spent 10.68s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 12:34:03,408 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:34:05,420 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:34:07,795 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:34:09,987 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:34:12,205 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:34:14,358 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:34:19,156 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:34:21,540 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:34:23,757 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:34:25,876 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:34:28,361 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:34:34,998 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:34:37,654 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:34:39,880 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:34:42,338 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:34:42,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:34:42,526 INFO L93 Difference]: Finished difference Result 85 states and 102 transitions. [2022-04-27 12:34:42,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-27 12:34:42,526 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0625) internal successors, (33), 14 states have internal predecessors, (33), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 29 [2022-04-27 12:34:42,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:34:42,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.0625) internal successors, (33), 14 states have internal predecessors, (33), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 12:34:42,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 77 transitions. [2022-04-27 12:34:42,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.0625) internal successors, (33), 14 states have internal predecessors, (33), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 12:34:42,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 77 transitions. [2022-04-27 12:34:42,532 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 77 transitions. [2022-04-27 12:34:46,834 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 75 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-27 12:34:46,836 INFO L225 Difference]: With dead ends: 85 [2022-04-27 12:34:46,836 INFO L226 Difference]: Without dead ends: 64 [2022-04-27 12:34:46,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 21.7s TimeCoverageRelationStatistics Valid=72, Invalid=238, Unknown=4, NotChecked=66, Total=380 [2022-04-27 12:34:46,840 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 36 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 22 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 96 IncrementalHoareTripleChecker+Unchecked, 33.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:34:46,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 155 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 204 Invalid, 15 Unknown, 96 Unchecked, 33.0s Time] [2022-04-27 12:34:46,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-27 12:34:46,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2022-04-27 12:34:46,864 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:34:46,865 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 60 states, 43 states have (on average 1.186046511627907) internal successors, (51), 45 states have internal predecessors, (51), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 12:34:46,865 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 60 states, 43 states have (on average 1.186046511627907) internal successors, (51), 45 states have internal predecessors, (51), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 12:34:46,865 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 60 states, 43 states have (on average 1.186046511627907) internal successors, (51), 45 states have internal predecessors, (51), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 12:34:46,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:34:46,868 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2022-04-27 12:34:46,868 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 74 transitions. [2022-04-27 12:34:46,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:34:46,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:34:46,869 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 43 states have (on average 1.186046511627907) internal successors, (51), 45 states have internal predecessors, (51), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 64 states. [2022-04-27 12:34:46,869 INFO L87 Difference]: Start difference. First operand has 60 states, 43 states have (on average 1.186046511627907) internal successors, (51), 45 states have internal predecessors, (51), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 64 states. [2022-04-27 12:34:46,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:34:46,872 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2022-04-27 12:34:46,872 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 74 transitions. [2022-04-27 12:34:46,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:34:46,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:34:46,872 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:34:46,872 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:34:46,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 43 states have (on average 1.186046511627907) internal successors, (51), 45 states have internal predecessors, (51), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 12:34:46,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2022-04-27 12:34:46,875 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 29 [2022-04-27 12:34:46,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:34:46,875 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2022-04-27 12:34:46,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0625) internal successors, (33), 14 states have internal predecessors, (33), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 12:34:46,876 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2022-04-27 12:34:46,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-27 12:34:46,876 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:34:46,876 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 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:34:46,890 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:34:47,077 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:34:47,077 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:34:47,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:34:47,077 INFO L85 PathProgramCache]: Analyzing trace with hash -414186241, now seen corresponding path program 2 times [2022-04-27 12:34:47,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:34:47,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699392154] [2022-04-27 12:34:47,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:34:47,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:34:47,091 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:34:47,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [22608225] [2022-04-27 12:34:47,091 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 12:34:47,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:34:47,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:34:47,092 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:34:47,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process