/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/divbin2_unwindbound5.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 12:32:21,129 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 12:32:21,130 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 12:32:21,162 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 12:32:21,162 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 12:32:21,163 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 12:32:21,164 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 12:32:21,165 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 12:32:21,166 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 12:32:21,166 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 12:32:21,167 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 12:32:21,167 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 12:32:21,168 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 12:32:21,168 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 12:32:21,169 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 12:32:21,169 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 12:32:21,170 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 12:32:21,170 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 12:32:21,186 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 12:32:21,188 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 12:32:21,189 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 12:32:21,189 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 12:32:21,190 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 12:32:21,190 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 12:32:21,191 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 12:32:21,192 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 12:32:21,193 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 12:32:21,193 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 12:32:21,193 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 12:32:21,194 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 12:32:21,194 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 12:32:21,194 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 12:32:21,195 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 12:32:21,195 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 12:32:21,195 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 12:32:21,196 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 12:32:21,196 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 12:32:21,197 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 12:32:21,197 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 12:32:21,197 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 12:32:21,197 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 12:32:21,203 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 12:32:21,204 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 12:32:21,224 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 12:32:21,225 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 12:32:21,225 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 12:32:21,225 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 12:32:21,226 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 12:32:21,226 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 12:32:21,226 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 12:32:21,226 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 12:32:21,226 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 12:32:21,227 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 12:32:21,227 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 12:32:21,227 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 12:32:21,227 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 12:32:21,227 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 12:32:21,227 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 12:32:21,227 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 12:32:21,227 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 12:32:21,228 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 12:32:21,228 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 12:32:21,228 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 12:32:21,228 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 12:32:21,228 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 12:32:21,228 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 12:32:21,228 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 12:32:21,228 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 12:32:21,228 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 12:32:21,228 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 12:32:21,228 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 12:32:21,228 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 12:32:21,229 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 12:32:21,229 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 12:32:21,229 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 12:32:21,229 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 12:32:21,229 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 12:32:21,405 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 12:32:21,420 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 12:32:21,421 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 12:32:21,422 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 12:32:21,427 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 12:32:21,428 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/divbin2_unwindbound5.i [2022-04-27 12:32:21,479 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e76975056/34a69404321546549fe08ae91283856a/FLAG02e7ccc60 [2022-04-27 12:32:21,836 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 12:32:21,836 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin2_unwindbound5.i [2022-04-27 12:32:21,842 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e76975056/34a69404321546549fe08ae91283856a/FLAG02e7ccc60 [2022-04-27 12:32:22,250 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e76975056/34a69404321546549fe08ae91283856a [2022-04-27 12:32:22,253 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 12:32:22,255 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 12:32:22,257 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 12:32:22,257 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 12:32:22,261 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 12:32:22,262 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 12:32:22" (1/1) ... [2022-04-27 12:32:22,263 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78e68d00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:32:22, skipping insertion in model container [2022-04-27 12:32:22,263 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 12:32:22" (1/1) ... [2022-04-27 12:32:22,269 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 12:32:22,283 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 12:32:22,403 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin2_unwindbound5.i[951,964] [2022-04-27 12:32:22,415 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 12:32:22,421 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 12:32:22,430 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin2_unwindbound5.i[951,964] [2022-04-27 12:32:22,434 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 12:32:22,448 INFO L208 MainTranslator]: Completed translation [2022-04-27 12:32:22,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:32:22 WrapperNode [2022-04-27 12:32:22,449 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 12:32:22,450 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 12:32:22,450 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 12:32:22,450 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 12:32:22,459 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:32:22" (1/1) ... [2022-04-27 12:32:22,459 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:32:22" (1/1) ... [2022-04-27 12:32:22,463 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:32:22" (1/1) ... [2022-04-27 12:32:22,464 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:32:22" (1/1) ... [2022-04-27 12:32:22,468 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:32:22" (1/1) ... [2022-04-27 12:32:22,472 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:32:22" (1/1) ... [2022-04-27 12:32:22,473 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:32:22" (1/1) ... [2022-04-27 12:32:22,474 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 12:32:22,475 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 12:32:22,475 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 12:32:22,475 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 12:32:22,476 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:32:22" (1/1) ... [2022-04-27 12:32:22,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 12:32:22,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:32:22,500 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 12:32:22,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 12:32:22,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 12:32:22,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 12:32:22,530 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 12:32:22,531 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 12:32:22,533 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 12:32:22,533 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 12:32:22,533 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 12:32:22,533 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 12:32:22,534 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 12:32:22,534 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 12:32:22,534 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 12:32:22,534 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 12:32:22,534 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 12:32:22,534 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 12:32:22,534 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 12:32:22,534 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 12:32:22,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 12:32:22,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 12:32:22,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 12:32:22,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 12:32:22,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 12:32:22,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 12:32:22,583 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 12:32:22,586 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 12:32:22,694 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 12:32:22,699 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 12:32:22,699 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 12:32:22,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 12:32:22 BoogieIcfgContainer [2022-04-27 12:32:22,700 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 12:32:22,702 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 12:32:22,702 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 12:32:22,704 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 12:32:22,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 12:32:22" (1/3) ... [2022-04-27 12:32:22,705 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3528bebe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 12:32:22, skipping insertion in model container [2022-04-27 12:32:22,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:32:22" (2/3) ... [2022-04-27 12:32:22,705 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3528bebe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 12:32:22, skipping insertion in model container [2022-04-27 12:32:22,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 12:32:22" (3/3) ... [2022-04-27 12:32:22,706 INFO L111 eAbstractionObserver]: Analyzing ICFG divbin2_unwindbound5.i [2022-04-27 12:32:22,717 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 12:32:22,717 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 12:32:22,750 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 12:32:22,755 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@3652aa75, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@15cd10a7 [2022-04-27 12:32:22,755 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 12:32:22,762 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 12:32:22,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 12:32:22,767 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:32:22,767 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:32:22,768 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:32:22,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:32:22,772 INFO L85 PathProgramCache]: Analyzing trace with hash -2126508982, now seen corresponding path program 1 times [2022-04-27 12:32:22,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:32:22,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017910502] [2022-04-27 12:32:22,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:32:22,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:32:22,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:32:22,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 12:32:22,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:32:22,905 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#(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(10, 2);~counter~0 := 0; {29#true} is VALID [2022-04-27 12:32:22,906 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-27 12:32:22,906 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29#true} {29#true} #82#return; {29#true} is VALID [2022-04-27 12:32:22,908 INFO L272 TraceCheckUtils]: 0: Hoare triple {29#true} call ULTIMATE.init(); {34#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 12:32:22,908 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#(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(10, 2);~counter~0 := 0; {29#true} is VALID [2022-04-27 12:32:22,908 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-27 12:32:22,909 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29#true} {29#true} #82#return; {29#true} is VALID [2022-04-27 12:32:22,909 INFO L272 TraceCheckUtils]: 4: Hoare triple {29#true} call #t~ret4 := main(); {29#true} is VALID [2022-04-27 12:32:22,909 INFO L290 TraceCheckUtils]: 5: Hoare triple {29#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 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {29#true} is VALID [2022-04-27 12:32:22,910 INFO L290 TraceCheckUtils]: 6: Hoare triple {29#true} assume !true; {30#false} is VALID [2022-04-27 12:32:22,910 INFO L290 TraceCheckUtils]: 7: Hoare triple {30#false} assume !true; {30#false} is VALID [2022-04-27 12:32:22,910 INFO L272 TraceCheckUtils]: 8: Hoare triple {30#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {30#false} is VALID [2022-04-27 12:32:22,910 INFO L290 TraceCheckUtils]: 9: Hoare triple {30#false} ~cond := #in~cond; {30#false} is VALID [2022-04-27 12:32:22,910 INFO L290 TraceCheckUtils]: 10: Hoare triple {30#false} assume 0 == ~cond; {30#false} is VALID [2022-04-27 12:32:22,911 INFO L290 TraceCheckUtils]: 11: Hoare triple {30#false} assume !false; {30#false} is VALID [2022-04-27 12:32:22,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:32:22,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:32:22,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017910502] [2022-04-27 12:32:22,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017910502] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:32:22,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:32:22,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 12:32:22,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096819911] [2022-04-27 12:32:22,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:32:22,918 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 12:32:22,919 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:32:22,922 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:32:22,936 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:32:22,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 12:32:22,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:32:22,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 12:32:22,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:32:22,961 INFO L87 Difference]: Start difference. First operand has 26 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:32:23,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:32:23,103 INFO L93 Difference]: Finished difference Result 44 states and 60 transitions. [2022-04-27 12:32:23,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 12:32:23,103 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 12:32:23,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:32:23,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:32:23,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-04-27 12:32:23,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:32:23,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-04-27 12:32:23,113 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 60 transitions. [2022-04-27 12:32:23,180 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:32:23,186 INFO L225 Difference]: With dead ends: 44 [2022-04-27 12:32:23,186 INFO L226 Difference]: Without dead ends: 22 [2022-04-27 12:32:23,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:32:23,191 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:32:23,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 34 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:32:23,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-27 12:32:23,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-04-27 12:32:23,213 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:32:23,213 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:32:23,214 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:32:23,214 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:32:23,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:32:23,217 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-04-27 12:32:23,217 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-27 12:32:23,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:32:23,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:32:23,218 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 22 states. [2022-04-27 12:32:23,218 INFO L87 Difference]: Start difference. First operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 22 states. [2022-04-27 12:32:23,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:32:23,220 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-04-27 12:32:23,220 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-27 12:32:23,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:32:23,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:32:23,221 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:32:23,221 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:32:23,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:32:23,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2022-04-27 12:32:23,224 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 12 [2022-04-27 12:32:23,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:32:23,224 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2022-04-27 12:32:23,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:32:23,225 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2022-04-27 12:32:23,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 12:32:23,225 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:32:23,225 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:32:23,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 12:32:23,226 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:32:23,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:32:23,227 INFO L85 PathProgramCache]: Analyzing trace with hash 941422680, now seen corresponding path program 1 times [2022-04-27 12:32:23,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:32:23,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258588694] [2022-04-27 12:32:23,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:32:23,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:32:23,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:32:23,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 12:32:23,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:32:23,337 INFO L290 TraceCheckUtils]: 0: Hoare triple {173#(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(10, 2);~counter~0 := 0; {171#(<= ~counter~0 0)} is VALID [2022-04-27 12:32:23,338 INFO L290 TraceCheckUtils]: 1: Hoare triple {171#(<= ~counter~0 0)} assume true; {171#(<= ~counter~0 0)} is VALID [2022-04-27 12:32:23,343 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {171#(<= ~counter~0 0)} {166#true} #82#return; {171#(<= ~counter~0 0)} is VALID [2022-04-27 12:32:23,344 INFO L272 TraceCheckUtils]: 0: Hoare triple {166#true} call ULTIMATE.init(); {173#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 12:32:23,345 INFO L290 TraceCheckUtils]: 1: Hoare triple {173#(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(10, 2);~counter~0 := 0; {171#(<= ~counter~0 0)} is VALID [2022-04-27 12:32:23,345 INFO L290 TraceCheckUtils]: 2: Hoare triple {171#(<= ~counter~0 0)} assume true; {171#(<= ~counter~0 0)} is VALID [2022-04-27 12:32:23,346 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {171#(<= ~counter~0 0)} {166#true} #82#return; {171#(<= ~counter~0 0)} is VALID [2022-04-27 12:32:23,346 INFO L272 TraceCheckUtils]: 4: Hoare triple {171#(<= ~counter~0 0)} call #t~ret4 := main(); {171#(<= ~counter~0 0)} is VALID [2022-04-27 12:32:23,347 INFO L290 TraceCheckUtils]: 5: Hoare triple {171#(<= ~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 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {171#(<= ~counter~0 0)} is VALID [2022-04-27 12:32:23,347 INFO L290 TraceCheckUtils]: 6: Hoare triple {171#(<= ~counter~0 0)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {172#(<= |main_#t~post2| 0)} is VALID [2022-04-27 12:32:23,348 INFO L290 TraceCheckUtils]: 7: Hoare triple {172#(<= |main_#t~post2| 0)} assume !(#t~post2 < 5);havoc #t~post2; {167#false} is VALID [2022-04-27 12:32:23,348 INFO L290 TraceCheckUtils]: 8: Hoare triple {167#false} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {167#false} is VALID [2022-04-27 12:32:23,348 INFO L290 TraceCheckUtils]: 9: Hoare triple {167#false} assume !(#t~post3 < 5);havoc #t~post3; {167#false} is VALID [2022-04-27 12:32:23,348 INFO L272 TraceCheckUtils]: 10: Hoare triple {167#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {167#false} is VALID [2022-04-27 12:32:23,348 INFO L290 TraceCheckUtils]: 11: Hoare triple {167#false} ~cond := #in~cond; {167#false} is VALID [2022-04-27 12:32:23,349 INFO L290 TraceCheckUtils]: 12: Hoare triple {167#false} assume 0 == ~cond; {167#false} is VALID [2022-04-27 12:32:23,349 INFO L290 TraceCheckUtils]: 13: Hoare triple {167#false} assume !false; {167#false} is VALID [2022-04-27 12:32:23,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:32:23,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:32:23,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258588694] [2022-04-27 12:32:23,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258588694] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:32:23,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:32:23,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 12:32:23,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241266675] [2022-04-27 12:32:23,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:32:23,351 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 12:32:23,351 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:32:23,351 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:32:23,377 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:32:23,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:32:23,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:32:23,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:32:23,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:32:23,378 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:32:23,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:32:23,502 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-27 12:32:23,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 12:32:23,502 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 12:32:23,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:32:23,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:32:23,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-04-27 12:32:23,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:32:23,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-04-27 12:32:23,506 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 44 transitions. [2022-04-27 12:32:23,539 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:32:23,540 INFO L225 Difference]: With dead ends: 35 [2022-04-27 12:32:23,540 INFO L226 Difference]: Without dead ends: 23 [2022-04-27 12:32:23,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 12:32:23,542 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 6 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:32:23,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 53 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:32:23,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-27 12:32:23,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-27 12:32:23,547 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:32:23,547 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:32:23,548 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:32:23,548 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:32:23,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:32:23,549 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-04-27 12:32:23,549 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-27 12:32:23,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:32:23,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:32:23,550 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 23 states. [2022-04-27 12:32:23,550 INFO L87 Difference]: Start difference. First operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 23 states. [2022-04-27 12:32:23,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:32:23,552 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-04-27 12:32:23,552 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-27 12:32:23,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:32:23,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:32:23,560 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:32:23,560 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:32:23,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:32:23,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2022-04-27 12:32:23,562 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 14 [2022-04-27 12:32:23,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:32:23,562 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2022-04-27 12:32:23,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:32:23,562 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-27 12:32:23,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 12:32:23,563 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:32:23,563 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:32:23,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 12:32:23,563 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:32:23,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:32:23,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1209133518, now seen corresponding path program 1 times [2022-04-27 12:32:23,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:32:23,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581422860] [2022-04-27 12:32:23,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:32:23,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:32:23,592 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:32:23,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1152165375] [2022-04-27 12:32:23,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:32:23,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:32:23,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:32:23,594 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:32:23,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 12:32:23,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:32:23,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 12:32:23,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:32:23,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:32:23,906 INFO L272 TraceCheckUtils]: 0: Hoare triple {303#true} call ULTIMATE.init(); {303#true} is VALID [2022-04-27 12:32:23,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {303#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);~counter~0 := 0; {311#(<= ~counter~0 0)} is VALID [2022-04-27 12:32:23,908 INFO L290 TraceCheckUtils]: 2: Hoare triple {311#(<= ~counter~0 0)} assume true; {311#(<= ~counter~0 0)} is VALID [2022-04-27 12:32:23,908 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {311#(<= ~counter~0 0)} {303#true} #82#return; {311#(<= ~counter~0 0)} is VALID [2022-04-27 12:32:23,909 INFO L272 TraceCheckUtils]: 4: Hoare triple {311#(<= ~counter~0 0)} call #t~ret4 := main(); {311#(<= ~counter~0 0)} is VALID [2022-04-27 12:32:23,910 INFO L290 TraceCheckUtils]: 5: Hoare triple {311#(<= ~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 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {311#(<= ~counter~0 0)} is VALID [2022-04-27 12:32:23,910 INFO L290 TraceCheckUtils]: 6: Hoare triple {311#(<= ~counter~0 0)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {327#(<= ~counter~0 1)} is VALID [2022-04-27 12:32:23,911 INFO L290 TraceCheckUtils]: 7: Hoare triple {327#(<= ~counter~0 1)} assume !!(#t~post2 < 5);havoc #t~post2; {327#(<= ~counter~0 1)} is VALID [2022-04-27 12:32:23,912 INFO L290 TraceCheckUtils]: 8: Hoare triple {327#(<= ~counter~0 1)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {327#(<= ~counter~0 1)} is VALID [2022-04-27 12:32:23,912 INFO L290 TraceCheckUtils]: 9: Hoare triple {327#(<= ~counter~0 1)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {337#(<= |main_#t~post3| 1)} is VALID [2022-04-27 12:32:23,913 INFO L290 TraceCheckUtils]: 10: Hoare triple {337#(<= |main_#t~post3| 1)} assume !(#t~post3 < 5);havoc #t~post3; {304#false} is VALID [2022-04-27 12:32:23,914 INFO L272 TraceCheckUtils]: 11: Hoare triple {304#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {304#false} is VALID [2022-04-27 12:32:23,914 INFO L290 TraceCheckUtils]: 12: Hoare triple {304#false} ~cond := #in~cond; {304#false} is VALID [2022-04-27 12:32:23,917 INFO L290 TraceCheckUtils]: 13: Hoare triple {304#false} assume 0 == ~cond; {304#false} is VALID [2022-04-27 12:32:23,918 INFO L290 TraceCheckUtils]: 14: Hoare triple {304#false} assume !false; {304#false} is VALID [2022-04-27 12:32:23,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:32:23,924 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:32:23,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:32:23,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581422860] [2022-04-27 12:32:23,924 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:32:23,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152165375] [2022-04-27 12:32:23,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152165375] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:32:23,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:32:23,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 12:32:23,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746914181] [2022-04-27 12:32:23,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:32:23,928 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 12:32:23,928 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:32:23,929 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:32:23,940 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:32:23,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:32:23,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:32:23,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:32:23,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:32:23,941 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:32:24,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:32:24,016 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2022-04-27 12:32:24,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:32:24,016 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 12:32:24,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:32:24,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:32:24,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-27 12:32:24,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:32:24,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-27 12:32:24,019 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2022-04-27 12:32:24,071 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:32:24,073 INFO L225 Difference]: With dead ends: 34 [2022-04-27 12:32:24,073 INFO L226 Difference]: Without dead ends: 27 [2022-04-27 12:32:24,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 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:32:24,077 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 3 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:32:24,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 66 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:32:24,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-27 12:32:24,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-04-27 12:32:24,085 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:32:24,087 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 26 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:32:24,087 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 26 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:32:24,087 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 26 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:32:24,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:32:24,090 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2022-04-27 12:32:24,090 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-04-27 12:32:24,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:32:24,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:32:24,091 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 27 states. [2022-04-27 12:32:24,093 INFO L87 Difference]: Start difference. First operand has 26 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 27 states. [2022-04-27 12:32:24,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:32:24,099 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2022-04-27 12:32:24,099 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-04-27 12:32:24,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:32:24,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:32:24,100 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:32:24,100 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:32:24,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:32:24,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2022-04-27 12:32:24,101 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 15 [2022-04-27 12:32:24,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:32:24,102 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2022-04-27 12:32:24,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:32:24,102 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2022-04-27 12:32:24,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 12:32:24,102 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:32:24,102 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:32:24,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 12:32:24,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:32:24,327 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:32:24,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:32:24,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1207346058, now seen corresponding path program 1 times [2022-04-27 12:32:24,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:32:24,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145406119] [2022-04-27 12:32:24,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:32:24,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:32:24,341 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:32:24,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [629051324] [2022-04-27 12:32:24,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:32:24,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:32:24,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:32:24,342 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:32:24,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 12:32:24,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:32:24,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-27 12:32:24,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:32:24,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:32:24,674 INFO L272 TraceCheckUtils]: 0: Hoare triple {487#true} call ULTIMATE.init(); {487#true} is VALID [2022-04-27 12:32:24,674 INFO L290 TraceCheckUtils]: 1: Hoare triple {487#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);~counter~0 := 0; {487#true} is VALID [2022-04-27 12:32:24,674 INFO L290 TraceCheckUtils]: 2: Hoare triple {487#true} assume true; {487#true} is VALID [2022-04-27 12:32:24,674 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {487#true} {487#true} #82#return; {487#true} is VALID [2022-04-27 12:32:24,675 INFO L272 TraceCheckUtils]: 4: Hoare triple {487#true} call #t~ret4 := main(); {487#true} is VALID [2022-04-27 12:32:24,675 INFO L290 TraceCheckUtils]: 5: Hoare triple {487#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 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {507#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:32:24,676 INFO L290 TraceCheckUtils]: 6: Hoare triple {507#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {507#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:32:24,676 INFO L290 TraceCheckUtils]: 7: Hoare triple {507#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post2 < 5);havoc #t~post2; {507#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:32:24,677 INFO L290 TraceCheckUtils]: 8: Hoare triple {507#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {517#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:32:24,677 INFO L290 TraceCheckUtils]: 9: Hoare triple {517#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {517#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:32:24,678 INFO L290 TraceCheckUtils]: 10: Hoare triple {517#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post3 < 5);havoc #t~post3; {517#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:32:24,679 INFO L272 TraceCheckUtils]: 11: Hoare triple {517#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {527#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:32:24,679 INFO L290 TraceCheckUtils]: 12: Hoare triple {527#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {531#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:32:24,680 INFO L290 TraceCheckUtils]: 13: Hoare triple {531#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {488#false} is VALID [2022-04-27 12:32:24,680 INFO L290 TraceCheckUtils]: 14: Hoare triple {488#false} assume !false; {488#false} is VALID [2022-04-27 12:32:24,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:32:24,680 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:32:24,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:32:24,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145406119] [2022-04-27 12:32:24,681 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:32:24,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629051324] [2022-04-27 12:32:24,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [629051324] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:32:24,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:32:24,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 12:32:24,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812639133] [2022-04-27 12:32:24,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:32:24,682 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 12:32:24,682 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:32:24,682 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:32:24,694 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:32:24,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 12:32:24,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:32:24,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 12:32:24,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-27 12:32:24,696 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:32:24,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:32:24,832 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2022-04-27 12:32:24,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 12:32:24,832 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 12:32:24,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:32:24,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:32:24,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-04-27 12:32:24,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:32:24,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-04-27 12:32:24,835 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 42 transitions. [2022-04-27 12:32:24,871 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:32:24,874 INFO L225 Difference]: With dead ends: 35 [2022-04-27 12:32:24,874 INFO L226 Difference]: Without dead ends: 32 [2022-04-27 12:32:24,875 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-27 12:32:24,876 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 10 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:32:24,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 75 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:32:24,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-27 12:32:24,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-27 12:32:24,887 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:32:24,887 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 12:32:24,888 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 12:32:24,889 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 12:32:24,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:32:24,892 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2022-04-27 12:32:24,892 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-04-27 12:32:24,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:32:24,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:32:24,894 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 32 states. [2022-04-27 12:32:24,894 INFO L87 Difference]: Start difference. First operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 32 states. [2022-04-27 12:32:24,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:32:24,898 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2022-04-27 12:32:24,898 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-04-27 12:32:24,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:32:24,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:32:24,899 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:32:24,899 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:32:24,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 12:32:24,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-04-27 12:32:24,901 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 15 [2022-04-27 12:32:24,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:32:24,901 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-04-27 12:32:24,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:32:24,902 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-04-27 12:32:24,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 12:32:24,902 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:32:24,902 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:32:24,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-27 12:32:25,120 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,SelfDestructingSolverStorable3 [2022-04-27 12:32:25,121 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:32:25,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:32:25,121 INFO L85 PathProgramCache]: Analyzing trace with hash -352921097, now seen corresponding path program 1 times [2022-04-27 12:32:25,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:32:25,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842743949] [2022-04-27 12:32:25,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:32:25,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:32:25,132 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:32:25,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [693129724] [2022-04-27 12:32:25,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:32:25,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:32:25,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:32:25,134 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:32:25,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 12:32:25,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:32:25,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 12:32:25,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:32:25,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:32:25,258 INFO L272 TraceCheckUtils]: 0: Hoare triple {693#true} call ULTIMATE.init(); {693#true} is VALID [2022-04-27 12:32:25,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {693#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);~counter~0 := 0; {701#(<= ~counter~0 0)} is VALID [2022-04-27 12:32:25,259 INFO L290 TraceCheckUtils]: 2: Hoare triple {701#(<= ~counter~0 0)} assume true; {701#(<= ~counter~0 0)} is VALID [2022-04-27 12:32:25,260 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {701#(<= ~counter~0 0)} {693#true} #82#return; {701#(<= ~counter~0 0)} is VALID [2022-04-27 12:32:25,260 INFO L272 TraceCheckUtils]: 4: Hoare triple {701#(<= ~counter~0 0)} call #t~ret4 := main(); {701#(<= ~counter~0 0)} is VALID [2022-04-27 12:32:25,260 INFO L290 TraceCheckUtils]: 5: Hoare triple {701#(<= ~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 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {701#(<= ~counter~0 0)} is VALID [2022-04-27 12:32:25,261 INFO L290 TraceCheckUtils]: 6: Hoare triple {701#(<= ~counter~0 0)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {717#(<= ~counter~0 1)} is VALID [2022-04-27 12:32:25,261 INFO L290 TraceCheckUtils]: 7: Hoare triple {717#(<= ~counter~0 1)} assume !!(#t~post2 < 5);havoc #t~post2; {717#(<= ~counter~0 1)} is VALID [2022-04-27 12:32:25,261 INFO L290 TraceCheckUtils]: 8: Hoare triple {717#(<= ~counter~0 1)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {717#(<= ~counter~0 1)} is VALID [2022-04-27 12:32:25,262 INFO L290 TraceCheckUtils]: 9: Hoare triple {717#(<= ~counter~0 1)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {727#(<= |main_#t~post2| 1)} is VALID [2022-04-27 12:32:25,262 INFO L290 TraceCheckUtils]: 10: Hoare triple {727#(<= |main_#t~post2| 1)} assume !(#t~post2 < 5);havoc #t~post2; {694#false} is VALID [2022-04-27 12:32:25,262 INFO L290 TraceCheckUtils]: 11: Hoare triple {694#false} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {694#false} is VALID [2022-04-27 12:32:25,262 INFO L290 TraceCheckUtils]: 12: Hoare triple {694#false} assume !(#t~post3 < 5);havoc #t~post3; {694#false} is VALID [2022-04-27 12:32:25,263 INFO L272 TraceCheckUtils]: 13: Hoare triple {694#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {694#false} is VALID [2022-04-27 12:32:25,263 INFO L290 TraceCheckUtils]: 14: Hoare triple {694#false} ~cond := #in~cond; {694#false} is VALID [2022-04-27 12:32:25,263 INFO L290 TraceCheckUtils]: 15: Hoare triple {694#false} assume 0 == ~cond; {694#false} is VALID [2022-04-27 12:32:25,263 INFO L290 TraceCheckUtils]: 16: Hoare triple {694#false} assume !false; {694#false} is VALID [2022-04-27 12:32:25,263 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:32:25,263 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:32:25,390 INFO L290 TraceCheckUtils]: 16: Hoare triple {694#false} assume !false; {694#false} is VALID [2022-04-27 12:32:25,390 INFO L290 TraceCheckUtils]: 15: Hoare triple {694#false} assume 0 == ~cond; {694#false} is VALID [2022-04-27 12:32:25,390 INFO L290 TraceCheckUtils]: 14: Hoare triple {694#false} ~cond := #in~cond; {694#false} is VALID [2022-04-27 12:32:25,390 INFO L272 TraceCheckUtils]: 13: Hoare triple {694#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {694#false} is VALID [2022-04-27 12:32:25,391 INFO L290 TraceCheckUtils]: 12: Hoare triple {694#false} assume !(#t~post3 < 5);havoc #t~post3; {694#false} is VALID [2022-04-27 12:32:25,391 INFO L290 TraceCheckUtils]: 11: Hoare triple {694#false} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {694#false} is VALID [2022-04-27 12:32:25,391 INFO L290 TraceCheckUtils]: 10: Hoare triple {767#(< |main_#t~post2| 5)} assume !(#t~post2 < 5);havoc #t~post2; {694#false} is VALID [2022-04-27 12:32:25,391 INFO L290 TraceCheckUtils]: 9: Hoare triple {771#(< ~counter~0 5)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {767#(< |main_#t~post2| 5)} is VALID [2022-04-27 12:32:25,392 INFO L290 TraceCheckUtils]: 8: Hoare triple {771#(< ~counter~0 5)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {771#(< ~counter~0 5)} is VALID [2022-04-27 12:32:25,392 INFO L290 TraceCheckUtils]: 7: Hoare triple {771#(< ~counter~0 5)} assume !!(#t~post2 < 5);havoc #t~post2; {771#(< ~counter~0 5)} is VALID [2022-04-27 12:32:25,393 INFO L290 TraceCheckUtils]: 6: Hoare triple {781#(< ~counter~0 4)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {771#(< ~counter~0 5)} is VALID [2022-04-27 12:32:25,393 INFO L290 TraceCheckUtils]: 5: Hoare triple {781#(< ~counter~0 4)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {781#(< ~counter~0 4)} is VALID [2022-04-27 12:32:25,393 INFO L272 TraceCheckUtils]: 4: Hoare triple {781#(< ~counter~0 4)} call #t~ret4 := main(); {781#(< ~counter~0 4)} is VALID [2022-04-27 12:32:25,394 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {781#(< ~counter~0 4)} {693#true} #82#return; {781#(< ~counter~0 4)} is VALID [2022-04-27 12:32:25,394 INFO L290 TraceCheckUtils]: 2: Hoare triple {781#(< ~counter~0 4)} assume true; {781#(< ~counter~0 4)} is VALID [2022-04-27 12:32:25,395 INFO L290 TraceCheckUtils]: 1: Hoare triple {693#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);~counter~0 := 0; {781#(< ~counter~0 4)} is VALID [2022-04-27 12:32:25,395 INFO L272 TraceCheckUtils]: 0: Hoare triple {693#true} call ULTIMATE.init(); {693#true} is VALID [2022-04-27 12:32:25,395 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:32:25,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:32:25,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842743949] [2022-04-27 12:32:25,395 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:32:25,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693129724] [2022-04-27 12:32:25,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693129724] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:32:25,395 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:32:25,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-27 12:32:25,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461925435] [2022-04-27 12:32:25,396 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:32:25,396 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 12:32:25,396 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:32:25,396 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:32:25,415 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:32:25,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 12:32:25,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:32:25,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 12:32:25,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-27 12:32:25,416 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:32:25,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:32:25,598 INFO L93 Difference]: Finished difference Result 66 states and 84 transitions. [2022-04-27 12:32:25,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 12:32:25,598 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 12:32:25,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:32:25,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:32:25,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 84 transitions. [2022-04-27 12:32:25,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:32:25,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 84 transitions. [2022-04-27 12:32:25,603 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 84 transitions. [2022-04-27 12:32:25,661 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:32:25,662 INFO L225 Difference]: With dead ends: 66 [2022-04-27 12:32:25,662 INFO L226 Difference]: Without dead ends: 54 [2022-04-27 12:32:25,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-27 12:32:25,663 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 31 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:32:25,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 132 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:32:25,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-27 12:32:25,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 40. [2022-04-27 12:32:25,674 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:32:25,674 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 40 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 32 states have internal predecessors, (40), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 12:32:25,675 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 40 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 32 states have internal predecessors, (40), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 12:32:25,675 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 40 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 32 states have internal predecessors, (40), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 12:32:25,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:32:25,678 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2022-04-27 12:32:25,678 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2022-04-27 12:32:25,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:32:25,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:32:25,681 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 32 states have internal predecessors, (40), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 54 states. [2022-04-27 12:32:25,681 INFO L87 Difference]: Start difference. First operand has 40 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 32 states have internal predecessors, (40), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 54 states. [2022-04-27 12:32:25,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:32:25,686 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2022-04-27 12:32:25,686 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2022-04-27 12:32:25,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:32:25,687 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:32:25,687 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:32:25,687 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:32:25,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 32 states have internal predecessors, (40), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 12:32:25,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2022-04-27 12:32:25,689 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 17 [2022-04-27 12:32:25,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:32:25,689 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2022-04-27 12:32:25,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:32:25,690 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2022-04-27 12:32:25,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 12:32:25,690 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:32:25,690 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:32:25,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 12:32:25,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:32:25,906 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:32:25,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:32:25,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1615882355, now seen corresponding path program 1 times [2022-04-27 12:32:25,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:32:25,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749715810] [2022-04-27 12:32:25,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:32:25,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:32:25,922 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:32:25,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [864871802] [2022-04-27 12:32:25,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:32:25,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:32:25,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:32:25,937 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:32:25,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 12:32:25,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:32:25,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 12:32:25,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:32:25,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:32:26,076 INFO L272 TraceCheckUtils]: 0: Hoare triple {1056#true} call ULTIMATE.init(); {1056#true} is VALID [2022-04-27 12:32:26,076 INFO L290 TraceCheckUtils]: 1: Hoare triple {1056#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);~counter~0 := 0; {1064#(<= ~counter~0 0)} is VALID [2022-04-27 12:32:26,077 INFO L290 TraceCheckUtils]: 2: Hoare triple {1064#(<= ~counter~0 0)} assume true; {1064#(<= ~counter~0 0)} is VALID [2022-04-27 12:32:26,077 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1064#(<= ~counter~0 0)} {1056#true} #82#return; {1064#(<= ~counter~0 0)} is VALID [2022-04-27 12:32:26,077 INFO L272 TraceCheckUtils]: 4: Hoare triple {1064#(<= ~counter~0 0)} call #t~ret4 := main(); {1064#(<= ~counter~0 0)} is VALID [2022-04-27 12:32:26,078 INFO L290 TraceCheckUtils]: 5: Hoare triple {1064#(<= ~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 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1064#(<= ~counter~0 0)} is VALID [2022-04-27 12:32:26,078 INFO L290 TraceCheckUtils]: 6: Hoare triple {1064#(<= ~counter~0 0)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {1080#(<= ~counter~0 1)} is VALID [2022-04-27 12:32:26,079 INFO L290 TraceCheckUtils]: 7: Hoare triple {1080#(<= ~counter~0 1)} assume !!(#t~post2 < 5);havoc #t~post2; {1080#(<= ~counter~0 1)} is VALID [2022-04-27 12:32:26,083 INFO L290 TraceCheckUtils]: 8: Hoare triple {1080#(<= ~counter~0 1)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1080#(<= ~counter~0 1)} is VALID [2022-04-27 12:32:26,084 INFO L290 TraceCheckUtils]: 9: Hoare triple {1080#(<= ~counter~0 1)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {1090#(<= ~counter~0 2)} is VALID [2022-04-27 12:32:26,085 INFO L290 TraceCheckUtils]: 10: Hoare triple {1090#(<= ~counter~0 2)} assume !!(#t~post2 < 5);havoc #t~post2; {1090#(<= ~counter~0 2)} is VALID [2022-04-27 12:32:26,085 INFO L290 TraceCheckUtils]: 11: Hoare triple {1090#(<= ~counter~0 2)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1090#(<= ~counter~0 2)} is VALID [2022-04-27 12:32:26,085 INFO L290 TraceCheckUtils]: 12: Hoare triple {1090#(<= ~counter~0 2)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1100#(<= |main_#t~post3| 2)} is VALID [2022-04-27 12:32:26,086 INFO L290 TraceCheckUtils]: 13: Hoare triple {1100#(<= |main_#t~post3| 2)} assume !(#t~post3 < 5);havoc #t~post3; {1057#false} is VALID [2022-04-27 12:32:26,086 INFO L272 TraceCheckUtils]: 14: Hoare triple {1057#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1057#false} is VALID [2022-04-27 12:32:26,086 INFO L290 TraceCheckUtils]: 15: Hoare triple {1057#false} ~cond := #in~cond; {1057#false} is VALID [2022-04-27 12:32:26,086 INFO L290 TraceCheckUtils]: 16: Hoare triple {1057#false} assume 0 == ~cond; {1057#false} is VALID [2022-04-27 12:32:26,086 INFO L290 TraceCheckUtils]: 17: Hoare triple {1057#false} assume !false; {1057#false} is VALID [2022-04-27 12:32:26,086 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:32:26,086 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:32:26,226 INFO L290 TraceCheckUtils]: 17: Hoare triple {1057#false} assume !false; {1057#false} is VALID [2022-04-27 12:32:26,227 INFO L290 TraceCheckUtils]: 16: Hoare triple {1057#false} assume 0 == ~cond; {1057#false} is VALID [2022-04-27 12:32:26,227 INFO L290 TraceCheckUtils]: 15: Hoare triple {1057#false} ~cond := #in~cond; {1057#false} is VALID [2022-04-27 12:32:26,228 INFO L272 TraceCheckUtils]: 14: Hoare triple {1057#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1057#false} is VALID [2022-04-27 12:32:26,228 INFO L290 TraceCheckUtils]: 13: Hoare triple {1128#(< |main_#t~post3| 5)} assume !(#t~post3 < 5);havoc #t~post3; {1057#false} is VALID [2022-04-27 12:32:26,229 INFO L290 TraceCheckUtils]: 12: Hoare triple {1132#(< ~counter~0 5)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1128#(< |main_#t~post3| 5)} is VALID [2022-04-27 12:32:26,230 INFO L290 TraceCheckUtils]: 11: Hoare triple {1132#(< ~counter~0 5)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1132#(< ~counter~0 5)} is VALID [2022-04-27 12:32:26,231 INFO L290 TraceCheckUtils]: 10: Hoare triple {1132#(< ~counter~0 5)} assume !!(#t~post2 < 5);havoc #t~post2; {1132#(< ~counter~0 5)} is VALID [2022-04-27 12:32:26,241 INFO L290 TraceCheckUtils]: 9: Hoare triple {1142#(< ~counter~0 4)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {1132#(< ~counter~0 5)} is VALID [2022-04-27 12:32:26,242 INFO L290 TraceCheckUtils]: 8: Hoare triple {1142#(< ~counter~0 4)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1142#(< ~counter~0 4)} is VALID [2022-04-27 12:32:26,246 INFO L290 TraceCheckUtils]: 7: Hoare triple {1142#(< ~counter~0 4)} assume !!(#t~post2 < 5);havoc #t~post2; {1142#(< ~counter~0 4)} is VALID [2022-04-27 12:32:26,247 INFO L290 TraceCheckUtils]: 6: Hoare triple {1090#(<= ~counter~0 2)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {1142#(< ~counter~0 4)} is VALID [2022-04-27 12:32:26,247 INFO L290 TraceCheckUtils]: 5: Hoare triple {1090#(<= ~counter~0 2)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1090#(<= ~counter~0 2)} is VALID [2022-04-27 12:32:26,247 INFO L272 TraceCheckUtils]: 4: Hoare triple {1090#(<= ~counter~0 2)} call #t~ret4 := main(); {1090#(<= ~counter~0 2)} is VALID [2022-04-27 12:32:26,248 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1090#(<= ~counter~0 2)} {1056#true} #82#return; {1090#(<= ~counter~0 2)} is VALID [2022-04-27 12:32:26,248 INFO L290 TraceCheckUtils]: 2: Hoare triple {1090#(<= ~counter~0 2)} assume true; {1090#(<= ~counter~0 2)} is VALID [2022-04-27 12:32:26,248 INFO L290 TraceCheckUtils]: 1: Hoare triple {1056#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);~counter~0 := 0; {1090#(<= ~counter~0 2)} is VALID [2022-04-27 12:32:26,248 INFO L272 TraceCheckUtils]: 0: Hoare triple {1056#true} call ULTIMATE.init(); {1056#true} is VALID [2022-04-27 12:32:26,249 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:32:26,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:32:26,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749715810] [2022-04-27 12:32:26,249 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:32:26,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [864871802] [2022-04-27 12:32:26,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [864871802] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:32:26,249 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:32:26,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-04-27 12:32:26,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421851183] [2022-04-27 12:32:26,249 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:32:26,250 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-27 12:32:26,250 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:32:26,250 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:32:26,268 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:32:26,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 12:32:26,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:32:26,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 12:32:26,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-27 12:32:26,270 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:32:26,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:32:26,467 INFO L93 Difference]: Finished difference Result 76 states and 92 transitions. [2022-04-27 12:32:26,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 12:32:26,467 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-27 12:32:26,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:32:26,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:32:26,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 92 transitions. [2022-04-27 12:32:26,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:32:26,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 92 transitions. [2022-04-27 12:32:26,472 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 92 transitions. [2022-04-27 12:32:26,524 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:32:26,525 INFO L225 Difference]: With dead ends: 76 [2022-04-27 12:32:26,525 INFO L226 Difference]: Without dead ends: 69 [2022-04-27 12:32:26,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-04-27 12:32:26,526 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 50 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:32:26,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 151 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:32:26,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-27 12:32:26,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 64. [2022-04-27 12:32:26,540 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:32:26,540 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 64 states, 49 states have (on average 1.346938775510204) internal successors, (66), 52 states have internal predecessors, (66), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 12:32:26,541 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 64 states, 49 states have (on average 1.346938775510204) internal successors, (66), 52 states have internal predecessors, (66), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 12:32:26,541 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 64 states, 49 states have (on average 1.346938775510204) internal successors, (66), 52 states have internal predecessors, (66), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 12:32:26,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:32:26,543 INFO L93 Difference]: Finished difference Result 69 states and 83 transitions. [2022-04-27 12:32:26,543 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 83 transitions. [2022-04-27 12:32:26,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:32:26,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:32:26,543 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 49 states have (on average 1.346938775510204) internal successors, (66), 52 states have internal predecessors, (66), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 69 states. [2022-04-27 12:32:26,543 INFO L87 Difference]: Start difference. First operand has 64 states, 49 states have (on average 1.346938775510204) internal successors, (66), 52 states have internal predecessors, (66), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 69 states. [2022-04-27 12:32:26,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:32:26,545 INFO L93 Difference]: Finished difference Result 69 states and 83 transitions. [2022-04-27 12:32:26,545 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 83 transitions. [2022-04-27 12:32:26,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:32:26,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:32:26,546 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:32:26,546 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:32:26,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 49 states have (on average 1.346938775510204) internal successors, (66), 52 states have internal predecessors, (66), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 12:32:26,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 80 transitions. [2022-04-27 12:32:26,548 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 80 transitions. Word has length 18 [2022-04-27 12:32:26,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:32:26,548 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 80 transitions. [2022-04-27 12:32:26,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:32:26,548 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 80 transitions. [2022-04-27 12:32:26,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 12:32:26,548 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:32:26,548 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:32:26,569 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:32:26,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:32:26,763 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:32:26,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:32:26,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1617669815, now seen corresponding path program 1 times [2022-04-27 12:32:26,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:32:26,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581263463] [2022-04-27 12:32:26,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:32:26,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:32:26,774 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:32:26,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1480173513] [2022-04-27 12:32:26,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:32:26,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:32:26,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:32:26,775 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:32:26,776 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:32:26,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:32:26,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-27 12:32:26,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:32:26,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:32:27,081 INFO L272 TraceCheckUtils]: 0: Hoare triple {1499#true} call ULTIMATE.init(); {1499#true} is VALID [2022-04-27 12:32:27,081 INFO L290 TraceCheckUtils]: 1: Hoare triple {1499#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);~counter~0 := 0; {1499#true} is VALID [2022-04-27 12:32:27,081 INFO L290 TraceCheckUtils]: 2: Hoare triple {1499#true} assume true; {1499#true} is VALID [2022-04-27 12:32:27,081 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1499#true} {1499#true} #82#return; {1499#true} is VALID [2022-04-27 12:32:27,081 INFO L272 TraceCheckUtils]: 4: Hoare triple {1499#true} call #t~ret4 := main(); {1499#true} is VALID [2022-04-27 12:32:27,082 INFO L290 TraceCheckUtils]: 5: Hoare triple {1499#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 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1519#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:32:27,083 INFO L290 TraceCheckUtils]: 6: Hoare triple {1519#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {1519#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:32:27,083 INFO L290 TraceCheckUtils]: 7: Hoare triple {1519#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post2 < 5);havoc #t~post2; {1519#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:32:27,084 INFO L290 TraceCheckUtils]: 8: Hoare triple {1519#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1529#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 12:32:27,084 INFO L290 TraceCheckUtils]: 9: Hoare triple {1529#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {1529#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 12:32:27,085 INFO L290 TraceCheckUtils]: 10: Hoare triple {1529#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} assume !!(#t~post2 < 5);havoc #t~post2; {1529#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 12:32:27,085 INFO L290 TraceCheckUtils]: 11: Hoare triple {1529#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1529#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 12:32:27,086 INFO L290 TraceCheckUtils]: 12: Hoare triple {1529#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1529#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 12:32:27,086 INFO L290 TraceCheckUtils]: 13: Hoare triple {1529#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} assume !!(#t~post3 < 5);havoc #t~post3; {1529#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 12:32:27,087 INFO L272 TraceCheckUtils]: 14: Hoare triple {1529#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1548#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:32:27,087 INFO L290 TraceCheckUtils]: 15: Hoare triple {1548#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1552#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:32:27,087 INFO L290 TraceCheckUtils]: 16: Hoare triple {1552#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1500#false} is VALID [2022-04-27 12:32:27,088 INFO L290 TraceCheckUtils]: 17: Hoare triple {1500#false} assume !false; {1500#false} is VALID [2022-04-27 12:32:27,088 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:32:27,088 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:32:27,468 INFO L290 TraceCheckUtils]: 17: Hoare triple {1500#false} assume !false; {1500#false} is VALID [2022-04-27 12:32:27,468 INFO L290 TraceCheckUtils]: 16: Hoare triple {1552#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1500#false} is VALID [2022-04-27 12:32:27,468 INFO L290 TraceCheckUtils]: 15: Hoare triple {1548#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1552#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:32:27,470 INFO L272 TraceCheckUtils]: 14: Hoare triple {1568#(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)); {1548#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:32:27,471 INFO L290 TraceCheckUtils]: 13: Hoare triple {1568#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} assume !!(#t~post3 < 5);havoc #t~post3; {1568#(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:32:27,471 INFO L290 TraceCheckUtils]: 12: Hoare triple {1568#(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; {1568#(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:32:27,471 INFO L290 TraceCheckUtils]: 11: Hoare triple {1568#(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); {1568#(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:32:27,472 INFO L290 TraceCheckUtils]: 10: Hoare triple {1568#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} assume !!(#t~post2 < 5);havoc #t~post2; {1568#(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:32:27,472 INFO L290 TraceCheckUtils]: 9: Hoare triple {1568#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {1568#(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:32:27,473 INFO L290 TraceCheckUtils]: 8: Hoare triple {1587#(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; {1568#(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:32:27,473 INFO L290 TraceCheckUtils]: 7: Hoare triple {1587#(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~post2 < 5);havoc #t~post2; {1587#(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:32:27,473 INFO L290 TraceCheckUtils]: 6: Hoare triple {1587#(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~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {1587#(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:32:27,474 INFO L290 TraceCheckUtils]: 5: Hoare triple {1499#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 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1587#(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:32:27,474 INFO L272 TraceCheckUtils]: 4: Hoare triple {1499#true} call #t~ret4 := main(); {1499#true} is VALID [2022-04-27 12:32:27,475 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1499#true} {1499#true} #82#return; {1499#true} is VALID [2022-04-27 12:32:27,475 INFO L290 TraceCheckUtils]: 2: Hoare triple {1499#true} assume true; {1499#true} is VALID [2022-04-27 12:32:27,475 INFO L290 TraceCheckUtils]: 1: Hoare triple {1499#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);~counter~0 := 0; {1499#true} is VALID [2022-04-27 12:32:27,475 INFO L272 TraceCheckUtils]: 0: Hoare triple {1499#true} call ULTIMATE.init(); {1499#true} is VALID [2022-04-27 12:32:27,475 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:32:27,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:32:27,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581263463] [2022-04-27 12:32:27,475 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:32:27,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480173513] [2022-04-27 12:32:27,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1480173513] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 12:32:27,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:32:27,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2022-04-27 12:32:27,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514414138] [2022-04-27 12:32:27,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:32:27,476 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-27 12:32:27,476 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:32:27,476 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:32:28,067 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:32:28,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 12:32:28,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:32:28,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 12:32:28,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-04-27 12:32:28,068 INFO L87 Difference]: Start difference. First operand 64 states and 80 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:32:28,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:32:28,185 INFO L93 Difference]: Finished difference Result 90 states and 109 transitions. [2022-04-27 12:32:28,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 12:32:28,185 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-27 12:32:28,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:32:28,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:32:28,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-04-27 12:32:28,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:32:28,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-04-27 12:32:28,187 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 41 transitions. [2022-04-27 12:32:30,262 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 40 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 12:32:30,263 INFO L225 Difference]: With dead ends: 90 [2022-04-27 12:32:30,263 INFO L226 Difference]: Without dead ends: 88 [2022-04-27 12:32:30,264 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-04-27 12:32:30,264 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 9 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 114 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:32:30,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 114 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 26 Unchecked, 0.0s Time] [2022-04-27 12:32:30,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-04-27 12:32:30,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2022-04-27 12:32:30,295 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:32:30,295 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand has 87 states, 66 states have (on average 1.2727272727272727) internal successors, (84), 72 states have internal predecessors, (84), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (8), 5 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 12:32:30,296 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand has 87 states, 66 states have (on average 1.2727272727272727) internal successors, (84), 72 states have internal predecessors, (84), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (8), 5 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 12:32:30,297 INFO L87 Difference]: Start difference. First operand 88 states. Second operand has 87 states, 66 states have (on average 1.2727272727272727) internal successors, (84), 72 states have internal predecessors, (84), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (8), 5 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 12:32:30,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:32:30,300 INFO L93 Difference]: Finished difference Result 88 states and 105 transitions. [2022-04-27 12:32:30,300 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 105 transitions. [2022-04-27 12:32:30,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:32:30,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:32:30,301 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 66 states have (on average 1.2727272727272727) internal successors, (84), 72 states have internal predecessors, (84), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (8), 5 states have call predecessors, (8), 8 states have call successors, (8) Second operand 88 states. [2022-04-27 12:32:30,301 INFO L87 Difference]: Start difference. First operand has 87 states, 66 states have (on average 1.2727272727272727) internal successors, (84), 72 states have internal predecessors, (84), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (8), 5 states have call predecessors, (8), 8 states have call successors, (8) Second operand 88 states. [2022-04-27 12:32:30,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:32:30,304 INFO L93 Difference]: Finished difference Result 88 states and 105 transitions. [2022-04-27 12:32:30,304 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 105 transitions. [2022-04-27 12:32:30,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:32:30,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:32:30,304 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:32:30,304 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:32:30,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 66 states have (on average 1.2727272727272727) internal successors, (84), 72 states have internal predecessors, (84), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (8), 5 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 12:32:30,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 104 transitions. [2022-04-27 12:32:30,307 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 104 transitions. Word has length 18 [2022-04-27 12:32:30,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:32:30,308 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 104 transitions. [2022-04-27 12:32:30,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:32:30,308 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 104 transitions. [2022-04-27 12:32:30,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 12:32:30,308 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:32:30,308 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:32:30,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-27 12:32:30,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:32:30,524 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:32:30,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:32:30,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1627795671, now seen corresponding path program 1 times [2022-04-27 12:32:30,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:32:30,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050296259] [2022-04-27 12:32:30,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:32:30,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:32:30,541 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:32:30,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [152674623] [2022-04-27 12:32:30,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:32:30,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:32:30,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:32:30,547 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:32:30,548 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:32:30,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:32:30,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 12:32:30,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:32:30,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:32:30,653 INFO L272 TraceCheckUtils]: 0: Hoare triple {2022#true} call ULTIMATE.init(); {2022#true} is VALID [2022-04-27 12:32:30,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {2022#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);~counter~0 := 0; {2022#true} is VALID [2022-04-27 12:32:30,653 INFO L290 TraceCheckUtils]: 2: Hoare triple {2022#true} assume true; {2022#true} is VALID [2022-04-27 12:32:30,653 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2022#true} {2022#true} #82#return; {2022#true} is VALID [2022-04-27 12:32:30,654 INFO L272 TraceCheckUtils]: 4: Hoare triple {2022#true} call #t~ret4 := main(); {2022#true} is VALID [2022-04-27 12:32:30,654 INFO L290 TraceCheckUtils]: 5: Hoare triple {2022#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 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {2042#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-27 12:32:30,654 INFO L290 TraceCheckUtils]: 6: Hoare triple {2042#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {2042#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-27 12:32:30,655 INFO L290 TraceCheckUtils]: 7: Hoare triple {2042#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !!(#t~post2 < 5);havoc #t~post2; {2042#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-27 12:32:30,655 INFO L290 TraceCheckUtils]: 8: Hoare triple {2042#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {2042#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-27 12:32:30,655 INFO L290 TraceCheckUtils]: 9: Hoare triple {2042#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2042#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-27 12:32:30,656 INFO L290 TraceCheckUtils]: 10: Hoare triple {2042#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !!(#t~post3 < 5);havoc #t~post3; {2042#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-27 12:32:30,656 INFO L272 TraceCheckUtils]: 11: Hoare triple {2042#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2022#true} is VALID [2022-04-27 12:32:30,656 INFO L290 TraceCheckUtils]: 12: Hoare triple {2022#true} ~cond := #in~cond; {2022#true} is VALID [2022-04-27 12:32:30,656 INFO L290 TraceCheckUtils]: 13: Hoare triple {2022#true} assume !(0 == ~cond); {2022#true} is VALID [2022-04-27 12:32:30,656 INFO L290 TraceCheckUtils]: 14: Hoare triple {2022#true} assume true; {2022#true} is VALID [2022-04-27 12:32:30,657 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2022#true} {2042#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} #78#return; {2042#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-27 12:32:30,658 INFO L290 TraceCheckUtils]: 16: Hoare triple {2042#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {2023#false} is VALID [2022-04-27 12:32:30,658 INFO L290 TraceCheckUtils]: 17: Hoare triple {2023#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {2023#false} is VALID [2022-04-27 12:32:30,658 INFO L290 TraceCheckUtils]: 18: Hoare triple {2023#false} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2023#false} is VALID [2022-04-27 12:32:30,658 INFO L290 TraceCheckUtils]: 19: Hoare triple {2023#false} assume !!(#t~post3 < 5);havoc #t~post3; {2023#false} is VALID [2022-04-27 12:32:30,658 INFO L272 TraceCheckUtils]: 20: Hoare triple {2023#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2023#false} is VALID [2022-04-27 12:32:30,658 INFO L290 TraceCheckUtils]: 21: Hoare triple {2023#false} ~cond := #in~cond; {2023#false} is VALID [2022-04-27 12:32:30,658 INFO L290 TraceCheckUtils]: 22: Hoare triple {2023#false} assume 0 == ~cond; {2023#false} is VALID [2022-04-27 12:32:30,659 INFO L290 TraceCheckUtils]: 23: Hoare triple {2023#false} assume !false; {2023#false} is VALID [2022-04-27 12:32:30,659 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:32:30,659 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:32:30,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:32:30,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050296259] [2022-04-27 12:32:30,659 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:32:30,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152674623] [2022-04-27 12:32:30,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [152674623] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:32:30,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:32:30,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 12:32:30,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963478280] [2022-04-27 12:32:30,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:32:30,660 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-04-27 12:32:30,660 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:32:30,660 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:32:30,675 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:32:30,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 12:32:30,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:32:30,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 12:32:30,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:32:30,686 INFO L87 Difference]: Start difference. First operand 87 states and 104 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:32:30,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:32:30,747 INFO L93 Difference]: Finished difference Result 118 states and 143 transitions. [2022-04-27 12:32:30,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 12:32:30,747 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-04-27 12:32:30,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:32:30,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:32:30,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-04-27 12:32:30,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:32:30,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-04-27 12:32:30,751 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 50 transitions. [2022-04-27 12:32:30,783 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:32:30,784 INFO L225 Difference]: With dead ends: 118 [2022-04-27 12:32:30,784 INFO L226 Difference]: Without dead ends: 73 [2022-04-27 12:32:30,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:32:30,785 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:32:30,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:32:30,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-27 12:32:30,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-04-27 12:32:30,803 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:32:30,803 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 73 states, 56 states have (on average 1.2678571428571428) internal successors, (71), 60 states have internal predecessors, (71), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 12:32:30,805 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 73 states, 56 states have (on average 1.2678571428571428) internal successors, (71), 60 states have internal predecessors, (71), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 12:32:30,805 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 73 states, 56 states have (on average 1.2678571428571428) internal successors, (71), 60 states have internal predecessors, (71), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 12:32:30,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:32:30,809 INFO L93 Difference]: Finished difference Result 73 states and 87 transitions. [2022-04-27 12:32:30,809 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 87 transitions. [2022-04-27 12:32:30,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:32:30,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:32:30,809 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 56 states have (on average 1.2678571428571428) internal successors, (71), 60 states have internal predecessors, (71), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) Second operand 73 states. [2022-04-27 12:32:30,810 INFO L87 Difference]: Start difference. First operand has 73 states, 56 states have (on average 1.2678571428571428) internal successors, (71), 60 states have internal predecessors, (71), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) Second operand 73 states. [2022-04-27 12:32:30,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:32:30,812 INFO L93 Difference]: Finished difference Result 73 states and 87 transitions. [2022-04-27 12:32:30,812 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 87 transitions. [2022-04-27 12:32:30,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:32:30,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:32:30,813 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:32:30,813 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:32:30,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 56 states have (on average 1.2678571428571428) internal successors, (71), 60 states have internal predecessors, (71), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 12:32:30,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 87 transitions. [2022-04-27 12:32:30,820 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 87 transitions. Word has length 24 [2022-04-27 12:32:30,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:32:30,820 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 87 transitions. [2022-04-27 12:32:30,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:32:30,821 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 87 transitions. [2022-04-27 12:32:30,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 12:32:30,821 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:32:30,822 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] [2022-04-27 12:32:30,839 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:32:31,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:32:31,022 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:32:31,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:32:31,023 INFO L85 PathProgramCache]: Analyzing trace with hash 145864044, now seen corresponding path program 1 times [2022-04-27 12:32:31,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:32:31,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460591822] [2022-04-27 12:32:31,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:32:31,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:32:31,053 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:32:31,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [174759126] [2022-04-27 12:32:31,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:32:31,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:32:31,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:32:31,058 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:32:31,059 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:32:31,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:32:31,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 12:32:31,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:32:31,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:32:31,290 INFO L272 TraceCheckUtils]: 0: Hoare triple {2490#true} call ULTIMATE.init(); {2490#true} is VALID [2022-04-27 12:32:31,291 INFO L290 TraceCheckUtils]: 1: Hoare triple {2490#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);~counter~0 := 0; {2490#true} is VALID [2022-04-27 12:32:31,291 INFO L290 TraceCheckUtils]: 2: Hoare triple {2490#true} assume true; {2490#true} is VALID [2022-04-27 12:32:31,291 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2490#true} {2490#true} #82#return; {2490#true} is VALID [2022-04-27 12:32:31,291 INFO L272 TraceCheckUtils]: 4: Hoare triple {2490#true} call #t~ret4 := main(); {2490#true} is VALID [2022-04-27 12:32:31,291 INFO L290 TraceCheckUtils]: 5: Hoare triple {2490#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 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {2490#true} is VALID [2022-04-27 12:32:31,291 INFO L290 TraceCheckUtils]: 6: Hoare triple {2490#true} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {2490#true} is VALID [2022-04-27 12:32:31,291 INFO L290 TraceCheckUtils]: 7: Hoare triple {2490#true} assume !!(#t~post2 < 5);havoc #t~post2; {2490#true} is VALID [2022-04-27 12:32:31,291 INFO L290 TraceCheckUtils]: 8: Hoare triple {2490#true} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {2490#true} is VALID [2022-04-27 12:32:31,291 INFO L290 TraceCheckUtils]: 9: Hoare triple {2490#true} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {2490#true} is VALID [2022-04-27 12:32:31,292 INFO L290 TraceCheckUtils]: 10: Hoare triple {2490#true} assume !!(#t~post2 < 5);havoc #t~post2; {2490#true} is VALID [2022-04-27 12:32:31,292 INFO L290 TraceCheckUtils]: 11: Hoare triple {2490#true} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {2490#true} is VALID [2022-04-27 12:32:31,292 INFO L290 TraceCheckUtils]: 12: Hoare triple {2490#true} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2490#true} is VALID [2022-04-27 12:32:31,292 INFO L290 TraceCheckUtils]: 13: Hoare triple {2490#true} assume !!(#t~post3 < 5);havoc #t~post3; {2490#true} is VALID [2022-04-27 12:32:31,292 INFO L272 TraceCheckUtils]: 14: Hoare triple {2490#true} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2490#true} is VALID [2022-04-27 12:32:31,293 INFO L290 TraceCheckUtils]: 15: Hoare triple {2490#true} ~cond := #in~cond; {2540#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:32:31,294 INFO L290 TraceCheckUtils]: 16: Hoare triple {2540#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2544#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:32:31,294 INFO L290 TraceCheckUtils]: 17: Hoare triple {2544#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2544#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:32:31,295 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2544#(not (= |__VERIFIER_assert_#in~cond| 0))} {2490#true} #78#return; {2551#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 12:32:31,295 INFO L290 TraceCheckUtils]: 19: Hoare triple {2551#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} assume !(~b~0 % 4294967296 != ~B~0 % 4294967296); {2551#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 12:32:31,296 INFO L272 TraceCheckUtils]: 20: Hoare triple {2551#(= (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)); {2558#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2022-04-27 12:32:31,296 INFO L290 TraceCheckUtils]: 21: Hoare triple {2558#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {2562#(= __VERIFIER_assert_~cond 1)} is VALID [2022-04-27 12:32:31,296 INFO L290 TraceCheckUtils]: 22: Hoare triple {2562#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {2491#false} is VALID [2022-04-27 12:32:31,297 INFO L290 TraceCheckUtils]: 23: Hoare triple {2491#false} assume !false; {2491#false} is VALID [2022-04-27 12:32:31,297 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 12:32:31,297 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:32:32,019 INFO L290 TraceCheckUtils]: 23: Hoare triple {2491#false} assume !false; {2491#false} is VALID [2022-04-27 12:32:32,020 INFO L290 TraceCheckUtils]: 22: Hoare triple {2572#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2491#false} is VALID [2022-04-27 12:32:32,020 INFO L290 TraceCheckUtils]: 21: Hoare triple {2544#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2572#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 12:32:32,021 INFO L272 TraceCheckUtils]: 20: Hoare triple {2551#(= (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)); {2544#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:32:32,021 INFO L290 TraceCheckUtils]: 19: Hoare triple {2551#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} assume !(~b~0 % 4294967296 != ~B~0 % 4294967296); {2551#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 12:32:32,022 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2544#(not (= |__VERIFIER_assert_#in~cond| 0))} {2490#true} #78#return; {2551#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 12:32:32,022 INFO L290 TraceCheckUtils]: 17: Hoare triple {2544#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2544#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:32:32,022 INFO L290 TraceCheckUtils]: 16: Hoare triple {2594#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2544#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:32:32,022 INFO L290 TraceCheckUtils]: 15: Hoare triple {2490#true} ~cond := #in~cond; {2594#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 12:32:32,023 INFO L272 TraceCheckUtils]: 14: Hoare triple {2490#true} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2490#true} is VALID [2022-04-27 12:32:32,023 INFO L290 TraceCheckUtils]: 13: Hoare triple {2490#true} assume !!(#t~post3 < 5);havoc #t~post3; {2490#true} is VALID [2022-04-27 12:32:32,023 INFO L290 TraceCheckUtils]: 12: Hoare triple {2490#true} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2490#true} is VALID [2022-04-27 12:32:32,023 INFO L290 TraceCheckUtils]: 11: Hoare triple {2490#true} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {2490#true} is VALID [2022-04-27 12:32:32,023 INFO L290 TraceCheckUtils]: 10: Hoare triple {2490#true} assume !!(#t~post2 < 5);havoc #t~post2; {2490#true} is VALID [2022-04-27 12:32:32,023 INFO L290 TraceCheckUtils]: 9: Hoare triple {2490#true} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {2490#true} is VALID [2022-04-27 12:32:32,023 INFO L290 TraceCheckUtils]: 8: Hoare triple {2490#true} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {2490#true} is VALID [2022-04-27 12:32:32,023 INFO L290 TraceCheckUtils]: 7: Hoare triple {2490#true} assume !!(#t~post2 < 5);havoc #t~post2; {2490#true} is VALID [2022-04-27 12:32:32,023 INFO L290 TraceCheckUtils]: 6: Hoare triple {2490#true} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {2490#true} is VALID [2022-04-27 12:32:32,023 INFO L290 TraceCheckUtils]: 5: Hoare triple {2490#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 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {2490#true} is VALID [2022-04-27 12:32:32,023 INFO L272 TraceCheckUtils]: 4: Hoare triple {2490#true} call #t~ret4 := main(); {2490#true} is VALID [2022-04-27 12:32:32,024 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2490#true} {2490#true} #82#return; {2490#true} is VALID [2022-04-27 12:32:32,024 INFO L290 TraceCheckUtils]: 2: Hoare triple {2490#true} assume true; {2490#true} is VALID [2022-04-27 12:32:32,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {2490#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);~counter~0 := 0; {2490#true} is VALID [2022-04-27 12:32:32,024 INFO L272 TraceCheckUtils]: 0: Hoare triple {2490#true} call ULTIMATE.init(); {2490#true} is VALID [2022-04-27 12:32:32,024 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 12:32:32,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:32:32,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460591822] [2022-04-27 12:32:32,024 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:32:32,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174759126] [2022-04-27 12:32:32,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174759126] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:32:32,025 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:32:32,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2022-04-27 12:32:32,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289031065] [2022-04-27 12:32:32,025 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:32:32,025 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-04-27 12:32:32,025 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:32:32,026 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:32:32,042 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:32:32,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 12:32:32,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:32:32,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 12:32:32,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-27 12:32:32,043 INFO L87 Difference]: Start difference. First operand 73 states and 87 transitions. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:32:35,025 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:32:35,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:32:35,272 INFO L93 Difference]: Finished difference Result 84 states and 97 transitions. [2022-04-27 12:32:35,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 12:32:35,273 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-04-27 12:32:35,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:32:35,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:32:35,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 35 transitions. [2022-04-27 12:32:35,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:32:35,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 35 transitions. [2022-04-27 12:32:35,275 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 35 transitions. [2022-04-27 12:32:35,303 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:32:35,304 INFO L225 Difference]: With dead ends: 84 [2022-04-27 12:32:35,304 INFO L226 Difference]: Without dead ends: 69 [2022-04-27 12:32:35,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-04-27 12:32:35,305 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 16 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-27 12:32:35,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 89 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-27 12:32:35,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-27 12:32:35,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-04-27 12:32:35,324 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:32:35,326 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 69 states, 54 states have (on average 1.2222222222222223) internal successors, (66), 57 states have internal predecessors, (66), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 12:32:35,326 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 69 states, 54 states have (on average 1.2222222222222223) internal successors, (66), 57 states have internal predecessors, (66), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 12:32:35,326 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 69 states, 54 states have (on average 1.2222222222222223) internal successors, (66), 57 states have internal predecessors, (66), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 12:32:35,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:32:35,333 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2022-04-27 12:32:35,333 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2022-04-27 12:32:35,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:32:35,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:32:35,333 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 54 states have (on average 1.2222222222222223) internal successors, (66), 57 states have internal predecessors, (66), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) Second operand 69 states. [2022-04-27 12:32:35,334 INFO L87 Difference]: Start difference. First operand has 69 states, 54 states have (on average 1.2222222222222223) internal successors, (66), 57 states have internal predecessors, (66), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) Second operand 69 states. [2022-04-27 12:32:35,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:32:35,336 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2022-04-27 12:32:35,336 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2022-04-27 12:32:35,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:32:35,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:32:35,336 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:32:35,336 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:32:35,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 54 states have (on average 1.2222222222222223) internal successors, (66), 57 states have internal predecessors, (66), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 12:32:35,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2022-04-27 12:32:35,338 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 80 transitions. Word has length 24 [2022-04-27 12:32:35,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:32:35,338 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 80 transitions. [2022-04-27 12:32:35,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:32:35,338 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2022-04-27 12:32:35,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 12:32:35,338 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:32:35,339 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] [2022-04-27 12:32:35,369 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:32:35,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:32:35,548 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:32:35,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:32:35,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1815750730, now seen corresponding path program 1 times [2022-04-27 12:32:35,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:32:35,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176405505] [2022-04-27 12:32:35,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:32:35,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:32:35,560 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:32:35,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [244556288] [2022-04-27 12:32:35,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:32:35,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:32:35,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:32:35,567 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:32:35,573 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:32:35,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:32:35,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-27 12:32:35,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:32:35,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:32:36,540 INFO L272 TraceCheckUtils]: 0: Hoare triple {2983#true} call ULTIMATE.init(); {2983#true} is VALID [2022-04-27 12:32:36,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {2983#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);~counter~0 := 0; {2983#true} is VALID [2022-04-27 12:32:36,541 INFO L290 TraceCheckUtils]: 2: Hoare triple {2983#true} assume true; {2983#true} is VALID [2022-04-27 12:32:36,541 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2983#true} {2983#true} #82#return; {2983#true} is VALID [2022-04-27 12:32:36,541 INFO L272 TraceCheckUtils]: 4: Hoare triple {2983#true} call #t~ret4 := main(); {2983#true} is VALID [2022-04-27 12:32:36,541 INFO L290 TraceCheckUtils]: 5: Hoare triple {2983#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 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {3003#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:32:36,542 INFO L290 TraceCheckUtils]: 6: Hoare triple {3003#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {3003#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:32:36,542 INFO L290 TraceCheckUtils]: 7: Hoare triple {3003#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post2 < 5);havoc #t~post2; {3003#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:32:36,543 INFO L290 TraceCheckUtils]: 8: Hoare triple {3003#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {3013#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 12:32:36,543 INFO L290 TraceCheckUtils]: 9: Hoare triple {3013#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {3013#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 12:32:36,543 INFO L290 TraceCheckUtils]: 10: Hoare triple {3013#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} assume !!(#t~post2 < 5);havoc #t~post2; {3013#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 12:32:36,544 INFO L290 TraceCheckUtils]: 11: Hoare triple {3013#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {3023#(and (= main_~b~0 2) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 12:32:36,544 INFO L290 TraceCheckUtils]: 12: Hoare triple {3023#(and (= main_~b~0 2) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {3023#(and (= main_~b~0 2) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 12:32:36,545 INFO L290 TraceCheckUtils]: 13: Hoare triple {3023#(and (= main_~b~0 2) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} assume !!(#t~post3 < 5);havoc #t~post3; {3023#(and (= main_~b~0 2) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 12:32:36,545 INFO L272 TraceCheckUtils]: 14: Hoare triple {3023#(and (= main_~b~0 2) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2983#true} is VALID [2022-04-27 12:32:36,545 INFO L290 TraceCheckUtils]: 15: Hoare triple {2983#true} ~cond := #in~cond; {2983#true} is VALID [2022-04-27 12:32:36,545 INFO L290 TraceCheckUtils]: 16: Hoare triple {2983#true} assume !(0 == ~cond); {2983#true} is VALID [2022-04-27 12:32:36,545 INFO L290 TraceCheckUtils]: 17: Hoare triple {2983#true} assume true; {2983#true} is VALID [2022-04-27 12:32:36,546 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2983#true} {3023#(and (= main_~b~0 2) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} #78#return; {3023#(and (= main_~b~0 2) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 12:32:36,547 INFO L290 TraceCheckUtils]: 19: Hoare triple {3023#(and (= main_~b~0 2) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {3048#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (not (<= 2 (mod main_~r~0 4294967296))) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 12:32:36,548 INFO L290 TraceCheckUtils]: 20: Hoare triple {3048#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (not (<= 2 (mod main_~r~0 4294967296))) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {3052#(and (= (+ main_~A~0 (* (- 1) main_~b~0)) main_~r~0) (= main_~b~0 1) (not (<= 2 (mod main_~A~0 4294967296))) (<= 1 (mod main_~A~0 4294967296)) (= main_~q~0 1))} is VALID [2022-04-27 12:32:36,549 INFO L290 TraceCheckUtils]: 21: Hoare triple {3052#(and (= (+ main_~A~0 (* (- 1) main_~b~0)) main_~r~0) (= main_~b~0 1) (not (<= 2 (mod main_~A~0 4294967296))) (<= 1 (mod main_~A~0 4294967296)) (= main_~q~0 1))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {3052#(and (= (+ main_~A~0 (* (- 1) main_~b~0)) main_~r~0) (= main_~b~0 1) (not (<= 2 (mod main_~A~0 4294967296))) (<= 1 (mod main_~A~0 4294967296)) (= main_~q~0 1))} is VALID [2022-04-27 12:32:36,549 INFO L290 TraceCheckUtils]: 22: Hoare triple {3052#(and (= (+ main_~A~0 (* (- 1) main_~b~0)) main_~r~0) (= main_~b~0 1) (not (<= 2 (mod main_~A~0 4294967296))) (<= 1 (mod main_~A~0 4294967296)) (= main_~q~0 1))} assume !!(#t~post3 < 5);havoc #t~post3; {3052#(and (= (+ main_~A~0 (* (- 1) main_~b~0)) main_~r~0) (= main_~b~0 1) (not (<= 2 (mod main_~A~0 4294967296))) (<= 1 (mod main_~A~0 4294967296)) (= main_~q~0 1))} is VALID [2022-04-27 12:32:36,551 INFO L272 TraceCheckUtils]: 23: Hoare triple {3052#(and (= (+ main_~A~0 (* (- 1) main_~b~0)) main_~r~0) (= main_~b~0 1) (not (<= 2 (mod main_~A~0 4294967296))) (<= 1 (mod main_~A~0 4294967296)) (= main_~q~0 1))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {3062#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:32:36,551 INFO L290 TraceCheckUtils]: 24: Hoare triple {3062#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3066#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:32:36,552 INFO L290 TraceCheckUtils]: 25: Hoare triple {3066#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2984#false} is VALID [2022-04-27 12:32:36,552 INFO L290 TraceCheckUtils]: 26: Hoare triple {2984#false} assume !false; {2984#false} is VALID [2022-04-27 12:32:36,552 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:32:36,552 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:32:38,795 WARN L855 $PredicateComparison]: unable to prove that (= (mod c_main_~A~0 4294967296) (mod (+ (* (div (mod c_main_~b~0 4294967296) 2) (* c_main_~q~0 2)) c_main_~r~0) 4294967296)) is different from true [2022-04-27 12:32:49,534 WARN L232 SmtUtils]: Spent 6.45s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 12:33:12,962 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 (mod (* c_main_~b~0 2) 4294967296)) (.cse0 (mod c_main_~r~0 4294967296))) (or (not (<= (mod c_main_~b~0 4294967296) .cse0)) (= (mod c_main_~A~0 4294967296) (mod (+ (* (div .cse1 2) (* c_main_~q~0 2)) c_main_~r~0) 4294967296)) (<= .cse1 .cse0))) is different from true [2022-04-27 12:33:36,272 INFO L290 TraceCheckUtils]: 26: Hoare triple {2984#false} assume !false; {2984#false} is VALID [2022-04-27 12:33:36,272 INFO L290 TraceCheckUtils]: 25: Hoare triple {3066#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2984#false} is VALID [2022-04-27 12:33:36,272 INFO L290 TraceCheckUtils]: 24: Hoare triple {3062#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3066#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:33:36,273 INFO L272 TraceCheckUtils]: 23: Hoare triple {3082#(= (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)); {3062#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:33:36,273 INFO L290 TraceCheckUtils]: 22: Hoare triple {3082#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} assume !!(#t~post3 < 5);havoc #t~post3; {3082#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 12:33:36,274 INFO L290 TraceCheckUtils]: 21: Hoare triple {3082#(= (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; {3082#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 12:33:38,086 INFO L290 TraceCheckUtils]: 20: Hoare triple {3082#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {3082#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 12:33:40,089 WARN L290 TraceCheckUtils]: 19: Hoare triple {3095#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296))} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {3082#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is UNKNOWN [2022-04-27 12:33:40,090 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2983#true} {3095#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296))} #78#return; {3095#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296))} is VALID [2022-04-27 12:33:40,090 INFO L290 TraceCheckUtils]: 17: Hoare triple {2983#true} assume true; {2983#true} is VALID [2022-04-27 12:33:40,090 INFO L290 TraceCheckUtils]: 16: Hoare triple {2983#true} assume !(0 == ~cond); {2983#true} is VALID [2022-04-27 12:33:40,090 INFO L290 TraceCheckUtils]: 15: Hoare triple {2983#true} ~cond := #in~cond; {2983#true} is VALID [2022-04-27 12:33:40,090 INFO L272 TraceCheckUtils]: 14: Hoare triple {3095#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2983#true} is VALID [2022-04-27 12:33:40,090 INFO L290 TraceCheckUtils]: 13: Hoare triple {3095#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296))} assume !!(#t~post3 < 5);havoc #t~post3; {3095#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296))} is VALID [2022-04-27 12:33:40,091 INFO L290 TraceCheckUtils]: 12: Hoare triple {3095#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {3095#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296))} is VALID [2022-04-27 12:33:40,091 INFO L290 TraceCheckUtils]: 11: Hoare triple {3120#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {3095#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296))} is VALID [2022-04-27 12:33:40,092 INFO L290 TraceCheckUtils]: 10: Hoare triple {3120#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} assume !!(#t~post2 < 5);havoc #t~post2; {3120#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-27 12:33:40,092 INFO L290 TraceCheckUtils]: 9: Hoare triple {3120#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {3120#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-27 12:33:42,200 WARN L290 TraceCheckUtils]: 8: Hoare triple {3130#(or (= (mod main_~A~0 4294967296) (mod (+ (* (* main_~q~0 2) (div (mod (* main_~b~0 2) 4294967296) 2)) main_~r~0) 4294967296)) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (<= (mod (* main_~b~0 2) 4294967296) (mod main_~r~0 4294967296)))} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {3120#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} is UNKNOWN [2022-04-27 12:33:42,202 INFO L290 TraceCheckUtils]: 7: Hoare triple {3130#(or (= (mod main_~A~0 4294967296) (mod (+ (* (* main_~q~0 2) (div (mod (* main_~b~0 2) 4294967296) 2)) main_~r~0) 4294967296)) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (<= (mod (* main_~b~0 2) 4294967296) (mod main_~r~0 4294967296)))} assume !!(#t~post2 < 5);havoc #t~post2; {3130#(or (= (mod main_~A~0 4294967296) (mod (+ (* (* main_~q~0 2) (div (mod (* main_~b~0 2) 4294967296) 2)) main_~r~0) 4294967296)) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (<= (mod (* main_~b~0 2) 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-27 12:33:42,203 INFO L290 TraceCheckUtils]: 6: Hoare triple {3130#(or (= (mod main_~A~0 4294967296) (mod (+ (* (* main_~q~0 2) (div (mod (* main_~b~0 2) 4294967296) 2)) main_~r~0) 4294967296)) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (<= (mod (* main_~b~0 2) 4294967296) (mod main_~r~0 4294967296)))} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {3130#(or (= (mod main_~A~0 4294967296) (mod (+ (* (* main_~q~0 2) (div (mod (* main_~b~0 2) 4294967296) 2)) main_~r~0) 4294967296)) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (<= (mod (* main_~b~0 2) 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-27 12:33:42,204 INFO L290 TraceCheckUtils]: 5: Hoare triple {2983#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 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {3130#(or (= (mod main_~A~0 4294967296) (mod (+ (* (* main_~q~0 2) (div (mod (* main_~b~0 2) 4294967296) 2)) main_~r~0) 4294967296)) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (<= (mod (* main_~b~0 2) 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-27 12:33:42,204 INFO L272 TraceCheckUtils]: 4: Hoare triple {2983#true} call #t~ret4 := main(); {2983#true} is VALID [2022-04-27 12:33:42,204 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2983#true} {2983#true} #82#return; {2983#true} is VALID [2022-04-27 12:33:42,204 INFO L290 TraceCheckUtils]: 2: Hoare triple {2983#true} assume true; {2983#true} is VALID [2022-04-27 12:33:42,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {2983#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);~counter~0 := 0; {2983#true} is VALID [2022-04-27 12:33:42,204 INFO L272 TraceCheckUtils]: 0: Hoare triple {2983#true} call ULTIMATE.init(); {2983#true} is VALID [2022-04-27 12:33:42,204 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-04-27 12:33:42,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:33:42,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176405505] [2022-04-27 12:33:42,205 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:33:42,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244556288] [2022-04-27 12:33:42,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [244556288] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:33:42,205 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:33:42,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2022-04-27 12:33:42,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85231858] [2022-04-27 12:33:42,205 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:33:42,205 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 12 states have internal predecessors, (34), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 27 [2022-04-27 12:33:42,206 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:33:42,206 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 12 states have internal predecessors, (34), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 12:33:48,564 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 40 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-27 12:33:48,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-27 12:33:48,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:33:48,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-27 12:33:48,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=81, Unknown=3, NotChecked=38, Total=156 [2022-04-27 12:33:48,565 INFO L87 Difference]: Start difference. First operand 69 states and 80 transitions. Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 12 states have internal predecessors, (34), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 12:34:08,174 WARN L232 SmtUtils]: Spent 8.81s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 12:34:10,268 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:34:12,385 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:34:20,697 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:34:27,196 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse2 (mod c_main_~A~0 4294967296)) (.cse1 (mod c_main_~b~0 4294967296))) (let ((.cse0 (= .cse2 (mod (+ (* (div .cse1 2) (* c_main_~q~0 2)) c_main_~r~0) 4294967296)))) (and (or .cse0 (<= .cse1 (mod c_main_~r~0 4294967296))) (= .cse2 (mod (+ c_main_~r~0 (* c_main_~b~0 c_main_~q~0)) 4294967296)) .cse0))) is different from true [2022-04-27 12:34:31,315 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:34:35,542 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:34:41,999 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:34:53,005 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:34:55,168 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:34:57,436 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:35:05,991 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:35:08,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:35:08,433 INFO L93 Difference]: Finished difference Result 102 states and 119 transitions. [2022-04-27 12:35:08,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 12:35:08,434 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 12 states have internal predecessors, (34), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 27 [2022-04-27 12:35:08,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:35:08,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 12 states have internal predecessors, (34), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 12:35:08,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 78 transitions. [2022-04-27 12:35:08,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 12 states have internal predecessors, (34), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 12:35:08,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 78 transitions. [2022-04-27 12:35:08,438 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 78 transitions. [2022-04-27 12:35:12,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 76 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-27 12:35:12,674 INFO L225 Difference]: With dead ends: 102 [2022-04-27 12:35:12,674 INFO L226 Difference]: Without dead ends: 79 [2022-04-27 12:35:12,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 35.7s TimeCoverageRelationStatistics Valid=57, Invalid=129, Unknown=8, NotChecked=78, Total=272 [2022-04-27 12:35:12,675 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 18 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 12 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 86 IncrementalHoareTripleChecker+Unchecked, 21.3s IncrementalHoareTripleChecker+Time [2022-04-27 12:35:12,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 116 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 88 Invalid, 10 Unknown, 86 Unchecked, 21.3s Time] [2022-04-27 12:35:12,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-27 12:35:12,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 71. [2022-04-27 12:35:12,699 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:35:12,700 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 71 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 58 states have internal predecessors, (67), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 12:35:12,700 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 71 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 58 states have internal predecessors, (67), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 12:35:12,700 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 71 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 58 states have internal predecessors, (67), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 12:35:12,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:35:12,701 INFO L93 Difference]: Finished difference Result 79 states and 89 transitions. [2022-04-27 12:35:12,701 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2022-04-27 12:35:12,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:35:12,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:35:12,702 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 58 states have internal predecessors, (67), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 79 states. [2022-04-27 12:35:12,702 INFO L87 Difference]: Start difference. First operand has 71 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 58 states have internal predecessors, (67), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 79 states. [2022-04-27 12:35:12,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:35:12,703 INFO L93 Difference]: Finished difference Result 79 states and 89 transitions. [2022-04-27 12:35:12,703 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2022-04-27 12:35:12,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:35:12,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:35:12,703 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:35:12,703 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:35:12,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 58 states have internal predecessors, (67), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 12:35:12,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2022-04-27 12:35:12,704 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 27 [2022-04-27 12:35:12,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:35:12,705 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2022-04-27 12:35:12,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 12 states have internal predecessors, (34), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 12:35:12,705 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2022-04-27 12:35:12,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 12:35:12,705 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:35:12,705 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:35:12,725 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:35:12,905 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,SelfDestructingSolverStorable9 [2022-04-27 12:35:12,906 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:35:12,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:35:12,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1552551832, now seen corresponding path program 2 times [2022-04-27 12:35:12,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:35:12,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775394374] [2022-04-27 12:35:12,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:35:12,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:35:12,919 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:35:12,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1106832556] [2022-04-27 12:35:12,919 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 12:35:12,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:35:12,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:35:12,930 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:35:12,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-27 12:35:12,964 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-27 12:35:12,964 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:35:12,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 12:35:12,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:35:12,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:35:13,141 INFO L272 TraceCheckUtils]: 0: Hoare triple {3545#true} call ULTIMATE.init(); {3545#true} is VALID [2022-04-27 12:35:13,142 INFO L290 TraceCheckUtils]: 1: Hoare triple {3545#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);~counter~0 := 0; {3545#true} is VALID [2022-04-27 12:35:13,142 INFO L290 TraceCheckUtils]: 2: Hoare triple {3545#true} assume true; {3545#true} is VALID [2022-04-27 12:35:13,142 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3545#true} {3545#true} #82#return; {3545#true} is VALID [2022-04-27 12:35:13,142 INFO L272 TraceCheckUtils]: 4: Hoare triple {3545#true} call #t~ret4 := main(); {3545#true} is VALID [2022-04-27 12:35:13,142 INFO L290 TraceCheckUtils]: 5: Hoare triple {3545#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 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {3565#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:35:13,143 INFO L290 TraceCheckUtils]: 6: Hoare triple {3565#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {3565#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:35:13,143 INFO L290 TraceCheckUtils]: 7: Hoare triple {3565#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post2 < 5);havoc #t~post2; {3565#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:35:13,144 INFO L290 TraceCheckUtils]: 8: Hoare triple {3565#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {3565#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:35:13,144 INFO L290 TraceCheckUtils]: 9: Hoare triple {3565#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {3565#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:35:13,144 INFO L290 TraceCheckUtils]: 10: Hoare triple {3565#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post2 < 5);havoc #t~post2; {3565#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:35:13,145 INFO L290 TraceCheckUtils]: 11: Hoare triple {3565#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {3565#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:35:13,145 INFO L290 TraceCheckUtils]: 12: Hoare triple {3565#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {3565#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:35:13,145 INFO L290 TraceCheckUtils]: 13: Hoare triple {3565#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post2 < 5);havoc #t~post2; {3565#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:35:13,146 INFO L290 TraceCheckUtils]: 14: Hoare triple {3565#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {3565#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:35:13,146 INFO L290 TraceCheckUtils]: 15: Hoare triple {3565#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {3565#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:35:13,146 INFO L290 TraceCheckUtils]: 16: Hoare triple {3565#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post2 < 5);havoc #t~post2; {3565#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:35:13,147 INFO L290 TraceCheckUtils]: 17: Hoare triple {3565#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {3565#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:35:13,147 INFO L290 TraceCheckUtils]: 18: Hoare triple {3565#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {3565#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:35:13,147 INFO L290 TraceCheckUtils]: 19: Hoare triple {3565#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(#t~post2 < 5);havoc #t~post2; {3565#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:35:13,148 INFO L290 TraceCheckUtils]: 20: Hoare triple {3565#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {3565#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:35:13,148 INFO L290 TraceCheckUtils]: 21: Hoare triple {3565#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(#t~post3 < 5);havoc #t~post3; {3565#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:35:13,149 INFO L272 TraceCheckUtils]: 22: Hoare triple {3565#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {3617#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:35:13,149 INFO L290 TraceCheckUtils]: 23: Hoare triple {3617#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3621#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:35:13,149 INFO L290 TraceCheckUtils]: 24: Hoare triple {3621#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3546#false} is VALID [2022-04-27 12:35:13,149 INFO L290 TraceCheckUtils]: 25: Hoare triple {3546#false} assume !false; {3546#false} is VALID [2022-04-27 12:35:13,150 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-27 12:35:13,150 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:35:13,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:35:13,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775394374] [2022-04-27 12:35:13,150 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:35:13,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106832556] [2022-04-27 12:35:13,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1106832556] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:35:13,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:35:13,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 12:35:13,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533520443] [2022-04-27 12:35:13,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:35:13,151 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-27 12:35:13,151 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:35:13,151 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:35:13,202 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:35:13,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:35:13,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:35:13,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:35:13,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:35:13,203 INFO L87 Difference]: Start difference. First operand 71 states and 81 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:35:13,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:35:13,617 INFO L93 Difference]: Finished difference Result 90 states and 102 transitions. [2022-04-27 12:35:13,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:35:13,617 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-27 12:35:13,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:35:13,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:35:13,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2022-04-27 12:35:13,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:35:13,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2022-04-27 12:35:13,619 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 39 transitions. [2022-04-27 12:35:13,753 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:35:13,754 INFO L225 Difference]: With dead ends: 90 [2022-04-27 12:35:13,754 INFO L226 Difference]: Without dead ends: 87 [2022-04-27 12:35:13,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 12:35:13,755 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 8 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 12:35:13,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 62 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 12:35:13,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-04-27 12:35:13,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 77. [2022-04-27 12:35:13,772 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:35:13,772 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand has 77 states, 60 states have (on average 1.1666666666666667) internal successors, (70), 62 states have internal predecessors, (70), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 12:35:13,773 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand has 77 states, 60 states have (on average 1.1666666666666667) internal successors, (70), 62 states have internal predecessors, (70), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 12:35:13,773 INFO L87 Difference]: Start difference. First operand 87 states. Second operand has 77 states, 60 states have (on average 1.1666666666666667) internal successors, (70), 62 states have internal predecessors, (70), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 12:35:13,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:35:13,774 INFO L93 Difference]: Finished difference Result 87 states and 97 transitions. [2022-04-27 12:35:13,774 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 97 transitions. [2022-04-27 12:35:13,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:35:13,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:35:13,774 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 60 states have (on average 1.1666666666666667) internal successors, (70), 62 states have internal predecessors, (70), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 87 states. [2022-04-27 12:35:13,775 INFO L87 Difference]: Start difference. First operand has 77 states, 60 states have (on average 1.1666666666666667) internal successors, (70), 62 states have internal predecessors, (70), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 87 states. [2022-04-27 12:35:13,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:35:13,776 INFO L93 Difference]: Finished difference Result 87 states and 97 transitions. [2022-04-27 12:35:13,776 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 97 transitions. [2022-04-27 12:35:13,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:35:13,776 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:35:13,776 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:35:13,776 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:35:13,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 60 states have (on average 1.1666666666666667) internal successors, (70), 62 states have internal predecessors, (70), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 12:35:13,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2022-04-27 12:35:13,777 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 26 [2022-04-27 12:35:13,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:35:13,777 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2022-04-27 12:35:13,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:35:13,778 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2022-04-27 12:35:13,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-27 12:35:13,778 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:35:13,778 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:35:13,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-27 12:35:13,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:35:13,995 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:35:13,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:35:13,995 INFO L85 PathProgramCache]: Analyzing trace with hash -2032185902, now seen corresponding path program 1 times [2022-04-27 12:35:13,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:35:13,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813365470] [2022-04-27 12:35:13,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:35:13,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:35:14,008 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:35:14,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1241928078] [2022-04-27 12:35:14,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:35:14,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:35:14,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:35:14,009 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:35:14,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process