/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_unwindbound10.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 12:33:33,407 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 12:33:33,408 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 12:33:33,443 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 12:33:33,444 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 12:33:33,445 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 12:33:33,449 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 12:33:33,454 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 12:33:33,455 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 12:33:33,460 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 12:33:33,461 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 12:33:33,462 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 12:33:33,462 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 12:33:33,463 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 12:33:33,463 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 12:33:33,464 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 12:33:33,465 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 12:33:33,465 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 12:33:33,467 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 12:33:33,468 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 12:33:33,469 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 12:33:33,474 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 12:33:33,475 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 12:33:33,476 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 12:33:33,477 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 12:33:33,486 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 12:33:33,486 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 12:33:33,486 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 12:33:33,487 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 12:33:33,487 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 12:33:33,488 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 12:33:33,488 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 12:33:33,489 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 12:33:33,489 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 12:33:33,490 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 12:33:33,490 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 12:33:33,491 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 12:33:33,491 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 12:33:33,491 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 12:33:33,492 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 12:33:33,492 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 12:33:33,493 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 12:33:33,494 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 12:33:33,512 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 12:33:33,512 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 12:33:33,513 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 12:33:33,513 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 12:33:33,513 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 12:33:33,513 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 12:33:33,514 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 12:33:33,514 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 12:33:33,514 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 12:33:33,515 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 12:33:33,515 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 12:33:33,515 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 12:33:33,515 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 12:33:33,515 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 12:33:33,515 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 12:33:33,516 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 12:33:33,516 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 12:33:33,516 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 12:33:33,516 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 12:33:33,516 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 12:33:33,517 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 12:33:33,517 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 12:33:33,517 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 12:33:33,517 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 12:33:33,517 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 12:33:33,517 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 12:33:33,518 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 12:33:33,518 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 12:33:33,518 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 12:33:33,518 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 12:33:33,518 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 12:33:33,519 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 12:33:33,519 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 12:33:33,519 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 12:33:33,734 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 12:33:33,749 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 12:33:33,750 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 12:33:33,751 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 12:33:33,751 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 12:33:33,752 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/divbin_unwindbound10.i [2022-04-27 12:33:33,800 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3feb63e9/b3d2c05bc1a745d29ba0a08a660fc434/FLAG2da55bc39 [2022-04-27 12:33:34,141 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 12:33:34,141 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin_unwindbound10.i [2022-04-27 12:33:34,146 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3feb63e9/b3d2c05bc1a745d29ba0a08a660fc434/FLAG2da55bc39 [2022-04-27 12:33:34,580 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3feb63e9/b3d2c05bc1a745d29ba0a08a660fc434 [2022-04-27 12:33:34,582 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 12:33:34,583 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 12:33:34,584 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 12:33:34,584 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 12:33:34,594 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 12:33:34,595 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 12:33:34" (1/1) ... [2022-04-27 12:33:34,596 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@513317f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:33:34, skipping insertion in model container [2022-04-27 12:33:34,596 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 12:33:34" (1/1) ... [2022-04-27 12:33:34,601 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 12:33:34,611 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 12:33:34,767 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_unwindbound10.i[950,963] [2022-04-27 12:33:34,790 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 12:33:34,797 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 12:33:34,806 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_unwindbound10.i[950,963] [2022-04-27 12:33:34,812 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 12:33:34,821 INFO L208 MainTranslator]: Completed translation [2022-04-27 12:33:34,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:33:34 WrapperNode [2022-04-27 12:33:34,822 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 12:33:34,823 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 12:33:34,823 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 12:33:34,823 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 12:33:34,831 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:33:34" (1/1) ... [2022-04-27 12:33:34,831 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:33:34" (1/1) ... [2022-04-27 12:33:34,835 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:33:34" (1/1) ... [2022-04-27 12:33:34,836 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:33:34" (1/1) ... [2022-04-27 12:33:34,841 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:33:34" (1/1) ... [2022-04-27 12:33:34,844 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:33:34" (1/1) ... [2022-04-27 12:33:34,845 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:33:34" (1/1) ... [2022-04-27 12:33:34,847 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 12:33:34,848 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 12:33:34,848 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 12:33:34,848 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 12:33:34,848 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:33:34" (1/1) ... [2022-04-27 12:33:34,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 12:33:34,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:33:34,871 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 12:33:34,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 12:33:34,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 12:33:34,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 12:33:34,909 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 12:33:34,909 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 12:33:34,909 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 12:33:34,909 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 12:33:34,909 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 12:33:34,910 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 12:33:34,910 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 12:33:34,910 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 12:33:34,910 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 12:33:34,910 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 12:33:34,910 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 12:33:34,910 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 12:33:34,910 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 12:33:34,910 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 12:33:34,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 12:33:34,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 12:33:34,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 12:33:34,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 12:33:34,911 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 12:33:34,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 12:33:34,967 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 12:33:34,968 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 12:33:35,089 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 12:33:35,107 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 12:33:35,107 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 12:33:35,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 12:33:35 BoogieIcfgContainer [2022-04-27 12:33:35,109 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 12:33:35,110 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 12:33:35,110 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 12:33:35,113 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 12:33:35,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 12:33:34" (1/3) ... [2022-04-27 12:33:35,114 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ee8238a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 12:33:35, skipping insertion in model container [2022-04-27 12:33:35,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:33:34" (2/3) ... [2022-04-27 12:33:35,114 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ee8238a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 12:33:35, skipping insertion in model container [2022-04-27 12:33:35,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 12:33:35" (3/3) ... [2022-04-27 12:33:35,115 INFO L111 eAbstractionObserver]: Analyzing ICFG divbin_unwindbound10.i [2022-04-27 12:33:35,125 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 12:33:35,125 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 12:33:35,183 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 12:33:35,194 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@483690bb, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3171169b [2022-04-27 12:33:35,194 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 12:33:35,203 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 12:33:35,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 12:33:35,212 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:33:35,212 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:33:35,213 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:33:35,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:33:35,223 INFO L85 PathProgramCache]: Analyzing trace with hash 878397729, now seen corresponding path program 1 times [2022-04-27 12:33:35,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:33:35,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036583909] [2022-04-27 12:33:35,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:33:35,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:33:35,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:33:35,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 12:33:35,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:33:35,424 INFO L290 TraceCheckUtils]: 0: Hoare triple {49#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {36#true} is VALID [2022-04-27 12:33:35,424 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume true; {36#true} is VALID [2022-04-27 12:33:35,425 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36#true} {36#true} #89#return; {36#true} is VALID [2022-04-27 12:33:35,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 12:33:35,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:33:35,433 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-04-27 12:33:35,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-04-27 12:33:35,434 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-27 12:33:35,435 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#false} {36#true} #81#return; {37#false} is VALID [2022-04-27 12:33:35,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 12:33:35,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:33:35,441 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-04-27 12:33:35,442 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-04-27 12:33:35,442 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-27 12:33:35,443 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#false} {37#false} #83#return; {37#false} is VALID [2022-04-27 12:33:35,444 INFO L272 TraceCheckUtils]: 0: Hoare triple {36#true} call ULTIMATE.init(); {49#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 12:33:35,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {49#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {36#true} is VALID [2022-04-27 12:33:35,444 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#true} assume true; {36#true} is VALID [2022-04-27 12:33:35,444 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#true} {36#true} #89#return; {36#true} is VALID [2022-04-27 12:33:35,445 INFO L272 TraceCheckUtils]: 4: Hoare triple {36#true} call #t~ret5 := main(); {36#true} is VALID [2022-04-27 12:33:35,445 INFO L290 TraceCheckUtils]: 5: Hoare triple {36#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {36#true} is VALID [2022-04-27 12:33:35,445 INFO L272 TraceCheckUtils]: 6: Hoare triple {36#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {36#true} is VALID [2022-04-27 12:33:35,445 INFO L290 TraceCheckUtils]: 7: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-04-27 12:33:35,446 INFO L290 TraceCheckUtils]: 8: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-04-27 12:33:35,446 INFO L290 TraceCheckUtils]: 9: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-27 12:33:35,446 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {37#false} {36#true} #81#return; {37#false} is VALID [2022-04-27 12:33:35,446 INFO L272 TraceCheckUtils]: 11: Hoare triple {37#false} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {36#true} is VALID [2022-04-27 12:33:35,447 INFO L290 TraceCheckUtils]: 12: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-04-27 12:33:35,447 INFO L290 TraceCheckUtils]: 13: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-04-27 12:33:35,447 INFO L290 TraceCheckUtils]: 14: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-27 12:33:35,447 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {37#false} {37#false} #83#return; {37#false} is VALID [2022-04-27 12:33:35,448 INFO L290 TraceCheckUtils]: 16: Hoare triple {37#false} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {37#false} is VALID [2022-04-27 12:33:35,448 INFO L290 TraceCheckUtils]: 17: Hoare triple {37#false} assume !true; {37#false} is VALID [2022-04-27 12:33:35,448 INFO L290 TraceCheckUtils]: 18: Hoare triple {37#false} assume !true; {37#false} is VALID [2022-04-27 12:33:35,448 INFO L272 TraceCheckUtils]: 19: Hoare triple {37#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {37#false} is VALID [2022-04-27 12:33:35,448 INFO L290 TraceCheckUtils]: 20: Hoare triple {37#false} ~cond := #in~cond; {37#false} is VALID [2022-04-27 12:33:35,449 INFO L290 TraceCheckUtils]: 21: Hoare triple {37#false} assume 0 == ~cond; {37#false} is VALID [2022-04-27 12:33:35,449 INFO L290 TraceCheckUtils]: 22: Hoare triple {37#false} assume !false; {37#false} is VALID [2022-04-27 12:33:35,449 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 12:33:35,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:33:35,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036583909] [2022-04-27 12:33:35,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036583909] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:33:35,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:33:35,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 12:33:35,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441237397] [2022-04-27 12:33:35,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:33:35,457 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-27 12:33:35,458 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:33:35,460 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:33:35,484 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:33:35,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 12:33:35,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:33:35,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 12:33:35,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:33:35,505 INFO L87 Difference]: Start difference. First operand has 33 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:33:35,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:33:35,631 INFO L93 Difference]: Finished difference Result 60 states and 84 transitions. [2022-04-27 12:33:35,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 12:33:35,631 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-27 12:33:35,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:33:35,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:33:35,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2022-04-27 12:33:35,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:33:35,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2022-04-27 12:33:35,644 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 84 transitions. [2022-04-27 12:33:35,731 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:33:35,739 INFO L225 Difference]: With dead ends: 60 [2022-04-27 12:33:35,739 INFO L226 Difference]: Without dead ends: 29 [2022-04-27 12:33:35,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:33:35,759 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:33:35,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 40 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:33:35,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-27 12:33:35,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2022-04-27 12:33:35,786 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:33:35,787 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 12:33:35,788 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 12:33:35,788 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 12:33:35,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:33:35,793 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-27 12:33:35,793 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-27 12:33:35,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:33:35,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:33:35,795 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 29 states. [2022-04-27 12:33:35,795 INFO L87 Difference]: Start difference. First operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 29 states. [2022-04-27 12:33:35,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:33:35,798 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-27 12:33:35,798 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-27 12:33:35,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:33:35,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:33:35,799 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:33:35,803 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:33:35,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 12:33:35,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2022-04-27 12:33:35,815 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 23 [2022-04-27 12:33:35,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:33:35,815 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-04-27 12:33:35,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:33:35,816 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-04-27 12:33:35,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-27 12:33:35,817 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:33:35,817 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:33:35,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 12:33:35,817 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:33:35,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:33:35,818 INFO L85 PathProgramCache]: Analyzing trace with hash 994169231, now seen corresponding path program 1 times [2022-04-27 12:33:35,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:33:35,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388355247] [2022-04-27 12:33:35,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:33:35,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:33:35,845 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:33:35,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [965446033] [2022-04-27 12:33:35,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:33:35,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:33:35,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:33:35,847 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:33:35,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 12:33:35,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:33:35,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 12:33:35,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:33:35,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:33:36,130 INFO L272 TraceCheckUtils]: 0: Hoare triple {227#true} call ULTIMATE.init(); {227#true} is VALID [2022-04-27 12:33:36,131 INFO L290 TraceCheckUtils]: 1: Hoare triple {227#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:33:36,132 INFO L290 TraceCheckUtils]: 2: Hoare triple {235#(<= ~counter~0 0)} assume true; {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:33:36,132 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {235#(<= ~counter~0 0)} {227#true} #89#return; {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:33:36,133 INFO L272 TraceCheckUtils]: 4: Hoare triple {235#(<= ~counter~0 0)} call #t~ret5 := main(); {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:33:36,133 INFO L290 TraceCheckUtils]: 5: Hoare triple {235#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:33:36,134 INFO L272 TraceCheckUtils]: 6: Hoare triple {235#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:33:36,135 INFO L290 TraceCheckUtils]: 7: Hoare triple {235#(<= ~counter~0 0)} ~cond := #in~cond; {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:33:36,135 INFO L290 TraceCheckUtils]: 8: Hoare triple {235#(<= ~counter~0 0)} assume !(0 == ~cond); {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:33:36,136 INFO L290 TraceCheckUtils]: 9: Hoare triple {235#(<= ~counter~0 0)} assume true; {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:33:36,137 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {235#(<= ~counter~0 0)} {235#(<= ~counter~0 0)} #81#return; {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:33:36,138 INFO L272 TraceCheckUtils]: 11: Hoare triple {235#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:33:36,138 INFO L290 TraceCheckUtils]: 12: Hoare triple {235#(<= ~counter~0 0)} ~cond := #in~cond; {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:33:36,139 INFO L290 TraceCheckUtils]: 13: Hoare triple {235#(<= ~counter~0 0)} assume !(0 == ~cond); {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:33:36,142 INFO L290 TraceCheckUtils]: 14: Hoare triple {235#(<= ~counter~0 0)} assume true; {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:33:36,143 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {235#(<= ~counter~0 0)} {235#(<= ~counter~0 0)} #83#return; {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:33:36,144 INFO L290 TraceCheckUtils]: 16: Hoare triple {235#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:33:36,144 INFO L290 TraceCheckUtils]: 17: Hoare triple {235#(<= ~counter~0 0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {284#(<= |main_#t~post3| 0)} is VALID [2022-04-27 12:33:36,145 INFO L290 TraceCheckUtils]: 18: Hoare triple {284#(<= |main_#t~post3| 0)} assume !(#t~post3 < 10);havoc #t~post3; {228#false} is VALID [2022-04-27 12:33:36,145 INFO L290 TraceCheckUtils]: 19: Hoare triple {228#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {228#false} is VALID [2022-04-27 12:33:36,145 INFO L290 TraceCheckUtils]: 20: Hoare triple {228#false} assume !(#t~post4 < 10);havoc #t~post4; {228#false} is VALID [2022-04-27 12:33:36,147 INFO L272 TraceCheckUtils]: 21: Hoare triple {228#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {228#false} is VALID [2022-04-27 12:33:36,148 INFO L290 TraceCheckUtils]: 22: Hoare triple {228#false} ~cond := #in~cond; {228#false} is VALID [2022-04-27 12:33:36,149 INFO L290 TraceCheckUtils]: 23: Hoare triple {228#false} assume 0 == ~cond; {228#false} is VALID [2022-04-27 12:33:36,150 INFO L290 TraceCheckUtils]: 24: Hoare triple {228#false} assume !false; {228#false} is VALID [2022-04-27 12:33:36,150 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 12:33:36,150 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:33:36,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:33:36,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388355247] [2022-04-27 12:33:36,151 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:33:36,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [965446033] [2022-04-27 12:33:36,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [965446033] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:33:36,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:33:36,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 12:33:36,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363078171] [2022-04-27 12:33:36,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:33:36,159 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-04-27 12:33:36,159 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:33:36,159 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:33:36,178 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:33:36,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 12:33:36,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:33:36,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 12:33:36,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 12:33:36,181 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:33:36,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:33:36,255 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2022-04-27 12:33:36,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 12:33:36,256 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-04-27 12:33:36,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:33:36,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:33:36,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-04-27 12:33:36,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:33:36,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-04-27 12:33:36,261 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 52 transitions. [2022-04-27 12:33:36,304 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:33:36,306 INFO L225 Difference]: With dead ends: 42 [2022-04-27 12:33:36,306 INFO L226 Difference]: Without dead ends: 30 [2022-04-27 12:33:36,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 12:33:36,307 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:33:36,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:33:36,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-27 12:33:36,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-27 12:33:36,320 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:33:36,321 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 12:33:36,321 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 12:33:36,322 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 12:33:36,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:33:36,326 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-04-27 12:33:36,326 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-27 12:33:36,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:33:36,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:33:36,329 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 30 states. [2022-04-27 12:33:36,330 INFO L87 Difference]: Start difference. First operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 30 states. [2022-04-27 12:33:36,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:33:36,335 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-04-27 12:33:36,335 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-27 12:33:36,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:33:36,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:33:36,336 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:33:36,336 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:33:36,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 12:33:36,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-04-27 12:33:36,338 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 25 [2022-04-27 12:33:36,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:33:36,338 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-04-27 12:33:36,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:33:36,338 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-27 12:33:36,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 12:33:36,339 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:33:36,339 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:33:36,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 12:33:36,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:33:36,540 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:33:36,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:33:36,541 INFO L85 PathProgramCache]: Analyzing trace with hash 422434646, now seen corresponding path program 1 times [2022-04-27 12:33:36,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:33:36,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033711191] [2022-04-27 12:33:36,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:33:36,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:33:36,566 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:33:36,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2069733406] [2022-04-27 12:33:36,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:33:36,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:33:36,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:33:36,568 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:33:36,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 12:33:36,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:33:36,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 12:33:36,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:33:36,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:33:36,783 INFO L272 TraceCheckUtils]: 0: Hoare triple {464#true} call ULTIMATE.init(); {464#true} is VALID [2022-04-27 12:33:36,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {464#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {472#(<= ~counter~0 0)} is VALID [2022-04-27 12:33:36,784 INFO L290 TraceCheckUtils]: 2: Hoare triple {472#(<= ~counter~0 0)} assume true; {472#(<= ~counter~0 0)} is VALID [2022-04-27 12:33:36,785 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {472#(<= ~counter~0 0)} {464#true} #89#return; {472#(<= ~counter~0 0)} is VALID [2022-04-27 12:33:36,785 INFO L272 TraceCheckUtils]: 4: Hoare triple {472#(<= ~counter~0 0)} call #t~ret5 := main(); {472#(<= ~counter~0 0)} is VALID [2022-04-27 12:33:36,786 INFO L290 TraceCheckUtils]: 5: Hoare triple {472#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {472#(<= ~counter~0 0)} is VALID [2022-04-27 12:33:36,786 INFO L272 TraceCheckUtils]: 6: Hoare triple {472#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {472#(<= ~counter~0 0)} is VALID [2022-04-27 12:33:36,786 INFO L290 TraceCheckUtils]: 7: Hoare triple {472#(<= ~counter~0 0)} ~cond := #in~cond; {472#(<= ~counter~0 0)} is VALID [2022-04-27 12:33:36,787 INFO L290 TraceCheckUtils]: 8: Hoare triple {472#(<= ~counter~0 0)} assume !(0 == ~cond); {472#(<= ~counter~0 0)} is VALID [2022-04-27 12:33:36,787 INFO L290 TraceCheckUtils]: 9: Hoare triple {472#(<= ~counter~0 0)} assume true; {472#(<= ~counter~0 0)} is VALID [2022-04-27 12:33:36,788 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {472#(<= ~counter~0 0)} {472#(<= ~counter~0 0)} #81#return; {472#(<= ~counter~0 0)} is VALID [2022-04-27 12:33:36,788 INFO L272 TraceCheckUtils]: 11: Hoare triple {472#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {472#(<= ~counter~0 0)} is VALID [2022-04-27 12:33:36,789 INFO L290 TraceCheckUtils]: 12: Hoare triple {472#(<= ~counter~0 0)} ~cond := #in~cond; {472#(<= ~counter~0 0)} is VALID [2022-04-27 12:33:36,789 INFO L290 TraceCheckUtils]: 13: Hoare triple {472#(<= ~counter~0 0)} assume !(0 == ~cond); {472#(<= ~counter~0 0)} is VALID [2022-04-27 12:33:36,790 INFO L290 TraceCheckUtils]: 14: Hoare triple {472#(<= ~counter~0 0)} assume true; {472#(<= ~counter~0 0)} is VALID [2022-04-27 12:33:36,790 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {472#(<= ~counter~0 0)} {472#(<= ~counter~0 0)} #83#return; {472#(<= ~counter~0 0)} is VALID [2022-04-27 12:33:36,791 INFO L290 TraceCheckUtils]: 16: Hoare triple {472#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {472#(<= ~counter~0 0)} is VALID [2022-04-27 12:33:36,791 INFO L290 TraceCheckUtils]: 17: Hoare triple {472#(<= ~counter~0 0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {521#(<= ~counter~0 1)} is VALID [2022-04-27 12:33:36,792 INFO L290 TraceCheckUtils]: 18: Hoare triple {521#(<= ~counter~0 1)} assume !!(#t~post3 < 10);havoc #t~post3; {521#(<= ~counter~0 1)} is VALID [2022-04-27 12:33:36,792 INFO L290 TraceCheckUtils]: 19: Hoare triple {521#(<= ~counter~0 1)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {521#(<= ~counter~0 1)} is VALID [2022-04-27 12:33:36,793 INFO L290 TraceCheckUtils]: 20: Hoare triple {521#(<= ~counter~0 1)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {531#(<= |main_#t~post4| 1)} is VALID [2022-04-27 12:33:36,793 INFO L290 TraceCheckUtils]: 21: Hoare triple {531#(<= |main_#t~post4| 1)} assume !(#t~post4 < 10);havoc #t~post4; {465#false} is VALID [2022-04-27 12:33:36,793 INFO L272 TraceCheckUtils]: 22: Hoare triple {465#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {465#false} is VALID [2022-04-27 12:33:36,793 INFO L290 TraceCheckUtils]: 23: Hoare triple {465#false} ~cond := #in~cond; {465#false} is VALID [2022-04-27 12:33:36,794 INFO L290 TraceCheckUtils]: 24: Hoare triple {465#false} assume 0 == ~cond; {465#false} is VALID [2022-04-27 12:33:36,794 INFO L290 TraceCheckUtils]: 25: Hoare triple {465#false} assume !false; {465#false} is VALID [2022-04-27 12:33:36,794 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 12:33:36,794 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:33:36,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:33:36,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033711191] [2022-04-27 12:33:36,795 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:33:36,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069733406] [2022-04-27 12:33:36,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2069733406] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:33:36,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:33:36,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 12:33:36,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611631874] [2022-04-27 12:33:36,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:33:36,796 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-04-27 12:33:36,796 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:33:36,796 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:33:36,814 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:33:36,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:33:36,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:33:36,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:33:36,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:33:36,816 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:33:39,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:33:39,008 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-27 12:33:39,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:33:39,009 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-04-27 12:33:39,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:33:39,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:33:39,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-04-27 12:33:39,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:33:39,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-04-27 12:33:39,013 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 48 transitions. [2022-04-27 12:33:39,064 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:33:39,065 INFO L225 Difference]: With dead ends: 41 [2022-04-27 12:33:39,065 INFO L226 Difference]: Without dead ends: 34 [2022-04-27 12:33:39,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:33:39,067 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 7 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:33:39,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 97 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:33:39,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-27 12:33:39,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2022-04-27 12:33:39,089 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:33:39,089 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 12:33:39,089 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 12:33:39,090 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 12:33:39,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:33:39,091 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2022-04-27 12:33:39,092 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-04-27 12:33:39,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:33:39,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:33:39,092 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-27 12:33:39,093 INFO L87 Difference]: Start difference. First operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-27 12:33:39,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:33:39,094 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2022-04-27 12:33:39,094 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-04-27 12:33:39,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:33:39,095 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:33:39,095 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:33:39,095 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:33:39,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 12:33:39,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2022-04-27 12:33:39,097 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 26 [2022-04-27 12:33:39,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:33:39,097 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2022-04-27 12:33:39,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:33:39,097 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2022-04-27 12:33:39,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 12:33:39,098 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:33:39,098 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:33:39,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 12:33:39,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-27 12:33:39,328 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:33:39,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:33:39,329 INFO L85 PathProgramCache]: Analyzing trace with hash 424222106, now seen corresponding path program 1 times [2022-04-27 12:33:39,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:33:39,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045555908] [2022-04-27 12:33:39,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:33:39,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:33:39,352 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:33:39,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [722118171] [2022-04-27 12:33:39,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:33:39,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:33:39,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:33:39,357 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:33:39,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 12:33:39,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:33:39,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-27 12:33:39,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:33:39,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:33:40,456 INFO L272 TraceCheckUtils]: 0: Hoare triple {715#true} call ULTIMATE.init(); {715#true} is VALID [2022-04-27 12:33:40,457 INFO L290 TraceCheckUtils]: 1: Hoare triple {715#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {715#true} is VALID [2022-04-27 12:33:40,457 INFO L290 TraceCheckUtils]: 2: Hoare triple {715#true} assume true; {715#true} is VALID [2022-04-27 12:33:40,457 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {715#true} {715#true} #89#return; {715#true} is VALID [2022-04-27 12:33:40,457 INFO L272 TraceCheckUtils]: 4: Hoare triple {715#true} call #t~ret5 := main(); {715#true} is VALID [2022-04-27 12:33:40,459 INFO L290 TraceCheckUtils]: 5: Hoare triple {715#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {715#true} is VALID [2022-04-27 12:33:40,459 INFO L272 TraceCheckUtils]: 6: Hoare triple {715#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {715#true} is VALID [2022-04-27 12:33:40,459 INFO L290 TraceCheckUtils]: 7: Hoare triple {715#true} ~cond := #in~cond; {741#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 12:33:40,460 INFO L290 TraceCheckUtils]: 8: Hoare triple {741#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {745#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:33:40,461 INFO L290 TraceCheckUtils]: 9: Hoare triple {745#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {745#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:33:40,461 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {745#(not (= |assume_abort_if_not_#in~cond| 0))} {715#true} #81#return; {752#(< (mod main_~B~0 4294967296) 2147483647)} is VALID [2022-04-27 12:33:40,462 INFO L272 TraceCheckUtils]: 11: Hoare triple {752#(< (mod main_~B~0 4294967296) 2147483647)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {715#true} is VALID [2022-04-27 12:33:40,462 INFO L290 TraceCheckUtils]: 12: Hoare triple {715#true} ~cond := #in~cond; {715#true} is VALID [2022-04-27 12:33:40,462 INFO L290 TraceCheckUtils]: 13: Hoare triple {715#true} assume !(0 == ~cond); {715#true} is VALID [2022-04-27 12:33:40,462 INFO L290 TraceCheckUtils]: 14: Hoare triple {715#true} assume true; {715#true} is VALID [2022-04-27 12:33:40,463 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {715#true} {752#(< (mod main_~B~0 4294967296) 2147483647)} #83#return; {752#(< (mod main_~B~0 4294967296) 2147483647)} is VALID [2022-04-27 12:33:40,465 INFO L290 TraceCheckUtils]: 16: Hoare triple {752#(< (mod main_~B~0 4294967296) 2147483647)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {771#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (< (mod main_~b~0 4294967296) 2147483647))} is VALID [2022-04-27 12:33:40,466 INFO L290 TraceCheckUtils]: 17: Hoare triple {771#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (< (mod main_~b~0 4294967296) 2147483647))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {771#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (< (mod main_~b~0 4294967296) 2147483647))} is VALID [2022-04-27 12:33:40,467 INFO L290 TraceCheckUtils]: 18: Hoare triple {771#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (< (mod main_~b~0 4294967296) 2147483647))} assume !!(#t~post3 < 10);havoc #t~post3; {771#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (< (mod main_~b~0 4294967296) 2147483647))} is VALID [2022-04-27 12:33:40,467 INFO L290 TraceCheckUtils]: 19: Hoare triple {771#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (< (mod main_~b~0 4294967296) 2147483647))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {781#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0) (< (mod main_~b~0 4294967296) 2147483647))} is VALID [2022-04-27 12:33:40,468 INFO L290 TraceCheckUtils]: 20: Hoare triple {781#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0) (< (mod main_~b~0 4294967296) 2147483647))} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {781#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0) (< (mod main_~b~0 4294967296) 2147483647))} is VALID [2022-04-27 12:33:40,469 INFO L290 TraceCheckUtils]: 21: Hoare triple {781#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0) (< (mod main_~b~0 4294967296) 2147483647))} assume !!(#t~post4 < 10);havoc #t~post4; {781#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0) (< (mod main_~b~0 4294967296) 2147483647))} is VALID [2022-04-27 12:33:40,470 INFO L272 TraceCheckUtils]: 22: Hoare triple {781#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0) (< (mod main_~b~0 4294967296) 2147483647))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {791#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:33:40,470 INFO L290 TraceCheckUtils]: 23: Hoare triple {791#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {795#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:33:40,471 INFO L290 TraceCheckUtils]: 24: Hoare triple {795#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {716#false} is VALID [2022-04-27 12:33:40,471 INFO L290 TraceCheckUtils]: 25: Hoare triple {716#false} assume !false; {716#false} is VALID [2022-04-27 12:33:40,471 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 12:33:40,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:33:41,118 INFO L290 TraceCheckUtils]: 25: Hoare triple {716#false} assume !false; {716#false} is VALID [2022-04-27 12:33:41,118 INFO L290 TraceCheckUtils]: 24: Hoare triple {795#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {716#false} is VALID [2022-04-27 12:33:41,119 INFO L290 TraceCheckUtils]: 23: Hoare triple {791#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {795#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:33:41,120 INFO L272 TraceCheckUtils]: 22: Hoare triple {811#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {791#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:33:41,120 INFO L290 TraceCheckUtils]: 21: Hoare triple {811#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} assume !!(#t~post4 < 10);havoc #t~post4; {811#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 12:33:41,121 INFO L290 TraceCheckUtils]: 20: Hoare triple {811#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {811#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 12:33:41,121 INFO L290 TraceCheckUtils]: 19: Hoare triple {821#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {811#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 12:33:41,122 INFO L290 TraceCheckUtils]: 18: Hoare triple {821#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} assume !!(#t~post3 < 10);havoc #t~post3; {821#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-27 12:33:41,122 INFO L290 TraceCheckUtils]: 17: Hoare triple {821#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {821#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-27 12:33:41,123 INFO L290 TraceCheckUtils]: 16: Hoare triple {715#true} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {821#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-27 12:33:41,123 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {715#true} {715#true} #83#return; {715#true} is VALID [2022-04-27 12:33:41,123 INFO L290 TraceCheckUtils]: 14: Hoare triple {715#true} assume true; {715#true} is VALID [2022-04-27 12:33:41,124 INFO L290 TraceCheckUtils]: 13: Hoare triple {715#true} assume !(0 == ~cond); {715#true} is VALID [2022-04-27 12:33:41,124 INFO L290 TraceCheckUtils]: 12: Hoare triple {715#true} ~cond := #in~cond; {715#true} is VALID [2022-04-27 12:33:41,124 INFO L272 TraceCheckUtils]: 11: Hoare triple {715#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {715#true} is VALID [2022-04-27 12:33:41,124 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {715#true} {715#true} #81#return; {715#true} is VALID [2022-04-27 12:33:41,124 INFO L290 TraceCheckUtils]: 9: Hoare triple {715#true} assume true; {715#true} is VALID [2022-04-27 12:33:41,124 INFO L290 TraceCheckUtils]: 8: Hoare triple {715#true} assume !(0 == ~cond); {715#true} is VALID [2022-04-27 12:33:41,124 INFO L290 TraceCheckUtils]: 7: Hoare triple {715#true} ~cond := #in~cond; {715#true} is VALID [2022-04-27 12:33:41,125 INFO L272 TraceCheckUtils]: 6: Hoare triple {715#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {715#true} is VALID [2022-04-27 12:33:41,125 INFO L290 TraceCheckUtils]: 5: Hoare triple {715#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {715#true} is VALID [2022-04-27 12:33:41,125 INFO L272 TraceCheckUtils]: 4: Hoare triple {715#true} call #t~ret5 := main(); {715#true} is VALID [2022-04-27 12:33:41,125 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {715#true} {715#true} #89#return; {715#true} is VALID [2022-04-27 12:33:41,125 INFO L290 TraceCheckUtils]: 2: Hoare triple {715#true} assume true; {715#true} is VALID [2022-04-27 12:33:41,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {715#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {715#true} is VALID [2022-04-27 12:33:41,125 INFO L272 TraceCheckUtils]: 0: Hoare triple {715#true} call ULTIMATE.init(); {715#true} is VALID [2022-04-27 12:33:41,126 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 12:33:41,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:33:41,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045555908] [2022-04-27 12:33:41,126 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:33:41,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722118171] [2022-04-27 12:33:41,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [722118171] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 12:33:41,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:33:41,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2022-04-27 12:33:41,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156734287] [2022-04-27 12:33:41,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:33:41,127 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-04-27 12:33:41,128 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:33:41,128 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:33:41,148 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:33:41,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 12:33:41,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:33:41,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 12:33:41,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-27 12:33:41,149 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:33:44,102 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:33:46,233 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:33:48,392 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:33:48,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:33:48,394 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2022-04-27 12:33:48,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:33:48,498 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-04-27 12:33:48,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:33:48,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:33:48,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-27 12:33:48,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:33:48,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-27 12:33:48,502 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 50 transitions. [2022-04-27 12:33:48,561 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:33:48,562 INFO L225 Difference]: With dead ends: 42 [2022-04-27 12:33:48,562 INFO L226 Difference]: Without dead ends: 39 [2022-04-27 12:33:48,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-04-27 12:33:48,564 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 11 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-04-27 12:33:48,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 126 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 3 Unknown, 0 Unchecked, 6.3s Time] [2022-04-27 12:33:48,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-27 12:33:48,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-27 12:33:48,572 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:33:48,573 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 12:33:48,573 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 12:33:48,573 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 12:33:48,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:33:48,575 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2022-04-27 12:33:48,575 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-04-27 12:33:48,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:33:48,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:33:48,576 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 39 states. [2022-04-27 12:33:48,576 INFO L87 Difference]: Start difference. First operand has 39 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 39 states. [2022-04-27 12:33:48,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:33:48,578 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2022-04-27 12:33:48,578 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-04-27 12:33:48,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:33:48,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:33:48,579 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:33:48,579 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:33:48,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 12:33:48,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2022-04-27 12:33:48,581 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 26 [2022-04-27 12:33:48,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:33:48,581 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2022-04-27 12:33:48,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:33:48,581 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-04-27 12:33:48,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 12:33:48,582 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:33:48,582 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:33:48,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 12:33:48,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:33:48,783 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:33:48,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:33:48,783 INFO L85 PathProgramCache]: Analyzing trace with hash -193375877, now seen corresponding path program 1 times [2022-04-27 12:33:48,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:33:48,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428073073] [2022-04-27 12:33:48,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:33:48,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:33:48,809 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:33:48,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1508520312] [2022-04-27 12:33:48,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:33:48,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:33:48,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:33:48,828 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:33:48,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 12:33:48,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:33:48,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 12:33:48,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:33:48,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:33:49,070 INFO L272 TraceCheckUtils]: 0: Hoare triple {1071#true} call ULTIMATE.init(); {1071#true} is VALID [2022-04-27 12:33:49,071 INFO L290 TraceCheckUtils]: 1: Hoare triple {1071#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:33:49,072 INFO L290 TraceCheckUtils]: 2: Hoare triple {1079#(<= ~counter~0 0)} assume true; {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:33:49,072 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1079#(<= ~counter~0 0)} {1071#true} #89#return; {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:33:49,073 INFO L272 TraceCheckUtils]: 4: Hoare triple {1079#(<= ~counter~0 0)} call #t~ret5 := main(); {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:33:49,073 INFO L290 TraceCheckUtils]: 5: Hoare triple {1079#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:33:49,074 INFO L272 TraceCheckUtils]: 6: Hoare triple {1079#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:33:49,074 INFO L290 TraceCheckUtils]: 7: Hoare triple {1079#(<= ~counter~0 0)} ~cond := #in~cond; {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:33:49,075 INFO L290 TraceCheckUtils]: 8: Hoare triple {1079#(<= ~counter~0 0)} assume !(0 == ~cond); {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:33:49,075 INFO L290 TraceCheckUtils]: 9: Hoare triple {1079#(<= ~counter~0 0)} assume true; {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:33:49,076 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1079#(<= ~counter~0 0)} {1079#(<= ~counter~0 0)} #81#return; {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:33:49,076 INFO L272 TraceCheckUtils]: 11: Hoare triple {1079#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:33:49,077 INFO L290 TraceCheckUtils]: 12: Hoare triple {1079#(<= ~counter~0 0)} ~cond := #in~cond; {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:33:49,077 INFO L290 TraceCheckUtils]: 13: Hoare triple {1079#(<= ~counter~0 0)} assume !(0 == ~cond); {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:33:49,077 INFO L290 TraceCheckUtils]: 14: Hoare triple {1079#(<= ~counter~0 0)} assume true; {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:33:49,078 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1079#(<= ~counter~0 0)} {1079#(<= ~counter~0 0)} #83#return; {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:33:49,079 INFO L290 TraceCheckUtils]: 16: Hoare triple {1079#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:33:49,080 INFO L290 TraceCheckUtils]: 17: Hoare triple {1079#(<= ~counter~0 0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1128#(<= ~counter~0 1)} is VALID [2022-04-27 12:33:49,081 INFO L290 TraceCheckUtils]: 18: Hoare triple {1128#(<= ~counter~0 1)} assume !!(#t~post3 < 10);havoc #t~post3; {1128#(<= ~counter~0 1)} is VALID [2022-04-27 12:33:49,081 INFO L290 TraceCheckUtils]: 19: Hoare triple {1128#(<= ~counter~0 1)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1128#(<= ~counter~0 1)} is VALID [2022-04-27 12:33:49,082 INFO L290 TraceCheckUtils]: 20: Hoare triple {1128#(<= ~counter~0 1)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1138#(<= |main_#t~post3| 1)} is VALID [2022-04-27 12:33:49,082 INFO L290 TraceCheckUtils]: 21: Hoare triple {1138#(<= |main_#t~post3| 1)} assume !(#t~post3 < 10);havoc #t~post3; {1072#false} is VALID [2022-04-27 12:33:49,083 INFO L290 TraceCheckUtils]: 22: Hoare triple {1072#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {1072#false} is VALID [2022-04-27 12:33:49,083 INFO L290 TraceCheckUtils]: 23: Hoare triple {1072#false} assume !(#t~post4 < 10);havoc #t~post4; {1072#false} is VALID [2022-04-27 12:33:49,083 INFO L272 TraceCheckUtils]: 24: Hoare triple {1072#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1072#false} is VALID [2022-04-27 12:33:49,083 INFO L290 TraceCheckUtils]: 25: Hoare triple {1072#false} ~cond := #in~cond; {1072#false} is VALID [2022-04-27 12:33:49,083 INFO L290 TraceCheckUtils]: 26: Hoare triple {1072#false} assume 0 == ~cond; {1072#false} is VALID [2022-04-27 12:33:49,083 INFO L290 TraceCheckUtils]: 27: Hoare triple {1072#false} assume !false; {1072#false} is VALID [2022-04-27 12:33:49,084 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 12:33:49,084 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:33:49,279 INFO L290 TraceCheckUtils]: 27: Hoare triple {1072#false} assume !false; {1072#false} is VALID [2022-04-27 12:33:49,279 INFO L290 TraceCheckUtils]: 26: Hoare triple {1072#false} assume 0 == ~cond; {1072#false} is VALID [2022-04-27 12:33:49,279 INFO L290 TraceCheckUtils]: 25: Hoare triple {1072#false} ~cond := #in~cond; {1072#false} is VALID [2022-04-27 12:33:49,279 INFO L272 TraceCheckUtils]: 24: Hoare triple {1072#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1072#false} is VALID [2022-04-27 12:33:49,280 INFO L290 TraceCheckUtils]: 23: Hoare triple {1072#false} assume !(#t~post4 < 10);havoc #t~post4; {1072#false} is VALID [2022-04-27 12:33:49,280 INFO L290 TraceCheckUtils]: 22: Hoare triple {1072#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {1072#false} is VALID [2022-04-27 12:33:49,290 INFO L290 TraceCheckUtils]: 21: Hoare triple {1178#(< |main_#t~post3| 10)} assume !(#t~post3 < 10);havoc #t~post3; {1072#false} is VALID [2022-04-27 12:33:49,290 INFO L290 TraceCheckUtils]: 20: Hoare triple {1182#(< ~counter~0 10)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1178#(< |main_#t~post3| 10)} is VALID [2022-04-27 12:33:49,291 INFO L290 TraceCheckUtils]: 19: Hoare triple {1182#(< ~counter~0 10)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1182#(< ~counter~0 10)} is VALID [2022-04-27 12:33:49,291 INFO L290 TraceCheckUtils]: 18: Hoare triple {1182#(< ~counter~0 10)} assume !!(#t~post3 < 10);havoc #t~post3; {1182#(< ~counter~0 10)} is VALID [2022-04-27 12:33:49,292 INFO L290 TraceCheckUtils]: 17: Hoare triple {1192#(< ~counter~0 9)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1182#(< ~counter~0 10)} is VALID [2022-04-27 12:33:49,292 INFO L290 TraceCheckUtils]: 16: Hoare triple {1192#(< ~counter~0 9)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1192#(< ~counter~0 9)} is VALID [2022-04-27 12:33:49,293 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1071#true} {1192#(< ~counter~0 9)} #83#return; {1192#(< ~counter~0 9)} is VALID [2022-04-27 12:33:49,293 INFO L290 TraceCheckUtils]: 14: Hoare triple {1071#true} assume true; {1071#true} is VALID [2022-04-27 12:33:49,293 INFO L290 TraceCheckUtils]: 13: Hoare triple {1071#true} assume !(0 == ~cond); {1071#true} is VALID [2022-04-27 12:33:49,293 INFO L290 TraceCheckUtils]: 12: Hoare triple {1071#true} ~cond := #in~cond; {1071#true} is VALID [2022-04-27 12:33:49,293 INFO L272 TraceCheckUtils]: 11: Hoare triple {1192#(< ~counter~0 9)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1071#true} is VALID [2022-04-27 12:33:49,294 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1071#true} {1192#(< ~counter~0 9)} #81#return; {1192#(< ~counter~0 9)} is VALID [2022-04-27 12:33:49,294 INFO L290 TraceCheckUtils]: 9: Hoare triple {1071#true} assume true; {1071#true} is VALID [2022-04-27 12:33:49,294 INFO L290 TraceCheckUtils]: 8: Hoare triple {1071#true} assume !(0 == ~cond); {1071#true} is VALID [2022-04-27 12:33:49,294 INFO L290 TraceCheckUtils]: 7: Hoare triple {1071#true} ~cond := #in~cond; {1071#true} is VALID [2022-04-27 12:33:49,294 INFO L272 TraceCheckUtils]: 6: Hoare triple {1192#(< ~counter~0 9)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {1071#true} is VALID [2022-04-27 12:33:49,295 INFO L290 TraceCheckUtils]: 5: Hoare triple {1192#(< ~counter~0 9)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {1192#(< ~counter~0 9)} is VALID [2022-04-27 12:33:49,295 INFO L272 TraceCheckUtils]: 4: Hoare triple {1192#(< ~counter~0 9)} call #t~ret5 := main(); {1192#(< ~counter~0 9)} is VALID [2022-04-27 12:33:49,296 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1192#(< ~counter~0 9)} {1071#true} #89#return; {1192#(< ~counter~0 9)} is VALID [2022-04-27 12:33:49,296 INFO L290 TraceCheckUtils]: 2: Hoare triple {1192#(< ~counter~0 9)} assume true; {1192#(< ~counter~0 9)} is VALID [2022-04-27 12:33:49,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {1071#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {1192#(< ~counter~0 9)} is VALID [2022-04-27 12:33:49,297 INFO L272 TraceCheckUtils]: 0: Hoare triple {1071#true} call ULTIMATE.init(); {1071#true} is VALID [2022-04-27 12:33:49,297 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 12:33:49,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:33:49,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428073073] [2022-04-27 12:33:49,297 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:33:49,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508520312] [2022-04-27 12:33:49,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1508520312] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:33:49,298 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:33:49,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-27 12:33:49,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120940399] [2022-04-27 12:33:49,298 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:33:49,299 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 28 [2022-04-27 12:33:49,299 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:33:49,299 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 12:33:49,337 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:33:49,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 12:33:49,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:33:49,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 12:33:49,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-27 12:33:49,339 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 12:33:49,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:33:49,626 INFO L93 Difference]: Finished difference Result 73 states and 92 transitions. [2022-04-27 12:33:49,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 12:33:49,626 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 28 [2022-04-27 12:33:49,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:33:49,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 12:33:49,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 92 transitions. [2022-04-27 12:33:49,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 12:33:49,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 92 transitions. [2022-04-27 12:33:49,632 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 92 transitions. [2022-04-27 12:33:49,714 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:33:49,720 INFO L225 Difference]: With dead ends: 73 [2022-04-27 12:33:49,720 INFO L226 Difference]: Without dead ends: 61 [2022-04-27 12:33:49,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-27 12:33:49,723 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 34 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:33:49,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 149 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:33:49,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-27 12:33:49,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 47. [2022-04-27 12:33:49,749 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:33:49,750 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 47 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 36 states have internal predecessors, (44), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 12:33:49,750 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 47 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 36 states have internal predecessors, (44), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 12:33:49,750 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 47 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 36 states have internal predecessors, (44), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 12:33:49,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:33:49,755 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2022-04-27 12:33:49,755 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 74 transitions. [2022-04-27 12:33:49,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:33:49,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:33:49,762 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 36 states have internal predecessors, (44), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 61 states. [2022-04-27 12:33:49,762 INFO L87 Difference]: Start difference. First operand has 47 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 36 states have internal predecessors, (44), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 61 states. [2022-04-27 12:33:49,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:33:49,764 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2022-04-27 12:33:49,764 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 74 transitions. [2022-04-27 12:33:49,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:33:49,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:33:49,765 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:33:49,765 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:33:49,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 36 states have internal predecessors, (44), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 12:33:49,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2022-04-27 12:33:49,767 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 28 [2022-04-27 12:33:49,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:33:49,768 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2022-04-27 12:33:49,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 12:33:49,768 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2022-04-27 12:33:49,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 12:33:49,769 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:33:49,769 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:33:49,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 12:33:49,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:33:49,992 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:33:49,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:33:49,992 INFO L85 PathProgramCache]: Analyzing trace with hash -2031725334, now seen corresponding path program 1 times [2022-04-27 12:33:49,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:33:49,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751228040] [2022-04-27 12:33:49,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:33:49,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:33:50,018 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:33:50,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [485861722] [2022-04-27 12:33:50,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:33:50,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:33:50,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:33:50,020 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:33:50,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-27 12:33:50,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:33:50,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 12:33:50,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:33:50,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:33:50,305 INFO L272 TraceCheckUtils]: 0: Hoare triple {1534#true} call ULTIMATE.init(); {1534#true} is VALID [2022-04-27 12:33:50,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {1534#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {1542#(<= ~counter~0 0)} is VALID [2022-04-27 12:33:50,306 INFO L290 TraceCheckUtils]: 2: Hoare triple {1542#(<= ~counter~0 0)} assume true; {1542#(<= ~counter~0 0)} is VALID [2022-04-27 12:33:50,307 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1542#(<= ~counter~0 0)} {1534#true} #89#return; {1542#(<= ~counter~0 0)} is VALID [2022-04-27 12:33:50,307 INFO L272 TraceCheckUtils]: 4: Hoare triple {1542#(<= ~counter~0 0)} call #t~ret5 := main(); {1542#(<= ~counter~0 0)} is VALID [2022-04-27 12:33:50,307 INFO L290 TraceCheckUtils]: 5: Hoare triple {1542#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {1542#(<= ~counter~0 0)} is VALID [2022-04-27 12:33:50,312 INFO L272 TraceCheckUtils]: 6: Hoare triple {1542#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {1542#(<= ~counter~0 0)} is VALID [2022-04-27 12:33:50,312 INFO L290 TraceCheckUtils]: 7: Hoare triple {1542#(<= ~counter~0 0)} ~cond := #in~cond; {1542#(<= ~counter~0 0)} is VALID [2022-04-27 12:33:50,313 INFO L290 TraceCheckUtils]: 8: Hoare triple {1542#(<= ~counter~0 0)} assume !(0 == ~cond); {1542#(<= ~counter~0 0)} is VALID [2022-04-27 12:33:50,313 INFO L290 TraceCheckUtils]: 9: Hoare triple {1542#(<= ~counter~0 0)} assume true; {1542#(<= ~counter~0 0)} is VALID [2022-04-27 12:33:50,313 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1542#(<= ~counter~0 0)} {1542#(<= ~counter~0 0)} #81#return; {1542#(<= ~counter~0 0)} is VALID [2022-04-27 12:33:50,314 INFO L272 TraceCheckUtils]: 11: Hoare triple {1542#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1542#(<= ~counter~0 0)} is VALID [2022-04-27 12:33:50,314 INFO L290 TraceCheckUtils]: 12: Hoare triple {1542#(<= ~counter~0 0)} ~cond := #in~cond; {1542#(<= ~counter~0 0)} is VALID [2022-04-27 12:33:50,314 INFO L290 TraceCheckUtils]: 13: Hoare triple {1542#(<= ~counter~0 0)} assume !(0 == ~cond); {1542#(<= ~counter~0 0)} is VALID [2022-04-27 12:33:50,315 INFO L290 TraceCheckUtils]: 14: Hoare triple {1542#(<= ~counter~0 0)} assume true; {1542#(<= ~counter~0 0)} is VALID [2022-04-27 12:33:50,315 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1542#(<= ~counter~0 0)} {1542#(<= ~counter~0 0)} #83#return; {1542#(<= ~counter~0 0)} is VALID [2022-04-27 12:33:50,315 INFO L290 TraceCheckUtils]: 16: Hoare triple {1542#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1542#(<= ~counter~0 0)} is VALID [2022-04-27 12:33:50,316 INFO L290 TraceCheckUtils]: 17: Hoare triple {1542#(<= ~counter~0 0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1591#(<= ~counter~0 1)} is VALID [2022-04-27 12:33:50,316 INFO L290 TraceCheckUtils]: 18: Hoare triple {1591#(<= ~counter~0 1)} assume !!(#t~post3 < 10);havoc #t~post3; {1591#(<= ~counter~0 1)} is VALID [2022-04-27 12:33:50,317 INFO L290 TraceCheckUtils]: 19: Hoare triple {1591#(<= ~counter~0 1)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1591#(<= ~counter~0 1)} is VALID [2022-04-27 12:33:50,317 INFO L290 TraceCheckUtils]: 20: Hoare triple {1591#(<= ~counter~0 1)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1601#(<= ~counter~0 2)} is VALID [2022-04-27 12:33:50,318 INFO L290 TraceCheckUtils]: 21: Hoare triple {1601#(<= ~counter~0 2)} assume !!(#t~post3 < 10);havoc #t~post3; {1601#(<= ~counter~0 2)} is VALID [2022-04-27 12:33:50,318 INFO L290 TraceCheckUtils]: 22: Hoare triple {1601#(<= ~counter~0 2)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1601#(<= ~counter~0 2)} is VALID [2022-04-27 12:33:50,318 INFO L290 TraceCheckUtils]: 23: Hoare triple {1601#(<= ~counter~0 2)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {1611#(<= |main_#t~post4| 2)} is VALID [2022-04-27 12:33:50,319 INFO L290 TraceCheckUtils]: 24: Hoare triple {1611#(<= |main_#t~post4| 2)} assume !(#t~post4 < 10);havoc #t~post4; {1535#false} is VALID [2022-04-27 12:33:50,319 INFO L272 TraceCheckUtils]: 25: Hoare triple {1535#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1535#false} is VALID [2022-04-27 12:33:50,319 INFO L290 TraceCheckUtils]: 26: Hoare triple {1535#false} ~cond := #in~cond; {1535#false} is VALID [2022-04-27 12:33:50,319 INFO L290 TraceCheckUtils]: 27: Hoare triple {1535#false} assume 0 == ~cond; {1535#false} is VALID [2022-04-27 12:33:50,319 INFO L290 TraceCheckUtils]: 28: Hoare triple {1535#false} assume !false; {1535#false} is VALID [2022-04-27 12:33:50,319 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 12:33:50,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:33:50,533 INFO L290 TraceCheckUtils]: 28: Hoare triple {1535#false} assume !false; {1535#false} is VALID [2022-04-27 12:33:50,534 INFO L290 TraceCheckUtils]: 27: Hoare triple {1535#false} assume 0 == ~cond; {1535#false} is VALID [2022-04-27 12:33:50,534 INFO L290 TraceCheckUtils]: 26: Hoare triple {1535#false} ~cond := #in~cond; {1535#false} is VALID [2022-04-27 12:33:50,534 INFO L272 TraceCheckUtils]: 25: Hoare triple {1535#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1535#false} is VALID [2022-04-27 12:33:50,534 INFO L290 TraceCheckUtils]: 24: Hoare triple {1639#(< |main_#t~post4| 10)} assume !(#t~post4 < 10);havoc #t~post4; {1535#false} is VALID [2022-04-27 12:33:50,535 INFO L290 TraceCheckUtils]: 23: Hoare triple {1643#(< ~counter~0 10)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {1639#(< |main_#t~post4| 10)} is VALID [2022-04-27 12:33:50,535 INFO L290 TraceCheckUtils]: 22: Hoare triple {1643#(< ~counter~0 10)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1643#(< ~counter~0 10)} is VALID [2022-04-27 12:33:50,536 INFO L290 TraceCheckUtils]: 21: Hoare triple {1643#(< ~counter~0 10)} assume !!(#t~post3 < 10);havoc #t~post3; {1643#(< ~counter~0 10)} is VALID [2022-04-27 12:33:50,536 INFO L290 TraceCheckUtils]: 20: Hoare triple {1653#(< ~counter~0 9)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1643#(< ~counter~0 10)} is VALID [2022-04-27 12:33:50,537 INFO L290 TraceCheckUtils]: 19: Hoare triple {1653#(< ~counter~0 9)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1653#(< ~counter~0 9)} is VALID [2022-04-27 12:33:50,537 INFO L290 TraceCheckUtils]: 18: Hoare triple {1653#(< ~counter~0 9)} assume !!(#t~post3 < 10);havoc #t~post3; {1653#(< ~counter~0 9)} is VALID [2022-04-27 12:33:50,538 INFO L290 TraceCheckUtils]: 17: Hoare triple {1663#(< ~counter~0 8)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1653#(< ~counter~0 9)} is VALID [2022-04-27 12:33:50,538 INFO L290 TraceCheckUtils]: 16: Hoare triple {1663#(< ~counter~0 8)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1663#(< ~counter~0 8)} is VALID [2022-04-27 12:33:50,539 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1534#true} {1663#(< ~counter~0 8)} #83#return; {1663#(< ~counter~0 8)} is VALID [2022-04-27 12:33:50,539 INFO L290 TraceCheckUtils]: 14: Hoare triple {1534#true} assume true; {1534#true} is VALID [2022-04-27 12:33:50,539 INFO L290 TraceCheckUtils]: 13: Hoare triple {1534#true} assume !(0 == ~cond); {1534#true} is VALID [2022-04-27 12:33:50,539 INFO L290 TraceCheckUtils]: 12: Hoare triple {1534#true} ~cond := #in~cond; {1534#true} is VALID [2022-04-27 12:33:50,539 INFO L272 TraceCheckUtils]: 11: Hoare triple {1663#(< ~counter~0 8)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1534#true} is VALID [2022-04-27 12:33:50,540 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1534#true} {1663#(< ~counter~0 8)} #81#return; {1663#(< ~counter~0 8)} is VALID [2022-04-27 12:33:50,540 INFO L290 TraceCheckUtils]: 9: Hoare triple {1534#true} assume true; {1534#true} is VALID [2022-04-27 12:33:50,540 INFO L290 TraceCheckUtils]: 8: Hoare triple {1534#true} assume !(0 == ~cond); {1534#true} is VALID [2022-04-27 12:33:50,540 INFO L290 TraceCheckUtils]: 7: Hoare triple {1534#true} ~cond := #in~cond; {1534#true} is VALID [2022-04-27 12:33:50,540 INFO L272 TraceCheckUtils]: 6: Hoare triple {1663#(< ~counter~0 8)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {1534#true} is VALID [2022-04-27 12:33:50,541 INFO L290 TraceCheckUtils]: 5: Hoare triple {1663#(< ~counter~0 8)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {1663#(< ~counter~0 8)} is VALID [2022-04-27 12:33:50,541 INFO L272 TraceCheckUtils]: 4: Hoare triple {1663#(< ~counter~0 8)} call #t~ret5 := main(); {1663#(< ~counter~0 8)} is VALID [2022-04-27 12:33:50,542 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1663#(< ~counter~0 8)} {1534#true} #89#return; {1663#(< ~counter~0 8)} is VALID [2022-04-27 12:33:50,544 INFO L290 TraceCheckUtils]: 2: Hoare triple {1663#(< ~counter~0 8)} assume true; {1663#(< ~counter~0 8)} is VALID [2022-04-27 12:33:50,545 INFO L290 TraceCheckUtils]: 1: Hoare triple {1534#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {1663#(< ~counter~0 8)} is VALID [2022-04-27 12:33:50,545 INFO L272 TraceCheckUtils]: 0: Hoare triple {1534#true} call ULTIMATE.init(); {1534#true} is VALID [2022-04-27 12:33:50,545 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 12:33:50,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:33:50,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751228040] [2022-04-27 12:33:50,546 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:33:50,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485861722] [2022-04-27 12:33:50,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [485861722] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:33:50,546 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:33:50,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-27 12:33:50,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277270734] [2022-04-27 12:33:50,546 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:33:50,547 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 29 [2022-04-27 12:33:50,547 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:33:50,547 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 12:33:50,595 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:33:50,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 12:33:50,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:33:50,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 12:33:50,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-27 12:33:50,597 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 12:33:50,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:33:50,977 INFO L93 Difference]: Finished difference Result 98 states and 120 transitions. [2022-04-27 12:33:50,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 12:33:50,977 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 29 [2022-04-27 12:33:50,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:33:50,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 12:33:50,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 120 transitions. [2022-04-27 12:33:50,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 12:33:50,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 120 transitions. [2022-04-27 12:33:50,984 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 120 transitions. [2022-04-27 12:33:51,078 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:33:51,081 INFO L225 Difference]: With dead ends: 98 [2022-04-27 12:33:51,081 INFO L226 Difference]: Without dead ends: 91 [2022-04-27 12:33:51,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-04-27 12:33:51,082 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 89 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:33:51,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 181 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 12:33:51,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-04-27 12:33:51,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 84. [2022-04-27 12:33:51,106 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:33:51,107 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 84 states, 63 states have (on average 1.3492063492063493) internal successors, (85), 67 states have internal predecessors, (85), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 12:33:51,107 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 84 states, 63 states have (on average 1.3492063492063493) internal successors, (85), 67 states have internal predecessors, (85), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 12:33:51,108 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 84 states, 63 states have (on average 1.3492063492063493) internal successors, (85), 67 states have internal predecessors, (85), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 12:33:51,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:33:51,111 INFO L93 Difference]: Finished difference Result 91 states and 110 transitions. [2022-04-27 12:33:51,111 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 110 transitions. [2022-04-27 12:33:51,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:33:51,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:33:51,112 INFO L74 IsIncluded]: Start isIncluded. First operand has 84 states, 63 states have (on average 1.3492063492063493) internal successors, (85), 67 states have internal predecessors, (85), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 91 states. [2022-04-27 12:33:51,113 INFO L87 Difference]: Start difference. First operand has 84 states, 63 states have (on average 1.3492063492063493) internal successors, (85), 67 states have internal predecessors, (85), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 91 states. [2022-04-27 12:33:51,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:33:51,116 INFO L93 Difference]: Finished difference Result 91 states and 110 transitions. [2022-04-27 12:33:51,116 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 110 transitions. [2022-04-27 12:33:51,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:33:51,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:33:51,117 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:33:51,117 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:33:51,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 63 states have (on average 1.3492063492063493) internal successors, (85), 67 states have internal predecessors, (85), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 12:33:51,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 106 transitions. [2022-04-27 12:33:51,120 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 106 transitions. Word has length 29 [2022-04-27 12:33:51,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:33:51,120 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 106 transitions. [2022-04-27 12:33:51,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 12:33:51,121 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 106 transitions. [2022-04-27 12:33:51,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 12:33:51,121 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:33:51,121 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:33:51,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-27 12:33:51,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:33:51,339 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:33:51,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:33:51,340 INFO L85 PathProgramCache]: Analyzing trace with hash -2029937874, now seen corresponding path program 1 times [2022-04-27 12:33:51,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:33:51,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174995068] [2022-04-27 12:33:51,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:33:51,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:33:51,355 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:33:51,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1782081474] [2022-04-27 12:33:51,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:33:51,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:33:51,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:33:51,356 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:33:51,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-27 12:33:51,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:33:51,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-27 12:33:51,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:33:51,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:33:51,989 INFO L272 TraceCheckUtils]: 0: Hoare triple {2146#true} call ULTIMATE.init(); {2146#true} is VALID [2022-04-27 12:33:51,989 INFO L290 TraceCheckUtils]: 1: Hoare triple {2146#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {2146#true} is VALID [2022-04-27 12:33:51,990 INFO L290 TraceCheckUtils]: 2: Hoare triple {2146#true} assume true; {2146#true} is VALID [2022-04-27 12:33:51,990 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2146#true} {2146#true} #89#return; {2146#true} is VALID [2022-04-27 12:33:51,990 INFO L272 TraceCheckUtils]: 4: Hoare triple {2146#true} call #t~ret5 := main(); {2146#true} is VALID [2022-04-27 12:33:51,990 INFO L290 TraceCheckUtils]: 5: Hoare triple {2146#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {2146#true} is VALID [2022-04-27 12:33:51,990 INFO L272 TraceCheckUtils]: 6: Hoare triple {2146#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {2146#true} is VALID [2022-04-27 12:33:51,990 INFO L290 TraceCheckUtils]: 7: Hoare triple {2146#true} ~cond := #in~cond; {2146#true} is VALID [2022-04-27 12:33:51,990 INFO L290 TraceCheckUtils]: 8: Hoare triple {2146#true} assume !(0 == ~cond); {2146#true} is VALID [2022-04-27 12:33:51,990 INFO L290 TraceCheckUtils]: 9: Hoare triple {2146#true} assume true; {2146#true} is VALID [2022-04-27 12:33:51,991 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2146#true} {2146#true} #81#return; {2146#true} is VALID [2022-04-27 12:33:51,991 INFO L272 TraceCheckUtils]: 11: Hoare triple {2146#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2146#true} is VALID [2022-04-27 12:33:51,991 INFO L290 TraceCheckUtils]: 12: Hoare triple {2146#true} ~cond := #in~cond; {2187#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 12:33:51,992 INFO L290 TraceCheckUtils]: 13: Hoare triple {2187#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2191#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:33:51,992 INFO L290 TraceCheckUtils]: 14: Hoare triple {2191#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2191#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:33:51,993 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2191#(not (= |assume_abort_if_not_#in~cond| 0))} {2146#true} #83#return; {2198#(<= 1 (mod main_~B~0 4294967296))} is VALID [2022-04-27 12:33:51,993 INFO L290 TraceCheckUtils]: 16: Hoare triple {2198#(<= 1 (mod main_~B~0 4294967296))} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {2202#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~b~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 12:33:51,994 INFO L290 TraceCheckUtils]: 17: Hoare triple {2202#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~b~0 4294967296)) (= main_~q~0 0))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2202#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~b~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 12:33:51,994 INFO L290 TraceCheckUtils]: 18: Hoare triple {2202#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~b~0 4294967296)) (= main_~q~0 0))} assume !!(#t~post3 < 10);havoc #t~post3; {2202#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~b~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 12:33:51,995 INFO L290 TraceCheckUtils]: 19: Hoare triple {2202#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~b~0 4294967296)) (= main_~q~0 0))} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {2212#(and (= main_~A~0 main_~r~0) (< (div (+ (- 1) (mod main_~r~0 4294967296)) (- 4294967296)) 1) (= main_~q~0 0))} is VALID [2022-04-27 12:33:51,996 INFO L290 TraceCheckUtils]: 20: Hoare triple {2212#(and (= main_~A~0 main_~r~0) (< (div (+ (- 1) (mod main_~r~0 4294967296)) (- 4294967296)) 1) (= main_~q~0 0))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2212#(and (= main_~A~0 main_~r~0) (< (div (+ (- 1) (mod main_~r~0 4294967296)) (- 4294967296)) 1) (= main_~q~0 0))} is VALID [2022-04-27 12:33:51,996 INFO L290 TraceCheckUtils]: 21: Hoare triple {2212#(and (= main_~A~0 main_~r~0) (< (div (+ (- 1) (mod main_~r~0 4294967296)) (- 4294967296)) 1) (= main_~q~0 0))} assume !!(#t~post3 < 10);havoc #t~post3; {2212#(and (= main_~A~0 main_~r~0) (< (div (+ (- 1) (mod main_~r~0 4294967296)) (- 4294967296)) 1) (= main_~q~0 0))} is VALID [2022-04-27 12:33:51,997 INFO L290 TraceCheckUtils]: 22: Hoare triple {2212#(and (= main_~A~0 main_~r~0) (< (div (+ (- 1) (mod main_~r~0 4294967296)) (- 4294967296)) 1) (= main_~q~0 0))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {2212#(and (= main_~A~0 main_~r~0) (< (div (+ (- 1) (mod main_~r~0 4294967296)) (- 4294967296)) 1) (= main_~q~0 0))} is VALID [2022-04-27 12:33:51,998 INFO L290 TraceCheckUtils]: 23: Hoare triple {2212#(and (= main_~A~0 main_~r~0) (< (div (+ (- 1) (mod main_~r~0 4294967296)) (- 4294967296)) 1) (= main_~q~0 0))} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2212#(and (= main_~A~0 main_~r~0) (< (div (+ (- 1) (mod main_~r~0 4294967296)) (- 4294967296)) 1) (= main_~q~0 0))} is VALID [2022-04-27 12:33:51,998 INFO L290 TraceCheckUtils]: 24: Hoare triple {2212#(and (= main_~A~0 main_~r~0) (< (div (+ (- 1) (mod main_~r~0 4294967296)) (- 4294967296)) 1) (= main_~q~0 0))} assume !!(#t~post4 < 10);havoc #t~post4; {2212#(and (= main_~A~0 main_~r~0) (< (div (+ (- 1) (mod main_~r~0 4294967296)) (- 4294967296)) 1) (= main_~q~0 0))} is VALID [2022-04-27 12:33:51,999 INFO L272 TraceCheckUtils]: 25: Hoare triple {2212#(and (= main_~A~0 main_~r~0) (< (div (+ (- 1) (mod main_~r~0 4294967296)) (- 4294967296)) 1) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2231#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:33:52,000 INFO L290 TraceCheckUtils]: 26: Hoare triple {2231#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2235#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:33:52,000 INFO L290 TraceCheckUtils]: 27: Hoare triple {2235#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2147#false} is VALID [2022-04-27 12:33:52,000 INFO L290 TraceCheckUtils]: 28: Hoare triple {2147#false} assume !false; {2147#false} is VALID [2022-04-27 12:33:52,000 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 12:33:52,000 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:33:52,684 INFO L290 TraceCheckUtils]: 28: Hoare triple {2147#false} assume !false; {2147#false} is VALID [2022-04-27 12:33:52,684 INFO L290 TraceCheckUtils]: 27: Hoare triple {2235#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2147#false} is VALID [2022-04-27 12:33:52,684 INFO L290 TraceCheckUtils]: 26: Hoare triple {2231#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2235#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:33:52,686 INFO L272 TraceCheckUtils]: 25: Hoare triple {2251#(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)); {2231#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:33:52,686 INFO L290 TraceCheckUtils]: 24: Hoare triple {2251#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} assume !!(#t~post4 < 10);havoc #t~post4; {2251#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} is VALID [2022-04-27 12:33:52,687 INFO L290 TraceCheckUtils]: 23: Hoare triple {2251#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2251#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} is VALID [2022-04-27 12:33:52,687 INFO L290 TraceCheckUtils]: 22: Hoare triple {2251#(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); {2251#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} is VALID [2022-04-27 12:33:52,688 INFO L290 TraceCheckUtils]: 21: Hoare triple {2251#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} assume !!(#t~post3 < 10);havoc #t~post3; {2251#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} is VALID [2022-04-27 12:33:52,688 INFO L290 TraceCheckUtils]: 20: Hoare triple {2251#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2251#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} is VALID [2022-04-27 12:33:52,688 INFO L290 TraceCheckUtils]: 19: Hoare triple {2270#(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; {2251#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} is VALID [2022-04-27 12:33:52,689 INFO L290 TraceCheckUtils]: 18: Hoare triple {2270#(or (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))))} assume !!(#t~post3 < 10);havoc #t~post3; {2270#(or (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))))} is VALID [2022-04-27 12:33:52,690 INFO L290 TraceCheckUtils]: 17: Hoare triple {2270#(or (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2270#(or (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))))} is VALID [2022-04-27 12:33:52,690 INFO L290 TraceCheckUtils]: 16: Hoare triple {2146#true} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {2270#(or (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))))} is VALID [2022-04-27 12:33:52,690 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2146#true} {2146#true} #83#return; {2146#true} is VALID [2022-04-27 12:33:52,690 INFO L290 TraceCheckUtils]: 14: Hoare triple {2146#true} assume true; {2146#true} is VALID [2022-04-27 12:33:52,691 INFO L290 TraceCheckUtils]: 13: Hoare triple {2146#true} assume !(0 == ~cond); {2146#true} is VALID [2022-04-27 12:33:52,691 INFO L290 TraceCheckUtils]: 12: Hoare triple {2146#true} ~cond := #in~cond; {2146#true} is VALID [2022-04-27 12:33:52,691 INFO L272 TraceCheckUtils]: 11: Hoare triple {2146#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2146#true} is VALID [2022-04-27 12:33:52,691 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2146#true} {2146#true} #81#return; {2146#true} is VALID [2022-04-27 12:33:52,691 INFO L290 TraceCheckUtils]: 9: Hoare triple {2146#true} assume true; {2146#true} is VALID [2022-04-27 12:33:52,691 INFO L290 TraceCheckUtils]: 8: Hoare triple {2146#true} assume !(0 == ~cond); {2146#true} is VALID [2022-04-27 12:33:52,691 INFO L290 TraceCheckUtils]: 7: Hoare triple {2146#true} ~cond := #in~cond; {2146#true} is VALID [2022-04-27 12:33:52,691 INFO L272 TraceCheckUtils]: 6: Hoare triple {2146#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {2146#true} is VALID [2022-04-27 12:33:52,691 INFO L290 TraceCheckUtils]: 5: Hoare triple {2146#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {2146#true} is VALID [2022-04-27 12:33:52,692 INFO L272 TraceCheckUtils]: 4: Hoare triple {2146#true} call #t~ret5 := main(); {2146#true} is VALID [2022-04-27 12:33:52,692 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2146#true} {2146#true} #89#return; {2146#true} is VALID [2022-04-27 12:33:52,692 INFO L290 TraceCheckUtils]: 2: Hoare triple {2146#true} assume true; {2146#true} is VALID [2022-04-27 12:33:52,692 INFO L290 TraceCheckUtils]: 1: Hoare triple {2146#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {2146#true} is VALID [2022-04-27 12:33:52,692 INFO L272 TraceCheckUtils]: 0: Hoare triple {2146#true} call ULTIMATE.init(); {2146#true} is VALID [2022-04-27 12:33:52,692 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 12:33:52,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:33:52,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174995068] [2022-04-27 12:33:52,693 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:33:52,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782081474] [2022-04-27 12:33:52,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1782081474] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 12:33:52,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:33:52,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2022-04-27 12:33:52,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180756276] [2022-04-27 12:33:52,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:33:52,694 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2022-04-27 12:33:52,694 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:33:52,694 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:33:53,136 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-27 12:33:53,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 12:33:53,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:33:53,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 12:33:53,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-04-27 12:33:53,137 INFO L87 Difference]: Start difference. First operand 84 states and 106 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:33:53,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:33:53,629 INFO L93 Difference]: Finished difference Result 117 states and 143 transitions. [2022-04-27 12:33:53,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 12:33:53,630 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2022-04-27 12:33:53,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:33:53,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:33:53,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2022-04-27 12:33:53,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:33:53,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2022-04-27 12:33:53,633 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 49 transitions. [2022-04-27 12:33:55,691 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 48 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 12:33:55,694 INFO L225 Difference]: With dead ends: 117 [2022-04-27 12:33:55,694 INFO L226 Difference]: Without dead ends: 115 [2022-04-27 12:33:55,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-04-27 12:33:55,695 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 9 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:33:55,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 152 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 26 Unchecked, 0.0s Time] [2022-04-27 12:33:55,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-04-27 12:33:55,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2022-04-27 12:33:55,723 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:33:55,724 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand has 114 states, 85 states have (on average 1.2705882352941176) internal successors, (108), 93 states have internal predecessors, (108), 17 states have call successors, (17), 12 states have call predecessors, (17), 11 states have return successors, (12), 8 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 12:33:55,724 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand has 114 states, 85 states have (on average 1.2705882352941176) internal successors, (108), 93 states have internal predecessors, (108), 17 states have call successors, (17), 12 states have call predecessors, (17), 11 states have return successors, (12), 8 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 12:33:55,725 INFO L87 Difference]: Start difference. First operand 115 states. Second operand has 114 states, 85 states have (on average 1.2705882352941176) internal successors, (108), 93 states have internal predecessors, (108), 17 states have call successors, (17), 12 states have call predecessors, (17), 11 states have return successors, (12), 8 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 12:33:55,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:33:55,728 INFO L93 Difference]: Finished difference Result 115 states and 138 transitions. [2022-04-27 12:33:55,728 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 138 transitions. [2022-04-27 12:33:55,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:33:55,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:33:55,729 INFO L74 IsIncluded]: Start isIncluded. First operand has 114 states, 85 states have (on average 1.2705882352941176) internal successors, (108), 93 states have internal predecessors, (108), 17 states have call successors, (17), 12 states have call predecessors, (17), 11 states have return successors, (12), 8 states have call predecessors, (12), 12 states have call successors, (12) Second operand 115 states. [2022-04-27 12:33:55,730 INFO L87 Difference]: Start difference. First operand has 114 states, 85 states have (on average 1.2705882352941176) internal successors, (108), 93 states have internal predecessors, (108), 17 states have call successors, (17), 12 states have call predecessors, (17), 11 states have return successors, (12), 8 states have call predecessors, (12), 12 states have call successors, (12) Second operand 115 states. [2022-04-27 12:33:55,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:33:55,733 INFO L93 Difference]: Finished difference Result 115 states and 138 transitions. [2022-04-27 12:33:55,733 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 138 transitions. [2022-04-27 12:33:55,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:33:55,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:33:55,734 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:33:55,734 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:33:55,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 85 states have (on average 1.2705882352941176) internal successors, (108), 93 states have internal predecessors, (108), 17 states have call successors, (17), 12 states have call predecessors, (17), 11 states have return successors, (12), 8 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 12:33:55,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 137 transitions. [2022-04-27 12:33:55,738 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 137 transitions. Word has length 29 [2022-04-27 12:33:55,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:33:55,738 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 137 transitions. [2022-04-27 12:33:55,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:33:55,738 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 137 transitions. [2022-04-27 12:33:55,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-27 12:33:55,739 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:33:55,739 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:33:55,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-27 12:33:55,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:33:55,944 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:33:55,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:33:55,944 INFO L85 PathProgramCache]: Analyzing trace with hash 223058363, now seen corresponding path program 1 times [2022-04-27 12:33:55,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:33:55,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809758096] [2022-04-27 12:33:55,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:33:55,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:33:55,961 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:33:55,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1301069475] [2022-04-27 12:33:55,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:33:55,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:33:55,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:33:55,962 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:33:55,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-27 12:33:56,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:33:56,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 12:33:56,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:33:56,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:33:56,361 INFO L272 TraceCheckUtils]: 0: Hoare triple {2864#true} call ULTIMATE.init(); {2864#true} is VALID [2022-04-27 12:33:56,361 INFO L290 TraceCheckUtils]: 1: Hoare triple {2864#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {2864#true} is VALID [2022-04-27 12:33:56,361 INFO L290 TraceCheckUtils]: 2: Hoare triple {2864#true} assume true; {2864#true} is VALID [2022-04-27 12:33:56,361 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2864#true} {2864#true} #89#return; {2864#true} is VALID [2022-04-27 12:33:56,361 INFO L272 TraceCheckUtils]: 4: Hoare triple {2864#true} call #t~ret5 := main(); {2864#true} is VALID [2022-04-27 12:33:56,361 INFO L290 TraceCheckUtils]: 5: Hoare triple {2864#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {2864#true} is VALID [2022-04-27 12:33:56,361 INFO L272 TraceCheckUtils]: 6: Hoare triple {2864#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {2864#true} is VALID [2022-04-27 12:33:56,361 INFO L290 TraceCheckUtils]: 7: Hoare triple {2864#true} ~cond := #in~cond; {2864#true} is VALID [2022-04-27 12:33:56,361 INFO L290 TraceCheckUtils]: 8: Hoare triple {2864#true} assume !(0 == ~cond); {2864#true} is VALID [2022-04-27 12:33:56,361 INFO L290 TraceCheckUtils]: 9: Hoare triple {2864#true} assume true; {2864#true} is VALID [2022-04-27 12:33:56,362 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2864#true} {2864#true} #81#return; {2864#true} is VALID [2022-04-27 12:33:56,362 INFO L272 TraceCheckUtils]: 11: Hoare triple {2864#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2864#true} is VALID [2022-04-27 12:33:56,362 INFO L290 TraceCheckUtils]: 12: Hoare triple {2864#true} ~cond := #in~cond; {2864#true} is VALID [2022-04-27 12:33:56,362 INFO L290 TraceCheckUtils]: 13: Hoare triple {2864#true} assume !(0 == ~cond); {2864#true} is VALID [2022-04-27 12:33:56,362 INFO L290 TraceCheckUtils]: 14: Hoare triple {2864#true} assume true; {2864#true} is VALID [2022-04-27 12:33:56,362 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2864#true} {2864#true} #83#return; {2864#true} is VALID [2022-04-27 12:33:56,362 INFO L290 TraceCheckUtils]: 16: Hoare triple {2864#true} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {2864#true} is VALID [2022-04-27 12:33:56,362 INFO L290 TraceCheckUtils]: 17: Hoare triple {2864#true} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2864#true} is VALID [2022-04-27 12:33:56,362 INFO L290 TraceCheckUtils]: 18: Hoare triple {2864#true} assume !!(#t~post3 < 10);havoc #t~post3; {2864#true} is VALID [2022-04-27 12:33:56,362 INFO L290 TraceCheckUtils]: 19: Hoare triple {2864#true} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {2864#true} is VALID [2022-04-27 12:33:56,362 INFO L290 TraceCheckUtils]: 20: Hoare triple {2864#true} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2864#true} is VALID [2022-04-27 12:33:56,362 INFO L290 TraceCheckUtils]: 21: Hoare triple {2864#true} assume !!(#t~post3 < 10);havoc #t~post3; {2864#true} is VALID [2022-04-27 12:33:56,362 INFO L290 TraceCheckUtils]: 22: Hoare triple {2864#true} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {2864#true} is VALID [2022-04-27 12:33:56,362 INFO L290 TraceCheckUtils]: 23: Hoare triple {2864#true} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2864#true} is VALID [2022-04-27 12:33:56,363 INFO L290 TraceCheckUtils]: 24: Hoare triple {2864#true} assume !!(#t~post4 < 10);havoc #t~post4; {2864#true} is VALID [2022-04-27 12:33:56,363 INFO L272 TraceCheckUtils]: 25: Hoare triple {2864#true} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2864#true} is VALID [2022-04-27 12:33:56,367 INFO L290 TraceCheckUtils]: 26: Hoare triple {2864#true} ~cond := #in~cond; {2947#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:33:56,368 INFO L290 TraceCheckUtils]: 27: Hoare triple {2947#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2951#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:33:56,368 INFO L290 TraceCheckUtils]: 28: Hoare triple {2951#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2951#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:33:56,369 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2951#(not (= |__VERIFIER_assert_#in~cond| 0))} {2864#true} #85#return; {2958#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 12:33:56,370 INFO L290 TraceCheckUtils]: 30: Hoare triple {2958#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} assume !(~b~0 % 4294967296 != ~B~0 % 4294967296); {2958#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 12:33:56,370 INFO L272 TraceCheckUtils]: 31: Hoare triple {2958#(= (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)); {2965#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2022-04-27 12:33:56,371 INFO L290 TraceCheckUtils]: 32: Hoare triple {2965#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {2969#(= __VERIFIER_assert_~cond 1)} is VALID [2022-04-27 12:33:56,371 INFO L290 TraceCheckUtils]: 33: Hoare triple {2969#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {2865#false} is VALID [2022-04-27 12:33:56,371 INFO L290 TraceCheckUtils]: 34: Hoare triple {2865#false} assume !false; {2865#false} is VALID [2022-04-27 12:33:56,372 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-27 12:33:56,372 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:33:58,193 INFO L290 TraceCheckUtils]: 34: Hoare triple {2865#false} assume !false; {2865#false} is VALID [2022-04-27 12:33:58,194 INFO L290 TraceCheckUtils]: 33: Hoare triple {2979#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2865#false} is VALID [2022-04-27 12:33:58,194 INFO L290 TraceCheckUtils]: 32: Hoare triple {2951#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2979#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 12:33:58,195 INFO L272 TraceCheckUtils]: 31: Hoare triple {2958#(= (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)); {2951#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:33:58,195 INFO L290 TraceCheckUtils]: 30: Hoare triple {2958#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} assume !(~b~0 % 4294967296 != ~B~0 % 4294967296); {2958#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 12:33:58,196 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2951#(not (= |__VERIFIER_assert_#in~cond| 0))} {2864#true} #85#return; {2958#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 12:33:58,197 INFO L290 TraceCheckUtils]: 28: Hoare triple {2951#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2951#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:33:58,197 INFO L290 TraceCheckUtils]: 27: Hoare triple {3001#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2951#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:33:58,197 INFO L290 TraceCheckUtils]: 26: Hoare triple {2864#true} ~cond := #in~cond; {3001#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 12:33:58,198 INFO L272 TraceCheckUtils]: 25: Hoare triple {2864#true} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2864#true} is VALID [2022-04-27 12:33:58,198 INFO L290 TraceCheckUtils]: 24: Hoare triple {2864#true} assume !!(#t~post4 < 10);havoc #t~post4; {2864#true} is VALID [2022-04-27 12:33:58,198 INFO L290 TraceCheckUtils]: 23: Hoare triple {2864#true} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2864#true} is VALID [2022-04-27 12:33:58,198 INFO L290 TraceCheckUtils]: 22: Hoare triple {2864#true} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {2864#true} is VALID [2022-04-27 12:33:58,198 INFO L290 TraceCheckUtils]: 21: Hoare triple {2864#true} assume !!(#t~post3 < 10);havoc #t~post3; {2864#true} is VALID [2022-04-27 12:33:58,198 INFO L290 TraceCheckUtils]: 20: Hoare triple {2864#true} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2864#true} is VALID [2022-04-27 12:33:58,198 INFO L290 TraceCheckUtils]: 19: Hoare triple {2864#true} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {2864#true} is VALID [2022-04-27 12:33:58,198 INFO L290 TraceCheckUtils]: 18: Hoare triple {2864#true} assume !!(#t~post3 < 10);havoc #t~post3; {2864#true} is VALID [2022-04-27 12:33:58,199 INFO L290 TraceCheckUtils]: 17: Hoare triple {2864#true} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2864#true} is VALID [2022-04-27 12:33:58,199 INFO L290 TraceCheckUtils]: 16: Hoare triple {2864#true} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {2864#true} is VALID [2022-04-27 12:33:58,199 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2864#true} {2864#true} #83#return; {2864#true} is VALID [2022-04-27 12:33:58,199 INFO L290 TraceCheckUtils]: 14: Hoare triple {2864#true} assume true; {2864#true} is VALID [2022-04-27 12:33:58,199 INFO L290 TraceCheckUtils]: 13: Hoare triple {2864#true} assume !(0 == ~cond); {2864#true} is VALID [2022-04-27 12:33:58,199 INFO L290 TraceCheckUtils]: 12: Hoare triple {2864#true} ~cond := #in~cond; {2864#true} is VALID [2022-04-27 12:33:58,199 INFO L272 TraceCheckUtils]: 11: Hoare triple {2864#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2864#true} is VALID [2022-04-27 12:33:58,199 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2864#true} {2864#true} #81#return; {2864#true} is VALID [2022-04-27 12:33:58,199 INFO L290 TraceCheckUtils]: 9: Hoare triple {2864#true} assume true; {2864#true} is VALID [2022-04-27 12:33:58,200 INFO L290 TraceCheckUtils]: 8: Hoare triple {2864#true} assume !(0 == ~cond); {2864#true} is VALID [2022-04-27 12:33:58,200 INFO L290 TraceCheckUtils]: 7: Hoare triple {2864#true} ~cond := #in~cond; {2864#true} is VALID [2022-04-27 12:33:58,200 INFO L272 TraceCheckUtils]: 6: Hoare triple {2864#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {2864#true} is VALID [2022-04-27 12:33:58,200 INFO L290 TraceCheckUtils]: 5: Hoare triple {2864#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {2864#true} is VALID [2022-04-27 12:33:58,200 INFO L272 TraceCheckUtils]: 4: Hoare triple {2864#true} call #t~ret5 := main(); {2864#true} is VALID [2022-04-27 12:33:58,200 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2864#true} {2864#true} #89#return; {2864#true} is VALID [2022-04-27 12:33:58,200 INFO L290 TraceCheckUtils]: 2: Hoare triple {2864#true} assume true; {2864#true} is VALID [2022-04-27 12:33:58,200 INFO L290 TraceCheckUtils]: 1: Hoare triple {2864#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {2864#true} is VALID [2022-04-27 12:33:58,201 INFO L272 TraceCheckUtils]: 0: Hoare triple {2864#true} call ULTIMATE.init(); {2864#true} is VALID [2022-04-27 12:33:58,201 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-27 12:33:58,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:33:58,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809758096] [2022-04-27 12:33:58,201 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:33:58,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301069475] [2022-04-27 12:33:58,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301069475] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:33:58,201 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:33:58,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2022-04-27 12:33:58,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436149176] [2022-04-27 12:33:58,202 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:33:58,202 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 35 [2022-04-27 12:33:58,202 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:33:58,203 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 12:33:58,242 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:33:58,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 12:33:58,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:33:58,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 12:33:58,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-27 12:33:58,243 INFO L87 Difference]: Start difference. First operand 114 states and 137 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 12:33:59,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:33:59,947 INFO L93 Difference]: Finished difference Result 133 states and 155 transitions. [2022-04-27 12:33:59,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 12:33:59,948 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 35 [2022-04-27 12:33:59,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:33:59,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 12:33:59,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 48 transitions. [2022-04-27 12:33:59,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 12:33:59,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 48 transitions. [2022-04-27 12:33:59,961 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 48 transitions. [2022-04-27 12:34:00,010 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:34:00,012 INFO L225 Difference]: With dead ends: 133 [2022-04-27 12:34:00,012 INFO L226 Difference]: Without dead ends: 111 [2022-04-27 12:34:00,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-04-27 12:34:00,013 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 17 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-27 12:34:00,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 162 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-27 12:34:00,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-04-27 12:34:00,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2022-04-27 12:34:00,046 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:34:00,047 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand has 111 states, 85 states have (on average 1.223529411764706) internal successors, (104), 90 states have internal predecessors, (104), 14 states have call successors, (14), 12 states have call predecessors, (14), 11 states have return successors, (12), 8 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 12:34:00,047 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand has 111 states, 85 states have (on average 1.223529411764706) internal successors, (104), 90 states have internal predecessors, (104), 14 states have call successors, (14), 12 states have call predecessors, (14), 11 states have return successors, (12), 8 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 12:34:00,048 INFO L87 Difference]: Start difference. First operand 111 states. Second operand has 111 states, 85 states have (on average 1.223529411764706) internal successors, (104), 90 states have internal predecessors, (104), 14 states have call successors, (14), 12 states have call predecessors, (14), 11 states have return successors, (12), 8 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 12:34:00,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:34:00,051 INFO L93 Difference]: Finished difference Result 111 states and 130 transitions. [2022-04-27 12:34:00,052 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 130 transitions. [2022-04-27 12:34:00,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:34:00,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:34:00,053 INFO L74 IsIncluded]: Start isIncluded. First operand has 111 states, 85 states have (on average 1.223529411764706) internal successors, (104), 90 states have internal predecessors, (104), 14 states have call successors, (14), 12 states have call predecessors, (14), 11 states have return successors, (12), 8 states have call predecessors, (12), 12 states have call successors, (12) Second operand 111 states. [2022-04-27 12:34:00,053 INFO L87 Difference]: Start difference. First operand has 111 states, 85 states have (on average 1.223529411764706) internal successors, (104), 90 states have internal predecessors, (104), 14 states have call successors, (14), 12 states have call predecessors, (14), 11 states have return successors, (12), 8 states have call predecessors, (12), 12 states have call successors, (12) Second operand 111 states. [2022-04-27 12:34:00,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:34:00,056 INFO L93 Difference]: Finished difference Result 111 states and 130 transitions. [2022-04-27 12:34:00,057 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 130 transitions. [2022-04-27 12:34:00,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:34:00,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:34:00,057 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:34:00,057 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:34:00,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 85 states have (on average 1.223529411764706) internal successors, (104), 90 states have internal predecessors, (104), 14 states have call successors, (14), 12 states have call predecessors, (14), 11 states have return successors, (12), 8 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 12:34:00,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 130 transitions. [2022-04-27 12:34:00,062 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 130 transitions. Word has length 35 [2022-04-27 12:34:00,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:34:00,062 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 130 transitions. [2022-04-27 12:34:00,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 12:34:00,063 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 130 transitions. [2022-04-27 12:34:00,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-27 12:34:00,063 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:34:00,063 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:34:00,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-27 12:34:00,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:34:00,283 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:34:00,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:34:00,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1731935178, now seen corresponding path program 1 times [2022-04-27 12:34:00,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:34:00,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476732680] [2022-04-27 12:34:00,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:34:00,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:34:00,308 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:34:00,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [702451894] [2022-04-27 12:34:00,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:34:00,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:34:00,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:34:00,310 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:34:00,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-27 12:34:00,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:34:00,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-27 12:34:00,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:34:00,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:34:00,458 INFO L272 TraceCheckUtils]: 0: Hoare triple {3624#true} call ULTIMATE.init(); {3624#true} is VALID [2022-04-27 12:34:00,459 INFO L290 TraceCheckUtils]: 1: Hoare triple {3624#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {3624#true} is VALID [2022-04-27 12:34:00,459 INFO L290 TraceCheckUtils]: 2: Hoare triple {3624#true} assume true; {3624#true} is VALID [2022-04-27 12:34:00,459 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3624#true} {3624#true} #89#return; {3624#true} is VALID [2022-04-27 12:34:00,459 INFO L272 TraceCheckUtils]: 4: Hoare triple {3624#true} call #t~ret5 := main(); {3624#true} is VALID [2022-04-27 12:34:00,459 INFO L290 TraceCheckUtils]: 5: Hoare triple {3624#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {3624#true} is VALID [2022-04-27 12:34:00,459 INFO L272 TraceCheckUtils]: 6: Hoare triple {3624#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {3624#true} is VALID [2022-04-27 12:34:00,459 INFO L290 TraceCheckUtils]: 7: Hoare triple {3624#true} ~cond := #in~cond; {3624#true} is VALID [2022-04-27 12:34:00,460 INFO L290 TraceCheckUtils]: 8: Hoare triple {3624#true} assume !(0 == ~cond); {3624#true} is VALID [2022-04-27 12:34:00,460 INFO L290 TraceCheckUtils]: 9: Hoare triple {3624#true} assume true; {3624#true} is VALID [2022-04-27 12:34:00,460 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3624#true} {3624#true} #81#return; {3624#true} is VALID [2022-04-27 12:34:00,460 INFO L272 TraceCheckUtils]: 11: Hoare triple {3624#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {3624#true} is VALID [2022-04-27 12:34:00,460 INFO L290 TraceCheckUtils]: 12: Hoare triple {3624#true} ~cond := #in~cond; {3624#true} is VALID [2022-04-27 12:34:00,460 INFO L290 TraceCheckUtils]: 13: Hoare triple {3624#true} assume !(0 == ~cond); {3624#true} is VALID [2022-04-27 12:34:00,460 INFO L290 TraceCheckUtils]: 14: Hoare triple {3624#true} assume true; {3624#true} is VALID [2022-04-27 12:34:00,460 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3624#true} {3624#true} #83#return; {3624#true} is VALID [2022-04-27 12:34:00,461 INFO L290 TraceCheckUtils]: 16: Hoare triple {3624#true} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {3677#(= main_~B~0 main_~b~0)} is VALID [2022-04-27 12:34:00,461 INFO L290 TraceCheckUtils]: 17: Hoare triple {3677#(= main_~B~0 main_~b~0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {3677#(= main_~B~0 main_~b~0)} is VALID [2022-04-27 12:34:00,462 INFO L290 TraceCheckUtils]: 18: Hoare triple {3677#(= main_~B~0 main_~b~0)} assume !!(#t~post3 < 10);havoc #t~post3; {3677#(= main_~B~0 main_~b~0)} is VALID [2022-04-27 12:34:00,462 INFO L290 TraceCheckUtils]: 19: Hoare triple {3677#(= main_~B~0 main_~b~0)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {3677#(= main_~B~0 main_~b~0)} is VALID [2022-04-27 12:34:00,463 INFO L290 TraceCheckUtils]: 20: Hoare triple {3677#(= main_~B~0 main_~b~0)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {3677#(= main_~B~0 main_~b~0)} is VALID [2022-04-27 12:34:00,463 INFO L290 TraceCheckUtils]: 21: Hoare triple {3677#(= main_~B~0 main_~b~0)} assume !!(#t~post4 < 10);havoc #t~post4; {3677#(= main_~B~0 main_~b~0)} is VALID [2022-04-27 12:34:00,463 INFO L272 TraceCheckUtils]: 22: Hoare triple {3677#(= main_~B~0 main_~b~0)} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {3624#true} is VALID [2022-04-27 12:34:00,463 INFO L290 TraceCheckUtils]: 23: Hoare triple {3624#true} ~cond := #in~cond; {3624#true} is VALID [2022-04-27 12:34:00,463 INFO L290 TraceCheckUtils]: 24: Hoare triple {3624#true} assume !(0 == ~cond); {3624#true} is VALID [2022-04-27 12:34:00,464 INFO L290 TraceCheckUtils]: 25: Hoare triple {3624#true} assume true; {3624#true} is VALID [2022-04-27 12:34:00,464 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3624#true} {3677#(= main_~B~0 main_~b~0)} #85#return; {3677#(= main_~B~0 main_~b~0)} is VALID [2022-04-27 12:34:00,465 INFO L290 TraceCheckUtils]: 27: Hoare triple {3677#(= 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); {3625#false} is VALID [2022-04-27 12:34:00,465 INFO L290 TraceCheckUtils]: 28: Hoare triple {3625#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {3625#false} is VALID [2022-04-27 12:34:00,465 INFO L290 TraceCheckUtils]: 29: Hoare triple {3625#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {3625#false} is VALID [2022-04-27 12:34:00,465 INFO L290 TraceCheckUtils]: 30: Hoare triple {3625#false} assume !!(#t~post4 < 10);havoc #t~post4; {3625#false} is VALID [2022-04-27 12:34:00,465 INFO L272 TraceCheckUtils]: 31: Hoare triple {3625#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {3625#false} is VALID [2022-04-27 12:34:00,466 INFO L290 TraceCheckUtils]: 32: Hoare triple {3625#false} ~cond := #in~cond; {3625#false} is VALID [2022-04-27 12:34:00,466 INFO L290 TraceCheckUtils]: 33: Hoare triple {3625#false} assume 0 == ~cond; {3625#false} is VALID [2022-04-27 12:34:00,466 INFO L290 TraceCheckUtils]: 34: Hoare triple {3625#false} assume !false; {3625#false} is VALID [2022-04-27 12:34:00,466 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 12:34:00,466 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:34:00,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:34:00,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476732680] [2022-04-27 12:34:00,466 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:34:00,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702451894] [2022-04-27 12:34:00,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [702451894] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:34:00,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:34:00,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 12:34:00,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178875819] [2022-04-27 12:34:00,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:34:00,467 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2022-04-27 12:34:00,468 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:34:00,468 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 12:34:00,499 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:34:00,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 12:34:00,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:34:00,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 12:34:00,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:34:00,501 INFO L87 Difference]: Start difference. First operand 111 states and 130 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 12:34:00,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:34:00,628 INFO L93 Difference]: Finished difference Result 145 states and 171 transitions. [2022-04-27 12:34:00,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 12:34:00,628 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2022-04-27 12:34:00,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:34:00,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 12:34:00,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2022-04-27 12:34:00,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 12:34:00,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2022-04-27 12:34:00,631 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 56 transitions. [2022-04-27 12:34:00,683 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:34:00,685 INFO L225 Difference]: With dead ends: 145 [2022-04-27 12:34:00,685 INFO L226 Difference]: Without dead ends: 95 [2022-04-27 12:34:00,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:34:00,686 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:34:00,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:34:00,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-04-27 12:34:00,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2022-04-27 12:34:00,711 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:34:00,711 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand has 95 states, 73 states have (on average 1.2191780821917808) internal successors, (89), 77 states have internal predecessors, (89), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:34:00,712 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand has 95 states, 73 states have (on average 1.2191780821917808) internal successors, (89), 77 states have internal predecessors, (89), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:34:00,712 INFO L87 Difference]: Start difference. First operand 95 states. Second operand has 95 states, 73 states have (on average 1.2191780821917808) internal successors, (89), 77 states have internal predecessors, (89), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:34:00,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:34:00,715 INFO L93 Difference]: Finished difference Result 95 states and 111 transitions. [2022-04-27 12:34:00,715 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 111 transitions. [2022-04-27 12:34:00,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:34:00,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:34:00,716 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 73 states have (on average 1.2191780821917808) internal successors, (89), 77 states have internal predecessors, (89), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) Second operand 95 states. [2022-04-27 12:34:00,716 INFO L87 Difference]: Start difference. First operand has 95 states, 73 states have (on average 1.2191780821917808) internal successors, (89), 77 states have internal predecessors, (89), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) Second operand 95 states. [2022-04-27 12:34:00,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:34:00,718 INFO L93 Difference]: Finished difference Result 95 states and 111 transitions. [2022-04-27 12:34:00,719 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 111 transitions. [2022-04-27 12:34:00,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:34:00,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:34:00,719 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:34:00,719 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:34:00,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 73 states have (on average 1.2191780821917808) internal successors, (89), 77 states have internal predecessors, (89), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:34:00,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 111 transitions. [2022-04-27 12:34:00,722 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 111 transitions. Word has length 35 [2022-04-27 12:34:00,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:34:00,722 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 111 transitions. [2022-04-27 12:34:00,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 12:34:00,722 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 111 transitions. [2022-04-27 12:34:00,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-27 12:34:00,723 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:34:00,723 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:34:00,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-27 12:34:00,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-27 12:34:00,939 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:34:00,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:34:00,940 INFO L85 PathProgramCache]: Analyzing trace with hash 817777954, now seen corresponding path program 1 times [2022-04-27 12:34:00,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:34:00,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808153654] [2022-04-27 12:34:00,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:34:00,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:34:00,958 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:34:00,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [105769393] [2022-04-27 12:34:00,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:34:00,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:34:00,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:34:00,959 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:34:00,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process