/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/divbin_valuebound10.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-14 15:45:32,982 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 15:45:33,010 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 15:45:33,030 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 15:45:33,030 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 15:45:33,031 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 15:45:33,032 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 15:45:33,033 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 15:45:33,034 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 15:45:33,034 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 15:45:33,035 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 15:45:33,036 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 15:45:33,036 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 15:45:33,036 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 15:45:33,037 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 15:45:33,038 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 15:45:33,038 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 15:45:33,039 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 15:45:33,040 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 15:45:33,041 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 15:45:33,042 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 15:45:33,043 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 15:45:33,043 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 15:45:33,044 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 15:45:33,045 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 15:45:33,046 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 15:45:33,047 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 15:45:33,047 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 15:45:33,047 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 15:45:33,048 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 15:45:33,048 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 15:45:33,049 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 15:45:33,049 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 15:45:33,050 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 15:45:33,050 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 15:45:33,051 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 15:45:33,051 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 15:45:33,051 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 15:45:33,052 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 15:45:33,052 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 15:45:33,052 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 15:45:33,053 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 15:45:33,054 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-14 15:45:33,068 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 15:45:33,068 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 15:45:33,068 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-14 15:45:33,068 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-14 15:45:33,069 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-14 15:45:33,069 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-14 15:45:33,069 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-14 15:45:33,069 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-14 15:45:33,069 INFO L138 SettingsManager]: * Use SBE=true [2022-04-14 15:45:33,070 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 15:45:33,070 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 15:45:33,070 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 15:45:33,070 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 15:45:33,070 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 15:45:33,070 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 15:45:33,070 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 15:45:33,070 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 15:45:33,070 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 15:45:33,070 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 15:45:33,070 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 15:45:33,071 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 15:45:33,071 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 15:45:33,071 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 15:45:33,071 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 15:45:33,071 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 15:45:33,071 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 15:45:33,071 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-14 15:45:33,071 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-14 15:45:33,071 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 15:45:33,071 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-14 15:45:33,072 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-14 15:45:33,072 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-14 15:45:33,072 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-14 15:45:33,072 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-14 15:45:33,271 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 15:45:33,296 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 15:45:33,297 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 15:45:33,298 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 15:45:33,299 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 15:45:33,300 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/divbin_valuebound10.i [2022-04-14 15:45:33,378 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d163f3c4/470c65865b384109a08e28218ce4e776/FLAGb7d9b2eb1 [2022-04-14 15:45:33,721 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 15:45:33,722 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin_valuebound10.i [2022-04-14 15:45:33,728 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d163f3c4/470c65865b384109a08e28218ce4e776/FLAGb7d9b2eb1 [2022-04-14 15:45:33,740 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d163f3c4/470c65865b384109a08e28218ce4e776 [2022-04-14 15:45:33,742 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 15:45:33,743 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-14 15:45:33,744 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 15:45:33,744 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 15:45:33,761 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 15:45:33,762 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 03:45:33" (1/1) ... [2022-04-14 15:45:33,762 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2607eba4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:45:33, skipping insertion in model container [2022-04-14 15:45:33,763 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 03:45:33" (1/1) ... [2022-04-14 15:45:33,768 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 15:45:33,781 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 15:45:33,891 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin_valuebound10.i[950,963] [2022-04-14 15:45:33,912 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 15:45:33,923 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 15:45:33,932 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin_valuebound10.i[950,963] [2022-04-14 15:45:33,937 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 15:45:33,946 INFO L208 MainTranslator]: Completed translation [2022-04-14 15:45:33,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:45:33 WrapperNode [2022-04-14 15:45:33,947 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 15:45:33,948 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 15:45:33,948 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 15:45:33,948 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 15:45:33,959 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:45:33" (1/1) ... [2022-04-14 15:45:33,959 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:45:33" (1/1) ... [2022-04-14 15:45:33,963 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:45:33" (1/1) ... [2022-04-14 15:45:33,964 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:45:33" (1/1) ... [2022-04-14 15:45:33,968 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:45:33" (1/1) ... [2022-04-14 15:45:33,971 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:45:33" (1/1) ... [2022-04-14 15:45:33,972 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:45:33" (1/1) ... [2022-04-14 15:45:33,973 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 15:45:33,974 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 15:45:33,974 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 15:45:33,974 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 15:45:33,975 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:45:33" (1/1) ... [2022-04-14 15:45:33,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 15:45:33,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:45:33,996 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-14 15:45:34,019 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-14 15:45:34,025 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 15:45:34,025 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 15:45:34,025 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 15:45:34,026 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-14 15:45:34,026 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-14 15:45:34,026 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 15:45:34,026 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-14 15:45:34,026 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 15:45:34,026 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-14 15:45:34,026 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-14 15:45:34,026 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 15:45:34,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 15:45:34,026 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-14 15:45:34,026 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-14 15:45:34,027 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-14 15:45:34,027 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 15:45:34,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 15:45:34,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 15:45:34,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 15:45:34,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 15:45:34,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 15:45:34,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 15:45:34,070 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 15:45:34,072 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 15:45:34,174 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 15:45:34,179 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 15:45:34,179 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-14 15:45:34,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 03:45:34 BoogieIcfgContainer [2022-04-14 15:45:34,180 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 15:45:34,181 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 15:45:34,181 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 15:45:34,184 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 15:45:34,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 03:45:33" (1/3) ... [2022-04-14 15:45:34,184 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dfd66b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 03:45:34, skipping insertion in model container [2022-04-14 15:45:34,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:45:33" (2/3) ... [2022-04-14 15:45:34,185 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dfd66b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 03:45:34, skipping insertion in model container [2022-04-14 15:45:34,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 03:45:34" (3/3) ... [2022-04-14 15:45:34,186 INFO L111 eAbstractionObserver]: Analyzing ICFG divbin_valuebound10.i [2022-04-14 15:45:34,189 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-14 15:45:34,189 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 15:45:34,219 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 15:45:34,224 INFO L340 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 [2022-04-14 15:45:34,224 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 15:45:34,240 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-14 15:45:34,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-14 15:45:34,244 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:45:34,245 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:45:34,245 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:45:34,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:45:34,250 INFO L85 PathProgramCache]: Analyzing trace with hash 291922115, now seen corresponding path program 1 times [2022-04-14 15:45:34,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:45:34,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009349334] [2022-04-14 15:45:34,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:45:34,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:45:34,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:45:34,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 15:45:34,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:45:34,384 INFO L290 TraceCheckUtils]: 0: Hoare triple {58#(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(9, 2); {37#true} is VALID [2022-04-14 15:45:34,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume true; {37#true} is VALID [2022-04-14 15:45:34,385 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37#true} {37#true} #94#return; {37#true} is VALID [2022-04-14 15:45:34,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-14 15:45:34,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:45:34,392 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-14 15:45:34,393 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-14 15:45:34,393 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-14 15:45:34,393 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {37#true} #82#return; {38#false} is VALID [2022-04-14 15:45:34,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-14 15:45:34,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:45:34,400 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-14 15:45:34,400 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-14 15:45:34,400 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-14 15:45:34,401 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {38#false} #84#return; {38#false} is VALID [2022-04-14 15:45:34,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-14 15:45:34,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:45:34,407 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-14 15:45:34,408 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-14 15:45:34,408 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-14 15:45:34,408 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {38#false} #86#return; {38#false} is VALID [2022-04-14 15:45:34,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-14 15:45:34,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:45:34,414 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-14 15:45:34,415 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-14 15:45:34,415 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-14 15:45:34,415 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {38#false} #88#return; {38#false} is VALID [2022-04-14 15:45:34,416 INFO L272 TraceCheckUtils]: 0: Hoare triple {37#true} call ULTIMATE.init(); {58#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 15:45:34,416 INFO L290 TraceCheckUtils]: 1: Hoare triple {58#(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(9, 2); {37#true} is VALID [2022-04-14 15:45:34,416 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#true} assume true; {37#true} is VALID [2022-04-14 15:45:34,417 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} #94#return; {37#true} is VALID [2022-04-14 15:45:34,417 INFO L272 TraceCheckUtils]: 4: Hoare triple {37#true} call #t~ret3 := main(); {37#true} is VALID [2022-04-14 15:45:34,417 INFO L290 TraceCheckUtils]: 5: Hoare triple {37#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {37#true} is VALID [2022-04-14 15:45:34,417 INFO L272 TraceCheckUtils]: 6: Hoare triple {37#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 10 then 1 else 0)); {37#true} is VALID [2022-04-14 15:45:34,417 INFO L290 TraceCheckUtils]: 7: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-14 15:45:34,418 INFO L290 TraceCheckUtils]: 8: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-14 15:45:34,418 INFO L290 TraceCheckUtils]: 9: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-14 15:45:34,418 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {38#false} {37#true} #82#return; {38#false} is VALID [2022-04-14 15:45:34,418 INFO L290 TraceCheckUtils]: 11: Hoare triple {38#false} ~B~0 := #t~nondet2;havoc #t~nondet2; {38#false} is VALID [2022-04-14 15:45:34,418 INFO L272 TraceCheckUtils]: 12: Hoare triple {38#false} call assume_abort_if_not((if ~B~0 % 4294967296 >= 0 && ~B~0 % 4294967296 <= 10 then 1 else 0)); {37#true} is VALID [2022-04-14 15:45:34,419 INFO L290 TraceCheckUtils]: 13: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-14 15:45:34,419 INFO L290 TraceCheckUtils]: 14: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-14 15:45:34,419 INFO L290 TraceCheckUtils]: 15: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-14 15:45:34,419 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {38#false} {38#false} #84#return; {38#false} is VALID [2022-04-14 15:45:34,420 INFO L272 TraceCheckUtils]: 17: Hoare triple {38#false} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {37#true} is VALID [2022-04-14 15:45:34,420 INFO L290 TraceCheckUtils]: 18: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-14 15:45:34,420 INFO L290 TraceCheckUtils]: 19: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-14 15:45:34,420 INFO L290 TraceCheckUtils]: 20: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-14 15:45:34,421 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {38#false} {38#false} #86#return; {38#false} is VALID [2022-04-14 15:45:34,421 INFO L272 TraceCheckUtils]: 22: Hoare triple {38#false} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {37#true} is VALID [2022-04-14 15:45:34,421 INFO L290 TraceCheckUtils]: 23: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-14 15:45:34,421 INFO L290 TraceCheckUtils]: 24: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-14 15:45:34,421 INFO L290 TraceCheckUtils]: 25: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-14 15:45:34,422 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {38#false} {38#false} #88#return; {38#false} is VALID [2022-04-14 15:45:34,422 INFO L290 TraceCheckUtils]: 27: Hoare triple {38#false} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {38#false} is VALID [2022-04-14 15:45:34,422 INFO L290 TraceCheckUtils]: 28: Hoare triple {38#false} assume !true; {38#false} is VALID [2022-04-14 15:45:34,422 INFO L290 TraceCheckUtils]: 29: Hoare triple {38#false} assume !true; {38#false} is VALID [2022-04-14 15:45:34,422 INFO L272 TraceCheckUtils]: 30: Hoare triple {38#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {38#false} is VALID [2022-04-14 15:45:34,423 INFO L290 TraceCheckUtils]: 31: Hoare triple {38#false} ~cond := #in~cond; {38#false} is VALID [2022-04-14 15:45:34,423 INFO L290 TraceCheckUtils]: 32: Hoare triple {38#false} assume 0 == ~cond; {38#false} is VALID [2022-04-14 15:45:34,423 INFO L290 TraceCheckUtils]: 33: Hoare triple {38#false} assume !false; {38#false} is VALID [2022-04-14 15:45:34,423 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-14 15:45:34,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:45:34,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009349334] [2022-04-14 15:45:34,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009349334] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 15:45:34,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 15:45:34,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-14 15:45:34,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673060592] [2022-04-14 15:45:34,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:45:34,432 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-14 15:45:34,434 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:45:34,437 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 15:45:34,481 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:45:34,483 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-14 15:45:34,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:45:34,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-14 15:45:34,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 15:45:34,512 INFO L87 Difference]: Start difference. First operand has 34 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 15:45:34,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:45:34,675 INFO L93 Difference]: Finished difference Result 61 states and 90 transitions. [2022-04-14 15:45:34,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-14 15:45:34,676 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-14 15:45:34,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:45:34,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 15:45:34,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2022-04-14 15:45:34,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 15:45:34,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2022-04-14 15:45:34,700 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 90 transitions. [2022-04-14 15:45:34,819 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:45:34,828 INFO L225 Difference]: With dead ends: 61 [2022-04-14 15:45:34,828 INFO L226 Difference]: Without dead ends: 29 [2022-04-14 15:45:34,832 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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-14 15:45:34,835 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 21 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 15:45:34,836 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 37 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 15:45:34,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-14 15:45:34,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-14 15:45:34,865 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:45:34,866 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-14 15:45:34,867 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-14 15:45:34,867 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-14 15:45:34,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:45:34,877 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-14 15:45:34,877 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-14 15:45:34,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:45:34,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:45:34,878 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 29 states. [2022-04-14 15:45:34,879 INFO L87 Difference]: Start difference. First operand has 29 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 29 states. [2022-04-14 15:45:34,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:45:34,883 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-14 15:45:34,883 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-14 15:45:34,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:45:34,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:45:34,884 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:45:34,884 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:45:34,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-14 15:45:34,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2022-04-14 15:45:34,889 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 34 [2022-04-14 15:45:34,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:45:34,889 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-04-14 15:45:34,890 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 15:45:34,891 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-14 15:45:34,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-14 15:45:34,892 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:45:34,893 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:45:34,893 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-14 15:45:34,893 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:45:34,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:45:34,897 INFO L85 PathProgramCache]: Analyzing trace with hash -245963777, now seen corresponding path program 1 times [2022-04-14 15:45:34,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:45:34,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119011202] [2022-04-14 15:45:34,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:45:34,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:45:34,940 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:45:34,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1445226402] [2022-04-14 15:45:34,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:45:34,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:45:34,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:45:34,942 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-14 15:45:34,960 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-14 15:45:35,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:45:35,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-14 15:45:35,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:45:35,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:45:35,931 INFO L272 TraceCheckUtils]: 0: Hoare triple {243#true} call ULTIMATE.init(); {243#true} is VALID [2022-04-14 15:45:35,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {243#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {243#true} is VALID [2022-04-14 15:45:35,931 INFO L290 TraceCheckUtils]: 2: Hoare triple {243#true} assume true; {243#true} is VALID [2022-04-14 15:45:35,931 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {243#true} {243#true} #94#return; {243#true} is VALID [2022-04-14 15:45:35,931 INFO L272 TraceCheckUtils]: 4: Hoare triple {243#true} call #t~ret3 := main(); {243#true} is VALID [2022-04-14 15:45:35,931 INFO L290 TraceCheckUtils]: 5: Hoare triple {243#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {243#true} is VALID [2022-04-14 15:45:35,932 INFO L272 TraceCheckUtils]: 6: Hoare triple {243#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 10 then 1 else 0)); {243#true} is VALID [2022-04-14 15:45:35,932 INFO L290 TraceCheckUtils]: 7: Hoare triple {243#true} ~cond := #in~cond; {243#true} is VALID [2022-04-14 15:45:35,932 INFO L290 TraceCheckUtils]: 8: Hoare triple {243#true} assume !(0 == ~cond); {243#true} is VALID [2022-04-14 15:45:35,932 INFO L290 TraceCheckUtils]: 9: Hoare triple {243#true} assume true; {243#true} is VALID [2022-04-14 15:45:35,932 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {243#true} {243#true} #82#return; {243#true} is VALID [2022-04-14 15:45:35,932 INFO L290 TraceCheckUtils]: 11: Hoare triple {243#true} ~B~0 := #t~nondet2;havoc #t~nondet2; {243#true} is VALID [2022-04-14 15:45:35,932 INFO L272 TraceCheckUtils]: 12: Hoare triple {243#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 0 && ~B~0 % 4294967296 <= 10 then 1 else 0)); {243#true} is VALID [2022-04-14 15:45:35,933 INFO L290 TraceCheckUtils]: 13: Hoare triple {243#true} ~cond := #in~cond; {287#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-14 15:45:35,933 INFO L290 TraceCheckUtils]: 14: Hoare triple {287#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {291#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 15:45:35,934 INFO L290 TraceCheckUtils]: 15: Hoare triple {291#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {291#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 15:45:35,934 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {291#(not (= |assume_abort_if_not_#in~cond| 0))} {243#true} #84#return; {298#(<= (mod main_~B~0 4294967296) 10)} is VALID [2022-04-14 15:45:35,934 INFO L272 TraceCheckUtils]: 17: Hoare triple {298#(<= (mod main_~B~0 4294967296) 10)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {243#true} is VALID [2022-04-14 15:45:35,935 INFO L290 TraceCheckUtils]: 18: Hoare triple {243#true} ~cond := #in~cond; {243#true} is VALID [2022-04-14 15:45:35,935 INFO L290 TraceCheckUtils]: 19: Hoare triple {243#true} assume !(0 == ~cond); {243#true} is VALID [2022-04-14 15:45:35,935 INFO L290 TraceCheckUtils]: 20: Hoare triple {243#true} assume true; {243#true} is VALID [2022-04-14 15:45:35,935 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {243#true} {298#(<= (mod main_~B~0 4294967296) 10)} #86#return; {298#(<= (mod main_~B~0 4294967296) 10)} is VALID [2022-04-14 15:45:35,936 INFO L272 TraceCheckUtils]: 22: Hoare triple {298#(<= (mod main_~B~0 4294967296) 10)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {243#true} is VALID [2022-04-14 15:45:35,936 INFO L290 TraceCheckUtils]: 23: Hoare triple {243#true} ~cond := #in~cond; {243#true} is VALID [2022-04-14 15:45:35,936 INFO L290 TraceCheckUtils]: 24: Hoare triple {243#true} assume !(0 == ~cond); {243#true} is VALID [2022-04-14 15:45:35,936 INFO L290 TraceCheckUtils]: 25: Hoare triple {243#true} assume true; {243#true} is VALID [2022-04-14 15:45:35,936 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {243#true} {298#(<= (mod main_~B~0 4294967296) 10)} #88#return; {298#(<= (mod main_~B~0 4294967296) 10)} is VALID [2022-04-14 15:45:35,937 INFO L290 TraceCheckUtils]: 27: Hoare triple {298#(<= (mod main_~B~0 4294967296) 10)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {332#(and (= main_~A~0 main_~r~0) (<= (mod main_~b~0 4294967296) 10) (= main_~q~0 0))} is VALID [2022-04-14 15:45:35,937 INFO L290 TraceCheckUtils]: 28: Hoare triple {332#(and (= main_~A~0 main_~r~0) (<= (mod main_~b~0 4294967296) 10) (= main_~q~0 0))} assume !false; {332#(and (= main_~A~0 main_~r~0) (<= (mod main_~b~0 4294967296) 10) (= main_~q~0 0))} is VALID [2022-04-14 15:45:35,938 INFO L290 TraceCheckUtils]: 29: Hoare triple {332#(and (= main_~A~0 main_~r~0) (<= (mod main_~b~0 4294967296) 10) (= main_~q~0 0))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {339#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (<= (mod main_~b~0 4294967296) 10) (= main_~q~0 0))} is VALID [2022-04-14 15:45:35,938 INFO L290 TraceCheckUtils]: 30: Hoare triple {339#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (<= (mod main_~b~0 4294967296) 10) (= main_~q~0 0))} assume !false; {339#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (<= (mod main_~b~0 4294967296) 10) (= main_~q~0 0))} is VALID [2022-04-14 15:45:35,939 INFO L272 TraceCheckUtils]: 31: Hoare triple {339#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (<= (mod main_~b~0 4294967296) 10) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {346#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:45:35,940 INFO L290 TraceCheckUtils]: 32: Hoare triple {346#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {350#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:45:35,940 INFO L290 TraceCheckUtils]: 33: Hoare triple {350#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {244#false} is VALID [2022-04-14 15:45:35,940 INFO L290 TraceCheckUtils]: 34: Hoare triple {244#false} assume !false; {244#false} is VALID [2022-04-14 15:45:35,941 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-14 15:45:35,941 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:45:36,336 INFO L290 TraceCheckUtils]: 34: Hoare triple {244#false} assume !false; {244#false} is VALID [2022-04-14 15:45:36,337 INFO L290 TraceCheckUtils]: 33: Hoare triple {350#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {244#false} is VALID [2022-04-14 15:45:36,337 INFO L290 TraceCheckUtils]: 32: Hoare triple {346#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {350#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:45:36,338 INFO L272 TraceCheckUtils]: 31: Hoare triple {366#(= (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)); {346#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:45:36,338 INFO L290 TraceCheckUtils]: 30: Hoare triple {366#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} assume !false; {366#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-14 15:45:36,339 INFO L290 TraceCheckUtils]: 29: Hoare triple {373#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {366#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-14 15:45:36,339 INFO L290 TraceCheckUtils]: 28: Hoare triple {373#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} assume !false; {373#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-14 15:45:36,340 INFO L290 TraceCheckUtils]: 27: Hoare triple {243#true} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {373#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-14 15:45:36,340 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {243#true} {243#true} #88#return; {243#true} is VALID [2022-04-14 15:45:36,340 INFO L290 TraceCheckUtils]: 25: Hoare triple {243#true} assume true; {243#true} is VALID [2022-04-14 15:45:36,340 INFO L290 TraceCheckUtils]: 24: Hoare triple {243#true} assume !(0 == ~cond); {243#true} is VALID [2022-04-14 15:45:36,340 INFO L290 TraceCheckUtils]: 23: Hoare triple {243#true} ~cond := #in~cond; {243#true} is VALID [2022-04-14 15:45:36,340 INFO L272 TraceCheckUtils]: 22: Hoare triple {243#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {243#true} is VALID [2022-04-14 15:45:36,340 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {243#true} {243#true} #86#return; {243#true} is VALID [2022-04-14 15:45:36,341 INFO L290 TraceCheckUtils]: 20: Hoare triple {243#true} assume true; {243#true} is VALID [2022-04-14 15:45:36,341 INFO L290 TraceCheckUtils]: 19: Hoare triple {243#true} assume !(0 == ~cond); {243#true} is VALID [2022-04-14 15:45:36,341 INFO L290 TraceCheckUtils]: 18: Hoare triple {243#true} ~cond := #in~cond; {243#true} is VALID [2022-04-14 15:45:36,341 INFO L272 TraceCheckUtils]: 17: Hoare triple {243#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {243#true} is VALID [2022-04-14 15:45:36,341 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {243#true} {243#true} #84#return; {243#true} is VALID [2022-04-14 15:45:36,341 INFO L290 TraceCheckUtils]: 15: Hoare triple {243#true} assume true; {243#true} is VALID [2022-04-14 15:45:36,341 INFO L290 TraceCheckUtils]: 14: Hoare triple {243#true} assume !(0 == ~cond); {243#true} is VALID [2022-04-14 15:45:36,341 INFO L290 TraceCheckUtils]: 13: Hoare triple {243#true} ~cond := #in~cond; {243#true} is VALID [2022-04-14 15:45:36,342 INFO L272 TraceCheckUtils]: 12: Hoare triple {243#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 0 && ~B~0 % 4294967296 <= 10 then 1 else 0)); {243#true} is VALID [2022-04-14 15:45:36,342 INFO L290 TraceCheckUtils]: 11: Hoare triple {243#true} ~B~0 := #t~nondet2;havoc #t~nondet2; {243#true} is VALID [2022-04-14 15:45:36,342 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {243#true} {243#true} #82#return; {243#true} is VALID [2022-04-14 15:45:36,342 INFO L290 TraceCheckUtils]: 9: Hoare triple {243#true} assume true; {243#true} is VALID [2022-04-14 15:45:36,342 INFO L290 TraceCheckUtils]: 8: Hoare triple {243#true} assume !(0 == ~cond); {243#true} is VALID [2022-04-14 15:45:36,342 INFO L290 TraceCheckUtils]: 7: Hoare triple {243#true} ~cond := #in~cond; {243#true} is VALID [2022-04-14 15:45:36,342 INFO L272 TraceCheckUtils]: 6: Hoare triple {243#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 10 then 1 else 0)); {243#true} is VALID [2022-04-14 15:45:36,342 INFO L290 TraceCheckUtils]: 5: Hoare triple {243#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {243#true} is VALID [2022-04-14 15:45:36,343 INFO L272 TraceCheckUtils]: 4: Hoare triple {243#true} call #t~ret3 := main(); {243#true} is VALID [2022-04-14 15:45:36,343 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {243#true} {243#true} #94#return; {243#true} is VALID [2022-04-14 15:45:36,343 INFO L290 TraceCheckUtils]: 2: Hoare triple {243#true} assume true; {243#true} is VALID [2022-04-14 15:45:36,343 INFO L290 TraceCheckUtils]: 1: Hoare triple {243#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {243#true} is VALID [2022-04-14 15:45:36,343 INFO L272 TraceCheckUtils]: 0: Hoare triple {243#true} call ULTIMATE.init(); {243#true} is VALID [2022-04-14 15:45:36,343 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-14 15:45:36,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:45:36,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119011202] [2022-04-14 15:45:36,344 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:45:36,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445226402] [2022-04-14 15:45:36,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1445226402] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 15:45:36,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-14 15:45:36,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2022-04-14 15:45:36,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022027208] [2022-04-14 15:45:36,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:45:36,346 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 35 [2022-04-14 15:45:36,346 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:45:36,346 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-14 15:45:36,366 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:45:36,367 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 15:45:36,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:45:36,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 15:45:36,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-14 15:45:36,368 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-14 15:45:38,546 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-14 15:45:38,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:45:38,678 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2022-04-14 15:45:38,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 15:45:38,678 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 35 [2022-04-14 15:45:38,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:45:38,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-14 15:45:38,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2022-04-14 15:45:38,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-14 15:45:38,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2022-04-14 15:45:38,681 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 49 transitions. [2022-04-14 15:45:38,726 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:45:38,728 INFO L225 Difference]: With dead ends: 41 [2022-04-14 15:45:38,728 INFO L226 Difference]: Without dead ends: 38 [2022-04-14 15:45:38,728 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-04-14 15:45:38,729 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 10 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-14 15:45:38,729 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 105 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-04-14 15:45:38,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-14 15:45:38,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-14 15:45:38,734 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:45:38,734 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 15:45:38,734 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 15:45:38,735 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 15:45:38,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:45:38,737 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2022-04-14 15:45:38,737 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-04-14 15:45:38,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:45:38,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:45:38,737 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 38 states. [2022-04-14 15:45:38,738 INFO L87 Difference]: Start difference. First operand has 38 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 38 states. [2022-04-14 15:45:38,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:45:38,739 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2022-04-14 15:45:38,740 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-04-14 15:45:38,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:45:38,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:45:38,740 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:45:38,740 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:45:38,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 15:45:38,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2022-04-14 15:45:38,742 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 35 [2022-04-14 15:45:38,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:45:38,742 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2022-04-14 15:45:38,742 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-14 15:45:38,743 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-04-14 15:45:38,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-14 15:45:38,743 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:45:38,743 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:45:38,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-14 15:45:38,961 WARN L460 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-14 15:45:38,962 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:45:38,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:45:38,963 INFO L85 PathProgramCache]: Analyzing trace with hash 397552474, now seen corresponding path program 1 times [2022-04-14 15:45:38,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:45:38,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581794120] [2022-04-14 15:45:38,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:45:38,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:45:38,981 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:45:38,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1088835435] [2022-04-14 15:45:38,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:45:38,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:45:38,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:45:38,994 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-14 15:45:39,041 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-14 15:45:39,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:45:39,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-14 15:45:39,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:45:39,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:45:40,271 INFO L272 TraceCheckUtils]: 0: Hoare triple {653#true} call ULTIMATE.init(); {653#true} is VALID [2022-04-14 15:45:40,271 INFO L290 TraceCheckUtils]: 1: Hoare triple {653#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {653#true} is VALID [2022-04-14 15:45:40,272 INFO L290 TraceCheckUtils]: 2: Hoare triple {653#true} assume true; {653#true} is VALID [2022-04-14 15:45:40,272 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {653#true} {653#true} #94#return; {653#true} is VALID [2022-04-14 15:45:40,272 INFO L272 TraceCheckUtils]: 4: Hoare triple {653#true} call #t~ret3 := main(); {653#true} is VALID [2022-04-14 15:45:40,272 INFO L290 TraceCheckUtils]: 5: Hoare triple {653#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {653#true} is VALID [2022-04-14 15:45:40,272 INFO L272 TraceCheckUtils]: 6: Hoare triple {653#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 10 then 1 else 0)); {653#true} is VALID [2022-04-14 15:45:40,272 INFO L290 TraceCheckUtils]: 7: Hoare triple {653#true} ~cond := #in~cond; {679#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-14 15:45:40,273 INFO L290 TraceCheckUtils]: 8: Hoare triple {679#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {683#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 15:45:40,273 INFO L290 TraceCheckUtils]: 9: Hoare triple {683#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {683#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 15:45:40,274 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {683#(not (= |assume_abort_if_not_#in~cond| 0))} {653#true} #82#return; {690#(<= (mod main_~A~0 4294967296) 10)} is VALID [2022-04-14 15:45:40,274 INFO L290 TraceCheckUtils]: 11: Hoare triple {690#(<= (mod main_~A~0 4294967296) 10)} ~B~0 := #t~nondet2;havoc #t~nondet2; {690#(<= (mod main_~A~0 4294967296) 10)} is VALID [2022-04-14 15:45:40,274 INFO L272 TraceCheckUtils]: 12: Hoare triple {690#(<= (mod main_~A~0 4294967296) 10)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 0 && ~B~0 % 4294967296 <= 10 then 1 else 0)); {653#true} is VALID [2022-04-14 15:45:40,275 INFO L290 TraceCheckUtils]: 13: Hoare triple {653#true} ~cond := #in~cond; {653#true} is VALID [2022-04-14 15:45:40,275 INFO L290 TraceCheckUtils]: 14: Hoare triple {653#true} assume !(0 == ~cond); {653#true} is VALID [2022-04-14 15:45:40,275 INFO L290 TraceCheckUtils]: 15: Hoare triple {653#true} assume true; {653#true} is VALID [2022-04-14 15:45:40,275 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {653#true} {690#(<= (mod main_~A~0 4294967296) 10)} #84#return; {690#(<= (mod main_~A~0 4294967296) 10)} is VALID [2022-04-14 15:45:40,275 INFO L272 TraceCheckUtils]: 17: Hoare triple {690#(<= (mod main_~A~0 4294967296) 10)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {653#true} is VALID [2022-04-14 15:45:40,276 INFO L290 TraceCheckUtils]: 18: Hoare triple {653#true} ~cond := #in~cond; {653#true} is VALID [2022-04-14 15:45:40,276 INFO L290 TraceCheckUtils]: 19: Hoare triple {653#true} assume !(0 == ~cond); {653#true} is VALID [2022-04-14 15:45:40,276 INFO L290 TraceCheckUtils]: 20: Hoare triple {653#true} assume true; {653#true} is VALID [2022-04-14 15:45:40,276 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {653#true} {690#(<= (mod main_~A~0 4294967296) 10)} #86#return; {690#(<= (mod main_~A~0 4294967296) 10)} is VALID [2022-04-14 15:45:40,276 INFO L272 TraceCheckUtils]: 22: Hoare triple {690#(<= (mod main_~A~0 4294967296) 10)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {653#true} is VALID [2022-04-14 15:45:40,277 INFO L290 TraceCheckUtils]: 23: Hoare triple {653#true} ~cond := #in~cond; {679#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-14 15:45:40,277 INFO L290 TraceCheckUtils]: 24: Hoare triple {679#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {683#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 15:45:40,278 INFO L290 TraceCheckUtils]: 25: Hoare triple {683#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {683#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 15:45:40,278 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {683#(not (= |assume_abort_if_not_#in~cond| 0))} {690#(<= (mod main_~A~0 4294967296) 10)} #88#return; {739#(and (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~A~0 4294967296) 10))} is VALID [2022-04-14 15:45:40,279 INFO L290 TraceCheckUtils]: 27: Hoare triple {739#(and (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~A~0 4294967296) 10))} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {743#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~b~0 4294967296)) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 10))} is VALID [2022-04-14 15:45:40,279 INFO L290 TraceCheckUtils]: 28: Hoare triple {743#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~b~0 4294967296)) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 10))} assume !false; {743#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~b~0 4294967296)) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 10))} is VALID [2022-04-14 15:45:40,281 INFO L290 TraceCheckUtils]: 29: Hoare triple {743#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~b~0 4294967296)) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 10))} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {750#(and (< 0 (+ (div (+ (- 1) (mod main_~r~0 4294967296)) 4294967296) 1)) (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 10))} is VALID [2022-04-14 15:45:40,281 INFO L290 TraceCheckUtils]: 30: Hoare triple {750#(and (< 0 (+ (div (+ (- 1) (mod main_~r~0 4294967296)) 4294967296) 1)) (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 10))} assume !false; {750#(and (< 0 (+ (div (+ (- 1) (mod main_~r~0 4294967296)) 4294967296) 1)) (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 10))} is VALID [2022-04-14 15:45:40,282 INFO L290 TraceCheckUtils]: 31: Hoare triple {750#(and (< 0 (+ (div (+ (- 1) (mod main_~r~0 4294967296)) 4294967296) 1)) (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 10))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {750#(and (< 0 (+ (div (+ (- 1) (mod main_~r~0 4294967296)) 4294967296) 1)) (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 10))} is VALID [2022-04-14 15:45:40,282 INFO L290 TraceCheckUtils]: 32: Hoare triple {750#(and (< 0 (+ (div (+ (- 1) (mod main_~r~0 4294967296)) 4294967296) 1)) (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 10))} assume !false; {750#(and (< 0 (+ (div (+ (- 1) (mod main_~r~0 4294967296)) 4294967296) 1)) (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 10))} is VALID [2022-04-14 15:45:40,283 INFO L272 TraceCheckUtils]: 33: Hoare triple {750#(and (< 0 (+ (div (+ (- 1) (mod main_~r~0 4294967296)) 4294967296) 1)) (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 10))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {763#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:45:40,284 INFO L290 TraceCheckUtils]: 34: Hoare triple {763#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {767#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:45:40,284 INFO L290 TraceCheckUtils]: 35: Hoare triple {767#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {654#false} is VALID [2022-04-14 15:45:40,284 INFO L290 TraceCheckUtils]: 36: Hoare triple {654#false} assume !false; {654#false} is VALID [2022-04-14 15:45:40,285 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-14 15:45:40,285 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:45:40,997 INFO L290 TraceCheckUtils]: 36: Hoare triple {654#false} assume !false; {654#false} is VALID [2022-04-14 15:45:40,998 INFO L290 TraceCheckUtils]: 35: Hoare triple {767#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {654#false} is VALID [2022-04-14 15:45:40,998 INFO L290 TraceCheckUtils]: 34: Hoare triple {763#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {767#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:45:41,000 INFO L272 TraceCheckUtils]: 33: Hoare triple {783#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {763#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:45:41,000 INFO L290 TraceCheckUtils]: 32: Hoare triple {783#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} assume !false; {783#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} is VALID [2022-04-14 15:45:41,000 INFO L290 TraceCheckUtils]: 31: Hoare triple {783#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {783#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} is VALID [2022-04-14 15:45:41,001 INFO L290 TraceCheckUtils]: 30: Hoare triple {783#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} assume !false; {783#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} is VALID [2022-04-14 15:45:41,001 INFO L290 TraceCheckUtils]: 29: Hoare triple {796#(or (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))))} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {783#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} is VALID [2022-04-14 15:45:41,002 INFO L290 TraceCheckUtils]: 28: Hoare triple {796#(or (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))))} assume !false; {796#(or (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))))} is VALID [2022-04-14 15:45:41,002 INFO L290 TraceCheckUtils]: 27: Hoare triple {653#true} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {796#(or (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))))} is VALID [2022-04-14 15:45:41,003 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {653#true} {653#true} #88#return; {653#true} is VALID [2022-04-14 15:45:41,003 INFO L290 TraceCheckUtils]: 25: Hoare triple {653#true} assume true; {653#true} is VALID [2022-04-14 15:45:41,003 INFO L290 TraceCheckUtils]: 24: Hoare triple {653#true} assume !(0 == ~cond); {653#true} is VALID [2022-04-14 15:45:41,003 INFO L290 TraceCheckUtils]: 23: Hoare triple {653#true} ~cond := #in~cond; {653#true} is VALID [2022-04-14 15:45:41,003 INFO L272 TraceCheckUtils]: 22: Hoare triple {653#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {653#true} is VALID [2022-04-14 15:45:41,003 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {653#true} {653#true} #86#return; {653#true} is VALID [2022-04-14 15:45:41,003 INFO L290 TraceCheckUtils]: 20: Hoare triple {653#true} assume true; {653#true} is VALID [2022-04-14 15:45:41,003 INFO L290 TraceCheckUtils]: 19: Hoare triple {653#true} assume !(0 == ~cond); {653#true} is VALID [2022-04-14 15:45:41,003 INFO L290 TraceCheckUtils]: 18: Hoare triple {653#true} ~cond := #in~cond; {653#true} is VALID [2022-04-14 15:45:41,003 INFO L272 TraceCheckUtils]: 17: Hoare triple {653#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {653#true} is VALID [2022-04-14 15:45:41,003 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {653#true} {653#true} #84#return; {653#true} is VALID [2022-04-14 15:45:41,004 INFO L290 TraceCheckUtils]: 15: Hoare triple {653#true} assume true; {653#true} is VALID [2022-04-14 15:45:41,004 INFO L290 TraceCheckUtils]: 14: Hoare triple {653#true} assume !(0 == ~cond); {653#true} is VALID [2022-04-14 15:45:41,004 INFO L290 TraceCheckUtils]: 13: Hoare triple {653#true} ~cond := #in~cond; {653#true} is VALID [2022-04-14 15:45:41,004 INFO L272 TraceCheckUtils]: 12: Hoare triple {653#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 0 && ~B~0 % 4294967296 <= 10 then 1 else 0)); {653#true} is VALID [2022-04-14 15:45:41,004 INFO L290 TraceCheckUtils]: 11: Hoare triple {653#true} ~B~0 := #t~nondet2;havoc #t~nondet2; {653#true} is VALID [2022-04-14 15:45:41,004 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {653#true} {653#true} #82#return; {653#true} is VALID [2022-04-14 15:45:41,004 INFO L290 TraceCheckUtils]: 9: Hoare triple {653#true} assume true; {653#true} is VALID [2022-04-14 15:45:41,004 INFO L290 TraceCheckUtils]: 8: Hoare triple {653#true} assume !(0 == ~cond); {653#true} is VALID [2022-04-14 15:45:41,004 INFO L290 TraceCheckUtils]: 7: Hoare triple {653#true} ~cond := #in~cond; {653#true} is VALID [2022-04-14 15:45:41,004 INFO L272 TraceCheckUtils]: 6: Hoare triple {653#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 10 then 1 else 0)); {653#true} is VALID [2022-04-14 15:45:41,004 INFO L290 TraceCheckUtils]: 5: Hoare triple {653#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {653#true} is VALID [2022-04-14 15:45:41,005 INFO L272 TraceCheckUtils]: 4: Hoare triple {653#true} call #t~ret3 := main(); {653#true} is VALID [2022-04-14 15:45:41,005 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {653#true} {653#true} #94#return; {653#true} is VALID [2022-04-14 15:45:41,005 INFO L290 TraceCheckUtils]: 2: Hoare triple {653#true} assume true; {653#true} is VALID [2022-04-14 15:45:41,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {653#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {653#true} is VALID [2022-04-14 15:45:41,005 INFO L272 TraceCheckUtils]: 0: Hoare triple {653#true} call ULTIMATE.init(); {653#true} is VALID [2022-04-14 15:45:41,005 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-14 15:45:41,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:45:41,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581794120] [2022-04-14 15:45:41,005 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:45:41,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088835435] [2022-04-14 15:45:41,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1088835435] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 15:45:41,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-14 15:45:41,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2022-04-14 15:45:41,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442205403] [2022-04-14 15:45:41,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:45:41,006 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 37 [2022-04-14 15:45:41,007 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:45:41,007 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-14 15:45:43,069 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 27 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-14 15:45:43,069 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 15:45:43,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:45:43,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 15:45:43,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-04-14 15:45:43,070 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-14 15:45:43,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:45:43,300 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2022-04-14 15:45:43,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 15:45:43,300 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 37 [2022-04-14 15:45:43,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:45:43,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-14 15:45:43,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-04-14 15:45:43,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-14 15:45:43,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-04-14 15:45:43,303 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 46 transitions. [2022-04-14 15:45:45,404 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 45 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-14 15:45:45,405 INFO L225 Difference]: With dead ends: 46 [2022-04-14 15:45:45,405 INFO L226 Difference]: Without dead ends: 44 [2022-04-14 15:45:45,406 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-14 15:45:45,406 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 6 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 16 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 15:45:45,407 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 151 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 16 Unchecked, 0.0s Time] [2022-04-14 15:45:45,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-14 15:45:45,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-14 15:45:45,412 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:45:45,412 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 30 states have internal predecessors, (33), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-14 15:45:45,413 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 30 states have internal predecessors, (33), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-14 15:45:45,413 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 30 states have internal predecessors, (33), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-14 15:45:45,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:45:45,415 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-04-14 15:45:45,415 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-04-14 15:45:45,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:45:45,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:45:45,415 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 30 states have internal predecessors, (33), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 44 states. [2022-04-14 15:45:45,416 INFO L87 Difference]: Start difference. First operand has 44 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 30 states have internal predecessors, (33), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 44 states. [2022-04-14 15:45:45,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:45:45,417 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-04-14 15:45:45,417 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-04-14 15:45:45,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:45:45,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:45:45,418 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:45:45,418 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:45:45,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 30 states have internal predecessors, (33), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-14 15:45:45,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2022-04-14 15:45:45,420 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 37 [2022-04-14 15:45:45,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:45:45,420 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2022-04-14 15:45:45,420 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-14 15:45:45,420 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-04-14 15:45:45,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-14 15:45:45,421 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:45:45,421 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:45:45,441 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-14 15:45:45,635 WARN L460 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-14 15:45:45,636 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:45:45,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:45:45,636 INFO L85 PathProgramCache]: Analyzing trace with hash -382866049, now seen corresponding path program 1 times [2022-04-14 15:45:45,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:45:45,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963210022] [2022-04-14 15:45:45,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:45:45,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:45:45,650 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:45:45,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1788065841] [2022-04-14 15:45:45,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:45:45,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:45:45,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:45:45,651 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-14 15:45:45,652 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-14 15:45:45,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:45:45,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-14 15:45:45,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:45:45,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:45:45,787 INFO L272 TraceCheckUtils]: 0: Hoare triple {1102#true} call ULTIMATE.init(); {1102#true} is VALID [2022-04-14 15:45:45,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {1102#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1102#true} is VALID [2022-04-14 15:45:45,787 INFO L290 TraceCheckUtils]: 2: Hoare triple {1102#true} assume true; {1102#true} is VALID [2022-04-14 15:45:45,787 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1102#true} {1102#true} #94#return; {1102#true} is VALID [2022-04-14 15:45:45,787 INFO L272 TraceCheckUtils]: 4: Hoare triple {1102#true} call #t~ret3 := main(); {1102#true} is VALID [2022-04-14 15:45:45,787 INFO L290 TraceCheckUtils]: 5: Hoare triple {1102#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {1102#true} is VALID [2022-04-14 15:45:45,787 INFO L272 TraceCheckUtils]: 6: Hoare triple {1102#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 10 then 1 else 0)); {1102#true} is VALID [2022-04-14 15:45:45,788 INFO L290 TraceCheckUtils]: 7: Hoare triple {1102#true} ~cond := #in~cond; {1102#true} is VALID [2022-04-14 15:45:45,788 INFO L290 TraceCheckUtils]: 8: Hoare triple {1102#true} assume !(0 == ~cond); {1102#true} is VALID [2022-04-14 15:45:45,788 INFO L290 TraceCheckUtils]: 9: Hoare triple {1102#true} assume true; {1102#true} is VALID [2022-04-14 15:45:45,788 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1102#true} {1102#true} #82#return; {1102#true} is VALID [2022-04-14 15:45:45,788 INFO L290 TraceCheckUtils]: 11: Hoare triple {1102#true} ~B~0 := #t~nondet2;havoc #t~nondet2; {1102#true} is VALID [2022-04-14 15:45:45,788 INFO L272 TraceCheckUtils]: 12: Hoare triple {1102#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 0 && ~B~0 % 4294967296 <= 10 then 1 else 0)); {1102#true} is VALID [2022-04-14 15:45:45,788 INFO L290 TraceCheckUtils]: 13: Hoare triple {1102#true} ~cond := #in~cond; {1102#true} is VALID [2022-04-14 15:45:45,788 INFO L290 TraceCheckUtils]: 14: Hoare triple {1102#true} assume !(0 == ~cond); {1102#true} is VALID [2022-04-14 15:45:45,788 INFO L290 TraceCheckUtils]: 15: Hoare triple {1102#true} assume true; {1102#true} is VALID [2022-04-14 15:45:45,788 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1102#true} {1102#true} #84#return; {1102#true} is VALID [2022-04-14 15:45:45,788 INFO L272 TraceCheckUtils]: 17: Hoare triple {1102#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {1102#true} is VALID [2022-04-14 15:45:45,788 INFO L290 TraceCheckUtils]: 18: Hoare triple {1102#true} ~cond := #in~cond; {1102#true} is VALID [2022-04-14 15:45:45,789 INFO L290 TraceCheckUtils]: 19: Hoare triple {1102#true} assume !(0 == ~cond); {1102#true} is VALID [2022-04-14 15:45:45,789 INFO L290 TraceCheckUtils]: 20: Hoare triple {1102#true} assume true; {1102#true} is VALID [2022-04-14 15:45:45,789 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1102#true} {1102#true} #86#return; {1102#true} is VALID [2022-04-14 15:45:45,789 INFO L272 TraceCheckUtils]: 22: Hoare triple {1102#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1102#true} is VALID [2022-04-14 15:45:45,789 INFO L290 TraceCheckUtils]: 23: Hoare triple {1102#true} ~cond := #in~cond; {1102#true} is VALID [2022-04-14 15:45:45,789 INFO L290 TraceCheckUtils]: 24: Hoare triple {1102#true} assume !(0 == ~cond); {1102#true} is VALID [2022-04-14 15:45:45,789 INFO L290 TraceCheckUtils]: 25: Hoare triple {1102#true} assume true; {1102#true} is VALID [2022-04-14 15:45:45,789 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1102#true} {1102#true} #88#return; {1102#true} is VALID [2022-04-14 15:45:45,791 INFO L290 TraceCheckUtils]: 27: Hoare triple {1102#true} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1188#(= main_~B~0 main_~b~0)} is VALID [2022-04-14 15:45:45,791 INFO L290 TraceCheckUtils]: 28: Hoare triple {1188#(= main_~B~0 main_~b~0)} assume !false; {1188#(= main_~B~0 main_~b~0)} is VALID [2022-04-14 15:45:45,791 INFO L290 TraceCheckUtils]: 29: Hoare triple {1188#(= main_~B~0 main_~b~0)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1188#(= main_~B~0 main_~b~0)} is VALID [2022-04-14 15:45:45,792 INFO L290 TraceCheckUtils]: 30: Hoare triple {1188#(= main_~B~0 main_~b~0)} assume !false; {1188#(= main_~B~0 main_~b~0)} is VALID [2022-04-14 15:45:45,792 INFO L272 TraceCheckUtils]: 31: Hoare triple {1188#(= main_~B~0 main_~b~0)} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1102#true} is VALID [2022-04-14 15:45:45,792 INFO L290 TraceCheckUtils]: 32: Hoare triple {1102#true} ~cond := #in~cond; {1102#true} is VALID [2022-04-14 15:45:45,792 INFO L290 TraceCheckUtils]: 33: Hoare triple {1102#true} assume !(0 == ~cond); {1102#true} is VALID [2022-04-14 15:45:45,792 INFO L290 TraceCheckUtils]: 34: Hoare triple {1102#true} assume true; {1102#true} is VALID [2022-04-14 15:45:45,793 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {1102#true} {1188#(= main_~B~0 main_~b~0)} #90#return; {1188#(= main_~B~0 main_~b~0)} is VALID [2022-04-14 15:45:45,793 INFO L290 TraceCheckUtils]: 36: Hoare triple {1188#(= main_~B~0 main_~b~0)} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {1103#false} is VALID [2022-04-14 15:45:45,794 INFO L290 TraceCheckUtils]: 37: Hoare triple {1103#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1103#false} is VALID [2022-04-14 15:45:45,794 INFO L290 TraceCheckUtils]: 38: Hoare triple {1103#false} assume !false; {1103#false} is VALID [2022-04-14 15:45:45,794 INFO L272 TraceCheckUtils]: 39: Hoare triple {1103#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1103#false} is VALID [2022-04-14 15:45:45,794 INFO L290 TraceCheckUtils]: 40: Hoare triple {1103#false} ~cond := #in~cond; {1103#false} is VALID [2022-04-14 15:45:45,794 INFO L290 TraceCheckUtils]: 41: Hoare triple {1103#false} assume 0 == ~cond; {1103#false} is VALID [2022-04-14 15:45:45,794 INFO L290 TraceCheckUtils]: 42: Hoare triple {1103#false} assume !false; {1103#false} is VALID [2022-04-14 15:45:45,794 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-14 15:45:45,794 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 15:45:45,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:45:45,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963210022] [2022-04-14 15:45:45,795 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:45:45,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1788065841] [2022-04-14 15:45:45,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1788065841] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 15:45:45,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 15:45:45,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-14 15:45:45,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002971635] [2022-04-14 15:45:45,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:45:45,796 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 43 [2022-04-14 15:45:45,796 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:45:45,796 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-14 15:45:45,825 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:45:45,826 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-14 15:45:45,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:45:45,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-14 15:45:45,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 15:45:45,826 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-14 15:45:45,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:45:45,906 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2022-04-14 15:45:45,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-14 15:45:45,906 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 43 [2022-04-14 15:45:45,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:45:45,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-14 15:45:45,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-04-14 15:45:45,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-14 15:45:45,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-04-14 15:45:45,909 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 55 transitions. [2022-04-14 15:45:45,953 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:45:45,954 INFO L225 Difference]: With dead ends: 55 [2022-04-14 15:45:45,954 INFO L226 Difference]: Without dead ends: 37 [2022-04-14 15:45:45,955 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 41 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-14 15:45:45,955 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 15:45:45,956 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 15:45:45,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-14 15:45:45,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-14 15:45:45,960 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:45:45,960 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 23 states have (on average 1.173913043478261) internal successors, (27), 25 states have internal predecessors, (27), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 15:45:45,960 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 23 states have (on average 1.173913043478261) internal successors, (27), 25 states have internal predecessors, (27), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 15:45:45,961 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 23 states have (on average 1.173913043478261) internal successors, (27), 25 states have internal predecessors, (27), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 15:45:45,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:45:45,962 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-04-14 15:45:45,962 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-04-14 15:45:45,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:45:45,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:45:45,963 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 23 states have (on average 1.173913043478261) internal successors, (27), 25 states have internal predecessors, (27), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 37 states. [2022-04-14 15:45:45,963 INFO L87 Difference]: Start difference. First operand has 37 states, 23 states have (on average 1.173913043478261) internal successors, (27), 25 states have internal predecessors, (27), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 37 states. [2022-04-14 15:45:45,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:45:45,964 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-04-14 15:45:45,964 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-04-14 15:45:45,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:45:45,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:45:45,965 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:45:45,965 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:45:45,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 23 states have (on average 1.173913043478261) internal successors, (27), 25 states have internal predecessors, (27), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 15:45:45,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2022-04-14 15:45:45,966 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 43 [2022-04-14 15:45:45,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:45:45,967 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2022-04-14 15:45:45,967 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-14 15:45:45,967 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-04-14 15:45:45,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-14 15:45:45,967 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:45:45,967 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:45:45,994 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-14 15:45:46,194 WARN L460 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-14 15:45:46,195 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:45:46,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:45:46,195 INFO L85 PathProgramCache]: Analyzing trace with hash -75827905, now seen corresponding path program 1 times [2022-04-14 15:45:46,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:45:46,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101705029] [2022-04-14 15:45:46,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:45:46,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:45:46,210 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:45:46,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2016114631] [2022-04-14 15:45:46,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:45:46,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:45:46,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:45:46,211 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-14 15:45:46,212 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-14 15:45:46,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:45:46,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-14 15:45:46,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:45:46,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:45:46,470 INFO L272 TraceCheckUtils]: 0: Hoare triple {1436#true} call ULTIMATE.init(); {1436#true} is VALID [2022-04-14 15:45:46,470 INFO L290 TraceCheckUtils]: 1: Hoare triple {1436#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1436#true} is VALID [2022-04-14 15:45:46,470 INFO L290 TraceCheckUtils]: 2: Hoare triple {1436#true} assume true; {1436#true} is VALID [2022-04-14 15:45:46,471 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1436#true} {1436#true} #94#return; {1436#true} is VALID [2022-04-14 15:45:46,471 INFO L272 TraceCheckUtils]: 4: Hoare triple {1436#true} call #t~ret3 := main(); {1436#true} is VALID [2022-04-14 15:45:46,471 INFO L290 TraceCheckUtils]: 5: Hoare triple {1436#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {1436#true} is VALID [2022-04-14 15:45:46,471 INFO L272 TraceCheckUtils]: 6: Hoare triple {1436#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 10 then 1 else 0)); {1436#true} is VALID [2022-04-14 15:45:46,471 INFO L290 TraceCheckUtils]: 7: Hoare triple {1436#true} ~cond := #in~cond; {1436#true} is VALID [2022-04-14 15:45:46,471 INFO L290 TraceCheckUtils]: 8: Hoare triple {1436#true} assume !(0 == ~cond); {1436#true} is VALID [2022-04-14 15:45:46,471 INFO L290 TraceCheckUtils]: 9: Hoare triple {1436#true} assume true; {1436#true} is VALID [2022-04-14 15:45:46,471 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1436#true} {1436#true} #82#return; {1436#true} is VALID [2022-04-14 15:45:46,471 INFO L290 TraceCheckUtils]: 11: Hoare triple {1436#true} ~B~0 := #t~nondet2;havoc #t~nondet2; {1436#true} is VALID [2022-04-14 15:45:46,471 INFO L272 TraceCheckUtils]: 12: Hoare triple {1436#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 0 && ~B~0 % 4294967296 <= 10 then 1 else 0)); {1436#true} is VALID [2022-04-14 15:45:46,471 INFO L290 TraceCheckUtils]: 13: Hoare triple {1436#true} ~cond := #in~cond; {1436#true} is VALID [2022-04-14 15:45:46,471 INFO L290 TraceCheckUtils]: 14: Hoare triple {1436#true} assume !(0 == ~cond); {1436#true} is VALID [2022-04-14 15:45:46,472 INFO L290 TraceCheckUtils]: 15: Hoare triple {1436#true} assume true; {1436#true} is VALID [2022-04-14 15:45:46,472 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1436#true} {1436#true} #84#return; {1436#true} is VALID [2022-04-14 15:45:46,472 INFO L272 TraceCheckUtils]: 17: Hoare triple {1436#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {1436#true} is VALID [2022-04-14 15:45:46,472 INFO L290 TraceCheckUtils]: 18: Hoare triple {1436#true} ~cond := #in~cond; {1436#true} is VALID [2022-04-14 15:45:46,475 INFO L290 TraceCheckUtils]: 19: Hoare triple {1436#true} assume !(0 == ~cond); {1436#true} is VALID [2022-04-14 15:45:46,475 INFO L290 TraceCheckUtils]: 20: Hoare triple {1436#true} assume true; {1436#true} is VALID [2022-04-14 15:45:46,475 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1436#true} {1436#true} #86#return; {1436#true} is VALID [2022-04-14 15:45:46,475 INFO L272 TraceCheckUtils]: 22: Hoare triple {1436#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1436#true} is VALID [2022-04-14 15:45:46,475 INFO L290 TraceCheckUtils]: 23: Hoare triple {1436#true} ~cond := #in~cond; {1436#true} is VALID [2022-04-14 15:45:46,475 INFO L290 TraceCheckUtils]: 24: Hoare triple {1436#true} assume !(0 == ~cond); {1436#true} is VALID [2022-04-14 15:45:46,476 INFO L290 TraceCheckUtils]: 25: Hoare triple {1436#true} assume true; {1436#true} is VALID [2022-04-14 15:45:46,476 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1436#true} {1436#true} #88#return; {1436#true} is VALID [2022-04-14 15:45:46,476 INFO L290 TraceCheckUtils]: 27: Hoare triple {1436#true} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1436#true} is VALID [2022-04-14 15:45:46,476 INFO L290 TraceCheckUtils]: 28: Hoare triple {1436#true} assume !false; {1436#true} is VALID [2022-04-14 15:45:46,476 INFO L290 TraceCheckUtils]: 29: Hoare triple {1436#true} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1436#true} is VALID [2022-04-14 15:45:46,476 INFO L290 TraceCheckUtils]: 30: Hoare triple {1436#true} assume !false; {1436#true} is VALID [2022-04-14 15:45:46,476 INFO L290 TraceCheckUtils]: 31: Hoare triple {1436#true} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1436#true} is VALID [2022-04-14 15:45:46,476 INFO L290 TraceCheckUtils]: 32: Hoare triple {1436#true} assume !false; {1436#true} is VALID [2022-04-14 15:45:46,476 INFO L272 TraceCheckUtils]: 33: Hoare triple {1436#true} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1436#true} is VALID [2022-04-14 15:45:46,477 INFO L290 TraceCheckUtils]: 34: Hoare triple {1436#true} ~cond := #in~cond; {1543#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:45:46,477 INFO L290 TraceCheckUtils]: 35: Hoare triple {1543#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1547#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:45:46,477 INFO L290 TraceCheckUtils]: 36: Hoare triple {1547#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1547#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:45:46,478 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1547#(not (= |__VERIFIER_assert_#in~cond| 0))} {1436#true} #90#return; {1554#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-14 15:45:46,478 INFO L290 TraceCheckUtils]: 38: Hoare triple {1554#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} assume !(~b~0 % 4294967296 != ~B~0 % 4294967296); {1554#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-14 15:45:46,479 INFO L272 TraceCheckUtils]: 39: Hoare triple {1554#(= (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)); {1561#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2022-04-14 15:45:46,479 INFO L290 TraceCheckUtils]: 40: Hoare triple {1561#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {1565#(= __VERIFIER_assert_~cond 1)} is VALID [2022-04-14 15:45:46,479 INFO L290 TraceCheckUtils]: 41: Hoare triple {1565#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {1437#false} is VALID [2022-04-14 15:45:46,480 INFO L290 TraceCheckUtils]: 42: Hoare triple {1437#false} assume !false; {1437#false} is VALID [2022-04-14 15:45:46,480 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-14 15:45:46,480 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:45:47,333 INFO L290 TraceCheckUtils]: 42: Hoare triple {1437#false} assume !false; {1437#false} is VALID [2022-04-14 15:45:47,333 INFO L290 TraceCheckUtils]: 41: Hoare triple {1575#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1437#false} is VALID [2022-04-14 15:45:47,334 INFO L290 TraceCheckUtils]: 40: Hoare triple {1547#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1575#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 15:45:47,334 INFO L272 TraceCheckUtils]: 39: Hoare triple {1554#(= (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)); {1547#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:45:47,335 INFO L290 TraceCheckUtils]: 38: Hoare triple {1554#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} assume !(~b~0 % 4294967296 != ~B~0 % 4294967296); {1554#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-14 15:45:47,335 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1547#(not (= |__VERIFIER_assert_#in~cond| 0))} {1436#true} #90#return; {1554#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-14 15:45:47,335 INFO L290 TraceCheckUtils]: 36: Hoare triple {1547#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1547#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:45:47,336 INFO L290 TraceCheckUtils]: 35: Hoare triple {1597#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1547#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:45:47,336 INFO L290 TraceCheckUtils]: 34: Hoare triple {1436#true} ~cond := #in~cond; {1597#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 15:45:47,336 INFO L272 TraceCheckUtils]: 33: Hoare triple {1436#true} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1436#true} is VALID [2022-04-14 15:45:47,336 INFO L290 TraceCheckUtils]: 32: Hoare triple {1436#true} assume !false; {1436#true} is VALID [2022-04-14 15:45:47,336 INFO L290 TraceCheckUtils]: 31: Hoare triple {1436#true} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1436#true} is VALID [2022-04-14 15:45:47,336 INFO L290 TraceCheckUtils]: 30: Hoare triple {1436#true} assume !false; {1436#true} is VALID [2022-04-14 15:45:47,336 INFO L290 TraceCheckUtils]: 29: Hoare triple {1436#true} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1436#true} is VALID [2022-04-14 15:45:47,336 INFO L290 TraceCheckUtils]: 28: Hoare triple {1436#true} assume !false; {1436#true} is VALID [2022-04-14 15:45:47,337 INFO L290 TraceCheckUtils]: 27: Hoare triple {1436#true} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1436#true} is VALID [2022-04-14 15:45:47,337 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1436#true} {1436#true} #88#return; {1436#true} is VALID [2022-04-14 15:45:47,337 INFO L290 TraceCheckUtils]: 25: Hoare triple {1436#true} assume true; {1436#true} is VALID [2022-04-14 15:45:47,337 INFO L290 TraceCheckUtils]: 24: Hoare triple {1436#true} assume !(0 == ~cond); {1436#true} is VALID [2022-04-14 15:45:47,338 INFO L290 TraceCheckUtils]: 23: Hoare triple {1436#true} ~cond := #in~cond; {1436#true} is VALID [2022-04-14 15:45:47,338 INFO L272 TraceCheckUtils]: 22: Hoare triple {1436#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1436#true} is VALID [2022-04-14 15:45:47,339 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1436#true} {1436#true} #86#return; {1436#true} is VALID [2022-04-14 15:45:47,340 INFO L290 TraceCheckUtils]: 20: Hoare triple {1436#true} assume true; {1436#true} is VALID [2022-04-14 15:45:47,340 INFO L290 TraceCheckUtils]: 19: Hoare triple {1436#true} assume !(0 == ~cond); {1436#true} is VALID [2022-04-14 15:45:47,340 INFO L290 TraceCheckUtils]: 18: Hoare triple {1436#true} ~cond := #in~cond; {1436#true} is VALID [2022-04-14 15:45:47,341 INFO L272 TraceCheckUtils]: 17: Hoare triple {1436#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {1436#true} is VALID [2022-04-14 15:45:47,341 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1436#true} {1436#true} #84#return; {1436#true} is VALID [2022-04-14 15:45:47,341 INFO L290 TraceCheckUtils]: 15: Hoare triple {1436#true} assume true; {1436#true} is VALID [2022-04-14 15:45:47,341 INFO L290 TraceCheckUtils]: 14: Hoare triple {1436#true} assume !(0 == ~cond); {1436#true} is VALID [2022-04-14 15:45:47,341 INFO L290 TraceCheckUtils]: 13: Hoare triple {1436#true} ~cond := #in~cond; {1436#true} is VALID [2022-04-14 15:45:47,341 INFO L272 TraceCheckUtils]: 12: Hoare triple {1436#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 0 && ~B~0 % 4294967296 <= 10 then 1 else 0)); {1436#true} is VALID [2022-04-14 15:45:47,341 INFO L290 TraceCheckUtils]: 11: Hoare triple {1436#true} ~B~0 := #t~nondet2;havoc #t~nondet2; {1436#true} is VALID [2022-04-14 15:45:47,341 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1436#true} {1436#true} #82#return; {1436#true} is VALID [2022-04-14 15:45:47,341 INFO L290 TraceCheckUtils]: 9: Hoare triple {1436#true} assume true; {1436#true} is VALID [2022-04-14 15:45:47,341 INFO L290 TraceCheckUtils]: 8: Hoare triple {1436#true} assume !(0 == ~cond); {1436#true} is VALID [2022-04-14 15:45:47,342 INFO L290 TraceCheckUtils]: 7: Hoare triple {1436#true} ~cond := #in~cond; {1436#true} is VALID [2022-04-14 15:45:47,342 INFO L272 TraceCheckUtils]: 6: Hoare triple {1436#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 10 then 1 else 0)); {1436#true} is VALID [2022-04-14 15:45:47,342 INFO L290 TraceCheckUtils]: 5: Hoare triple {1436#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {1436#true} is VALID [2022-04-14 15:45:47,342 INFO L272 TraceCheckUtils]: 4: Hoare triple {1436#true} call #t~ret3 := main(); {1436#true} is VALID [2022-04-14 15:45:47,342 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1436#true} {1436#true} #94#return; {1436#true} is VALID [2022-04-14 15:45:47,342 INFO L290 TraceCheckUtils]: 2: Hoare triple {1436#true} assume true; {1436#true} is VALID [2022-04-14 15:45:47,342 INFO L290 TraceCheckUtils]: 1: Hoare triple {1436#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1436#true} is VALID [2022-04-14 15:45:47,342 INFO L272 TraceCheckUtils]: 0: Hoare triple {1436#true} call ULTIMATE.init(); {1436#true} is VALID [2022-04-14 15:45:47,342 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-14 15:45:47,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:45:47,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101705029] [2022-04-14 15:45:47,342 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:45:47,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016114631] [2022-04-14 15:45:47,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016114631] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 15:45:47,343 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 15:45:47,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2022-04-14 15:45:47,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773223238] [2022-04-14 15:45:47,344 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 15:45:47,344 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 43 [2022-04-14 15:45:47,345 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:45:47,345 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-14 15:45:47,368 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:45:47,368 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-14 15:45:47,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:45:47,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-14 15:45:47,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-14 15:45:47,369 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-14 15:45:49,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:45:49,600 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-04-14 15:45:49,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-14 15:45:49,600 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 43 [2022-04-14 15:45:49,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:45:49,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-14 15:45:49,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-04-14 15:45:49,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-14 15:45:49,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-04-14 15:45:49,602 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 42 transitions. [2022-04-14 15:45:49,654 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-14 15:45:49,654 INFO L225 Difference]: With dead ends: 43 [2022-04-14 15:45:49,654 INFO L226 Difference]: Without dead ends: 36 [2022-04-14 15:45:49,655 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-04-14 15:45:49,655 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 12 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 15:45:49,655 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 153 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 15:45:49,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-14 15:45:49,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-14 15:45:49,660 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:45:49,660 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 15:45:49,660 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 15:45:49,660 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 15:45:49,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:45:49,661 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-14 15:45:49,662 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-14 15:45:49,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:45:49,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:45:49,662 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-14 15:45:49,662 INFO L87 Difference]: Start difference. First operand has 36 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-14 15:45:49,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:45:49,663 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-14 15:45:49,663 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-14 15:45:49,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:45:49,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:45:49,663 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:45:49,663 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:45:49,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 15:45:49,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2022-04-14 15:45:49,665 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 43 [2022-04-14 15:45:49,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:45:49,665 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2022-04-14 15:45:49,665 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-14 15:45:49,665 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-14 15:45:49,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-14 15:45:49,665 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:45:49,665 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:45:49,684 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-14 15:45:49,882 WARN L460 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-14 15:45:49,882 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:45:49,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:45:49,882 INFO L85 PathProgramCache]: Analyzing trace with hash 866494938, now seen corresponding path program 1 times [2022-04-14 15:45:49,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:45:49,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628108307] [2022-04-14 15:45:49,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:45:49,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:45:49,897 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:45:49,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [486098546] [2022-04-14 15:45:49,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:45:49,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:45:49,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:45:49,908 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-14 15:45:49,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process