/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_valuebound20.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 12:33:04,676 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 12:33:04,678 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 12:33:04,729 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 12:33:04,729 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 12:33:04,731 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 12:33:04,733 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 12:33:04,735 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 12:33:04,737 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 12:33:04,741 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 12:33:04,742 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 12:33:04,743 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 12:33:04,743 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 12:33:04,745 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 12:33:04,746 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 12:33:04,748 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 12:33:04,749 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 12:33:04,749 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 12:33:04,751 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 12:33:04,756 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 12:33:04,758 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 12:33:04,759 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 12:33:04,760 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 12:33:04,760 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 12:33:04,761 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 12:33:04,767 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 12:33:04,768 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 12:33:04,768 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 12:33:04,769 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 12:33:04,769 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 12:33:04,770 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 12:33:04,770 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 12:33:04,772 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 12:33:04,772 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 12:33:04,773 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 12:33:04,773 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 12:33:04,774 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 12:33:04,774 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 12:33:04,774 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 12:33:04,775 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 12:33:04,775 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 12:33:04,777 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 12:33:04,777 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:33:04,805 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 12:33:04,806 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 12:33:04,806 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 12:33:04,806 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 12:33:04,807 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 12:33:04,807 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 12:33:04,807 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 12:33:04,807 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 12:33:04,807 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 12:33:04,808 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 12:33:04,808 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 12:33:04,808 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 12:33:04,809 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 12:33:04,809 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 12:33:04,809 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 12:33:04,809 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 12:33:04,809 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 12:33:04,810 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 12:33:04,810 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 12:33:04,810 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 12:33:04,811 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 12:33:04,811 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 12:33:04,811 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 12:33:04,811 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 12:33:04,811 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 12:33:04,811 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 12:33:04,812 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 12:33:04,812 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 12:33:04,812 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 12:33:04,812 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 12:33:04,812 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 12:33:04,812 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 12:33:04,812 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 12:33:04,813 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:33:04,999 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 12:33:05,018 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 12:33:05,020 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 12:33:05,021 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 12:33:05,022 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 12:33:05,023 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/divbin2_valuebound20.i [2022-04-27 12:33:05,087 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/527e49274/592b751cdfb743fd9ae0ed114b0d3156/FLAG5a17cd1e3 [2022-04-27 12:33:05,525 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 12:33:05,526 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin2_valuebound20.i [2022-04-27 12:33:05,534 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/527e49274/592b751cdfb743fd9ae0ed114b0d3156/FLAG5a17cd1e3 [2022-04-27 12:33:05,552 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/527e49274/592b751cdfb743fd9ae0ed114b0d3156 [2022-04-27 12:33:05,554 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 12:33:05,556 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 12:33:05,564 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 12:33:05,565 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 12:33:05,568 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 12:33:05,569 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 12:33:05" (1/1) ... [2022-04-27 12:33:05,570 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b6551a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:33:05, skipping insertion in model container [2022-04-27 12:33:05,570 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 12:33:05" (1/1) ... [2022-04-27 12:33:05,576 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 12:33:05,592 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 12:33:05,730 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_valuebound20.i[951,964] [2022-04-27 12:33:05,762 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 12:33:05,775 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 12:33:05,799 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_valuebound20.i[951,964] [2022-04-27 12:33:05,804 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 12:33:05,815 INFO L208 MainTranslator]: Completed translation [2022-04-27 12:33:05,816 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:33:05 WrapperNode [2022-04-27 12:33:05,816 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 12:33:05,816 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 12:33:05,817 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 12:33:05,817 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 12:33:05,825 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:33:05" (1/1) ... [2022-04-27 12:33:05,825 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:33:05" (1/1) ... [2022-04-27 12:33:05,831 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:33:05" (1/1) ... [2022-04-27 12:33:05,831 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:33:05" (1/1) ... [2022-04-27 12:33:05,836 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:33:05" (1/1) ... [2022-04-27 12:33:05,841 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:33:05" (1/1) ... [2022-04-27 12:33:05,842 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:33:05" (1/1) ... [2022-04-27 12:33:05,843 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 12:33:05,844 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 12:33:05,844 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 12:33:05,844 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 12:33:05,845 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:33:05" (1/1) ... [2022-04-27 12:33:05,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 12:33:05,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:33:05,873 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:33:05,886 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:33:05,920 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 12:33:05,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 12:33:05,921 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 12:33:05,922 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 12:33:05,922 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 12:33:05,922 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 12:33:05,922 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 12:33:05,923 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 12:33:05,923 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 12:33:05,923 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 12:33:05,923 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 12:33:05,923 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 12:33:05,923 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 12:33:05,923 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 12:33:05,923 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 12:33:05,923 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 12:33:05,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 12:33:05,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 12:33:05,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 12:33:05,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 12:33:05,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 12:33:05,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 12:33:06,006 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 12:33:06,008 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 12:33:06,187 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 12:33:06,200 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 12:33:06,200 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 12:33:06,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 12:33:06 BoogieIcfgContainer [2022-04-27 12:33:06,201 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 12:33:06,202 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 12:33:06,203 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 12:33:06,212 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 12:33:06,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 12:33:05" (1/3) ... [2022-04-27 12:33:06,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b46a694 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 12:33:06, skipping insertion in model container [2022-04-27 12:33:06,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:33:05" (2/3) ... [2022-04-27 12:33:06,214 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b46a694 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 12:33:06, skipping insertion in model container [2022-04-27 12:33:06,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 12:33:06" (3/3) ... [2022-04-27 12:33:06,215 INFO L111 eAbstractionObserver]: Analyzing ICFG divbin2_valuebound20.i [2022-04-27 12:33:06,244 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 12:33:06,245 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 12:33:06,324 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 12:33:06,352 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@611b9cd5, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2e32c432 [2022-04-27 12:33:06,353 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 12:33:06,361 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:33:06,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 12:33:06,368 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:33:06,368 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:33:06,369 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:33:06,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:33:06,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1171333446, now seen corresponding path program 1 times [2022-04-27 12:33:06,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:33:06,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723164866] [2022-04-27 12:33:06,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:33:06,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:33:06,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:33:06,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 12:33:06,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:33:06,602 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:33:06,603 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-27 12:33:06,603 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} #84#return; {33#true} is VALID [2022-04-27 12:33:06,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 12:33:06,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:33:06,620 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-27 12:33:06,621 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-27 12:33:06,621 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-27 12:33:06,623 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#false} {33#true} #78#return; {34#false} is VALID [2022-04-27 12:33:06,624 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:33:06,625 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:33:06,625 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-27 12:33:06,625 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #84#return; {33#true} is VALID [2022-04-27 12:33:06,629 INFO L272 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret2 := main(); {33#true} is VALID [2022-04-27 12:33:06,629 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:33:06,630 INFO L272 TraceCheckUtils]: 6: Hoare triple {33#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 20 then 1 else 0)); {33#true} is VALID [2022-04-27 12:33:06,630 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-27 12:33:06,631 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-27 12:33:06,632 INFO L290 TraceCheckUtils]: 9: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-27 12:33:06,632 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {34#false} {33#true} #78#return; {34#false} is VALID [2022-04-27 12:33:06,632 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:33:06,633 INFO L290 TraceCheckUtils]: 12: Hoare triple {34#false} assume !true; {34#false} is VALID [2022-04-27 12:33:06,633 INFO L290 TraceCheckUtils]: 13: Hoare triple {34#false} assume !true; {34#false} is VALID [2022-04-27 12:33:06,634 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:33:06,635 INFO L290 TraceCheckUtils]: 15: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2022-04-27 12:33:06,635 INFO L290 TraceCheckUtils]: 16: Hoare triple {34#false} assume 0 == ~cond; {34#false} is VALID [2022-04-27 12:33:06,636 INFO L290 TraceCheckUtils]: 17: Hoare triple {34#false} assume !false; {34#false} is VALID [2022-04-27 12:33:06,636 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:33:06,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:33:06,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723164866] [2022-04-27 12:33:06,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723164866] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:33:06,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:33:06,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 12:33:06,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253572297] [2022-04-27 12:33:06,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:33:06,647 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:33:06,648 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:33:06,652 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:33:06,696 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:33:06,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 12:33:06,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:33:06,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 12:33:06,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:33:06,729 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:33:06,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:33:06,862 INFO L93 Difference]: Finished difference Result 51 states and 70 transitions. [2022-04-27 12:33:06,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 12:33:06,863 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:33:06,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:33:06,865 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:33:06,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-04-27 12:33:06,878 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:33:06,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-04-27 12:33:06,890 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 70 transitions. [2022-04-27 12:33:06,967 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:33:06,974 INFO L225 Difference]: With dead ends: 51 [2022-04-27 12:33:06,975 INFO L226 Difference]: Without dead ends: 25 [2022-04-27 12:33:06,977 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:33:06,980 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:33:06,981 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:33:06,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-27 12:33:07,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-27 12:33:07,004 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:33:07,005 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:33:07,006 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:33:07,007 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:33:07,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:33:07,010 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-27 12:33:07,011 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-27 12:33:07,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:33:07,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:33:07,012 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:33:07,013 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:33:07,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:33:07,019 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-27 12:33:07,024 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-27 12:33:07,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:33:07,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:33:07,025 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:33:07,025 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:33:07,025 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:33:07,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-04-27 12:33:07,029 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 18 [2022-04-27 12:33:07,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:33:07,030 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-04-27 12:33:07,031 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:33:07,031 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-27 12:33:07,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-27 12:33:07,032 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:33:07,032 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:33:07,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 12:33:07,032 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:33:07,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:33:07,040 INFO L85 PathProgramCache]: Analyzing trace with hash -73515422, now seen corresponding path program 1 times [2022-04-27 12:33:07,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:33:07,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405786836] [2022-04-27 12:33:07,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:33:07,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:33:07,063 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:33:07,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [986765383] [2022-04-27 12:33:07,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:33:07,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:33:07,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:33:07,075 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:33:07,118 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:33:07,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:33:07,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 12:33:07,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:33:07,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:33:07,567 INFO L272 TraceCheckUtils]: 0: Hoare triple {195#true} call ULTIMATE.init(); {195#true} is VALID [2022-04-27 12:33:07,567 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:33:07,568 INFO L290 TraceCheckUtils]: 2: Hoare triple {195#true} assume true; {195#true} is VALID [2022-04-27 12:33:07,568 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {195#true} {195#true} #84#return; {195#true} is VALID [2022-04-27 12:33:07,568 INFO L272 TraceCheckUtils]: 4: Hoare triple {195#true} call #t~ret2 := main(); {195#true} is VALID [2022-04-27 12:33:07,568 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:33:07,568 INFO L272 TraceCheckUtils]: 6: Hoare triple {195#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 20 then 1 else 0)); {195#true} is VALID [2022-04-27 12:33:07,568 INFO L290 TraceCheckUtils]: 7: Hoare triple {195#true} ~cond := #in~cond; {195#true} is VALID [2022-04-27 12:33:07,569 INFO L290 TraceCheckUtils]: 8: Hoare triple {195#true} assume !(0 == ~cond); {195#true} is VALID [2022-04-27 12:33:07,569 INFO L290 TraceCheckUtils]: 9: Hoare triple {195#true} assume true; {195#true} is VALID [2022-04-27 12:33:07,569 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {195#true} {195#true} #78#return; {195#true} is VALID [2022-04-27 12:33:07,570 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:33:07,570 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:33:07,571 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:33:07,572 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:33:07,573 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:33:07,573 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:33:07,574 INFO L290 TraceCheckUtils]: 17: Hoare triple {251#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {196#false} is VALID [2022-04-27 12:33:07,574 INFO L290 TraceCheckUtils]: 18: Hoare triple {196#false} assume !false; {196#false} is VALID [2022-04-27 12:33:07,574 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:33:07,574 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:33:07,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:33:07,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405786836] [2022-04-27 12:33:07,575 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:33:07,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986765383] [2022-04-27 12:33:07,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986765383] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:33:07,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:33:07,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 12:33:07,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962575485] [2022-04-27 12:33:07,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:33:07,577 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:33:07,577 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:33:07,578 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:33:07,595 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:33:07,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 12:33:07,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:33:07,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 12:33:07,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-27 12:33:07,596 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:33:09,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:33:09,965 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-04-27 12:33:09,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 12:33:09,965 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:33:09,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:33:09,966 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:33:09,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-04-27 12:33:09,968 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:33:09,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-04-27 12:33:09,969 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 42 transitions. [2022-04-27 12:33:10,016 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:33:10,017 INFO L225 Difference]: With dead ends: 37 [2022-04-27 12:33:10,018 INFO L226 Difference]: Without dead ends: 34 [2022-04-27 12:33:10,018 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:33:10,019 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:33:10,020 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:33:10,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-27 12:33:10,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-27 12:33:10,026 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:33:10,026 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:33:10,027 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:33:10,027 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:33:10,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:33:10,029 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-27 12:33:10,029 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-27 12:33:10,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:33:10,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:33:10,030 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:33:10,030 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:33:10,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:33:10,032 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-27 12:33:10,033 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-27 12:33:10,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:33:10,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:33:10,033 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:33:10,033 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:33:10,034 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:33:10,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2022-04-27 12:33:10,035 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 19 [2022-04-27 12:33:10,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:33:10,036 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2022-04-27 12:33:10,036 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:33:10,036 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-27 12:33:10,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 12:33:10,037 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:33:10,037 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:33:10,065 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:33:10,237 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:33:10,238 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:33:10,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:33:10,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1211706883, now seen corresponding path program 1 times [2022-04-27 12:33:10,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:33:10,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843356175] [2022-04-27 12:33:10,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:33:10,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:33:10,254 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:33:10,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [345895319] [2022-04-27 12:33:10,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:33:10,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:33:10,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:33:10,256 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:33:10,257 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:33:10,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:33:10,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 12:33:10,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:33:10,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:33:10,791 INFO L272 TraceCheckUtils]: 0: Hoare triple {425#true} call ULTIMATE.init(); {425#true} is VALID [2022-04-27 12:33:10,791 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:33:10,792 INFO L290 TraceCheckUtils]: 2: Hoare triple {425#true} assume true; {425#true} is VALID [2022-04-27 12:33:10,792 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {425#true} {425#true} #84#return; {425#true} is VALID [2022-04-27 12:33:10,792 INFO L272 TraceCheckUtils]: 4: Hoare triple {425#true} call #t~ret2 := main(); {425#true} is VALID [2022-04-27 12:33:10,792 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:33:10,792 INFO L272 TraceCheckUtils]: 6: Hoare triple {425#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 20 then 1 else 0)); {425#true} is VALID [2022-04-27 12:33:10,793 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:33:10,793 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:33:10,794 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:33:10,795 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) 20)} is VALID [2022-04-27 12:33:10,795 INFO L290 TraceCheckUtils]: 11: Hoare triple {462#(<= (mod main_~A~0 4294967296) 20)} ~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {466#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 20) (= main_~q~0 0))} is VALID [2022-04-27 12:33:10,796 INFO L290 TraceCheckUtils]: 12: Hoare triple {466#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 20) (= main_~q~0 0))} assume !false; {466#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 20) (= main_~q~0 0))} is VALID [2022-04-27 12:33:10,797 INFO L290 TraceCheckUtils]: 13: Hoare triple {466#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 20) (= main_~q~0 0))} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {466#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 20) (= main_~q~0 0))} is VALID [2022-04-27 12:33:10,797 INFO L290 TraceCheckUtils]: 14: Hoare triple {466#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 20) (= main_~q~0 0))} assume !false; {466#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 20) (= main_~q~0 0))} is VALID [2022-04-27 12:33:10,798 INFO L290 TraceCheckUtils]: 15: Hoare triple {466#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 20) (= main_~q~0 0))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {466#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 20) (= main_~q~0 0))} is VALID [2022-04-27 12:33:10,798 INFO L290 TraceCheckUtils]: 16: Hoare triple {466#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 20) (= main_~q~0 0))} assume !false; {466#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 20) (= main_~q~0 0))} is VALID [2022-04-27 12:33:10,799 INFO L272 TraceCheckUtils]: 17: Hoare triple {466#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 20) (= 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:33:10,800 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:33:10,800 INFO L290 TraceCheckUtils]: 19: Hoare triple {489#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {426#false} is VALID [2022-04-27 12:33:10,800 INFO L290 TraceCheckUtils]: 20: Hoare triple {426#false} assume !false; {426#false} is VALID [2022-04-27 12:33:10,801 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:33:10,801 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:33:10,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:33:10,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843356175] [2022-04-27 12:33:10,801 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:33:10,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345895319] [2022-04-27 12:33:10,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345895319] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:33:10,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:33:10,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-27 12:33:10,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271433952] [2022-04-27 12:33:10,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:33:10,803 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:33:10,803 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:33:10,803 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:33:10,825 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:33:10,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 12:33:10,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:33:10,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 12:33:10,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-27 12:33:10,827 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:33:11,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:33:11,201 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-27 12:33:11,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 12:33:11,202 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:33:11,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:33:11,202 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:33:11,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 41 transitions. [2022-04-27 12:33:11,204 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:33:11,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 41 transitions. [2022-04-27 12:33:11,206 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 41 transitions. [2022-04-27 12:33:11,252 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:33:11,253 INFO L225 Difference]: With dead ends: 45 [2022-04-27 12:33:11,254 INFO L226 Difference]: Without dead ends: 42 [2022-04-27 12:33:11,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-27 12:33:11,255 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:33:11,255 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:33:11,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-27 12:33:11,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 33. [2022-04-27 12:33:11,263 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:33:11,264 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:33:11,264 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:33:11,264 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:33:11,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:33:11,266 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-04-27 12:33:11,267 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-27 12:33:11,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:33:11,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:33:11,267 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:33:11,268 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:33:11,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:33:11,270 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-04-27 12:33:11,270 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-27 12:33:11,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:33:11,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:33:11,271 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:33:11,271 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:33:11,271 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:33:11,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2022-04-27 12:33:11,272 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 21 [2022-04-27 12:33:11,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:33:11,273 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2022-04-27 12:33:11,273 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:33:11,273 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-04-27 12:33:11,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 12:33:11,274 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:33:11,274 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:33:11,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-27 12:33:11,474 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:33:11,475 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:33:11,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:33:11,476 INFO L85 PathProgramCache]: Analyzing trace with hash 947727214, now seen corresponding path program 1 times [2022-04-27 12:33:11,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:33:11,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255428561] [2022-04-27 12:33:11,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:33:11,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:33:11,491 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:33:11,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [181891810] [2022-04-27 12:33:11,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:33:11,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:33:11,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:33:11,493 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:33:11,525 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:33:11,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:33:11,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 12:33:11,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:33:11,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:33:11,650 INFO L272 TraceCheckUtils]: 0: Hoare triple {689#true} call ULTIMATE.init(); {689#true} is VALID [2022-04-27 12:33:11,650 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:33:11,650 INFO L290 TraceCheckUtils]: 2: Hoare triple {689#true} assume true; {689#true} is VALID [2022-04-27 12:33:11,651 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {689#true} {689#true} #84#return; {689#true} is VALID [2022-04-27 12:33:11,651 INFO L272 TraceCheckUtils]: 4: Hoare triple {689#true} call #t~ret2 := main(); {689#true} is VALID [2022-04-27 12:33:11,651 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:33:11,651 INFO L272 TraceCheckUtils]: 6: Hoare triple {689#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 20 then 1 else 0)); {689#true} is VALID [2022-04-27 12:33:11,651 INFO L290 TraceCheckUtils]: 7: Hoare triple {689#true} ~cond := #in~cond; {689#true} is VALID [2022-04-27 12:33:11,652 INFO L290 TraceCheckUtils]: 8: Hoare triple {689#true} assume !(0 == ~cond); {689#true} is VALID [2022-04-27 12:33:11,652 INFO L290 TraceCheckUtils]: 9: Hoare triple {689#true} assume true; {689#true} is VALID [2022-04-27 12:33:11,652 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {689#true} {689#true} #78#return; {689#true} is VALID [2022-04-27 12:33:11,654 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:33:11,654 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:33:11,656 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:33:11,657 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:33:11,657 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:33:11,665 INFO L290 TraceCheckUtils]: 16: Hoare triple {689#true} ~cond := #in~cond; {689#true} is VALID [2022-04-27 12:33:11,666 INFO L290 TraceCheckUtils]: 17: Hoare triple {689#true} assume !(0 == ~cond); {689#true} is VALID [2022-04-27 12:33:11,666 INFO L290 TraceCheckUtils]: 18: Hoare triple {689#true} assume true; {689#true} is VALID [2022-04-27 12:33:11,668 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:33:11,670 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:33:11,670 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:33:11,670 INFO L290 TraceCheckUtils]: 22: Hoare triple {690#false} assume !false; {690#false} is VALID [2022-04-27 12:33:11,670 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:33:11,670 INFO L290 TraceCheckUtils]: 24: Hoare triple {690#false} ~cond := #in~cond; {690#false} is VALID [2022-04-27 12:33:11,670 INFO L290 TraceCheckUtils]: 25: Hoare triple {690#false} assume 0 == ~cond; {690#false} is VALID [2022-04-27 12:33:11,671 INFO L290 TraceCheckUtils]: 26: Hoare triple {690#false} assume !false; {690#false} is VALID [2022-04-27 12:33:11,671 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:33:11,671 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:33:11,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:33:11,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255428561] [2022-04-27 12:33:11,672 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:33:11,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181891810] [2022-04-27 12:33:11,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181891810] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:33:11,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:33:11,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 12:33:11,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628792376] [2022-04-27 12:33:11,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:33:11,673 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:33:11,674 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:33:11,674 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:33:11,700 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:33:11,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 12:33:11,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:33:11,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 12:33:11,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:33:11,701 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:33:11,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:33:11,809 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2022-04-27 12:33:11,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 12:33:11,809 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:33:11,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:33:11,810 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:33:11,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-04-27 12:33:11,812 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:33:11,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-04-27 12:33:11,813 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 48 transitions. [2022-04-27 12:33:11,867 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:33:11,868 INFO L225 Difference]: With dead ends: 57 [2022-04-27 12:33:11,868 INFO L226 Difference]: Without dead ends: 35 [2022-04-27 12:33:11,869 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:33:11,870 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:33:11,870 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:33:11,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-27 12:33:11,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-27 12:33:11,880 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:33:11,880 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:33:11,880 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:33:11,881 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:33:11,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:33:11,882 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-04-27 12:33:11,882 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-27 12:33:11,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:33:11,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:33:11,883 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:33:11,884 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:33:11,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:33:11,885 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-04-27 12:33:11,885 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-27 12:33:11,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:33:11,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:33:11,886 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:33:11,886 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:33:11,887 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:33:11,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2022-04-27 12:33:11,888 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 27 [2022-04-27 12:33:11,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:33:11,888 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2022-04-27 12:33:11,889 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:33:11,889 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-27 12:33:11,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 12:33:11,890 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:33:11,890 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:33:11,917 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:33:12,103 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:33:12,104 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:33:12,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:33:12,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1574040585, now seen corresponding path program 1 times [2022-04-27 12:33:12,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:33:12,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77377241] [2022-04-27 12:33:12,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:33:12,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:33:12,122 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:33:12,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1283532988] [2022-04-27 12:33:12,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:33:12,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:33:12,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:33:12,124 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:33:12,144 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:33:12,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:33:12,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-27 12:33:12,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:33:12,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:33:13,388 INFO L272 TraceCheckUtils]: 0: Hoare triple {966#true} call ULTIMATE.init(); {966#true} is VALID [2022-04-27 12:33:13,389 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:13,389 INFO L290 TraceCheckUtils]: 2: Hoare triple {966#true} assume true; {966#true} is VALID [2022-04-27 12:33:13,389 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {966#true} {966#true} #84#return; {966#true} is VALID [2022-04-27 12:33:13,389 INFO L272 TraceCheckUtils]: 4: Hoare triple {966#true} call #t~ret2 := main(); {966#true} is VALID [2022-04-27 12:33:13,389 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:13,390 INFO L272 TraceCheckUtils]: 6: Hoare triple {966#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 20 then 1 else 0)); {966#true} is VALID [2022-04-27 12:33:13,390 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:33:13,391 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:33:13,391 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:33:13,392 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) 20)} is VALID [2022-04-27 12:33:13,393 INFO L290 TraceCheckUtils]: 11: Hoare triple {1003#(<= (mod main_~A~0 4294967296) 20)} ~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1007#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 20) (= main_~q~0 0))} is VALID [2022-04-27 12:33:13,393 INFO L290 TraceCheckUtils]: 12: Hoare triple {1007#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 20) (= main_~q~0 0))} assume !false; {1007#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 20) (= main_~q~0 0))} is VALID [2022-04-27 12:33:13,394 INFO L290 TraceCheckUtils]: 13: Hoare triple {1007#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 20) (= main_~q~0 0))} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1014#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 20) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 12:33:13,395 INFO L290 TraceCheckUtils]: 14: Hoare triple {1014#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 20) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} assume !false; {1014#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 20) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 12:33:13,395 INFO L290 TraceCheckUtils]: 15: Hoare triple {1014#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 20) (<= 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:33:13,396 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:33:13,396 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:33:13,396 INFO L290 TraceCheckUtils]: 18: Hoare triple {966#true} ~cond := #in~cond; {966#true} is VALID [2022-04-27 12:33:13,396 INFO L290 TraceCheckUtils]: 19: Hoare triple {966#true} assume !(0 == ~cond); {966#true} is VALID [2022-04-27 12:33:13,397 INFO L290 TraceCheckUtils]: 20: Hoare triple {966#true} assume true; {966#true} is VALID [2022-04-27 12:33:13,397 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:33:13,404 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:33:13,406 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:33:13,407 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:33:13,417 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:33:13,417 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:13,418 INFO L290 TraceCheckUtils]: 27: Hoare triple {1058#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {967#false} is VALID [2022-04-27 12:33:13,418 INFO L290 TraceCheckUtils]: 28: Hoare triple {967#false} assume !false; {967#false} is VALID [2022-04-27 12:33:13,418 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:33:13,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:33:19,927 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:53,582 WARN L232 SmtUtils]: Spent 6.41s 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:02,295 INFO L290 TraceCheckUtils]: 28: Hoare triple {967#false} assume !false; {967#false} is VALID [2022-04-27 12:34:02,295 INFO L290 TraceCheckUtils]: 27: Hoare triple {1058#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {967#false} is VALID [2022-04-27 12:34:02,296 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:34:02,297 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:34:02,297 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:34:03,966 INFO 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 VALID [2022-04-27 12:34:05,969 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:34:05,970 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:34:05,970 INFO L290 TraceCheckUtils]: 20: Hoare triple {966#true} assume true; {966#true} is VALID [2022-04-27 12:34:05,970 INFO L290 TraceCheckUtils]: 19: Hoare triple {966#true} assume !(0 == ~cond); {966#true} is VALID [2022-04-27 12:34:05,970 INFO L290 TraceCheckUtils]: 18: Hoare triple {966#true} ~cond := #in~cond; {966#true} is VALID [2022-04-27 12:34:05,970 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:34:05,971 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:34:05,972 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:34:05,972 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:34:08,098 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:34:08,099 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:34:08,100 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:34:08,100 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {966#true} {966#true} #78#return; {966#true} is VALID [2022-04-27 12:34:08,100 INFO L290 TraceCheckUtils]: 9: Hoare triple {966#true} assume true; {966#true} is VALID [2022-04-27 12:34:08,100 INFO L290 TraceCheckUtils]: 8: Hoare triple {966#true} assume !(0 == ~cond); {966#true} is VALID [2022-04-27 12:34:08,100 INFO L290 TraceCheckUtils]: 7: Hoare triple {966#true} ~cond := #in~cond; {966#true} is VALID [2022-04-27 12:34:08,100 INFO L272 TraceCheckUtils]: 6: Hoare triple {966#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 20 then 1 else 0)); {966#true} is VALID [2022-04-27 12:34:08,101 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:34:08,101 INFO L272 TraceCheckUtils]: 4: Hoare triple {966#true} call #t~ret2 := main(); {966#true} is VALID [2022-04-27 12:34:08,101 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {966#true} {966#true} #84#return; {966#true} is VALID [2022-04-27 12:34:08,101 INFO L290 TraceCheckUtils]: 2: Hoare triple {966#true} assume true; {966#true} is VALID [2022-04-27 12:34:08,101 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:34:08,101 INFO L272 TraceCheckUtils]: 0: Hoare triple {966#true} call ULTIMATE.init(); {966#true} is VALID [2022-04-27 12:34:08,102 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:34:08,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:34:08,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77377241] [2022-04-27 12:34:08,102 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:34:08,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283532988] [2022-04-27 12:34:08,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1283532988] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:34:08,103 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:34:08,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 16 [2022-04-27 12:34:08,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005085763] [2022-04-27 12:34:08,103 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:34:08,104 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:08,104 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:34:08,104 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:34:14,297 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:34:14,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-27 12:34:14,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:34:14,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-27 12:34:14,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=154, Unknown=10, NotChecked=26, Total=240 [2022-04-27 12:34:14,298 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:34:22,919 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,143 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:29,424 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:35:32,772 WARN L232 SmtUtils]: Spent 52.33s on a formula simplification. DAG size of input: 34 DAG size of output: 33 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 12:35:35,022 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:35:39,588 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:35:41,712 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:35:43,917 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:35:46,098 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:35:57,419 WARN L232 SmtUtils]: Spent 8.67s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 12:36:10,501 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:36:12,739 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:36:14,898 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:36:40,086 WARN L232 SmtUtils]: Spent 22.47s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 12:36:42,090 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:36:44,322 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:36:46,480 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:36:50,872 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:36:55,229 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:37:10,499 WARN L232 SmtUtils]: Spent 12.95s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 12:37:12,503 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:37:14,689 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:37:19,079 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:37:23,660 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:37:26,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:37:31,022 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:37:33,204 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:37:37,540 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:37:39,726 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:37:42,167 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:38:01,874 WARN L232 SmtUtils]: Spent 15.05s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 12:38:03,877 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:38:06,231 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:38:08,433 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:38:10,610 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:38:12,792 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:38:15,094 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:38:19,592 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:38:21,878 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:38:24,375 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:38:31,367 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:38:33,600 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:38:35,797 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:38:38,002 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:38:40,144 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:38:42,297 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:38:44,481 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:38:46,630 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:38:49,027 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:38:51,211 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:38:55,813 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:39:00,232 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:39:02,382 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:39:04,564 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:39:09,426 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:39:11,604 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:39:11,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:39:11,817 INFO L93 Difference]: Finished difference Result 107 states and 135 transitions. [2022-04-27 12:39:11,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-27 12:39:11,817 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:39:11,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:39:11,818 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:39:11,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 108 transitions. [2022-04-27 12:39:11,822 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:39:11,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 108 transitions. [2022-04-27 12:39:11,826 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 108 transitions. [2022-04-27 12:39:20,255 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 104 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-27 12:39:20,257 INFO L225 Difference]: With dead ends: 107 [2022-04-27 12:39:20,258 INFO L226 Difference]: Without dead ends: 86 [2022-04-27 12:39:20,258 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 161.5s TimeCoverageRelationStatistics Valid=108, Invalid=338, Unknown=20, NotChecked=40, Total=506 [2022-04-27 12:39:20,259 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 49 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 34 mSolverCounterUnsat, 51 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 105.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 51 IncrementalHoareTripleChecker+Unknown, 58 IncrementalHoareTripleChecker+Unchecked, 110.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:39:20,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 193 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 208 Invalid, 51 Unknown, 58 Unchecked, 110.1s Time] [2022-04-27 12:39:20,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-04-27 12:39:20,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 64. [2022-04-27 12:39:20,300 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:39:20,300 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand has 64 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 49 states have internal predecessors, (55), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 12:39:20,301 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand has 64 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 49 states have internal predecessors, (55), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 12:39:20,301 INFO L87 Difference]: Start difference. First operand 86 states. Second operand has 64 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 49 states have internal predecessors, (55), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 12:39:20,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:39:20,305 INFO L93 Difference]: Finished difference Result 86 states and 107 transitions. [2022-04-27 12:39:20,306 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 107 transitions. [2022-04-27 12:39:20,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:39:20,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:39:20,307 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 49 states have internal predecessors, (55), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) Second operand 86 states. [2022-04-27 12:39:20,307 INFO L87 Difference]: Start difference. First operand has 64 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 49 states have internal predecessors, (55), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) Second operand 86 states. [2022-04-27 12:39:20,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:39:20,312 INFO L93 Difference]: Finished difference Result 86 states and 107 transitions. [2022-04-27 12:39:20,312 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 107 transitions. [2022-04-27 12:39:20,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:39:20,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:39:20,313 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:39:20,313 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:39:20,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 49 states have internal predecessors, (55), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 12:39:20,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2022-04-27 12:39:20,316 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 29 [2022-04-27 12:39:20,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:39:20,316 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2022-04-27 12:39:20,316 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:39:20,316 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2022-04-27 12:39:20,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-27 12:39:20,317 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:39:20,317 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 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:39:20,326 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:39:20,518 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:39:20,518 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:39:20,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:39:20,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1554731686, now seen corresponding path program 2 times [2022-04-27 12:39:20,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:39:20,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943494129] [2022-04-27 12:39:20,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:39:20,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:39:20,536 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:39:20,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [766297097] [2022-04-27 12:39:20,536 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 12:39:20,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:39:20,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:39:20,548 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:39:20,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process