/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/dijkstra-u_unwindbound100.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 12:17:24,147 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 12:17:24,148 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 12:17:24,174 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 12:17:24,174 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 12:17:24,176 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 12:17:24,180 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 12:17:24,182 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 12:17:24,183 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 12:17:24,184 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 12:17:24,184 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 12:17:24,185 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 12:17:24,185 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 12:17:24,186 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 12:17:24,187 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 12:17:24,188 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 12:17:24,188 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 12:17:24,189 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 12:17:24,190 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 12:17:24,192 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 12:17:24,193 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 12:17:24,194 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 12:17:24,195 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 12:17:24,195 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 12:17:24,196 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 12:17:24,199 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 12:17:24,199 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 12:17:24,199 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 12:17:24,200 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 12:17:24,200 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 12:17:24,201 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 12:17:24,201 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 12:17:24,201 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 12:17:24,202 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 12:17:24,203 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 12:17:24,204 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 12:17:24,204 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 12:17:24,204 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 12:17:24,204 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 12:17:24,205 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 12:17:24,205 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 12:17:24,209 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 12:17:24,209 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:17:24,226 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 12:17:24,226 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 12:17:24,226 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 12:17:24,227 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 12:17:24,227 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 12:17:24,227 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 12:17:24,227 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 12:17:24,228 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 12:17:24,228 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 12:17:24,228 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 12:17:24,228 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 12:17:24,228 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 12:17:24,228 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 12:17:24,228 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 12:17:24,228 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 12:17:24,228 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 12:17:24,228 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 12:17:24,228 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 12:17:24,229 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 12:17:24,229 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 12:17:24,229 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 12:17:24,229 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 12:17:24,229 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 12:17:24,229 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 12:17:24,229 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 12:17:24,229 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 12:17:24,229 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 12:17:24,229 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 12:17:24,230 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 12:17:24,230 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 12:17:24,230 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 12:17:24,230 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 12:17:24,230 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 12:17:24,230 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:17:24,411 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 12:17:24,426 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 12:17:24,428 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 12:17:24,429 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 12:17:24,432 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 12:17:24,433 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound100.c [2022-04-27 12:17:24,476 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/325a77abd/69f333b8a2eb4690827f21eda67877f2/FLAGcec1fc616 [2022-04-27 12:17:24,813 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 12:17:24,813 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound100.c [2022-04-27 12:17:24,818 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/325a77abd/69f333b8a2eb4690827f21eda67877f2/FLAGcec1fc616 [2022-04-27 12:17:24,829 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/325a77abd/69f333b8a2eb4690827f21eda67877f2 [2022-04-27 12:17:24,831 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 12:17:24,832 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 12:17:24,834 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 12:17:24,834 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 12:17:24,838 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 12:17:24,839 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 12:17:24" (1/1) ... [2022-04-27 12:17:24,840 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7144ce87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:17:24, skipping insertion in model container [2022-04-27 12:17:24,840 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 12:17:24" (1/1) ... [2022-04-27 12:17:24,845 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 12:17:24,855 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 12:17:25,008 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/dijkstra-u_unwindbound100.c[525,538] [2022-04-27 12:17:25,036 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 12:17:25,042 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 12:17:25,053 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/dijkstra-u_unwindbound100.c[525,538] [2022-04-27 12:17:25,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 12:17:25,078 INFO L208 MainTranslator]: Completed translation [2022-04-27 12:17:25,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:17:25 WrapperNode [2022-04-27 12:17:25,079 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 12:17:25,079 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 12:17:25,079 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 12:17:25,079 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 12:17:25,087 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:17:25" (1/1) ... [2022-04-27 12:17:25,087 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:17:25" (1/1) ... [2022-04-27 12:17:25,092 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:17:25" (1/1) ... [2022-04-27 12:17:25,092 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:17:25" (1/1) ... [2022-04-27 12:17:25,097 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:17:25" (1/1) ... [2022-04-27 12:17:25,100 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:17:25" (1/1) ... [2022-04-27 12:17:25,101 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:17:25" (1/1) ... [2022-04-27 12:17:25,108 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 12:17:25,108 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 12:17:25,109 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 12:17:25,109 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 12:17:25,110 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:17:25" (1/1) ... [2022-04-27 12:17:25,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 12:17:25,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:17:25,148 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:17:25,156 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:17:25,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 12:17:25,186 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 12:17:25,186 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 12:17:25,186 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 12:17:25,188 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 12:17:25,188 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 12:17:25,188 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 12:17:25,188 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 12:17:25,189 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 12:17:25,189 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 12:17:25,189 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 12:17:25,189 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 12:17:25,189 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 12:17:25,189 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 12:17:25,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 12:17:25,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 12:17:25,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 12:17:25,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 12:17:25,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 12:17:25,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 12:17:25,251 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 12:17:25,253 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 12:17:25,458 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 12:17:25,464 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 12:17:25,465 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 12:17:25,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 12:17:25 BoogieIcfgContainer [2022-04-27 12:17:25,467 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 12:17:25,478 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 12:17:25,478 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 12:17:25,481 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 12:17:25,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 12:17:24" (1/3) ... [2022-04-27 12:17:25,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4812ac3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 12:17:25, skipping insertion in model container [2022-04-27 12:17:25,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:17:25" (2/3) ... [2022-04-27 12:17:25,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4812ac3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 12:17:25, skipping insertion in model container [2022-04-27 12:17:25,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 12:17:25" (3/3) ... [2022-04-27 12:17:25,484 INFO L111 eAbstractionObserver]: Analyzing ICFG dijkstra-u_unwindbound100.c [2022-04-27 12:17:25,496 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 12:17:25,496 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 12:17:25,533 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 12:17:25,538 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@6ed42c14, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@c0bfec0 [2022-04-27 12:17:25,538 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 12:17:25,551 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 12:17:25,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 12:17:25,556 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:17:25,557 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:17:25,557 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:17:25,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:17:25,561 INFO L85 PathProgramCache]: Analyzing trace with hash -2024343623, now seen corresponding path program 1 times [2022-04-27 12:17:25,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:17:25,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653007625] [2022-04-27 12:17:25,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:17:25,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:17:25,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:17:25,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 12:17:25,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:17:25,727 INFO L290 TraceCheckUtils]: 0: Hoare triple {51#(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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {42#true} is VALID [2022-04-27 12:17:25,727 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-27 12:17:25,727 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42#true} {42#true} #102#return; {42#true} is VALID [2022-04-27 12:17:25,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 12:17:25,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:17:25,742 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-27 12:17:25,742 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-27 12:17:25,743 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-27 12:17:25,743 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {42#true} #82#return; {43#false} is VALID [2022-04-27 12:17:25,744 INFO L272 TraceCheckUtils]: 0: Hoare triple {42#true} call ULTIMATE.init(); {51#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 12:17:25,745 INFO L290 TraceCheckUtils]: 1: Hoare triple {51#(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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {42#true} is VALID [2022-04-27 12:17:25,745 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-27 12:17:25,745 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} #102#return; {42#true} is VALID [2022-04-27 12:17:25,745 INFO L272 TraceCheckUtils]: 4: Hoare triple {42#true} call #t~ret7 := main(); {42#true} is VALID [2022-04-27 12:17:25,745 INFO L290 TraceCheckUtils]: 5: Hoare triple {42#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {42#true} is VALID [2022-04-27 12:17:25,745 INFO L272 TraceCheckUtils]: 6: Hoare triple {42#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {42#true} is VALID [2022-04-27 12:17:25,745 INFO L290 TraceCheckUtils]: 7: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-27 12:17:25,746 INFO L290 TraceCheckUtils]: 8: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-27 12:17:25,746 INFO L290 TraceCheckUtils]: 9: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-27 12:17:25,746 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {43#false} {42#true} #82#return; {43#false} is VALID [2022-04-27 12:17:25,746 INFO L290 TraceCheckUtils]: 11: Hoare triple {43#false} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {43#false} is VALID [2022-04-27 12:17:25,746 INFO L290 TraceCheckUtils]: 12: Hoare triple {43#false} assume !true; {43#false} is VALID [2022-04-27 12:17:25,747 INFO L290 TraceCheckUtils]: 13: Hoare triple {43#false} assume !true; {43#false} is VALID [2022-04-27 12:17:25,748 INFO L272 TraceCheckUtils]: 14: Hoare triple {43#false} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 + 16 * ~n~0 * ~p~0 + 12 * ~h~0 * ~r~0 - 16 * ~p~0 * ~r~0 - ~h~0 - 4 * ~p~0) % 4294967296 then 1 else 0)); {43#false} is VALID [2022-04-27 12:17:25,749 INFO L290 TraceCheckUtils]: 15: Hoare triple {43#false} ~cond := #in~cond; {43#false} is VALID [2022-04-27 12:17:25,749 INFO L290 TraceCheckUtils]: 16: Hoare triple {43#false} assume 0 == ~cond; {43#false} is VALID [2022-04-27 12:17:25,750 INFO L290 TraceCheckUtils]: 17: Hoare triple {43#false} assume !false; {43#false} is VALID [2022-04-27 12:17:25,750 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:17:25,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:17:25,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653007625] [2022-04-27 12:17:25,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653007625] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:17:25,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:17:25,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 12:17:25,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947082843] [2022-04-27 12:17:25,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:17:25,759 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-27 12:17:25,760 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:17:25,763 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:17:25,805 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:17:25,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 12:17:25,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:17:25,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 12:17:25,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:17:25,842 INFO L87 Difference]: Start difference. First operand has 39 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:17:30,154 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:17:32,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:17:32,737 INFO L93 Difference]: Finished difference Result 70 states and 111 transitions. [2022-04-27 12:17:32,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 12:17:32,738 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-27 12:17:32,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:17:32,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:17:32,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-04-27 12:17:32,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:17:32,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-04-27 12:17:32,759 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 111 transitions. [2022-04-27 12:17:32,868 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:17:32,885 INFO L225 Difference]: With dead ends: 70 [2022-04-27 12:17:32,886 INFO L226 Difference]: Without dead ends: 35 [2022-04-27 12:17:32,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:17:32,890 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-27 12:17:32,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 53 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 25 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-27 12:17:32,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-27 12:17:32,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-04-27 12:17:32,933 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:17:32,934 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:17:32,935 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:17:32,935 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:17:32,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:17:32,939 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-04-27 12:17:32,939 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2022-04-27 12:17:32,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:17:32,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:17:32,940 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 35 states. [2022-04-27 12:17:32,941 INFO L87 Difference]: Start difference. First operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 35 states. [2022-04-27 12:17:32,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:17:32,944 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-04-27 12:17:32,944 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2022-04-27 12:17:32,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:17:32,945 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:17:32,945 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:17:32,945 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:17:32,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:17:32,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2022-04-27 12:17:32,961 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 46 transitions. Word has length 18 [2022-04-27 12:17:32,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:17:32,961 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 46 transitions. [2022-04-27 12:17:32,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:17:32,962 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2022-04-27 12:17:32,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 12:17:32,962 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:17:32,963 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:17:32,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 12:17:32,963 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:17:32,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:17:32,964 INFO L85 PathProgramCache]: Analyzing trace with hash -96361696, now seen corresponding path program 1 times [2022-04-27 12:17:32,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:17:32,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794127803] [2022-04-27 12:17:32,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:17:32,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:17:32,982 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:17:32,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [654704185] [2022-04-27 12:17:32,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:17:32,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:17:32,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:17:33,000 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:17:33,001 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:17:33,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:17:33,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 12:17:33,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:17:33,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:17:33,205 INFO L272 TraceCheckUtils]: 0: Hoare triple {274#true} call ULTIMATE.init(); {274#true} is VALID [2022-04-27 12:17:33,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {274#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {282#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:33,206 INFO L290 TraceCheckUtils]: 2: Hoare triple {282#(<= ~counter~0 0)} assume true; {282#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:33,207 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {282#(<= ~counter~0 0)} {274#true} #102#return; {282#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:33,207 INFO L272 TraceCheckUtils]: 4: Hoare triple {282#(<= ~counter~0 0)} call #t~ret7 := main(); {282#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:33,208 INFO L290 TraceCheckUtils]: 5: Hoare triple {282#(<= ~counter~0 0)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {282#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:33,208 INFO L272 TraceCheckUtils]: 6: Hoare triple {282#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {282#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:33,209 INFO L290 TraceCheckUtils]: 7: Hoare triple {282#(<= ~counter~0 0)} ~cond := #in~cond; {282#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:33,209 INFO L290 TraceCheckUtils]: 8: Hoare triple {282#(<= ~counter~0 0)} assume !(0 == ~cond); {282#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:33,210 INFO L290 TraceCheckUtils]: 9: Hoare triple {282#(<= ~counter~0 0)} assume true; {282#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:33,210 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {282#(<= ~counter~0 0)} {282#(<= ~counter~0 0)} #82#return; {282#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:33,211 INFO L290 TraceCheckUtils]: 11: Hoare triple {282#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {282#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:33,211 INFO L290 TraceCheckUtils]: 12: Hoare triple {282#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {316#(<= |main_#t~post5| 0)} is VALID [2022-04-27 12:17:33,212 INFO L290 TraceCheckUtils]: 13: Hoare triple {316#(<= |main_#t~post5| 0)} assume !(#t~post5 < 100);havoc #t~post5; {275#false} is VALID [2022-04-27 12:17:33,212 INFO L290 TraceCheckUtils]: 14: Hoare triple {275#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {275#false} is VALID [2022-04-27 12:17:33,212 INFO L290 TraceCheckUtils]: 15: Hoare triple {275#false} assume !(#t~post6 < 100);havoc #t~post6; {275#false} is VALID [2022-04-27 12:17:33,212 INFO L272 TraceCheckUtils]: 16: Hoare triple {275#false} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 + 16 * ~n~0 * ~p~0 + 12 * ~h~0 * ~r~0 - 16 * ~p~0 * ~r~0 - ~h~0 - 4 * ~p~0) % 4294967296 then 1 else 0)); {275#false} is VALID [2022-04-27 12:17:33,213 INFO L290 TraceCheckUtils]: 17: Hoare triple {275#false} ~cond := #in~cond; {275#false} is VALID [2022-04-27 12:17:33,213 INFO L290 TraceCheckUtils]: 18: Hoare triple {275#false} assume 0 == ~cond; {275#false} is VALID [2022-04-27 12:17:33,213 INFO L290 TraceCheckUtils]: 19: Hoare triple {275#false} assume !false; {275#false} is VALID [2022-04-27 12:17:33,213 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:17:33,213 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:17:33,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:17:33,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794127803] [2022-04-27 12:17:33,214 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:17:33,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654704185] [2022-04-27 12:17:33,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [654704185] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:17:33,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:17:33,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 12:17:33,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489500158] [2022-04-27 12:17:33,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:17:33,216 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-27 12:17:33,216 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:17:33,217 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:17:33,234 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:17:33,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 12:17:33,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:17:33,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 12:17:33,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 12:17:33,236 INFO L87 Difference]: Start difference. First operand 34 states and 46 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:17:38,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:17:38,370 INFO L93 Difference]: Finished difference Result 55 states and 78 transitions. [2022-04-27 12:17:38,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 12:17:38,370 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-27 12:17:38,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:17:38,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:17:38,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-04-27 12:17:38,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:17:38,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-04-27 12:17:38,376 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 78 transitions. [2022-04-27 12:17:38,456 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:17:38,457 INFO L225 Difference]: With dead ends: 55 [2022-04-27 12:17:38,457 INFO L226 Difference]: Without dead ends: 36 [2022-04-27 12:17:38,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 12:17:38,459 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:17:38,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:17:38,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-27 12:17:38,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-27 12:17:38,466 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:17:38,466 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:17:38,467 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:17:38,467 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:17:38,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:17:38,469 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2022-04-27 12:17:38,469 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-27 12:17:38,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:17:38,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:17:38,470 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 36 states. [2022-04-27 12:17:38,471 INFO L87 Difference]: Start difference. First operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 36 states. [2022-04-27 12:17:38,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:17:38,473 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2022-04-27 12:17:38,473 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-27 12:17:38,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:17:38,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:17:38,473 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:17:38,474 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:17:38,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:17:38,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2022-04-27 12:17:38,476 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 20 [2022-04-27 12:17:38,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:17:38,476 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2022-04-27 12:17:38,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:17:38,476 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-27 12:17:38,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 12:17:38,477 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:17:38,477 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:17:38,495 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:17:38,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:17:38,695 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:17:38,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:17:38,696 INFO L85 PathProgramCache]: Analyzing trace with hash 962099791, now seen corresponding path program 1 times [2022-04-27 12:17:38,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:17:38,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551674265] [2022-04-27 12:17:38,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:17:38,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:17:38,712 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:17:38,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1979927286] [2022-04-27 12:17:38,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:17:38,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:17:38,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:17:38,714 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:17:38,715 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:17:38,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:17:38,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 12:17:38,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:17:38,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:17:38,896 INFO L272 TraceCheckUtils]: 0: Hoare triple {546#true} call ULTIMATE.init(); {546#true} is VALID [2022-04-27 12:17:38,897 INFO L290 TraceCheckUtils]: 1: Hoare triple {546#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {554#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:38,897 INFO L290 TraceCheckUtils]: 2: Hoare triple {554#(<= ~counter~0 0)} assume true; {554#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:38,898 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {554#(<= ~counter~0 0)} {546#true} #102#return; {554#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:38,901 INFO L272 TraceCheckUtils]: 4: Hoare triple {554#(<= ~counter~0 0)} call #t~ret7 := main(); {554#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:38,901 INFO L290 TraceCheckUtils]: 5: Hoare triple {554#(<= ~counter~0 0)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {554#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:38,902 INFO L272 TraceCheckUtils]: 6: Hoare triple {554#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {554#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:38,902 INFO L290 TraceCheckUtils]: 7: Hoare triple {554#(<= ~counter~0 0)} ~cond := #in~cond; {554#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:38,903 INFO L290 TraceCheckUtils]: 8: Hoare triple {554#(<= ~counter~0 0)} assume !(0 == ~cond); {554#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:38,903 INFO L290 TraceCheckUtils]: 9: Hoare triple {554#(<= ~counter~0 0)} assume true; {554#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:38,904 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {554#(<= ~counter~0 0)} {554#(<= ~counter~0 0)} #82#return; {554#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:38,904 INFO L290 TraceCheckUtils]: 11: Hoare triple {554#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {554#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:38,905 INFO L290 TraceCheckUtils]: 12: Hoare triple {554#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {588#(<= ~counter~0 1)} is VALID [2022-04-27 12:17:38,905 INFO L290 TraceCheckUtils]: 13: Hoare triple {588#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {588#(<= ~counter~0 1)} is VALID [2022-04-27 12:17:38,906 INFO L290 TraceCheckUtils]: 14: Hoare triple {588#(<= ~counter~0 1)} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {588#(<= ~counter~0 1)} is VALID [2022-04-27 12:17:38,906 INFO L290 TraceCheckUtils]: 15: Hoare triple {588#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {598#(<= |main_#t~post6| 1)} is VALID [2022-04-27 12:17:38,906 INFO L290 TraceCheckUtils]: 16: Hoare triple {598#(<= |main_#t~post6| 1)} assume !(#t~post6 < 100);havoc #t~post6; {547#false} is VALID [2022-04-27 12:17:38,906 INFO L272 TraceCheckUtils]: 17: Hoare triple {547#false} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 + 16 * ~n~0 * ~p~0 + 12 * ~h~0 * ~r~0 - 16 * ~p~0 * ~r~0 - ~h~0 - 4 * ~p~0) % 4294967296 then 1 else 0)); {547#false} is VALID [2022-04-27 12:17:38,907 INFO L290 TraceCheckUtils]: 18: Hoare triple {547#false} ~cond := #in~cond; {547#false} is VALID [2022-04-27 12:17:38,907 INFO L290 TraceCheckUtils]: 19: Hoare triple {547#false} assume 0 == ~cond; {547#false} is VALID [2022-04-27 12:17:38,907 INFO L290 TraceCheckUtils]: 20: Hoare triple {547#false} assume !false; {547#false} is VALID [2022-04-27 12:17:38,907 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:17:38,907 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:17:38,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:17:38,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551674265] [2022-04-27 12:17:38,907 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:17:38,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979927286] [2022-04-27 12:17:38,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979927286] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:17:38,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:17:38,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 12:17:38,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376528188] [2022-04-27 12:17:38,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:17:38,908 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-27 12:17:38,908 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:17:38,909 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:17:38,923 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:17:38,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:17:38,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:17:38,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:17:38,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:17:38,924 INFO L87 Difference]: Start difference. First operand 36 states and 48 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:17:43,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:17:43,833 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2022-04-27 12:17:43,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:17:43,833 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-27 12:17:43,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:17:43,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:17:43,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-27 12:17:43,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:17:43,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-27 12:17:43,837 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-27 12:17:43,899 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:17:43,900 INFO L225 Difference]: With dead ends: 49 [2022-04-27 12:17:43,900 INFO L226 Difference]: Without dead ends: 40 [2022-04-27 12:17:43,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 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:17:43,901 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 7 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:17:43,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 120 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:17:43,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-27 12:17:43,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2022-04-27 12:17:43,914 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:17:43,915 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:17:43,915 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:17:43,915 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:17:43,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:17:43,921 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2022-04-27 12:17:43,921 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2022-04-27 12:17:43,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:17:43,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:17:43,922 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 40 states. [2022-04-27 12:17:43,922 INFO L87 Difference]: Start difference. First operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 40 states. [2022-04-27 12:17:43,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:17:43,924 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2022-04-27 12:17:43,924 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2022-04-27 12:17:43,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:17:43,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:17:43,928 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:17:43,928 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:17:43,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:17:43,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 52 transitions. [2022-04-27 12:17:43,931 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 52 transitions. Word has length 21 [2022-04-27 12:17:43,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:17:43,931 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 52 transitions. [2022-04-27 12:17:43,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:17:43,931 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 52 transitions. [2022-04-27 12:17:43,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 12:17:43,932 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:17:43,932 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:17:43,954 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:17:44,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-27 12:17:44,140 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:17:44,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:17:44,140 INFO L85 PathProgramCache]: Analyzing trace with hash 963589341, now seen corresponding path program 1 times [2022-04-27 12:17:44,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:17:44,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414742576] [2022-04-27 12:17:44,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:17:44,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:17:44,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:17:44,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 12:17:44,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:17:44,444 INFO L290 TraceCheckUtils]: 0: Hoare triple {835#(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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {822#true} is VALID [2022-04-27 12:17:44,445 INFO L290 TraceCheckUtils]: 1: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-27 12:17:44,445 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {822#true} {822#true} #102#return; {822#true} is VALID [2022-04-27 12:17:44,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 12:17:44,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:17:44,450 INFO L290 TraceCheckUtils]: 0: Hoare triple {822#true} ~cond := #in~cond; {822#true} is VALID [2022-04-27 12:17:44,450 INFO L290 TraceCheckUtils]: 1: Hoare triple {822#true} assume !(0 == ~cond); {822#true} is VALID [2022-04-27 12:17:44,450 INFO L290 TraceCheckUtils]: 2: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-27 12:17:44,451 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {822#true} {822#true} #82#return; {822#true} is VALID [2022-04-27 12:17:44,451 INFO L272 TraceCheckUtils]: 0: Hoare triple {822#true} call ULTIMATE.init(); {835#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 12:17:44,452 INFO L290 TraceCheckUtils]: 1: Hoare triple {835#(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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {822#true} is VALID [2022-04-27 12:17:44,452 INFO L290 TraceCheckUtils]: 2: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-27 12:17:44,452 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {822#true} {822#true} #102#return; {822#true} is VALID [2022-04-27 12:17:44,452 INFO L272 TraceCheckUtils]: 4: Hoare triple {822#true} call #t~ret7 := main(); {822#true} is VALID [2022-04-27 12:17:44,452 INFO L290 TraceCheckUtils]: 5: Hoare triple {822#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {822#true} is VALID [2022-04-27 12:17:44,452 INFO L272 TraceCheckUtils]: 6: Hoare triple {822#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {822#true} is VALID [2022-04-27 12:17:44,452 INFO L290 TraceCheckUtils]: 7: Hoare triple {822#true} ~cond := #in~cond; {822#true} is VALID [2022-04-27 12:17:44,452 INFO L290 TraceCheckUtils]: 8: Hoare triple {822#true} assume !(0 == ~cond); {822#true} is VALID [2022-04-27 12:17:44,453 INFO L290 TraceCheckUtils]: 9: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-27 12:17:44,453 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {822#true} {822#true} #82#return; {822#true} is VALID [2022-04-27 12:17:44,453 INFO L290 TraceCheckUtils]: 11: Hoare triple {822#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {831#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-27 12:17:44,454 INFO L290 TraceCheckUtils]: 12: Hoare triple {831#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {831#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-27 12:17:44,454 INFO L290 TraceCheckUtils]: 13: Hoare triple {831#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} assume !!(#t~post5 < 100);havoc #t~post5; {831#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-27 12:17:44,455 INFO L290 TraceCheckUtils]: 14: Hoare triple {831#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {832#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} is VALID [2022-04-27 12:17:44,456 INFO L290 TraceCheckUtils]: 15: Hoare triple {832#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {832#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} is VALID [2022-04-27 12:17:44,456 INFO L290 TraceCheckUtils]: 16: Hoare triple {832#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} assume !!(#t~post6 < 100);havoc #t~post6; {832#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} is VALID [2022-04-27 12:17:44,458 INFO L272 TraceCheckUtils]: 17: Hoare triple {832#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {833#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:17:44,458 INFO L290 TraceCheckUtils]: 18: Hoare triple {833#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {834#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 12:17:44,459 INFO L290 TraceCheckUtils]: 19: Hoare triple {834#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {823#false} is VALID [2022-04-27 12:17:44,459 INFO L290 TraceCheckUtils]: 20: Hoare triple {823#false} assume !false; {823#false} is VALID [2022-04-27 12:17:44,459 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:17:44,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:17:44,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414742576] [2022-04-27 12:17:44,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414742576] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:17:44,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:17:44,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 12:17:44,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187929765] [2022-04-27 12:17:44,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:17:44,460 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-04-27 12:17:44,460 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:17:44,460 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:17:44,489 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:17:44,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 12:17:44,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:17:44,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 12:17:44,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-27 12:17:44,491 INFO L87 Difference]: Start difference. First operand 39 states and 52 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:17:49,358 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:17:52,639 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:17:57,493 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:18:02,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:18:02,301 INFO L93 Difference]: Finished difference Result 72 states and 104 transitions. [2022-04-27 12:18:02,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 12:18:02,301 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-04-27 12:18:02,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:18:02,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:18:02,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2022-04-27 12:18:02,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:18:02,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2022-04-27 12:18:02,306 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 104 transitions. [2022-04-27 12:18:02,533 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:18:02,535 INFO L225 Difference]: With dead ends: 72 [2022-04-27 12:18:02,535 INFO L226 Difference]: Without dead ends: 51 [2022-04-27 12:18:02,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-27 12:18:02,536 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 24 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 37 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2022-04-27 12:18:02,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 107 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 207 Invalid, 2 Unknown, 0 Unchecked, 12.4s Time] [2022-04-27 12:18:02,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-27 12:18:02,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-27 12:18:02,564 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:18:02,564 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 12:18:02,565 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 12:18:02,565 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 12:18:02,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:18:02,567 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-04-27 12:18:02,567 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2022-04-27 12:18:02,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:18:02,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:18:02,568 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 51 states. [2022-04-27 12:18:02,568 INFO L87 Difference]: Start difference. First operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 51 states. [2022-04-27 12:18:02,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:18:02,570 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-04-27 12:18:02,570 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2022-04-27 12:18:02,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:18:02,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:18:02,571 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:18:02,571 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:18:02,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 12:18:02,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 69 transitions. [2022-04-27 12:18:02,573 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 69 transitions. Word has length 21 [2022-04-27 12:18:02,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:18:02,573 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 69 transitions. [2022-04-27 12:18:02,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:18:02,573 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2022-04-27 12:18:02,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 12:18:02,574 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:18:02,574 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:18:02,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 12:18:02,574 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:18:02,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:18:02,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1701877900, now seen corresponding path program 1 times [2022-04-27 12:18:02,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:18:02,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850716576] [2022-04-27 12:18:02,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:18:02,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:18:02,610 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:18:02,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1876414067] [2022-04-27 12:18:02,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:18:02,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:18:02,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:18:02,616 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:18:02,617 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:18:02,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:18:02,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 12:18:02,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:18:02,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:18:02,768 INFO L272 TraceCheckUtils]: 0: Hoare triple {1137#true} call ULTIMATE.init(); {1137#true} is VALID [2022-04-27 12:18:02,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {1137#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1145#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:02,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {1145#(<= ~counter~0 0)} assume true; {1145#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:02,769 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1145#(<= ~counter~0 0)} {1137#true} #102#return; {1145#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:02,770 INFO L272 TraceCheckUtils]: 4: Hoare triple {1145#(<= ~counter~0 0)} call #t~ret7 := main(); {1145#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:02,770 INFO L290 TraceCheckUtils]: 5: Hoare triple {1145#(<= ~counter~0 0)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1145#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:02,770 INFO L272 TraceCheckUtils]: 6: Hoare triple {1145#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1145#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:02,771 INFO L290 TraceCheckUtils]: 7: Hoare triple {1145#(<= ~counter~0 0)} ~cond := #in~cond; {1145#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:02,771 INFO L290 TraceCheckUtils]: 8: Hoare triple {1145#(<= ~counter~0 0)} assume !(0 == ~cond); {1145#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:02,771 INFO L290 TraceCheckUtils]: 9: Hoare triple {1145#(<= ~counter~0 0)} assume true; {1145#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:02,772 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1145#(<= ~counter~0 0)} {1145#(<= ~counter~0 0)} #82#return; {1145#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:02,772 INFO L290 TraceCheckUtils]: 11: Hoare triple {1145#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1145#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:02,773 INFO L290 TraceCheckUtils]: 12: Hoare triple {1145#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1179#(<= ~counter~0 1)} is VALID [2022-04-27 12:18:02,773 INFO L290 TraceCheckUtils]: 13: Hoare triple {1179#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {1179#(<= ~counter~0 1)} is VALID [2022-04-27 12:18:02,773 INFO L290 TraceCheckUtils]: 14: Hoare triple {1179#(<= ~counter~0 1)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {1179#(<= ~counter~0 1)} is VALID [2022-04-27 12:18:02,774 INFO L290 TraceCheckUtils]: 15: Hoare triple {1179#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1189#(<= |main_#t~post5| 1)} is VALID [2022-04-27 12:18:02,774 INFO L290 TraceCheckUtils]: 16: Hoare triple {1189#(<= |main_#t~post5| 1)} assume !(#t~post5 < 100);havoc #t~post5; {1138#false} is VALID [2022-04-27 12:18:02,774 INFO L290 TraceCheckUtils]: 17: Hoare triple {1138#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1138#false} is VALID [2022-04-27 12:18:02,775 INFO L290 TraceCheckUtils]: 18: Hoare triple {1138#false} assume !(#t~post6 < 100);havoc #t~post6; {1138#false} is VALID [2022-04-27 12:18:02,775 INFO L272 TraceCheckUtils]: 19: Hoare triple {1138#false} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 + 16 * ~n~0 * ~p~0 + 12 * ~h~0 * ~r~0 - 16 * ~p~0 * ~r~0 - ~h~0 - 4 * ~p~0) % 4294967296 then 1 else 0)); {1138#false} is VALID [2022-04-27 12:18:02,775 INFO L290 TraceCheckUtils]: 20: Hoare triple {1138#false} ~cond := #in~cond; {1138#false} is VALID [2022-04-27 12:18:02,775 INFO L290 TraceCheckUtils]: 21: Hoare triple {1138#false} assume 0 == ~cond; {1138#false} is VALID [2022-04-27 12:18:02,775 INFO L290 TraceCheckUtils]: 22: Hoare triple {1138#false} assume !false; {1138#false} is VALID [2022-04-27 12:18:02,775 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:18:02,775 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:18:02,938 INFO L290 TraceCheckUtils]: 22: Hoare triple {1138#false} assume !false; {1138#false} is VALID [2022-04-27 12:18:02,938 INFO L290 TraceCheckUtils]: 21: Hoare triple {1138#false} assume 0 == ~cond; {1138#false} is VALID [2022-04-27 12:18:02,938 INFO L290 TraceCheckUtils]: 20: Hoare triple {1138#false} ~cond := #in~cond; {1138#false} is VALID [2022-04-27 12:18:02,939 INFO L272 TraceCheckUtils]: 19: Hoare triple {1138#false} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 + 16 * ~n~0 * ~p~0 + 12 * ~h~0 * ~r~0 - 16 * ~p~0 * ~r~0 - ~h~0 - 4 * ~p~0) % 4294967296 then 1 else 0)); {1138#false} is VALID [2022-04-27 12:18:02,942 INFO L290 TraceCheckUtils]: 18: Hoare triple {1138#false} assume !(#t~post6 < 100);havoc #t~post6; {1138#false} is VALID [2022-04-27 12:18:02,954 INFO L290 TraceCheckUtils]: 17: Hoare triple {1138#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1138#false} is VALID [2022-04-27 12:18:02,955 INFO L290 TraceCheckUtils]: 16: Hoare triple {1229#(< |main_#t~post5| 100)} assume !(#t~post5 < 100);havoc #t~post5; {1138#false} is VALID [2022-04-27 12:18:02,955 INFO L290 TraceCheckUtils]: 15: Hoare triple {1233#(< ~counter~0 100)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1229#(< |main_#t~post5| 100)} is VALID [2022-04-27 12:18:02,956 INFO L290 TraceCheckUtils]: 14: Hoare triple {1233#(< ~counter~0 100)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {1233#(< ~counter~0 100)} is VALID [2022-04-27 12:18:02,956 INFO L290 TraceCheckUtils]: 13: Hoare triple {1233#(< ~counter~0 100)} assume !!(#t~post5 < 100);havoc #t~post5; {1233#(< ~counter~0 100)} is VALID [2022-04-27 12:18:02,957 INFO L290 TraceCheckUtils]: 12: Hoare triple {1243#(< ~counter~0 99)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1233#(< ~counter~0 100)} is VALID [2022-04-27 12:18:02,957 INFO L290 TraceCheckUtils]: 11: Hoare triple {1243#(< ~counter~0 99)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1243#(< ~counter~0 99)} is VALID [2022-04-27 12:18:02,958 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1137#true} {1243#(< ~counter~0 99)} #82#return; {1243#(< ~counter~0 99)} is VALID [2022-04-27 12:18:02,958 INFO L290 TraceCheckUtils]: 9: Hoare triple {1137#true} assume true; {1137#true} is VALID [2022-04-27 12:18:02,958 INFO L290 TraceCheckUtils]: 8: Hoare triple {1137#true} assume !(0 == ~cond); {1137#true} is VALID [2022-04-27 12:18:02,958 INFO L290 TraceCheckUtils]: 7: Hoare triple {1137#true} ~cond := #in~cond; {1137#true} is VALID [2022-04-27 12:18:02,958 INFO L272 TraceCheckUtils]: 6: Hoare triple {1243#(< ~counter~0 99)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1137#true} is VALID [2022-04-27 12:18:02,959 INFO L290 TraceCheckUtils]: 5: Hoare triple {1243#(< ~counter~0 99)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1243#(< ~counter~0 99)} is VALID [2022-04-27 12:18:02,959 INFO L272 TraceCheckUtils]: 4: Hoare triple {1243#(< ~counter~0 99)} call #t~ret7 := main(); {1243#(< ~counter~0 99)} is VALID [2022-04-27 12:18:02,959 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1243#(< ~counter~0 99)} {1137#true} #102#return; {1243#(< ~counter~0 99)} is VALID [2022-04-27 12:18:02,960 INFO L290 TraceCheckUtils]: 2: Hoare triple {1243#(< ~counter~0 99)} assume true; {1243#(< ~counter~0 99)} is VALID [2022-04-27 12:18:02,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {1137#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1243#(< ~counter~0 99)} is VALID [2022-04-27 12:18:02,961 INFO L272 TraceCheckUtils]: 0: Hoare triple {1137#true} call ULTIMATE.init(); {1137#true} is VALID [2022-04-27 12:18:02,961 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:18:02,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:18:02,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850716576] [2022-04-27 12:18:02,961 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:18:02,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876414067] [2022-04-27 12:18:02,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876414067] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:18:02,961 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:18:02,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-27 12:18:02,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861660630] [2022-04-27 12:18:02,962 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:18:02,962 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 23 [2022-04-27 12:18:02,962 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:18:02,963 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 12:18:02,989 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:18:02,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 12:18:02,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:18:02,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 12:18:02,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-27 12:18:02,990 INFO L87 Difference]: Start difference. First operand 51 states and 69 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 12:18:05,254 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:18:07,374 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:18:11,811 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:18:15,059 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:18:17,067 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:18:18,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:18:18,559 INFO L93 Difference]: Finished difference Result 108 states and 149 transitions. [2022-04-27 12:18:18,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 12:18:18,559 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 23 [2022-04-27 12:18:18,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:18:18,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 12:18:18,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 135 transitions. [2022-04-27 12:18:18,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 12:18:18,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 135 transitions. [2022-04-27 12:18:18,563 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 135 transitions. [2022-04-27 12:18:18,677 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:18:18,679 INFO L225 Difference]: With dead ends: 108 [2022-04-27 12:18:18,679 INFO L226 Difference]: Without dead ends: 89 [2022-04-27 12:18:18,680 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 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:18:18,681 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 61 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 22 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.3s IncrementalHoareTripleChecker+Time [2022-04-27 12:18:18,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 238 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 71 Invalid, 5 Unknown, 0 Unchecked, 13.3s Time] [2022-04-27 12:18:18,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-27 12:18:18,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 67. [2022-04-27 12:18:18,701 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:18:18,702 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 67 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 43 states have internal predecessors, (51), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 12:18:18,702 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 67 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 43 states have internal predecessors, (51), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 12:18:18,702 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 67 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 43 states have internal predecessors, (51), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 12:18:18,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:18:18,705 INFO L93 Difference]: Finished difference Result 89 states and 117 transitions. [2022-04-27 12:18:18,705 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 117 transitions. [2022-04-27 12:18:18,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:18:18,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:18:18,706 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 43 states have internal predecessors, (51), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 89 states. [2022-04-27 12:18:18,706 INFO L87 Difference]: Start difference. First operand has 67 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 43 states have internal predecessors, (51), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 89 states. [2022-04-27 12:18:18,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:18:18,709 INFO L93 Difference]: Finished difference Result 89 states and 117 transitions. [2022-04-27 12:18:18,709 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 117 transitions. [2022-04-27 12:18:18,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:18:18,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:18:18,710 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:18:18,710 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:18:18,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 43 states have internal predecessors, (51), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 12:18:18,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 86 transitions. [2022-04-27 12:18:18,712 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 86 transitions. Word has length 23 [2022-04-27 12:18:18,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:18:18,712 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 86 transitions. [2022-04-27 12:18:18,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 12:18:18,713 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 86 transitions. [2022-04-27 12:18:18,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 12:18:18,713 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:18:18,713 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:18:18,737 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:18:18,931 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:18:18,932 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:18:18,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:18:18,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1564262277, now seen corresponding path program 1 times [2022-04-27 12:18:18,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:18:18,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047732590] [2022-04-27 12:18:18,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:18:18,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:18:18,942 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:18:18,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [694368730] [2022-04-27 12:18:18,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:18:18,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:18:18,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:18:18,947 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:18:18,947 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:18:18,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:18:18,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 12:18:19,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:18:19,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:18:19,135 INFO L272 TraceCheckUtils]: 0: Hoare triple {1723#true} call ULTIMATE.init(); {1723#true} is VALID [2022-04-27 12:18:19,136 INFO L290 TraceCheckUtils]: 1: Hoare triple {1723#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1731#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:19,136 INFO L290 TraceCheckUtils]: 2: Hoare triple {1731#(<= ~counter~0 0)} assume true; {1731#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:19,137 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1731#(<= ~counter~0 0)} {1723#true} #102#return; {1731#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:19,137 INFO L272 TraceCheckUtils]: 4: Hoare triple {1731#(<= ~counter~0 0)} call #t~ret7 := main(); {1731#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:19,137 INFO L290 TraceCheckUtils]: 5: Hoare triple {1731#(<= ~counter~0 0)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1731#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:19,138 INFO L272 TraceCheckUtils]: 6: Hoare triple {1731#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1731#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:19,138 INFO L290 TraceCheckUtils]: 7: Hoare triple {1731#(<= ~counter~0 0)} ~cond := #in~cond; {1731#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:19,138 INFO L290 TraceCheckUtils]: 8: Hoare triple {1731#(<= ~counter~0 0)} assume !(0 == ~cond); {1731#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:19,138 INFO L290 TraceCheckUtils]: 9: Hoare triple {1731#(<= ~counter~0 0)} assume true; {1731#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:19,139 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1731#(<= ~counter~0 0)} {1731#(<= ~counter~0 0)} #82#return; {1731#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:19,139 INFO L290 TraceCheckUtils]: 11: Hoare triple {1731#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1731#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:19,140 INFO L290 TraceCheckUtils]: 12: Hoare triple {1731#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1765#(<= ~counter~0 1)} is VALID [2022-04-27 12:18:19,140 INFO L290 TraceCheckUtils]: 13: Hoare triple {1765#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {1765#(<= ~counter~0 1)} is VALID [2022-04-27 12:18:19,140 INFO L290 TraceCheckUtils]: 14: Hoare triple {1765#(<= ~counter~0 1)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {1765#(<= ~counter~0 1)} is VALID [2022-04-27 12:18:19,140 INFO L290 TraceCheckUtils]: 15: Hoare triple {1765#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1775#(<= ~counter~0 2)} is VALID [2022-04-27 12:18:19,141 INFO L290 TraceCheckUtils]: 16: Hoare triple {1775#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {1775#(<= ~counter~0 2)} is VALID [2022-04-27 12:18:19,141 INFO L290 TraceCheckUtils]: 17: Hoare triple {1775#(<= ~counter~0 2)} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {1775#(<= ~counter~0 2)} is VALID [2022-04-27 12:18:19,141 INFO L290 TraceCheckUtils]: 18: Hoare triple {1775#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1785#(<= |main_#t~post6| 2)} is VALID [2022-04-27 12:18:19,142 INFO L290 TraceCheckUtils]: 19: Hoare triple {1785#(<= |main_#t~post6| 2)} assume !(#t~post6 < 100);havoc #t~post6; {1724#false} is VALID [2022-04-27 12:18:19,142 INFO L272 TraceCheckUtils]: 20: Hoare triple {1724#false} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 + 16 * ~n~0 * ~p~0 + 12 * ~h~0 * ~r~0 - 16 * ~p~0 * ~r~0 - ~h~0 - 4 * ~p~0) % 4294967296 then 1 else 0)); {1724#false} is VALID [2022-04-27 12:18:19,142 INFO L290 TraceCheckUtils]: 21: Hoare triple {1724#false} ~cond := #in~cond; {1724#false} is VALID [2022-04-27 12:18:19,142 INFO L290 TraceCheckUtils]: 22: Hoare triple {1724#false} assume 0 == ~cond; {1724#false} is VALID [2022-04-27 12:18:19,142 INFO L290 TraceCheckUtils]: 23: Hoare triple {1724#false} assume !false; {1724#false} is VALID [2022-04-27 12:18:19,142 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:18:19,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:18:19,297 INFO L290 TraceCheckUtils]: 23: Hoare triple {1724#false} assume !false; {1724#false} is VALID [2022-04-27 12:18:19,297 INFO L290 TraceCheckUtils]: 22: Hoare triple {1724#false} assume 0 == ~cond; {1724#false} is VALID [2022-04-27 12:18:19,298 INFO L290 TraceCheckUtils]: 21: Hoare triple {1724#false} ~cond := #in~cond; {1724#false} is VALID [2022-04-27 12:18:19,298 INFO L272 TraceCheckUtils]: 20: Hoare triple {1724#false} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 + 16 * ~n~0 * ~p~0 + 12 * ~h~0 * ~r~0 - 16 * ~p~0 * ~r~0 - ~h~0 - 4 * ~p~0) % 4294967296 then 1 else 0)); {1724#false} is VALID [2022-04-27 12:18:19,298 INFO L290 TraceCheckUtils]: 19: Hoare triple {1813#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {1724#false} is VALID [2022-04-27 12:18:19,298 INFO L290 TraceCheckUtils]: 18: Hoare triple {1817#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1813#(< |main_#t~post6| 100)} is VALID [2022-04-27 12:18:19,299 INFO L290 TraceCheckUtils]: 17: Hoare triple {1817#(< ~counter~0 100)} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {1817#(< ~counter~0 100)} is VALID [2022-04-27 12:18:19,299 INFO L290 TraceCheckUtils]: 16: Hoare triple {1817#(< ~counter~0 100)} assume !!(#t~post5 < 100);havoc #t~post5; {1817#(< ~counter~0 100)} is VALID [2022-04-27 12:18:19,299 INFO L290 TraceCheckUtils]: 15: Hoare triple {1827#(< ~counter~0 99)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1817#(< ~counter~0 100)} is VALID [2022-04-27 12:18:19,300 INFO L290 TraceCheckUtils]: 14: Hoare triple {1827#(< ~counter~0 99)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {1827#(< ~counter~0 99)} is VALID [2022-04-27 12:18:19,300 INFO L290 TraceCheckUtils]: 13: Hoare triple {1827#(< ~counter~0 99)} assume !!(#t~post5 < 100);havoc #t~post5; {1827#(< ~counter~0 99)} is VALID [2022-04-27 12:18:19,300 INFO L290 TraceCheckUtils]: 12: Hoare triple {1837#(< ~counter~0 98)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1827#(< ~counter~0 99)} is VALID [2022-04-27 12:18:19,301 INFO L290 TraceCheckUtils]: 11: Hoare triple {1837#(< ~counter~0 98)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1837#(< ~counter~0 98)} is VALID [2022-04-27 12:18:19,301 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1723#true} {1837#(< ~counter~0 98)} #82#return; {1837#(< ~counter~0 98)} is VALID [2022-04-27 12:18:19,301 INFO L290 TraceCheckUtils]: 9: Hoare triple {1723#true} assume true; {1723#true} is VALID [2022-04-27 12:18:19,301 INFO L290 TraceCheckUtils]: 8: Hoare triple {1723#true} assume !(0 == ~cond); {1723#true} is VALID [2022-04-27 12:18:19,301 INFO L290 TraceCheckUtils]: 7: Hoare triple {1723#true} ~cond := #in~cond; {1723#true} is VALID [2022-04-27 12:18:19,301 INFO L272 TraceCheckUtils]: 6: Hoare triple {1837#(< ~counter~0 98)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1723#true} is VALID [2022-04-27 12:18:19,302 INFO L290 TraceCheckUtils]: 5: Hoare triple {1837#(< ~counter~0 98)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1837#(< ~counter~0 98)} is VALID [2022-04-27 12:18:19,302 INFO L272 TraceCheckUtils]: 4: Hoare triple {1837#(< ~counter~0 98)} call #t~ret7 := main(); {1837#(< ~counter~0 98)} is VALID [2022-04-27 12:18:19,302 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1837#(< ~counter~0 98)} {1723#true} #102#return; {1837#(< ~counter~0 98)} is VALID [2022-04-27 12:18:19,302 INFO L290 TraceCheckUtils]: 2: Hoare triple {1837#(< ~counter~0 98)} assume true; {1837#(< ~counter~0 98)} is VALID [2022-04-27 12:18:19,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {1723#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1837#(< ~counter~0 98)} is VALID [2022-04-27 12:18:19,303 INFO L272 TraceCheckUtils]: 0: Hoare triple {1723#true} call ULTIMATE.init(); {1723#true} is VALID [2022-04-27 12:18:19,303 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:18:19,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:18:19,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047732590] [2022-04-27 12:18:19,303 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:18:19,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694368730] [2022-04-27 12:18:19,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694368730] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:18:19,304 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:18:19,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-27 12:18:19,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832498719] [2022-04-27 12:18:19,304 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:18:19,304 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 24 [2022-04-27 12:18:19,304 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:18:19,304 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 12:18:19,331 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:18:19,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 12:18:19,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:18:19,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 12:18:19,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-27 12:18:19,332 INFO L87 Difference]: Start difference. First operand 67 states and 86 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 12:18:25,008 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:18:27,013 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:18:37,226 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:18:40,233 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:18:43,232 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:18:46,407 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:18:46,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:18:46,479 INFO L93 Difference]: Finished difference Result 140 states and 188 transitions. [2022-04-27 12:18:46,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 12:18:46,479 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 24 [2022-04-27 12:18:46,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:18:46,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 12:18:46,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 178 transitions. [2022-04-27 12:18:46,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 12:18:46,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 178 transitions. [2022-04-27 12:18:46,486 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 178 transitions. [2022-04-27 12:18:46,645 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 178 edges. 178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:18:46,648 INFO L225 Difference]: With dead ends: 140 [2022-04-27 12:18:46,648 INFO L226 Difference]: Without dead ends: 129 [2022-04-27 12:18:46,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-04-27 12:18:46,649 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 125 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 48 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.7s IncrementalHoareTripleChecker+Time [2022-04-27 12:18:46,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 322 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 104 Invalid, 4 Unknown, 0 Unchecked, 16.7s Time] [2022-04-27 12:18:46,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-04-27 12:18:46,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 120. [2022-04-27 12:18:46,704 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:18:46,705 INFO L82 GeneralOperation]: Start isEquivalent. First operand 129 states. Second operand has 120 states, 68 states have (on average 1.2941176470588236) internal successors, (88), 72 states have internal predecessors, (88), 42 states have call successors, (42), 11 states have call predecessors, (42), 9 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-27 12:18:46,705 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand has 120 states, 68 states have (on average 1.2941176470588236) internal successors, (88), 72 states have internal predecessors, (88), 42 states have call successors, (42), 11 states have call predecessors, (42), 9 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-27 12:18:46,706 INFO L87 Difference]: Start difference. First operand 129 states. Second operand has 120 states, 68 states have (on average 1.2941176470588236) internal successors, (88), 72 states have internal predecessors, (88), 42 states have call successors, (42), 11 states have call predecessors, (42), 9 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-27 12:18:46,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:18:46,710 INFO L93 Difference]: Finished difference Result 129 states and 172 transitions. [2022-04-27 12:18:46,710 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 172 transitions. [2022-04-27 12:18:46,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:18:46,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:18:46,713 INFO L74 IsIncluded]: Start isIncluded. First operand has 120 states, 68 states have (on average 1.2941176470588236) internal successors, (88), 72 states have internal predecessors, (88), 42 states have call successors, (42), 11 states have call predecessors, (42), 9 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) Second operand 129 states. [2022-04-27 12:18:46,714 INFO L87 Difference]: Start difference. First operand has 120 states, 68 states have (on average 1.2941176470588236) internal successors, (88), 72 states have internal predecessors, (88), 42 states have call successors, (42), 11 states have call predecessors, (42), 9 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) Second operand 129 states. [2022-04-27 12:18:46,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:18:46,727 INFO L93 Difference]: Finished difference Result 129 states and 172 transitions. [2022-04-27 12:18:46,727 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 172 transitions. [2022-04-27 12:18:46,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:18:46,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:18:46,727 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:18:46,727 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:18:46,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 68 states have (on average 1.2941176470588236) internal successors, (88), 72 states have internal predecessors, (88), 42 states have call successors, (42), 11 states have call predecessors, (42), 9 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-27 12:18:46,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 167 transitions. [2022-04-27 12:18:46,731 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 167 transitions. Word has length 24 [2022-04-27 12:18:46,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:18:46,731 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 167 transitions. [2022-04-27 12:18:46,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 12:18:46,731 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 167 transitions. [2022-04-27 12:18:46,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 12:18:46,731 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:18:46,732 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:18:46,750 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:18:46,950 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:18:46,950 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:18:46,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:18:46,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1562772727, now seen corresponding path program 1 times [2022-04-27 12:18:46,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:18:46,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781971075] [2022-04-27 12:18:46,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:18:46,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:18:46,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:18:47,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 12:18:47,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:18:47,137 INFO L290 TraceCheckUtils]: 0: Hoare triple {2539#(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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2525#true} is VALID [2022-04-27 12:18:47,137 INFO L290 TraceCheckUtils]: 1: Hoare triple {2525#true} assume true; {2525#true} is VALID [2022-04-27 12:18:47,137 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2525#true} {2525#true} #102#return; {2525#true} is VALID [2022-04-27 12:18:47,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 12:18:47,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:18:47,148 INFO L290 TraceCheckUtils]: 0: Hoare triple {2525#true} ~cond := #in~cond; {2525#true} is VALID [2022-04-27 12:18:47,148 INFO L290 TraceCheckUtils]: 1: Hoare triple {2525#true} assume !(0 == ~cond); {2525#true} is VALID [2022-04-27 12:18:47,148 INFO L290 TraceCheckUtils]: 2: Hoare triple {2525#true} assume true; {2525#true} is VALID [2022-04-27 12:18:47,148 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2525#true} {2525#true} #82#return; {2525#true} is VALID [2022-04-27 12:18:47,148 INFO L272 TraceCheckUtils]: 0: Hoare triple {2525#true} call ULTIMATE.init(); {2539#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 12:18:47,149 INFO L290 TraceCheckUtils]: 1: Hoare triple {2539#(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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2525#true} is VALID [2022-04-27 12:18:47,149 INFO L290 TraceCheckUtils]: 2: Hoare triple {2525#true} assume true; {2525#true} is VALID [2022-04-27 12:18:47,151 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2525#true} {2525#true} #102#return; {2525#true} is VALID [2022-04-27 12:18:47,151 INFO L272 TraceCheckUtils]: 4: Hoare triple {2525#true} call #t~ret7 := main(); {2525#true} is VALID [2022-04-27 12:18:47,152 INFO L290 TraceCheckUtils]: 5: Hoare triple {2525#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {2525#true} is VALID [2022-04-27 12:18:47,152 INFO L272 TraceCheckUtils]: 6: Hoare triple {2525#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {2525#true} is VALID [2022-04-27 12:18:47,152 INFO L290 TraceCheckUtils]: 7: Hoare triple {2525#true} ~cond := #in~cond; {2525#true} is VALID [2022-04-27 12:18:47,152 INFO L290 TraceCheckUtils]: 8: Hoare triple {2525#true} assume !(0 == ~cond); {2525#true} is VALID [2022-04-27 12:18:47,152 INFO L290 TraceCheckUtils]: 9: Hoare triple {2525#true} assume true; {2525#true} is VALID [2022-04-27 12:18:47,152 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2525#true} {2525#true} #82#return; {2525#true} is VALID [2022-04-27 12:18:47,152 INFO L290 TraceCheckUtils]: 11: Hoare triple {2525#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {2534#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-27 12:18:47,153 INFO L290 TraceCheckUtils]: 12: Hoare triple {2534#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2534#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-27 12:18:47,153 INFO L290 TraceCheckUtils]: 13: Hoare triple {2534#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !!(#t~post5 < 100);havoc #t~post5; {2534#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-27 12:18:47,154 INFO L290 TraceCheckUtils]: 14: Hoare triple {2534#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {2535#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-27 12:18:47,172 INFO L290 TraceCheckUtils]: 15: Hoare triple {2535#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2535#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-27 12:18:47,173 INFO L290 TraceCheckUtils]: 16: Hoare triple {2535#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !!(#t~post5 < 100);havoc #t~post5; {2535#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-27 12:18:47,174 INFO L290 TraceCheckUtils]: 17: Hoare triple {2535#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {2536#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} is VALID [2022-04-27 12:18:47,174 INFO L290 TraceCheckUtils]: 18: Hoare triple {2536#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2536#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} is VALID [2022-04-27 12:18:47,175 INFO L290 TraceCheckUtils]: 19: Hoare triple {2536#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} assume !!(#t~post6 < 100);havoc #t~post6; {2536#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} is VALID [2022-04-27 12:18:47,176 INFO L272 TraceCheckUtils]: 20: Hoare triple {2536#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {2537#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:18:47,176 INFO L290 TraceCheckUtils]: 21: Hoare triple {2537#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2538#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 12:18:47,176 INFO L290 TraceCheckUtils]: 22: Hoare triple {2538#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2526#false} is VALID [2022-04-27 12:18:47,176 INFO L290 TraceCheckUtils]: 23: Hoare triple {2526#false} assume !false; {2526#false} is VALID [2022-04-27 12:18:47,177 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:18:47,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:18:47,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781971075] [2022-04-27 12:18:47,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781971075] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 12:18:47,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317571154] [2022-04-27 12:18:47,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:18:47,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:18:47,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:18:47,179 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:18:47,180 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:18:47,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:18:47,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 12:18:47,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:18:47,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:18:47,487 INFO L272 TraceCheckUtils]: 0: Hoare triple {2525#true} call ULTIMATE.init(); {2525#true} is VALID [2022-04-27 12:18:47,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {2525#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2525#true} is VALID [2022-04-27 12:18:47,488 INFO L290 TraceCheckUtils]: 2: Hoare triple {2525#true} assume true; {2525#true} is VALID [2022-04-27 12:18:47,488 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2525#true} {2525#true} #102#return; {2525#true} is VALID [2022-04-27 12:18:47,488 INFO L272 TraceCheckUtils]: 4: Hoare triple {2525#true} call #t~ret7 := main(); {2525#true} is VALID [2022-04-27 12:18:47,488 INFO L290 TraceCheckUtils]: 5: Hoare triple {2525#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {2525#true} is VALID [2022-04-27 12:18:47,488 INFO L272 TraceCheckUtils]: 6: Hoare triple {2525#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {2525#true} is VALID [2022-04-27 12:18:47,488 INFO L290 TraceCheckUtils]: 7: Hoare triple {2525#true} ~cond := #in~cond; {2525#true} is VALID [2022-04-27 12:18:47,488 INFO L290 TraceCheckUtils]: 8: Hoare triple {2525#true} assume !(0 == ~cond); {2525#true} is VALID [2022-04-27 12:18:47,488 INFO L290 TraceCheckUtils]: 9: Hoare triple {2525#true} assume true; {2525#true} is VALID [2022-04-27 12:18:47,488 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2525#true} {2525#true} #82#return; {2525#true} is VALID [2022-04-27 12:18:47,489 INFO L290 TraceCheckUtils]: 11: Hoare triple {2525#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {2534#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-27 12:18:47,490 INFO L290 TraceCheckUtils]: 12: Hoare triple {2534#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2534#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-27 12:18:47,490 INFO L290 TraceCheckUtils]: 13: Hoare triple {2534#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !!(#t~post5 < 100);havoc #t~post5; {2534#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-27 12:18:47,490 INFO L290 TraceCheckUtils]: 14: Hoare triple {2534#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {2585#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-27 12:18:47,491 INFO L290 TraceCheckUtils]: 15: Hoare triple {2585#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2585#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-27 12:18:47,492 INFO L290 TraceCheckUtils]: 16: Hoare triple {2585#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !!(#t~post5 < 100);havoc #t~post5; {2585#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-27 12:18:47,492 INFO L290 TraceCheckUtils]: 17: Hoare triple {2585#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {2595#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} is VALID [2022-04-27 12:18:47,493 INFO L290 TraceCheckUtils]: 18: Hoare triple {2595#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2595#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} is VALID [2022-04-27 12:18:47,493 INFO L290 TraceCheckUtils]: 19: Hoare triple {2595#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} assume !!(#t~post6 < 100);havoc #t~post6; {2595#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} is VALID [2022-04-27 12:18:47,494 INFO L272 TraceCheckUtils]: 20: Hoare triple {2595#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {2605#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:18:47,498 INFO L290 TraceCheckUtils]: 21: Hoare triple {2605#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2609#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:18:47,499 INFO L290 TraceCheckUtils]: 22: Hoare triple {2609#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2526#false} is VALID [2022-04-27 12:18:47,499 INFO L290 TraceCheckUtils]: 23: Hoare triple {2526#false} assume !false; {2526#false} is VALID [2022-04-27 12:18:47,499 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:18:47,499 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:18:47,714 INFO L290 TraceCheckUtils]: 23: Hoare triple {2526#false} assume !false; {2526#false} is VALID [2022-04-27 12:18:47,715 INFO L290 TraceCheckUtils]: 22: Hoare triple {2609#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2526#false} is VALID [2022-04-27 12:18:47,715 INFO L290 TraceCheckUtils]: 21: Hoare triple {2605#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2609#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:18:47,716 INFO L272 TraceCheckUtils]: 20: Hoare triple {2625#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {2605#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:18:47,716 INFO L290 TraceCheckUtils]: 19: Hoare triple {2625#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} assume !!(#t~post6 < 100);havoc #t~post6; {2625#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} is VALID [2022-04-27 12:18:47,716 INFO L290 TraceCheckUtils]: 18: Hoare triple {2625#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2625#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} is VALID [2022-04-27 12:18:47,717 INFO L290 TraceCheckUtils]: 17: Hoare triple {2635#(or (<= (mod main_~q~0 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296)))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {2625#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} is VALID [2022-04-27 12:18:47,717 INFO L290 TraceCheckUtils]: 16: Hoare triple {2635#(or (<= (mod main_~q~0 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296)))} assume !!(#t~post5 < 100);havoc #t~post5; {2635#(or (<= (mod main_~q~0 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296)))} is VALID [2022-04-27 12:18:47,718 INFO L290 TraceCheckUtils]: 15: Hoare triple {2635#(or (<= (mod main_~q~0 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2635#(or (<= (mod main_~q~0 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296)))} is VALID [2022-04-27 12:18:47,727 INFO L290 TraceCheckUtils]: 14: Hoare triple {2645#(or (<= (mod (* main_~q~0 4) 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) (* main_~q~0 4)) 4294967296)))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {2635#(or (<= (mod main_~q~0 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296)))} is VALID [2022-04-27 12:18:47,728 INFO L290 TraceCheckUtils]: 13: Hoare triple {2645#(or (<= (mod (* main_~q~0 4) 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) (* main_~q~0 4)) 4294967296)))} assume !!(#t~post5 < 100);havoc #t~post5; {2645#(or (<= (mod (* main_~q~0 4) 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) (* main_~q~0 4)) 4294967296)))} is VALID [2022-04-27 12:18:47,728 INFO L290 TraceCheckUtils]: 12: Hoare triple {2645#(or (<= (mod (* main_~q~0 4) 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) (* main_~q~0 4)) 4294967296)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2645#(or (<= (mod (* main_~q~0 4) 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) (* main_~q~0 4)) 4294967296)))} is VALID [2022-04-27 12:18:47,728 INFO L290 TraceCheckUtils]: 11: Hoare triple {2525#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {2645#(or (<= (mod (* main_~q~0 4) 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) (* main_~q~0 4)) 4294967296)))} is VALID [2022-04-27 12:18:47,728 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2525#true} {2525#true} #82#return; {2525#true} is VALID [2022-04-27 12:18:47,729 INFO L290 TraceCheckUtils]: 9: Hoare triple {2525#true} assume true; {2525#true} is VALID [2022-04-27 12:18:47,729 INFO L290 TraceCheckUtils]: 8: Hoare triple {2525#true} assume !(0 == ~cond); {2525#true} is VALID [2022-04-27 12:18:47,729 INFO L290 TraceCheckUtils]: 7: Hoare triple {2525#true} ~cond := #in~cond; {2525#true} is VALID [2022-04-27 12:18:47,729 INFO L272 TraceCheckUtils]: 6: Hoare triple {2525#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {2525#true} is VALID [2022-04-27 12:18:47,729 INFO L290 TraceCheckUtils]: 5: Hoare triple {2525#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {2525#true} is VALID [2022-04-27 12:18:47,729 INFO L272 TraceCheckUtils]: 4: Hoare triple {2525#true} call #t~ret7 := main(); {2525#true} is VALID [2022-04-27 12:18:47,729 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2525#true} {2525#true} #102#return; {2525#true} is VALID [2022-04-27 12:18:47,729 INFO L290 TraceCheckUtils]: 2: Hoare triple {2525#true} assume true; {2525#true} is VALID [2022-04-27 12:18:47,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {2525#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2525#true} is VALID [2022-04-27 12:18:47,729 INFO L272 TraceCheckUtils]: 0: Hoare triple {2525#true} call ULTIMATE.init(); {2525#true} is VALID [2022-04-27 12:18:47,729 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:18:47,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [317571154] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:18:47,729 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 12:18:47,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2022-04-27 12:18:47,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650855605] [2022-04-27 12:18:47,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 12:18:47,730 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-04-27 12:18:47,731 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:18:47,731 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.4) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:18:47,769 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:18:47,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-27 12:18:47,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:18:47,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-27 12:18:47,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-04-27 12:18:47,770 INFO L87 Difference]: Start difference. First operand 120 states and 167 transitions. Second operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:18:51,802 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:18:54,780 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:18:56,781 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:19:01,077 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:19:03,317 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:19:07,625 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:19:09,633 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:19:11,826 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:19:19,368 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:19:21,461 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:19:23,591 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:19:25,718 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:19:27,825 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:19:29,962 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:19:44,239 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:19:46,379 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:19:46,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:46,534 INFO L93 Difference]: Finished difference Result 191 states and 269 transitions. [2022-04-27 12:19:46,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 12:19:46,556 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-04-27 12:19:46,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:19:46,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:19:46,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 136 transitions. [2022-04-27 12:19:46,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:19:46,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 136 transitions. [2022-04-27 12:19:46,565 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 136 transitions. [2022-04-27 12:19:47,271 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:19:47,275 INFO L225 Difference]: With dead ends: 191 [2022-04-27 12:19:47,275 INFO L226 Difference]: Without dead ends: 174 [2022-04-27 12:19:47,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2022-04-27 12:19:47,277 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 56 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 140 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 41.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 41.7s IncrementalHoareTripleChecker+Time [2022-04-27 12:19:47,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 145 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 385 Invalid, 15 Unknown, 0 Unchecked, 41.7s Time] [2022-04-27 12:19:47,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-04-27 12:19:47,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 167. [2022-04-27 12:19:47,362 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:19:47,363 INFO L82 GeneralOperation]: Start isEquivalent. First operand 174 states. Second operand has 167 states, 96 states have (on average 1.25) internal successors, (120), 102 states have internal predecessors, (120), 56 states have call successors, (56), 16 states have call predecessors, (56), 14 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2022-04-27 12:19:47,364 INFO L74 IsIncluded]: Start isIncluded. First operand 174 states. Second operand has 167 states, 96 states have (on average 1.25) internal successors, (120), 102 states have internal predecessors, (120), 56 states have call successors, (56), 16 states have call predecessors, (56), 14 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2022-04-27 12:19:47,364 INFO L87 Difference]: Start difference. First operand 174 states. Second operand has 167 states, 96 states have (on average 1.25) internal successors, (120), 102 states have internal predecessors, (120), 56 states have call successors, (56), 16 states have call predecessors, (56), 14 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2022-04-27 12:19:47,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:47,369 INFO L93 Difference]: Finished difference Result 174 states and 238 transitions. [2022-04-27 12:19:47,369 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 238 transitions. [2022-04-27 12:19:47,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:19:47,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:19:47,371 INFO L74 IsIncluded]: Start isIncluded. First operand has 167 states, 96 states have (on average 1.25) internal successors, (120), 102 states have internal predecessors, (120), 56 states have call successors, (56), 16 states have call predecessors, (56), 14 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) Second operand 174 states. [2022-04-27 12:19:47,371 INFO L87 Difference]: Start difference. First operand has 167 states, 96 states have (on average 1.25) internal successors, (120), 102 states have internal predecessors, (120), 56 states have call successors, (56), 16 states have call predecessors, (56), 14 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) Second operand 174 states. [2022-04-27 12:19:47,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:47,377 INFO L93 Difference]: Finished difference Result 174 states and 238 transitions. [2022-04-27 12:19:47,377 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 238 transitions. [2022-04-27 12:19:47,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:19:47,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:19:47,379 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:19:47,379 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:19:47,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 96 states have (on average 1.25) internal successors, (120), 102 states have internal predecessors, (120), 56 states have call successors, (56), 16 states have call predecessors, (56), 14 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2022-04-27 12:19:47,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 225 transitions. [2022-04-27 12:19:47,384 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 225 transitions. Word has length 24 [2022-04-27 12:19:47,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:19:47,384 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 225 transitions. [2022-04-27 12:19:47,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:19:47,384 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 225 transitions. [2022-04-27 12:19:47,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-27 12:19:47,385 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:19:47,385 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:19:47,405 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:19:47,601 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:19:47,602 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:19:47,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:19:47,602 INFO L85 PathProgramCache]: Analyzing trace with hash -45171523, now seen corresponding path program 1 times [2022-04-27 12:19:47,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:19:47,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349130588] [2022-04-27 12:19:47,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:19:47,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:19:47,614 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:19:47,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2011084344] [2022-04-27 12:19:47,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:19:47,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:19:47,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:19:47,621 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:19:47,665 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:19:47,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:19:47,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 12:19:47,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:19:47,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:19:47,941 INFO L272 TraceCheckUtils]: 0: Hoare triple {3584#true} call ULTIMATE.init(); {3584#true} is VALID [2022-04-27 12:19:47,942 INFO L290 TraceCheckUtils]: 1: Hoare triple {3584#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3584#true} is VALID [2022-04-27 12:19:47,942 INFO L290 TraceCheckUtils]: 2: Hoare triple {3584#true} assume true; {3584#true} is VALID [2022-04-27 12:19:47,942 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3584#true} {3584#true} #102#return; {3584#true} is VALID [2022-04-27 12:19:47,942 INFO L272 TraceCheckUtils]: 4: Hoare triple {3584#true} call #t~ret7 := main(); {3584#true} is VALID [2022-04-27 12:19:47,942 INFO L290 TraceCheckUtils]: 5: Hoare triple {3584#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {3584#true} is VALID [2022-04-27 12:19:47,942 INFO L272 TraceCheckUtils]: 6: Hoare triple {3584#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {3584#true} is VALID [2022-04-27 12:19:47,942 INFO L290 TraceCheckUtils]: 7: Hoare triple {3584#true} ~cond := #in~cond; {3584#true} is VALID [2022-04-27 12:19:47,942 INFO L290 TraceCheckUtils]: 8: Hoare triple {3584#true} assume !(0 == ~cond); {3584#true} is VALID [2022-04-27 12:19:47,942 INFO L290 TraceCheckUtils]: 9: Hoare triple {3584#true} assume true; {3584#true} is VALID [2022-04-27 12:19:47,942 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3584#true} {3584#true} #82#return; {3584#true} is VALID [2022-04-27 12:19:47,943 INFO L290 TraceCheckUtils]: 11: Hoare triple {3584#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {3622#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 12:19:47,943 INFO L290 TraceCheckUtils]: 12: Hoare triple {3622#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3622#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 12:19:47,943 INFO L290 TraceCheckUtils]: 13: Hoare triple {3622#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !!(#t~post5 < 100);havoc #t~post5; {3622#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 12:19:47,944 INFO L290 TraceCheckUtils]: 14: Hoare triple {3622#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {3622#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 12:19:47,944 INFO L290 TraceCheckUtils]: 15: Hoare triple {3622#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3622#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 12:19:47,945 INFO L290 TraceCheckUtils]: 16: Hoare triple {3622#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !!(#t~post6 < 100);havoc #t~post6; {3622#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 12:19:47,945 INFO L272 TraceCheckUtils]: 17: Hoare triple {3622#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {3584#true} is VALID [2022-04-27 12:19:47,945 INFO L290 TraceCheckUtils]: 18: Hoare triple {3584#true} ~cond := #in~cond; {3584#true} is VALID [2022-04-27 12:19:47,945 INFO L290 TraceCheckUtils]: 19: Hoare triple {3584#true} assume !(0 == ~cond); {3584#true} is VALID [2022-04-27 12:19:47,945 INFO L290 TraceCheckUtils]: 20: Hoare triple {3584#true} assume true; {3584#true} is VALID [2022-04-27 12:19:47,946 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3584#true} {3622#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #84#return; {3622#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 12:19:47,946 INFO L272 TraceCheckUtils]: 22: Hoare triple {3622#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} call __VERIFIER_assert((if (~p~0 * ~p~0 + ~r~0 * ~q~0) % 4294967296 == ~n~0 * ~q~0 % 4294967296 then 1 else 0)); {3584#true} is VALID [2022-04-27 12:19:47,946 INFO L290 TraceCheckUtils]: 23: Hoare triple {3584#true} ~cond := #in~cond; {3584#true} is VALID [2022-04-27 12:19:47,946 INFO L290 TraceCheckUtils]: 24: Hoare triple {3584#true} assume !(0 == ~cond); {3584#true} is VALID [2022-04-27 12:19:47,946 INFO L290 TraceCheckUtils]: 25: Hoare triple {3584#true} assume true; {3584#true} is VALID [2022-04-27 12:19:47,947 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3584#true} {3622#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #86#return; {3622#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 12:19:47,948 INFO L272 TraceCheckUtils]: 27: Hoare triple {3622#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 * ~q~0 + 16 * ~n~0 * ~p~0 * ~q~0 - ~h~0 * ~q~0 * ~q~0 - 4 * ~p~0 * ~q~0 * ~q~0 + 12 * ~h~0 * ~q~0 * ~r~0 - 16 * ~p~0 * ~q~0 * ~r~0) % 4294967296 then 1 else 0)); {3671#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:19:47,948 INFO L290 TraceCheckUtils]: 28: Hoare triple {3671#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3675#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:19:47,948 INFO L290 TraceCheckUtils]: 29: Hoare triple {3675#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3585#false} is VALID [2022-04-27 12:19:47,948 INFO L290 TraceCheckUtils]: 30: Hoare triple {3585#false} assume !false; {3585#false} is VALID [2022-04-27 12:19:47,949 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 12:19:47,949 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:19:47,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:19:47,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349130588] [2022-04-27 12:19:47,949 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:19:47,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011084344] [2022-04-27 12:19:47,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011084344] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:19:47,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:19:47,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 12:19:47,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410422870] [2022-04-27 12:19:47,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:19:47,950 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2022-04-27 12:19:47,950 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:19:47,950 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 12:19:47,994 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:19:47,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:19:47,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:19:47,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:19:47,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:19:47,995 INFO L87 Difference]: Start difference. First operand 167 states and 225 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 12:19:52,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:52,023 INFO L93 Difference]: Finished difference Result 173 states and 229 transitions. [2022-04-27 12:19:52,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:19:52,023 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2022-04-27 12:19:52,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:19:52,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 12:19:52,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-04-27 12:19:52,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 12:19:52,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-04-27 12:19:52,025 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 71 transitions. [2022-04-27 12:19:52,098 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:19:52,101 INFO L225 Difference]: With dead ends: 173 [2022-04-27 12:19:52,101 INFO L226 Difference]: Without dead ends: 139 [2022-04-27 12:19:52,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 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:19:52,102 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 6 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-27 12:19:52,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 154 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-27 12:19:52,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-04-27 12:19:52,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2022-04-27 12:19:52,156 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:19:52,156 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states. Second operand has 139 states, 79 states have (on average 1.2784810126582278) internal successors, (101), 85 states have internal predecessors, (101), 49 states have call successors, (49), 11 states have call predecessors, (49), 10 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2022-04-27 12:19:52,157 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand has 139 states, 79 states have (on average 1.2784810126582278) internal successors, (101), 85 states have internal predecessors, (101), 49 states have call successors, (49), 11 states have call predecessors, (49), 10 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2022-04-27 12:19:52,157 INFO L87 Difference]: Start difference. First operand 139 states. Second operand has 139 states, 79 states have (on average 1.2784810126582278) internal successors, (101), 85 states have internal predecessors, (101), 49 states have call successors, (49), 11 states have call predecessors, (49), 10 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2022-04-27 12:19:52,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:52,161 INFO L93 Difference]: Finished difference Result 139 states and 193 transitions. [2022-04-27 12:19:52,161 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 193 transitions. [2022-04-27 12:19:52,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:19:52,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:19:52,162 INFO L74 IsIncluded]: Start isIncluded. First operand has 139 states, 79 states have (on average 1.2784810126582278) internal successors, (101), 85 states have internal predecessors, (101), 49 states have call successors, (49), 11 states have call predecessors, (49), 10 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) Second operand 139 states. [2022-04-27 12:19:52,162 INFO L87 Difference]: Start difference. First operand has 139 states, 79 states have (on average 1.2784810126582278) internal successors, (101), 85 states have internal predecessors, (101), 49 states have call successors, (49), 11 states have call predecessors, (49), 10 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) Second operand 139 states. [2022-04-27 12:19:52,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:52,165 INFO L93 Difference]: Finished difference Result 139 states and 193 transitions. [2022-04-27 12:19:52,166 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 193 transitions. [2022-04-27 12:19:52,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:19:52,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:19:52,166 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:19:52,166 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:19:52,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 79 states have (on average 1.2784810126582278) internal successors, (101), 85 states have internal predecessors, (101), 49 states have call successors, (49), 11 states have call predecessors, (49), 10 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2022-04-27 12:19:52,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 193 transitions. [2022-04-27 12:19:52,170 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 193 transitions. Word has length 31 [2022-04-27 12:19:52,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:19:52,171 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 193 transitions. [2022-04-27 12:19:52,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 12:19:52,171 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 193 transitions. [2022-04-27 12:19:52,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-27 12:19:52,171 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:19:52,171 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:19:52,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-27 12:19:52,375 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:19:52,375 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:19:52,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:19:52,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1547125783, now seen corresponding path program 1 times [2022-04-27 12:19:52,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:19:52,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90185660] [2022-04-27 12:19:52,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:19:52,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:19:52,388 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:19:52,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [285904834] [2022-04-27 12:19:52,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:19:52,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:19:52,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:19:52,389 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:19:52,390 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:19:52,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:19:52,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 12:19:52,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:19:52,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:19:52,606 INFO L272 TraceCheckUtils]: 0: Hoare triple {4418#true} call ULTIMATE.init(); {4418#true} is VALID [2022-04-27 12:19:52,606 INFO L290 TraceCheckUtils]: 1: Hoare triple {4418#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4418#true} is VALID [2022-04-27 12:19:52,606 INFO L290 TraceCheckUtils]: 2: Hoare triple {4418#true} assume true; {4418#true} is VALID [2022-04-27 12:19:52,606 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4418#true} {4418#true} #102#return; {4418#true} is VALID [2022-04-27 12:19:52,606 INFO L272 TraceCheckUtils]: 4: Hoare triple {4418#true} call #t~ret7 := main(); {4418#true} is VALID [2022-04-27 12:19:52,606 INFO L290 TraceCheckUtils]: 5: Hoare triple {4418#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {4418#true} is VALID [2022-04-27 12:19:52,606 INFO L272 TraceCheckUtils]: 6: Hoare triple {4418#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {4418#true} is VALID [2022-04-27 12:19:52,606 INFO L290 TraceCheckUtils]: 7: Hoare triple {4418#true} ~cond := #in~cond; {4418#true} is VALID [2022-04-27 12:19:52,606 INFO L290 TraceCheckUtils]: 8: Hoare triple {4418#true} assume !(0 == ~cond); {4418#true} is VALID [2022-04-27 12:19:52,606 INFO L290 TraceCheckUtils]: 9: Hoare triple {4418#true} assume true; {4418#true} is VALID [2022-04-27 12:19:52,606 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4418#true} {4418#true} #82#return; {4418#true} is VALID [2022-04-27 12:19:52,608 INFO L290 TraceCheckUtils]: 11: Hoare triple {4418#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {4456#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:19:52,608 INFO L290 TraceCheckUtils]: 12: Hoare triple {4456#(and (= main_~p~0 0) (= main_~h~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4456#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:19:52,608 INFO L290 TraceCheckUtils]: 13: Hoare triple {4456#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {4456#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:19:52,609 INFO L290 TraceCheckUtils]: 14: Hoare triple {4456#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {4456#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:19:52,609 INFO L290 TraceCheckUtils]: 15: Hoare triple {4456#(and (= main_~p~0 0) (= main_~h~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4456#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:19:52,609 INFO L290 TraceCheckUtils]: 16: Hoare triple {4456#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {4456#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:19:52,610 INFO L290 TraceCheckUtils]: 17: Hoare triple {4456#(and (= main_~p~0 0) (= main_~h~0 0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {4456#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:19:52,610 INFO L290 TraceCheckUtils]: 18: Hoare triple {4456#(and (= main_~p~0 0) (= main_~h~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4456#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:19:52,611 INFO L290 TraceCheckUtils]: 19: Hoare triple {4456#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(#t~post6 < 100);havoc #t~post6; {4456#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:19:52,611 INFO L272 TraceCheckUtils]: 20: Hoare triple {4456#(and (= main_~p~0 0) (= main_~h~0 0))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {4418#true} is VALID [2022-04-27 12:19:52,611 INFO L290 TraceCheckUtils]: 21: Hoare triple {4418#true} ~cond := #in~cond; {4418#true} is VALID [2022-04-27 12:19:52,611 INFO L290 TraceCheckUtils]: 22: Hoare triple {4418#true} assume !(0 == ~cond); {4418#true} is VALID [2022-04-27 12:19:52,611 INFO L290 TraceCheckUtils]: 23: Hoare triple {4418#true} assume true; {4418#true} is VALID [2022-04-27 12:19:52,612 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {4418#true} {4456#(and (= main_~p~0 0) (= main_~h~0 0))} #84#return; {4456#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:19:52,612 INFO L272 TraceCheckUtils]: 25: Hoare triple {4456#(and (= main_~p~0 0) (= main_~h~0 0))} call __VERIFIER_assert((if (~p~0 * ~p~0 + ~r~0 * ~q~0) % 4294967296 == ~n~0 * ~q~0 % 4294967296 then 1 else 0)); {4418#true} is VALID [2022-04-27 12:19:52,612 INFO L290 TraceCheckUtils]: 26: Hoare triple {4418#true} ~cond := #in~cond; {4418#true} is VALID [2022-04-27 12:19:52,612 INFO L290 TraceCheckUtils]: 27: Hoare triple {4418#true} assume !(0 == ~cond); {4418#true} is VALID [2022-04-27 12:19:52,612 INFO L290 TraceCheckUtils]: 28: Hoare triple {4418#true} assume true; {4418#true} is VALID [2022-04-27 12:19:52,612 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {4418#true} {4456#(and (= main_~p~0 0) (= main_~h~0 0))} #86#return; {4456#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:19:52,613 INFO L272 TraceCheckUtils]: 30: Hoare triple {4456#(and (= main_~p~0 0) (= main_~h~0 0))} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 * ~q~0 + 16 * ~n~0 * ~p~0 * ~q~0 - ~h~0 * ~q~0 * ~q~0 - 4 * ~p~0 * ~q~0 * ~q~0 + 12 * ~h~0 * ~q~0 * ~r~0 - 16 * ~p~0 * ~q~0 * ~r~0) % 4294967296 then 1 else 0)); {4514#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:19:52,614 INFO L290 TraceCheckUtils]: 31: Hoare triple {4514#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4518#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:19:52,614 INFO L290 TraceCheckUtils]: 32: Hoare triple {4518#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4419#false} is VALID [2022-04-27 12:19:52,614 INFO L290 TraceCheckUtils]: 33: Hoare triple {4419#false} assume !false; {4419#false} is VALID [2022-04-27 12:19:52,614 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-27 12:19:52,614 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:19:52,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:19:52,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90185660] [2022-04-27 12:19:52,615 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:19:52,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285904834] [2022-04-27 12:19:52,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285904834] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:19:52,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:19:52,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 12:19:52,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615457632] [2022-04-27 12:19:52,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:19:52,615 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2022-04-27 12:19:52,615 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:19:52,615 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 12:19:52,639 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:19:52,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:19:52,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:19:52,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:19:52,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:19:52,640 INFO L87 Difference]: Start difference. First operand 139 states and 193 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 12:19:57,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:57,331 INFO L93 Difference]: Finished difference Result 165 states and 214 transitions. [2022-04-27 12:19:57,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:19:57,331 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2022-04-27 12:19:57,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:19:57,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 12:19:57,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-04-27 12:19:57,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 12:19:57,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-04-27 12:19:57,333 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 69 transitions. [2022-04-27 12:19:57,403 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:19:57,405 INFO L225 Difference]: With dead ends: 165 [2022-04-27 12:19:57,405 INFO L226 Difference]: Without dead ends: 160 [2022-04-27 12:19:57,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 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:19:57,406 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 8 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-27 12:19:57,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 156 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-27 12:19:57,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-04-27 12:19:57,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 146. [2022-04-27 12:19:57,456 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:19:57,456 INFO L82 GeneralOperation]: Start isEquivalent. First operand 160 states. Second operand has 146 states, 86 states have (on average 1.1511627906976745) internal successors, (99), 90 states have internal predecessors, (99), 44 states have call successors, (44), 16 states have call predecessors, (44), 15 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-27 12:19:57,457 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand has 146 states, 86 states have (on average 1.1511627906976745) internal successors, (99), 90 states have internal predecessors, (99), 44 states have call successors, (44), 16 states have call predecessors, (44), 15 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-27 12:19:57,457 INFO L87 Difference]: Start difference. First operand 160 states. Second operand has 146 states, 86 states have (on average 1.1511627906976745) internal successors, (99), 90 states have internal predecessors, (99), 44 states have call successors, (44), 16 states have call predecessors, (44), 15 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-27 12:19:57,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:57,461 INFO L93 Difference]: Finished difference Result 160 states and 201 transitions. [2022-04-27 12:19:57,461 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 201 transitions. [2022-04-27 12:19:57,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:19:57,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:19:57,461 INFO L74 IsIncluded]: Start isIncluded. First operand has 146 states, 86 states have (on average 1.1511627906976745) internal successors, (99), 90 states have internal predecessors, (99), 44 states have call successors, (44), 16 states have call predecessors, (44), 15 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) Second operand 160 states. [2022-04-27 12:19:57,462 INFO L87 Difference]: Start difference. First operand has 146 states, 86 states have (on average 1.1511627906976745) internal successors, (99), 90 states have internal predecessors, (99), 44 states have call successors, (44), 16 states have call predecessors, (44), 15 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) Second operand 160 states. [2022-04-27 12:19:57,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:57,465 INFO L93 Difference]: Finished difference Result 160 states and 201 transitions. [2022-04-27 12:19:57,465 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 201 transitions. [2022-04-27 12:19:57,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:19:57,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:19:57,466 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:19:57,466 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:19:57,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 86 states have (on average 1.1511627906976745) internal successors, (99), 90 states have internal predecessors, (99), 44 states have call successors, (44), 16 states have call predecessors, (44), 15 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-27 12:19:57,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 184 transitions. [2022-04-27 12:19:57,469 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 184 transitions. Word has length 34 [2022-04-27 12:19:57,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:19:57,469 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 184 transitions. [2022-04-27 12:19:57,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 12:19:57,470 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 184 transitions. [2022-04-27 12:19:57,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 12:19:57,470 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:19:57,470 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:19:57,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-27 12:19:57,673 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:19:57,674 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:19:57,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:19:57,674 INFO L85 PathProgramCache]: Analyzing trace with hash 821435566, now seen corresponding path program 1 times [2022-04-27 12:19:57,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:19:57,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246896849] [2022-04-27 12:19:57,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:19:57,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:19:57,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:19:57,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 12:19:57,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:19:57,787 INFO L290 TraceCheckUtils]: 0: Hoare triple {5309#(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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5299#(<= ~counter~0 0)} is VALID [2022-04-27 12:19:57,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {5299#(<= ~counter~0 0)} assume true; {5299#(<= ~counter~0 0)} is VALID [2022-04-27 12:19:57,788 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5299#(<= ~counter~0 0)} {5294#true} #102#return; {5299#(<= ~counter~0 0)} is VALID [2022-04-27 12:19:57,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 12:19:57,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:19:57,792 INFO L290 TraceCheckUtils]: 0: Hoare triple {5294#true} ~cond := #in~cond; {5294#true} is VALID [2022-04-27 12:19:57,792 INFO L290 TraceCheckUtils]: 1: Hoare triple {5294#true} assume !(0 == ~cond); {5294#true} is VALID [2022-04-27 12:19:57,792 INFO L290 TraceCheckUtils]: 2: Hoare triple {5294#true} assume true; {5294#true} is VALID [2022-04-27 12:19:57,792 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5294#true} {5299#(<= ~counter~0 0)} #82#return; {5299#(<= ~counter~0 0)} is VALID [2022-04-27 12:19:57,793 INFO L272 TraceCheckUtils]: 0: Hoare triple {5294#true} call ULTIMATE.init(); {5309#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 12:19:57,793 INFO L290 TraceCheckUtils]: 1: Hoare triple {5309#(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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5299#(<= ~counter~0 0)} is VALID [2022-04-27 12:19:57,793 INFO L290 TraceCheckUtils]: 2: Hoare triple {5299#(<= ~counter~0 0)} assume true; {5299#(<= ~counter~0 0)} is VALID [2022-04-27 12:19:57,794 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5299#(<= ~counter~0 0)} {5294#true} #102#return; {5299#(<= ~counter~0 0)} is VALID [2022-04-27 12:19:57,794 INFO L272 TraceCheckUtils]: 4: Hoare triple {5299#(<= ~counter~0 0)} call #t~ret7 := main(); {5299#(<= ~counter~0 0)} is VALID [2022-04-27 12:19:57,794 INFO L290 TraceCheckUtils]: 5: Hoare triple {5299#(<= ~counter~0 0)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {5299#(<= ~counter~0 0)} is VALID [2022-04-27 12:19:57,795 INFO L272 TraceCheckUtils]: 6: Hoare triple {5299#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {5294#true} is VALID [2022-04-27 12:19:57,795 INFO L290 TraceCheckUtils]: 7: Hoare triple {5294#true} ~cond := #in~cond; {5294#true} is VALID [2022-04-27 12:19:57,795 INFO L290 TraceCheckUtils]: 8: Hoare triple {5294#true} assume !(0 == ~cond); {5294#true} is VALID [2022-04-27 12:19:57,795 INFO L290 TraceCheckUtils]: 9: Hoare triple {5294#true} assume true; {5294#true} is VALID [2022-04-27 12:19:57,795 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5294#true} {5299#(<= ~counter~0 0)} #82#return; {5299#(<= ~counter~0 0)} is VALID [2022-04-27 12:19:57,795 INFO L290 TraceCheckUtils]: 11: Hoare triple {5299#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {5299#(<= ~counter~0 0)} is VALID [2022-04-27 12:19:57,796 INFO L290 TraceCheckUtils]: 12: Hoare triple {5299#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5304#(<= ~counter~0 1)} is VALID [2022-04-27 12:19:57,796 INFO L290 TraceCheckUtils]: 13: Hoare triple {5304#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {5304#(<= ~counter~0 1)} is VALID [2022-04-27 12:19:57,797 INFO L290 TraceCheckUtils]: 14: Hoare triple {5304#(<= ~counter~0 1)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5304#(<= ~counter~0 1)} is VALID [2022-04-27 12:19:57,797 INFO L290 TraceCheckUtils]: 15: Hoare triple {5304#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5305#(<= ~counter~0 2)} is VALID [2022-04-27 12:19:57,798 INFO L290 TraceCheckUtils]: 16: Hoare triple {5305#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {5305#(<= ~counter~0 2)} is VALID [2022-04-27 12:19:57,798 INFO L290 TraceCheckUtils]: 17: Hoare triple {5305#(<= ~counter~0 2)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5305#(<= ~counter~0 2)} is VALID [2022-04-27 12:19:57,799 INFO L290 TraceCheckUtils]: 18: Hoare triple {5305#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5306#(<= ~counter~0 3)} is VALID [2022-04-27 12:19:57,799 INFO L290 TraceCheckUtils]: 19: Hoare triple {5306#(<= ~counter~0 3)} assume !!(#t~post5 < 100);havoc #t~post5; {5306#(<= ~counter~0 3)} is VALID [2022-04-27 12:19:57,799 INFO L290 TraceCheckUtils]: 20: Hoare triple {5306#(<= ~counter~0 3)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5306#(<= ~counter~0 3)} is VALID [2022-04-27 12:19:57,800 INFO L290 TraceCheckUtils]: 21: Hoare triple {5306#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5307#(<= ~counter~0 4)} is VALID [2022-04-27 12:19:57,800 INFO L290 TraceCheckUtils]: 22: Hoare triple {5307#(<= ~counter~0 4)} assume !!(#t~post5 < 100);havoc #t~post5; {5307#(<= ~counter~0 4)} is VALID [2022-04-27 12:19:57,800 INFO L290 TraceCheckUtils]: 23: Hoare triple {5307#(<= ~counter~0 4)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5307#(<= ~counter~0 4)} is VALID [2022-04-27 12:19:57,801 INFO L290 TraceCheckUtils]: 24: Hoare triple {5307#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5308#(<= |main_#t~post5| 4)} is VALID [2022-04-27 12:19:57,801 INFO L290 TraceCheckUtils]: 25: Hoare triple {5308#(<= |main_#t~post5| 4)} assume !(#t~post5 < 100);havoc #t~post5; {5295#false} is VALID [2022-04-27 12:19:57,801 INFO L290 TraceCheckUtils]: 26: Hoare triple {5295#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5295#false} is VALID [2022-04-27 12:19:57,801 INFO L290 TraceCheckUtils]: 27: Hoare triple {5295#false} assume !!(#t~post6 < 100);havoc #t~post6; {5295#false} is VALID [2022-04-27 12:19:57,801 INFO L272 TraceCheckUtils]: 28: Hoare triple {5295#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {5295#false} is VALID [2022-04-27 12:19:57,801 INFO L290 TraceCheckUtils]: 29: Hoare triple {5295#false} ~cond := #in~cond; {5295#false} is VALID [2022-04-27 12:19:57,801 INFO L290 TraceCheckUtils]: 30: Hoare triple {5295#false} assume 0 == ~cond; {5295#false} is VALID [2022-04-27 12:19:57,801 INFO L290 TraceCheckUtils]: 31: Hoare triple {5295#false} assume !false; {5295#false} is VALID [2022-04-27 12:19:57,802 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:19:57,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:19:57,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246896849] [2022-04-27 12:19:57,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246896849] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 12:19:57,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [213495424] [2022-04-27 12:19:57,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:19:57,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:19:57,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:19:57,803 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:19:57,803 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:19:57,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:19:57,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 12:19:57,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:19:57,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:19:58,022 INFO L272 TraceCheckUtils]: 0: Hoare triple {5294#true} call ULTIMATE.init(); {5294#true} is VALID [2022-04-27 12:19:58,023 INFO L290 TraceCheckUtils]: 1: Hoare triple {5294#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5299#(<= ~counter~0 0)} is VALID [2022-04-27 12:19:58,023 INFO L290 TraceCheckUtils]: 2: Hoare triple {5299#(<= ~counter~0 0)} assume true; {5299#(<= ~counter~0 0)} is VALID [2022-04-27 12:19:58,023 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5299#(<= ~counter~0 0)} {5294#true} #102#return; {5299#(<= ~counter~0 0)} is VALID [2022-04-27 12:19:58,023 INFO L272 TraceCheckUtils]: 4: Hoare triple {5299#(<= ~counter~0 0)} call #t~ret7 := main(); {5299#(<= ~counter~0 0)} is VALID [2022-04-27 12:19:58,024 INFO L290 TraceCheckUtils]: 5: Hoare triple {5299#(<= ~counter~0 0)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {5299#(<= ~counter~0 0)} is VALID [2022-04-27 12:19:58,024 INFO L272 TraceCheckUtils]: 6: Hoare triple {5299#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {5299#(<= ~counter~0 0)} is VALID [2022-04-27 12:19:58,024 INFO L290 TraceCheckUtils]: 7: Hoare triple {5299#(<= ~counter~0 0)} ~cond := #in~cond; {5299#(<= ~counter~0 0)} is VALID [2022-04-27 12:19:58,025 INFO L290 TraceCheckUtils]: 8: Hoare triple {5299#(<= ~counter~0 0)} assume !(0 == ~cond); {5299#(<= ~counter~0 0)} is VALID [2022-04-27 12:19:58,025 INFO L290 TraceCheckUtils]: 9: Hoare triple {5299#(<= ~counter~0 0)} assume true; {5299#(<= ~counter~0 0)} is VALID [2022-04-27 12:19:58,025 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5299#(<= ~counter~0 0)} {5299#(<= ~counter~0 0)} #82#return; {5299#(<= ~counter~0 0)} is VALID [2022-04-27 12:19:58,026 INFO L290 TraceCheckUtils]: 11: Hoare triple {5299#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {5299#(<= ~counter~0 0)} is VALID [2022-04-27 12:19:58,026 INFO L290 TraceCheckUtils]: 12: Hoare triple {5299#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5304#(<= ~counter~0 1)} is VALID [2022-04-27 12:19:58,026 INFO L290 TraceCheckUtils]: 13: Hoare triple {5304#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {5304#(<= ~counter~0 1)} is VALID [2022-04-27 12:19:58,027 INFO L290 TraceCheckUtils]: 14: Hoare triple {5304#(<= ~counter~0 1)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5304#(<= ~counter~0 1)} is VALID [2022-04-27 12:19:58,027 INFO L290 TraceCheckUtils]: 15: Hoare triple {5304#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5305#(<= ~counter~0 2)} is VALID [2022-04-27 12:19:58,027 INFO L290 TraceCheckUtils]: 16: Hoare triple {5305#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {5305#(<= ~counter~0 2)} is VALID [2022-04-27 12:19:58,028 INFO L290 TraceCheckUtils]: 17: Hoare triple {5305#(<= ~counter~0 2)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5305#(<= ~counter~0 2)} is VALID [2022-04-27 12:19:58,028 INFO L290 TraceCheckUtils]: 18: Hoare triple {5305#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5306#(<= ~counter~0 3)} is VALID [2022-04-27 12:19:58,028 INFO L290 TraceCheckUtils]: 19: Hoare triple {5306#(<= ~counter~0 3)} assume !!(#t~post5 < 100);havoc #t~post5; {5306#(<= ~counter~0 3)} is VALID [2022-04-27 12:19:58,029 INFO L290 TraceCheckUtils]: 20: Hoare triple {5306#(<= ~counter~0 3)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5306#(<= ~counter~0 3)} is VALID [2022-04-27 12:19:58,029 INFO L290 TraceCheckUtils]: 21: Hoare triple {5306#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5307#(<= ~counter~0 4)} is VALID [2022-04-27 12:19:58,029 INFO L290 TraceCheckUtils]: 22: Hoare triple {5307#(<= ~counter~0 4)} assume !!(#t~post5 < 100);havoc #t~post5; {5307#(<= ~counter~0 4)} is VALID [2022-04-27 12:19:58,030 INFO L290 TraceCheckUtils]: 23: Hoare triple {5307#(<= ~counter~0 4)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5307#(<= ~counter~0 4)} is VALID [2022-04-27 12:19:58,030 INFO L290 TraceCheckUtils]: 24: Hoare triple {5307#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5308#(<= |main_#t~post5| 4)} is VALID [2022-04-27 12:19:58,030 INFO L290 TraceCheckUtils]: 25: Hoare triple {5308#(<= |main_#t~post5| 4)} assume !(#t~post5 < 100);havoc #t~post5; {5295#false} is VALID [2022-04-27 12:19:58,030 INFO L290 TraceCheckUtils]: 26: Hoare triple {5295#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5295#false} is VALID [2022-04-27 12:19:58,030 INFO L290 TraceCheckUtils]: 27: Hoare triple {5295#false} assume !!(#t~post6 < 100);havoc #t~post6; {5295#false} is VALID [2022-04-27 12:19:58,030 INFO L272 TraceCheckUtils]: 28: Hoare triple {5295#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {5295#false} is VALID [2022-04-27 12:19:58,031 INFO L290 TraceCheckUtils]: 29: Hoare triple {5295#false} ~cond := #in~cond; {5295#false} is VALID [2022-04-27 12:19:58,031 INFO L290 TraceCheckUtils]: 30: Hoare triple {5295#false} assume 0 == ~cond; {5295#false} is VALID [2022-04-27 12:19:58,031 INFO L290 TraceCheckUtils]: 31: Hoare triple {5295#false} assume !false; {5295#false} is VALID [2022-04-27 12:19:58,031 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:19:58,031 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:19:58,276 INFO L290 TraceCheckUtils]: 31: Hoare triple {5295#false} assume !false; {5295#false} is VALID [2022-04-27 12:19:58,276 INFO L290 TraceCheckUtils]: 30: Hoare triple {5295#false} assume 0 == ~cond; {5295#false} is VALID [2022-04-27 12:19:58,276 INFO L290 TraceCheckUtils]: 29: Hoare triple {5295#false} ~cond := #in~cond; {5295#false} is VALID [2022-04-27 12:19:58,276 INFO L272 TraceCheckUtils]: 28: Hoare triple {5295#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {5295#false} is VALID [2022-04-27 12:19:58,276 INFO L290 TraceCheckUtils]: 27: Hoare triple {5295#false} assume !!(#t~post6 < 100);havoc #t~post6; {5295#false} is VALID [2022-04-27 12:19:58,276 INFO L290 TraceCheckUtils]: 26: Hoare triple {5295#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5295#false} is VALID [2022-04-27 12:19:58,277 INFO L290 TraceCheckUtils]: 25: Hoare triple {5424#(< |main_#t~post5| 100)} assume !(#t~post5 < 100);havoc #t~post5; {5295#false} is VALID [2022-04-27 12:19:58,277 INFO L290 TraceCheckUtils]: 24: Hoare triple {5428#(< ~counter~0 100)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5424#(< |main_#t~post5| 100)} is VALID [2022-04-27 12:19:58,277 INFO L290 TraceCheckUtils]: 23: Hoare triple {5428#(< ~counter~0 100)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5428#(< ~counter~0 100)} is VALID [2022-04-27 12:19:58,278 INFO L290 TraceCheckUtils]: 22: Hoare triple {5428#(< ~counter~0 100)} assume !!(#t~post5 < 100);havoc #t~post5; {5428#(< ~counter~0 100)} is VALID [2022-04-27 12:19:58,278 INFO L290 TraceCheckUtils]: 21: Hoare triple {5438#(< ~counter~0 99)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5428#(< ~counter~0 100)} is VALID [2022-04-27 12:19:58,278 INFO L290 TraceCheckUtils]: 20: Hoare triple {5438#(< ~counter~0 99)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5438#(< ~counter~0 99)} is VALID [2022-04-27 12:19:58,279 INFO L290 TraceCheckUtils]: 19: Hoare triple {5438#(< ~counter~0 99)} assume !!(#t~post5 < 100);havoc #t~post5; {5438#(< ~counter~0 99)} is VALID [2022-04-27 12:19:58,279 INFO L290 TraceCheckUtils]: 18: Hoare triple {5448#(< ~counter~0 98)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5438#(< ~counter~0 99)} is VALID [2022-04-27 12:19:58,279 INFO L290 TraceCheckUtils]: 17: Hoare triple {5448#(< ~counter~0 98)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5448#(< ~counter~0 98)} is VALID [2022-04-27 12:19:58,280 INFO L290 TraceCheckUtils]: 16: Hoare triple {5448#(< ~counter~0 98)} assume !!(#t~post5 < 100);havoc #t~post5; {5448#(< ~counter~0 98)} is VALID [2022-04-27 12:19:58,280 INFO L290 TraceCheckUtils]: 15: Hoare triple {5458#(< ~counter~0 97)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5448#(< ~counter~0 98)} is VALID [2022-04-27 12:19:58,280 INFO L290 TraceCheckUtils]: 14: Hoare triple {5458#(< ~counter~0 97)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5458#(< ~counter~0 97)} is VALID [2022-04-27 12:19:58,281 INFO L290 TraceCheckUtils]: 13: Hoare triple {5458#(< ~counter~0 97)} assume !!(#t~post5 < 100);havoc #t~post5; {5458#(< ~counter~0 97)} is VALID [2022-04-27 12:19:58,281 INFO L290 TraceCheckUtils]: 12: Hoare triple {5468#(< ~counter~0 96)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5458#(< ~counter~0 97)} is VALID [2022-04-27 12:19:58,281 INFO L290 TraceCheckUtils]: 11: Hoare triple {5468#(< ~counter~0 96)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {5468#(< ~counter~0 96)} is VALID [2022-04-27 12:19:58,282 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5294#true} {5468#(< ~counter~0 96)} #82#return; {5468#(< ~counter~0 96)} is VALID [2022-04-27 12:19:58,282 INFO L290 TraceCheckUtils]: 9: Hoare triple {5294#true} assume true; {5294#true} is VALID [2022-04-27 12:19:58,282 INFO L290 TraceCheckUtils]: 8: Hoare triple {5294#true} assume !(0 == ~cond); {5294#true} is VALID [2022-04-27 12:19:58,282 INFO L290 TraceCheckUtils]: 7: Hoare triple {5294#true} ~cond := #in~cond; {5294#true} is VALID [2022-04-27 12:19:58,282 INFO L272 TraceCheckUtils]: 6: Hoare triple {5468#(< ~counter~0 96)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {5294#true} is VALID [2022-04-27 12:19:58,282 INFO L290 TraceCheckUtils]: 5: Hoare triple {5468#(< ~counter~0 96)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {5468#(< ~counter~0 96)} is VALID [2022-04-27 12:19:58,283 INFO L272 TraceCheckUtils]: 4: Hoare triple {5468#(< ~counter~0 96)} call #t~ret7 := main(); {5468#(< ~counter~0 96)} is VALID [2022-04-27 12:19:58,283 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5468#(< ~counter~0 96)} {5294#true} #102#return; {5468#(< ~counter~0 96)} is VALID [2022-04-27 12:19:58,283 INFO L290 TraceCheckUtils]: 2: Hoare triple {5468#(< ~counter~0 96)} assume true; {5468#(< ~counter~0 96)} is VALID [2022-04-27 12:19:58,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {5294#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5468#(< ~counter~0 96)} is VALID [2022-04-27 12:19:58,284 INFO L272 TraceCheckUtils]: 0: Hoare triple {5294#true} call ULTIMATE.init(); {5294#true} is VALID [2022-04-27 12:19:58,284 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:19:58,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [213495424] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:19:58,284 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 12:19:58,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 15 [2022-04-27 12:19:58,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485536903] [2022-04-27 12:19:58,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 12:19:58,285 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 14 states have internal predecessors, (48), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 32 [2022-04-27 12:19:58,285 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:19:58,285 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 3.2) internal successors, (48), 14 states have internal predecessors, (48), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 12:19:58,325 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:19:58,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-27 12:19:58,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:19:58,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-27 12:19:58,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2022-04-27 12:19:58,326 INFO L87 Difference]: Start difference. First operand 146 states and 184 transitions. Second operand has 15 states, 15 states have (on average 3.2) internal successors, (48), 14 states have internal predecessors, (48), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 12:20:02,375 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:20:04,439 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:20:10,330 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:20:16,911 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:20:19,463 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:20:21,984 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:20:24,284 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:20:30,017 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:20:34,506 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:20:36,546 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:20:38,549 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:20:43,086 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:20:45,826 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:20:48,765 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:20:51,090 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:20:53,522 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:20:57,721 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:20:59,725 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:21:02,817 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:21:05,541 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:21:07,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:21:07,204 INFO L93 Difference]: Finished difference Result 347 states and 439 transitions. [2022-04-27 12:21:07,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-27 12:21:07,204 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 14 states have internal predecessors, (48), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 32 [2022-04-27 12:21:07,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:21:07,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.2) internal successors, (48), 14 states have internal predecessors, (48), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 12:21:07,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 254 transitions. [2022-04-27 12:21:07,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.2) internal successors, (48), 14 states have internal predecessors, (48), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 12:21:07,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 254 transitions. [2022-04-27 12:21:07,210 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 254 transitions. [2022-04-27 12:21:07,455 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 254 edges. 254 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:21:07,462 INFO L225 Difference]: With dead ends: 347 [2022-04-27 12:21:07,462 INFO L226 Difference]: Without dead ends: 307 [2022-04-27 12:21:07,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=716, Unknown=0, NotChecked=0, Total=992 [2022-04-27 12:21:07,463 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 184 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 130 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 55.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 55.4s IncrementalHoareTripleChecker+Time [2022-04-27 12:21:07,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 162 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 397 Invalid, 18 Unknown, 0 Unchecked, 55.4s Time] [2022-04-27 12:21:07,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2022-04-27 12:21:07,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 281. [2022-04-27 12:21:07,572 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:21:07,572 INFO L82 GeneralOperation]: Start isEquivalent. First operand 307 states. Second operand has 281 states, 167 states have (on average 1.1616766467065869) internal successors, (194), 175 states have internal predecessors, (194), 83 states have call successors, (83), 31 states have call predecessors, (83), 30 states have return successors, (78), 74 states have call predecessors, (78), 78 states have call successors, (78) [2022-04-27 12:21:07,573 INFO L74 IsIncluded]: Start isIncluded. First operand 307 states. Second operand has 281 states, 167 states have (on average 1.1616766467065869) internal successors, (194), 175 states have internal predecessors, (194), 83 states have call successors, (83), 31 states have call predecessors, (83), 30 states have return successors, (78), 74 states have call predecessors, (78), 78 states have call successors, (78) [2022-04-27 12:21:07,573 INFO L87 Difference]: Start difference. First operand 307 states. Second operand has 281 states, 167 states have (on average 1.1616766467065869) internal successors, (194), 175 states have internal predecessors, (194), 83 states have call successors, (83), 31 states have call predecessors, (83), 30 states have return successors, (78), 74 states have call predecessors, (78), 78 states have call successors, (78) [2022-04-27 12:21:07,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:21:07,579 INFO L93 Difference]: Finished difference Result 307 states and 380 transitions. [2022-04-27 12:21:07,579 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 380 transitions. [2022-04-27 12:21:07,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:21:07,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:21:07,581 INFO L74 IsIncluded]: Start isIncluded. First operand has 281 states, 167 states have (on average 1.1616766467065869) internal successors, (194), 175 states have internal predecessors, (194), 83 states have call successors, (83), 31 states have call predecessors, (83), 30 states have return successors, (78), 74 states have call predecessors, (78), 78 states have call successors, (78) Second operand 307 states. [2022-04-27 12:21:07,581 INFO L87 Difference]: Start difference. First operand has 281 states, 167 states have (on average 1.1616766467065869) internal successors, (194), 175 states have internal predecessors, (194), 83 states have call successors, (83), 31 states have call predecessors, (83), 30 states have return successors, (78), 74 states have call predecessors, (78), 78 states have call successors, (78) Second operand 307 states. [2022-04-27 12:21:07,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:21:07,588 INFO L93 Difference]: Finished difference Result 307 states and 380 transitions. [2022-04-27 12:21:07,588 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 380 transitions. [2022-04-27 12:21:07,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:21:07,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:21:07,588 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:21:07,588 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:21:07,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 167 states have (on average 1.1616766467065869) internal successors, (194), 175 states have internal predecessors, (194), 83 states have call successors, (83), 31 states have call predecessors, (83), 30 states have return successors, (78), 74 states have call predecessors, (78), 78 states have call successors, (78) [2022-04-27 12:21:07,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 355 transitions. [2022-04-27 12:21:07,595 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 355 transitions. Word has length 32 [2022-04-27 12:21:07,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:21:07,595 INFO L495 AbstractCegarLoop]: Abstraction has 281 states and 355 transitions. [2022-04-27 12:21:07,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 14 states have internal predecessors, (48), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 12:21:07,595 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 355 transitions. [2022-04-27 12:21:07,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-27 12:21:07,596 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:21:07,596 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:21:07,612 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:21:07,812 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:21:07,813 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:21:07,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:21:07,813 INFO L85 PathProgramCache]: Analyzing trace with hash -271152338, now seen corresponding path program 2 times [2022-04-27 12:21:07,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:21:07,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949068970] [2022-04-27 12:21:07,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:21:07,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:21:07,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:21:08,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 12:21:08,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:21:08,058 INFO L290 TraceCheckUtils]: 0: Hoare triple {7082#(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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7066#(<= ~counter~0 0)} is VALID [2022-04-27 12:21:08,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {7066#(<= ~counter~0 0)} assume true; {7066#(<= ~counter~0 0)} is VALID [2022-04-27 12:21:08,059 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7066#(<= ~counter~0 0)} {7061#true} #102#return; {7066#(<= ~counter~0 0)} is VALID [2022-04-27 12:21:08,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 12:21:08,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:21:08,063 INFO L290 TraceCheckUtils]: 0: Hoare triple {7061#true} ~cond := #in~cond; {7061#true} is VALID [2022-04-27 12:21:08,063 INFO L290 TraceCheckUtils]: 1: Hoare triple {7061#true} assume !(0 == ~cond); {7061#true} is VALID [2022-04-27 12:21:08,063 INFO L290 TraceCheckUtils]: 2: Hoare triple {7061#true} assume true; {7061#true} is VALID [2022-04-27 12:21:08,063 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7061#true} {7066#(<= ~counter~0 0)} #82#return; {7066#(<= ~counter~0 0)} is VALID [2022-04-27 12:21:08,064 INFO L272 TraceCheckUtils]: 0: Hoare triple {7061#true} call ULTIMATE.init(); {7082#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 12:21:08,064 INFO L290 TraceCheckUtils]: 1: Hoare triple {7082#(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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7066#(<= ~counter~0 0)} is VALID [2022-04-27 12:21:08,065 INFO L290 TraceCheckUtils]: 2: Hoare triple {7066#(<= ~counter~0 0)} assume true; {7066#(<= ~counter~0 0)} is VALID [2022-04-27 12:21:08,065 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7066#(<= ~counter~0 0)} {7061#true} #102#return; {7066#(<= ~counter~0 0)} is VALID [2022-04-27 12:21:08,065 INFO L272 TraceCheckUtils]: 4: Hoare triple {7066#(<= ~counter~0 0)} call #t~ret7 := main(); {7066#(<= ~counter~0 0)} is VALID [2022-04-27 12:21:08,065 INFO L290 TraceCheckUtils]: 5: Hoare triple {7066#(<= ~counter~0 0)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {7066#(<= ~counter~0 0)} is VALID [2022-04-27 12:21:08,065 INFO L272 TraceCheckUtils]: 6: Hoare triple {7066#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {7061#true} is VALID [2022-04-27 12:21:08,066 INFO L290 TraceCheckUtils]: 7: Hoare triple {7061#true} ~cond := #in~cond; {7061#true} is VALID [2022-04-27 12:21:08,066 INFO L290 TraceCheckUtils]: 8: Hoare triple {7061#true} assume !(0 == ~cond); {7061#true} is VALID [2022-04-27 12:21:08,066 INFO L290 TraceCheckUtils]: 9: Hoare triple {7061#true} assume true; {7061#true} is VALID [2022-04-27 12:21:08,066 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7061#true} {7066#(<= ~counter~0 0)} #82#return; {7066#(<= ~counter~0 0)} is VALID [2022-04-27 12:21:08,066 INFO L290 TraceCheckUtils]: 11: Hoare triple {7066#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {7066#(<= ~counter~0 0)} is VALID [2022-04-27 12:21:08,067 INFO L290 TraceCheckUtils]: 12: Hoare triple {7066#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7071#(<= ~counter~0 1)} is VALID [2022-04-27 12:21:08,071 INFO L290 TraceCheckUtils]: 13: Hoare triple {7071#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {7071#(<= ~counter~0 1)} is VALID [2022-04-27 12:21:08,072 INFO L290 TraceCheckUtils]: 14: Hoare triple {7071#(<= ~counter~0 1)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7071#(<= ~counter~0 1)} is VALID [2022-04-27 12:21:08,072 INFO L290 TraceCheckUtils]: 15: Hoare triple {7071#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7072#(<= ~counter~0 2)} is VALID [2022-04-27 12:21:08,073 INFO L290 TraceCheckUtils]: 16: Hoare triple {7072#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {7072#(<= ~counter~0 2)} is VALID [2022-04-27 12:21:08,073 INFO L290 TraceCheckUtils]: 17: Hoare triple {7072#(<= ~counter~0 2)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7072#(<= ~counter~0 2)} is VALID [2022-04-27 12:21:08,073 INFO L290 TraceCheckUtils]: 18: Hoare triple {7072#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7073#(<= ~counter~0 3)} is VALID [2022-04-27 12:21:08,074 INFO L290 TraceCheckUtils]: 19: Hoare triple {7073#(<= ~counter~0 3)} assume !!(#t~post5 < 100);havoc #t~post5; {7073#(<= ~counter~0 3)} is VALID [2022-04-27 12:21:08,074 INFO L290 TraceCheckUtils]: 20: Hoare triple {7073#(<= ~counter~0 3)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7073#(<= ~counter~0 3)} is VALID [2022-04-27 12:21:08,074 INFO L290 TraceCheckUtils]: 21: Hoare triple {7073#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7074#(<= ~counter~0 4)} is VALID [2022-04-27 12:21:08,075 INFO L290 TraceCheckUtils]: 22: Hoare triple {7074#(<= ~counter~0 4)} assume !!(#t~post5 < 100);havoc #t~post5; {7074#(<= ~counter~0 4)} is VALID [2022-04-27 12:21:08,075 INFO L290 TraceCheckUtils]: 23: Hoare triple {7074#(<= ~counter~0 4)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7074#(<= ~counter~0 4)} is VALID [2022-04-27 12:21:08,075 INFO L290 TraceCheckUtils]: 24: Hoare triple {7074#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7075#(<= ~counter~0 5)} is VALID [2022-04-27 12:21:08,076 INFO L290 TraceCheckUtils]: 25: Hoare triple {7075#(<= ~counter~0 5)} assume !!(#t~post5 < 100);havoc #t~post5; {7075#(<= ~counter~0 5)} is VALID [2022-04-27 12:21:08,076 INFO L290 TraceCheckUtils]: 26: Hoare triple {7075#(<= ~counter~0 5)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7075#(<= ~counter~0 5)} is VALID [2022-04-27 12:21:08,077 INFO L290 TraceCheckUtils]: 27: Hoare triple {7075#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7076#(<= ~counter~0 6)} is VALID [2022-04-27 12:21:08,077 INFO L290 TraceCheckUtils]: 28: Hoare triple {7076#(<= ~counter~0 6)} assume !!(#t~post5 < 100);havoc #t~post5; {7076#(<= ~counter~0 6)} is VALID [2022-04-27 12:21:08,077 INFO L290 TraceCheckUtils]: 29: Hoare triple {7076#(<= ~counter~0 6)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7076#(<= ~counter~0 6)} is VALID [2022-04-27 12:21:08,078 INFO L290 TraceCheckUtils]: 30: Hoare triple {7076#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7077#(<= ~counter~0 7)} is VALID [2022-04-27 12:21:08,078 INFO L290 TraceCheckUtils]: 31: Hoare triple {7077#(<= ~counter~0 7)} assume !!(#t~post5 < 100);havoc #t~post5; {7077#(<= ~counter~0 7)} is VALID [2022-04-27 12:21:08,078 INFO L290 TraceCheckUtils]: 32: Hoare triple {7077#(<= ~counter~0 7)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7077#(<= ~counter~0 7)} is VALID [2022-04-27 12:21:08,079 INFO L290 TraceCheckUtils]: 33: Hoare triple {7077#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7078#(<= ~counter~0 8)} is VALID [2022-04-27 12:21:08,079 INFO L290 TraceCheckUtils]: 34: Hoare triple {7078#(<= ~counter~0 8)} assume !!(#t~post5 < 100);havoc #t~post5; {7078#(<= ~counter~0 8)} is VALID [2022-04-27 12:21:08,079 INFO L290 TraceCheckUtils]: 35: Hoare triple {7078#(<= ~counter~0 8)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7078#(<= ~counter~0 8)} is VALID [2022-04-27 12:21:08,080 INFO L290 TraceCheckUtils]: 36: Hoare triple {7078#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7079#(<= ~counter~0 9)} is VALID [2022-04-27 12:21:08,080 INFO L290 TraceCheckUtils]: 37: Hoare triple {7079#(<= ~counter~0 9)} assume !!(#t~post5 < 100);havoc #t~post5; {7079#(<= ~counter~0 9)} is VALID [2022-04-27 12:21:08,080 INFO L290 TraceCheckUtils]: 38: Hoare triple {7079#(<= ~counter~0 9)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7079#(<= ~counter~0 9)} is VALID [2022-04-27 12:21:08,081 INFO L290 TraceCheckUtils]: 39: Hoare triple {7079#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7080#(<= ~counter~0 10)} is VALID [2022-04-27 12:21:08,081 INFO L290 TraceCheckUtils]: 40: Hoare triple {7080#(<= ~counter~0 10)} assume !!(#t~post5 < 100);havoc #t~post5; {7080#(<= ~counter~0 10)} is VALID [2022-04-27 12:21:08,081 INFO L290 TraceCheckUtils]: 41: Hoare triple {7080#(<= ~counter~0 10)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7080#(<= ~counter~0 10)} is VALID [2022-04-27 12:21:08,081 INFO L290 TraceCheckUtils]: 42: Hoare triple {7080#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7081#(<= |main_#t~post5| 10)} is VALID [2022-04-27 12:21:08,082 INFO L290 TraceCheckUtils]: 43: Hoare triple {7081#(<= |main_#t~post5| 10)} assume !(#t~post5 < 100);havoc #t~post5; {7062#false} is VALID [2022-04-27 12:21:08,082 INFO L290 TraceCheckUtils]: 44: Hoare triple {7062#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7062#false} is VALID [2022-04-27 12:21:08,082 INFO L290 TraceCheckUtils]: 45: Hoare triple {7062#false} assume !!(#t~post6 < 100);havoc #t~post6; {7062#false} is VALID [2022-04-27 12:21:08,082 INFO L272 TraceCheckUtils]: 46: Hoare triple {7062#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {7062#false} is VALID [2022-04-27 12:21:08,082 INFO L290 TraceCheckUtils]: 47: Hoare triple {7062#false} ~cond := #in~cond; {7062#false} is VALID [2022-04-27 12:21:08,082 INFO L290 TraceCheckUtils]: 48: Hoare triple {7062#false} assume 0 == ~cond; {7062#false} is VALID [2022-04-27 12:21:08,082 INFO L290 TraceCheckUtils]: 49: Hoare triple {7062#false} assume !false; {7062#false} is VALID [2022-04-27 12:21:08,083 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:21:08,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:21:08,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949068970] [2022-04-27 12:21:08,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949068970] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 12:21:08,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380946716] [2022-04-27 12:21:08,083 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 12:21:08,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:21:08,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:21:08,084 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:21:08,085 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:21:08,123 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-27 12:21:08,123 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:21:08,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-27 12:21:08,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:21:08,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:21:08,285 INFO L272 TraceCheckUtils]: 0: Hoare triple {7061#true} call ULTIMATE.init(); {7061#true} is VALID [2022-04-27 12:21:08,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {7061#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7061#true} is VALID [2022-04-27 12:21:08,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {7061#true} assume true; {7061#true} is VALID [2022-04-27 12:21:08,285 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7061#true} {7061#true} #102#return; {7061#true} is VALID [2022-04-27 12:21:08,285 INFO L272 TraceCheckUtils]: 4: Hoare triple {7061#true} call #t~ret7 := main(); {7061#true} is VALID [2022-04-27 12:21:08,285 INFO L290 TraceCheckUtils]: 5: Hoare triple {7061#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {7061#true} is VALID [2022-04-27 12:21:08,285 INFO L272 TraceCheckUtils]: 6: Hoare triple {7061#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {7061#true} is VALID [2022-04-27 12:21:08,285 INFO L290 TraceCheckUtils]: 7: Hoare triple {7061#true} ~cond := #in~cond; {7061#true} is VALID [2022-04-27 12:21:08,285 INFO L290 TraceCheckUtils]: 8: Hoare triple {7061#true} assume !(0 == ~cond); {7061#true} is VALID [2022-04-27 12:21:08,285 INFO L290 TraceCheckUtils]: 9: Hoare triple {7061#true} assume true; {7061#true} is VALID [2022-04-27 12:21:08,285 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7061#true} {7061#true} #82#return; {7061#true} is VALID [2022-04-27 12:21:08,285 INFO L290 TraceCheckUtils]: 11: Hoare triple {7061#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {7061#true} is VALID [2022-04-27 12:21:08,285 INFO L290 TraceCheckUtils]: 12: Hoare triple {7061#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7061#true} is VALID [2022-04-27 12:21:08,285 INFO L290 TraceCheckUtils]: 13: Hoare triple {7061#true} assume !!(#t~post5 < 100);havoc #t~post5; {7061#true} is VALID [2022-04-27 12:21:08,286 INFO L290 TraceCheckUtils]: 14: Hoare triple {7061#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7061#true} is VALID [2022-04-27 12:21:08,286 INFO L290 TraceCheckUtils]: 15: Hoare triple {7061#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7061#true} is VALID [2022-04-27 12:21:08,286 INFO L290 TraceCheckUtils]: 16: Hoare triple {7061#true} assume !!(#t~post5 < 100);havoc #t~post5; {7061#true} is VALID [2022-04-27 12:21:08,286 INFO L290 TraceCheckUtils]: 17: Hoare triple {7061#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7061#true} is VALID [2022-04-27 12:21:08,286 INFO L290 TraceCheckUtils]: 18: Hoare triple {7061#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7061#true} is VALID [2022-04-27 12:21:08,286 INFO L290 TraceCheckUtils]: 19: Hoare triple {7061#true} assume !!(#t~post5 < 100);havoc #t~post5; {7061#true} is VALID [2022-04-27 12:21:08,286 INFO L290 TraceCheckUtils]: 20: Hoare triple {7061#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7061#true} is VALID [2022-04-27 12:21:08,286 INFO L290 TraceCheckUtils]: 21: Hoare triple {7061#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7061#true} is VALID [2022-04-27 12:21:08,286 INFO L290 TraceCheckUtils]: 22: Hoare triple {7061#true} assume !!(#t~post5 < 100);havoc #t~post5; {7061#true} is VALID [2022-04-27 12:21:08,286 INFO L290 TraceCheckUtils]: 23: Hoare triple {7061#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7061#true} is VALID [2022-04-27 12:21:08,286 INFO L290 TraceCheckUtils]: 24: Hoare triple {7061#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7061#true} is VALID [2022-04-27 12:21:08,286 INFO L290 TraceCheckUtils]: 25: Hoare triple {7061#true} assume !!(#t~post5 < 100);havoc #t~post5; {7061#true} is VALID [2022-04-27 12:21:08,286 INFO L290 TraceCheckUtils]: 26: Hoare triple {7061#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7061#true} is VALID [2022-04-27 12:21:08,286 INFO L290 TraceCheckUtils]: 27: Hoare triple {7061#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7061#true} is VALID [2022-04-27 12:21:08,286 INFO L290 TraceCheckUtils]: 28: Hoare triple {7061#true} assume !!(#t~post5 < 100);havoc #t~post5; {7061#true} is VALID [2022-04-27 12:21:08,286 INFO L290 TraceCheckUtils]: 29: Hoare triple {7061#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7061#true} is VALID [2022-04-27 12:21:08,286 INFO L290 TraceCheckUtils]: 30: Hoare triple {7061#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7061#true} is VALID [2022-04-27 12:21:08,286 INFO L290 TraceCheckUtils]: 31: Hoare triple {7061#true} assume !!(#t~post5 < 100);havoc #t~post5; {7061#true} is VALID [2022-04-27 12:21:08,286 INFO L290 TraceCheckUtils]: 32: Hoare triple {7061#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7061#true} is VALID [2022-04-27 12:21:08,286 INFO L290 TraceCheckUtils]: 33: Hoare triple {7061#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7061#true} is VALID [2022-04-27 12:21:08,287 INFO L290 TraceCheckUtils]: 34: Hoare triple {7061#true} assume !!(#t~post5 < 100);havoc #t~post5; {7061#true} is VALID [2022-04-27 12:21:08,287 INFO L290 TraceCheckUtils]: 35: Hoare triple {7061#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7061#true} is VALID [2022-04-27 12:21:08,287 INFO L290 TraceCheckUtils]: 36: Hoare triple {7061#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7061#true} is VALID [2022-04-27 12:21:08,287 INFO L290 TraceCheckUtils]: 37: Hoare triple {7061#true} assume !!(#t~post5 < 100);havoc #t~post5; {7061#true} is VALID [2022-04-27 12:21:08,287 INFO L290 TraceCheckUtils]: 38: Hoare triple {7061#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7061#true} is VALID [2022-04-27 12:21:08,287 INFO L290 TraceCheckUtils]: 39: Hoare triple {7061#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7061#true} is VALID [2022-04-27 12:21:08,287 INFO L290 TraceCheckUtils]: 40: Hoare triple {7061#true} assume !!(#t~post5 < 100);havoc #t~post5; {7061#true} is VALID [2022-04-27 12:21:08,287 INFO L290 TraceCheckUtils]: 41: Hoare triple {7061#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7061#true} is VALID [2022-04-27 12:21:08,288 INFO L290 TraceCheckUtils]: 42: Hoare triple {7061#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7212#(<= (+ |main_#t~post5| 1) ~counter~0)} is VALID [2022-04-27 12:21:08,289 INFO L290 TraceCheckUtils]: 43: Hoare triple {7212#(<= (+ |main_#t~post5| 1) ~counter~0)} assume !(#t~post5 < 100);havoc #t~post5; {7216#(<= 101 ~counter~0)} is VALID [2022-04-27 12:21:08,289 INFO L290 TraceCheckUtils]: 44: Hoare triple {7216#(<= 101 ~counter~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7220#(<= 101 |main_#t~post6|)} is VALID [2022-04-27 12:21:08,290 INFO L290 TraceCheckUtils]: 45: Hoare triple {7220#(<= 101 |main_#t~post6|)} assume !!(#t~post6 < 100);havoc #t~post6; {7062#false} is VALID [2022-04-27 12:21:08,290 INFO L272 TraceCheckUtils]: 46: Hoare triple {7062#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {7062#false} is VALID [2022-04-27 12:21:08,290 INFO L290 TraceCheckUtils]: 47: Hoare triple {7062#false} ~cond := #in~cond; {7062#false} is VALID [2022-04-27 12:21:08,290 INFO L290 TraceCheckUtils]: 48: Hoare triple {7062#false} assume 0 == ~cond; {7062#false} is VALID [2022-04-27 12:21:08,290 INFO L290 TraceCheckUtils]: 49: Hoare triple {7062#false} assume !false; {7062#false} is VALID [2022-04-27 12:21:08,290 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-04-27 12:21:08,290 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:21:08,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1380946716] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:21:08,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:21:08,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 18 [2022-04-27 12:21:08,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014154485] [2022-04-27 12:21:08,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:21:08,291 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 50 [2022-04-27 12:21:08,291 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:21:08,291 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:21:08,306 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:21:08,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:21:08,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:21:08,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:21:08,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2022-04-27 12:21:08,307 INFO L87 Difference]: Start difference. First operand 281 states and 355 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:21:10,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:21:10,552 INFO L93 Difference]: Finished difference Result 318 states and 404 transitions. [2022-04-27 12:21:10,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:21:10,552 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 50 [2022-04-27 12:21:10,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:21:10,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:21:10,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-04-27 12:21:10,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:21:10,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-04-27 12:21:10,554 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 77 transitions. [2022-04-27 12:21:10,631 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:21:10,636 INFO L225 Difference]: With dead ends: 318 [2022-04-27 12:21:10,636 INFO L226 Difference]: Without dead ends: 278 [2022-04-27 12:21:10,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-04-27 12:21:10,637 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:21:10,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 167 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:21:10,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2022-04-27 12:21:10,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 273. [2022-04-27 12:21:10,744 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:21:10,745 INFO L82 GeneralOperation]: Start isEquivalent. First operand 278 states. Second operand has 273 states, 160 states have (on average 1.15625) internal successors, (185), 167 states have internal predecessors, (185), 82 states have call successors, (82), 31 states have call predecessors, (82), 30 states have return successors, (77), 74 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-27 12:21:10,745 INFO L74 IsIncluded]: Start isIncluded. First operand 278 states. Second operand has 273 states, 160 states have (on average 1.15625) internal successors, (185), 167 states have internal predecessors, (185), 82 states have call successors, (82), 31 states have call predecessors, (82), 30 states have return successors, (77), 74 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-27 12:21:10,746 INFO L87 Difference]: Start difference. First operand 278 states. Second operand has 273 states, 160 states have (on average 1.15625) internal successors, (185), 167 states have internal predecessors, (185), 82 states have call successors, (82), 31 states have call predecessors, (82), 30 states have return successors, (77), 74 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-27 12:21:10,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:21:10,751 INFO L93 Difference]: Finished difference Result 278 states and 350 transitions. [2022-04-27 12:21:10,751 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 350 transitions. [2022-04-27 12:21:10,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:21:10,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:21:10,754 INFO L74 IsIncluded]: Start isIncluded. First operand has 273 states, 160 states have (on average 1.15625) internal successors, (185), 167 states have internal predecessors, (185), 82 states have call successors, (82), 31 states have call predecessors, (82), 30 states have return successors, (77), 74 states have call predecessors, (77), 77 states have call successors, (77) Second operand 278 states. [2022-04-27 12:21:10,754 INFO L87 Difference]: Start difference. First operand has 273 states, 160 states have (on average 1.15625) internal successors, (185), 167 states have internal predecessors, (185), 82 states have call successors, (82), 31 states have call predecessors, (82), 30 states have return successors, (77), 74 states have call predecessors, (77), 77 states have call successors, (77) Second operand 278 states. [2022-04-27 12:21:10,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:21:10,761 INFO L93 Difference]: Finished difference Result 278 states and 350 transitions. [2022-04-27 12:21:10,761 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 350 transitions. [2022-04-27 12:21:10,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:21:10,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:21:10,761 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:21:10,761 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:21:10,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 160 states have (on average 1.15625) internal successors, (185), 167 states have internal predecessors, (185), 82 states have call successors, (82), 31 states have call predecessors, (82), 30 states have return successors, (77), 74 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-27 12:21:10,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 344 transitions. [2022-04-27 12:21:10,768 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 344 transitions. Word has length 50 [2022-04-27 12:21:10,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:21:10,768 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 344 transitions. [2022-04-27 12:21:10,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:21:10,768 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 344 transitions. [2022-04-27 12:21:10,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-27 12:21:10,769 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:21:10,769 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:21:10,788 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:21:10,983 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:21:10,983 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:21:10,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:21:10,984 INFO L85 PathProgramCache]: Analyzing trace with hash 109392637, now seen corresponding path program 1 times [2022-04-27 12:21:10,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:21:10,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321257202] [2022-04-27 12:21:10,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:21:10,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:21:10,993 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:21:10,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [528623293] [2022-04-27 12:21:10,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:21:10,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:21:10,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:21:10,994 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:21:10,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process